TSTP Solution File: SWV408+2 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWV408+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 10:51:42 EDT 2024
% Result : Theorem 0.20s 0.40s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 39 ( 6 unt; 0 def)
% Number of atoms : 115 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 135 ( 59 ~; 42 |; 26 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 89 ( 72 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1127,plain,
$false,
inference(resolution,[],[f1125,f896]) ).
fof(f896,plain,
less_than(sK4(sK1,sK3),findmin_pqp_res(sK0)),
inference(resolution,[],[f894,f120]) ).
fof(f120,plain,
! [X0,X1] :
( less_than(X1,X0)
| less_than(X0,X1) ),
inference(cnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( less_than(X1,X0)
| less_than(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',totality) ).
fof(f894,plain,
~ less_than(findmin_pqp_res(sK0),sK4(sK1,sK3)),
inference(resolution,[],[f893,f101]) ).
fof(f101,plain,
contains_slb(sK1,sK3),
inference(cnf_transformation,[],[f90]) ).
fof(f90,plain,
( ! [X4] :
( ~ less_than(findmin_pqp_res(sK0),X4)
| ~ pair_in_list(update_slb(sK1,findmin_pqp_res(sK0)),sK3,X4) )
& ~ pair_in_list(update_slb(sK1,findmin_pqp_res(sK0)),sK3,findmin_pqp_res(sK0))
& strictly_less_than(sK3,findmin_cpq_res(triple(sK0,sK1,sK2)))
& contains_slb(sK1,sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f56,f89]) ).
fof(f89,plain,
( ? [X0,X1,X2,X3] :
( ! [X4] :
( ~ less_than(findmin_pqp_res(X0),X4)
| ~ pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,X4) )
& ~ pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,findmin_pqp_res(X0))
& strictly_less_than(X3,findmin_cpq_res(triple(X0,X1,X2)))
& contains_slb(X1,X3) )
=> ( ! [X4] :
( ~ less_than(findmin_pqp_res(sK0),X4)
| ~ pair_in_list(update_slb(sK1,findmin_pqp_res(sK0)),sK3,X4) )
& ~ pair_in_list(update_slb(sK1,findmin_pqp_res(sK0)),sK3,findmin_pqp_res(sK0))
& strictly_less_than(sK3,findmin_cpq_res(triple(sK0,sK1,sK2)))
& contains_slb(sK1,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f56,plain,
? [X0,X1,X2,X3] :
( ! [X4] :
( ~ less_than(findmin_pqp_res(X0),X4)
| ~ pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,X4) )
& ~ pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,findmin_pqp_res(X0))
& strictly_less_than(X3,findmin_cpq_res(triple(X0,X1,X2)))
& contains_slb(X1,X3) ),
inference(flattening,[],[f55]) ).
fof(f55,plain,
? [X0,X1,X2,X3] :
( ! [X4] :
( ~ less_than(findmin_pqp_res(X0),X4)
| ~ pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,X4) )
& ~ pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,findmin_pqp_res(X0))
& strictly_less_than(X3,findmin_cpq_res(triple(X0,X1,X2)))
& contains_slb(X1,X3) ),
inference(ennf_transformation,[],[f46]) ).
fof(f46,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( strictly_less_than(X3,findmin_cpq_res(triple(X0,X1,X2)))
& contains_slb(X1,X3) )
=> ( ? [X4] :
( less_than(findmin_pqp_res(X0),X4)
& pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,X4) )
| pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,findmin_pqp_res(X0)) ) ),
inference(negated_conjecture,[],[f45]) ).
fof(f45,conjecture,
! [X0,X1,X2,X3] :
( ( strictly_less_than(X3,findmin_cpq_res(triple(X0,X1,X2)))
& contains_slb(X1,X3) )
=> ( ? [X4] :
( less_than(findmin_pqp_res(X0),X4)
& pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,X4) )
| pair_in_list(update_slb(X1,findmin_pqp_res(X0)),X3,findmin_pqp_res(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l44_co) ).
fof(f893,plain,
( ~ contains_slb(sK1,sK3)
| ~ less_than(findmin_pqp_res(sK0),sK4(sK1,sK3)) ),
inference(resolution,[],[f892,f105]) ).
fof(f105,plain,
! [X0,X1] :
( pair_in_list(X0,X1,sK4(X0,X1))
| ~ contains_slb(X0,X1) ),
inference(cnf_transformation,[],[f92]) ).
fof(f92,plain,
! [X0,X1] :
( pair_in_list(X0,X1,sK4(X0,X1))
| ~ contains_slb(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f57,f91]) ).
fof(f91,plain,
! [X0,X1] :
( ? [X2] : pair_in_list(X0,X1,X2)
=> pair_in_list(X0,X1,sK4(X0,X1)) ),
introduced(choice_axiom,[]) ).
fof(f57,plain,
! [X0,X1] :
( ? [X2] : pair_in_list(X0,X1,X2)
| ~ contains_slb(X0,X1) ),
inference(ennf_transformation,[],[f42]) ).
fof(f42,axiom,
! [X0,X1] :
( contains_slb(X0,X1)
=> ? [X2] : pair_in_list(X0,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l45_li4647) ).
fof(f892,plain,
! [X0] :
( ~ pair_in_list(sK1,sK3,X0)
| ~ less_than(findmin_pqp_res(sK0),X0) ),
inference(duplicate_literal_removal,[],[f890]) ).
fof(f890,plain,
! [X0] :
( ~ less_than(findmin_pqp_res(sK0),X0)
| ~ pair_in_list(sK1,sK3,X0)
| ~ less_than(findmin_pqp_res(sK0),X0) ),
inference(resolution,[],[f107,f104]) ).
fof(f104,plain,
! [X4] :
( ~ pair_in_list(update_slb(sK1,findmin_pqp_res(sK0)),sK3,X4)
| ~ less_than(findmin_pqp_res(sK0),X4) ),
inference(cnf_transformation,[],[f90]) ).
fof(f107,plain,
! [X2,X3,X0,X1] :
( pair_in_list(update_slb(X0,X3),X1,X2)
| ~ less_than(X3,X2)
| ~ pair_in_list(X0,X1,X2) ),
inference(cnf_transformation,[],[f61]) ).
fof(f61,plain,
! [X0,X1,X2,X3] :
( pair_in_list(update_slb(X0,X3),X1,X2)
| ~ less_than(X3,X2)
| ~ pair_in_list(X0,X1,X2) ),
inference(flattening,[],[f60]) ).
fof(f60,plain,
! [X0,X1,X2,X3] :
( pair_in_list(update_slb(X0,X3),X1,X2)
| ~ less_than(X3,X2)
| ~ pair_in_list(X0,X1,X2) ),
inference(ennf_transformation,[],[f44]) ).
fof(f44,axiom,
! [X0,X1,X2,X3] :
( ( less_than(X3,X2)
& pair_in_list(X0,X1,X2) )
=> pair_in_list(update_slb(X0,X3),X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l49_li3637) ).
fof(f1125,plain,
~ less_than(sK4(sK1,sK3),findmin_pqp_res(sK0)),
inference(resolution,[],[f1124,f101]) ).
fof(f1124,plain,
( ~ contains_slb(sK1,sK3)
| ~ less_than(sK4(sK1,sK3),findmin_pqp_res(sK0)) ),
inference(resolution,[],[f895,f105]) ).
fof(f895,plain,
( ~ pair_in_list(sK1,sK3,sK4(sK1,sK3))
| ~ less_than(sK4(sK1,sK3),findmin_pqp_res(sK0)) ),
inference(resolution,[],[f894,f820]) ).
fof(f820,plain,
! [X0] :
( less_than(findmin_pqp_res(sK0),X0)
| ~ pair_in_list(sK1,sK3,X0)
| ~ less_than(X0,findmin_pqp_res(sK0)) ),
inference(resolution,[],[f816,f125]) ).
fof(f125,plain,
! [X0,X1] :
( strictly_less_than(X0,X1)
| less_than(X1,X0)
| ~ less_than(X0,X1) ),
inference(cnf_transformation,[],[f94]) ).
fof(f94,plain,
! [X0,X1] :
( ( strictly_less_than(X0,X1)
| less_than(X1,X0)
| ~ less_than(X0,X1) )
& ( ( ~ less_than(X1,X0)
& less_than(X0,X1) )
| ~ strictly_less_than(X0,X1) ) ),
inference(flattening,[],[f93]) ).
fof(f93,plain,
! [X0,X1] :
( ( strictly_less_than(X0,X1)
| less_than(X1,X0)
| ~ less_than(X0,X1) )
& ( ( ~ less_than(X1,X0)
& less_than(X0,X1) )
| ~ strictly_less_than(X0,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( strictly_less_than(X0,X1)
<=> ( ~ less_than(X1,X0)
& less_than(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',stricly_smaller_definition) ).
fof(f816,plain,
! [X0] :
( ~ strictly_less_than(X0,findmin_pqp_res(sK0))
| ~ pair_in_list(sK1,sK3,X0) ),
inference(resolution,[],[f106,f103]) ).
fof(f103,plain,
~ pair_in_list(update_slb(sK1,findmin_pqp_res(sK0)),sK3,findmin_pqp_res(sK0)),
inference(cnf_transformation,[],[f90]) ).
fof(f106,plain,
! [X2,X3,X0,X1] :
( pair_in_list(update_slb(X0,X3),X1,X3)
| ~ strictly_less_than(X2,X3)
| ~ pair_in_list(X0,X1,X2) ),
inference(cnf_transformation,[],[f59]) ).
fof(f59,plain,
! [X0,X1,X2,X3] :
( pair_in_list(update_slb(X0,X3),X1,X3)
| ~ strictly_less_than(X2,X3)
| ~ pair_in_list(X0,X1,X2) ),
inference(flattening,[],[f58]) ).
fof(f58,plain,
! [X0,X1,X2,X3] :
( pair_in_list(update_slb(X0,X3),X1,X3)
| ~ strictly_less_than(X2,X3)
| ~ pair_in_list(X0,X1,X2) ),
inference(ennf_transformation,[],[f43]) ).
fof(f43,axiom,
! [X0,X1,X2,X3] :
( ( strictly_less_than(X2,X3)
& pair_in_list(X0,X1,X2) )
=> pair_in_list(update_slb(X0,X3),X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l48_li3839) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV408+2 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n004.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 21:10:13 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.36 % (28479)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37 % (28482)WARNING: value z3 for option sas not known
% 0.14/0.37 % (28480)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.37 % (28482)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.37 % (28483)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.37 % (28481)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.37 % (28484)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.14/0.37 % (28485)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.14/0.37 % (28486)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.14/0.38 TRYING [1]
% 0.14/0.38 TRYING [2]
% 0.14/0.39 TRYING [3]
% 0.20/0.40 TRYING [1]
% 0.20/0.40 TRYING [2]
% 0.20/0.40 TRYING [1]
% 0.20/0.40 % (28485)First to succeed.
% 0.20/0.40 % (28485)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-28479"
% 0.20/0.40 % (28485)Refutation found. Thanks to Tanya!
% 0.20/0.40 % SZS status Theorem for theBenchmark
% 0.20/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.40 % (28485)------------------------------
% 0.20/0.40 % (28485)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.20/0.40 % (28485)Termination reason: Refutation
% 0.20/0.40
% 0.20/0.40 % (28485)Memory used [KB]: 1015
% 0.20/0.40 % (28485)Time elapsed: 0.029 s
% 0.20/0.40 % (28485)Instructions burned: 50 (million)
% 0.20/0.40 % (28479)Success in time 0.047 s
%------------------------------------------------------------------------------