TSTP Solution File: SWV408+2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV408+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n026.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:29:31 EDT 2024
% Result : Theorem 0.59s 0.80s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 37 ( 5 unt; 1 typ; 0 def)
% Number of atoms : 240 ( 0 equ)
% Maximal formula atoms : 10 ( 6 avg)
% Number of connectives : 125 ( 51 ~; 40 |; 26 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 130 ( 130 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 15 ( 14 usr; 5 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 96 ( 78 !; 17 ?; 26 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_10,type,
sQ5_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f194,plain,
$false,
inference(subsumption_resolution,[],[f193,f88]) ).
tff(f88,plain,
contains_slb(sK2,sK4),
inference(cnf_transformation,[],[f78]) ).
tff(f78,plain,
( ! [X4] :
( ~ less_than(findmin_pqp_res(sK1),X4)
| ~ pair_in_list(update_slb(sK2,findmin_pqp_res(sK1)),sK4,X4) )
& ~ pair_in_list(update_slb(sK2,findmin_pqp_res(sK1)),sK4,findmin_pqp_res(sK1))
& strictly_less_than(sK4,findmin_cpq_res(triple(sK1,sK2,sK3)))
& contains_slb(sK2,sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4])],[f60,f77]) ).
tff(f77,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(sK1),X4)
| ~ pair_in_list(update_slb(sK2,findmin_pqp_res(sK1)),sK4,X4) )
& ~ pair_in_list(update_slb(sK2,findmin_pqp_res(sK1)),sK4,findmin_pqp_res(sK1))
& strictly_less_than(sK4,findmin_cpq_res(triple(sK1,sK2,sK3)))
& contains_slb(sK2,sK4) ) ),
introduced(choice_axiom,[]) ).
tff(f60,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,[],[f59]) ).
tff(f59,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]) ).
tff(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]) ).
tff(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/sandbox/tmp/tmp.6JFXVXOcAl/Vampire---4.8_23042',l44_co) ).
tff(f193,plain,
~ contains_slb(sK2,sK4),
inference(resolution,[],[f192,f85]) ).
tff(f85,plain,
! [X0: $i,X1: $i] :
( pair_in_list(X0,X1,sK0(X0,X1))
| ~ contains_slb(X0,X1) ),
inference(cnf_transformation,[],[f76]) ).
tff(f76,plain,
! [X0,X1] :
( pair_in_list(X0,X1,sK0(X0,X1))
| ~ contains_slb(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f54,f75]) ).
tff(f75,plain,
! [X0,X1] :
( ? [X2] : pair_in_list(X0,X1,X2)
=> pair_in_list(X0,X1,sK0(X0,X1)) ),
introduced(choice_axiom,[]) ).
tff(f54,plain,
! [X0,X1] :
( ? [X2] : pair_in_list(X0,X1,X2)
| ~ contains_slb(X0,X1) ),
inference(ennf_transformation,[],[f42]) ).
tff(f42,axiom,
! [X0,X1] :
( contains_slb(X0,X1)
=> ? [X2] : pair_in_list(X0,X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.6JFXVXOcAl/Vampire---4.8_23042',l45_li4647) ).
tff(f192,plain,
! [X0: $i] : ~ pair_in_list(sK2,sK4,X0),
inference(subsumption_resolution,[],[f172,f170]) ).
tff(f170,plain,
! [X0: $i] :
( ~ pair_in_list(sK2,sK4,X0)
| ~ less_than(findmin_pqp_res(sK1),X0) ),
inference(duplicate_literal_removal,[],[f169]) ).
tff(f169,plain,
! [X0: $i] :
( ~ less_than(findmin_pqp_res(sK1),X0)
| ~ pair_in_list(sK2,sK4,X0)
| ~ less_than(findmin_pqp_res(sK1),X0) ),
inference(resolution,[],[f87,f91]) ).
tff(f91,plain,
! [X4: $i] :
( ~ pair_in_list(update_slb(sK2,findmin_pqp_res(sK1)),sK4,X4)
| ~ less_than(findmin_pqp_res(sK1),X4) ),
inference(cnf_transformation,[],[f78]) ).
tff(f87,plain,
! [X2: $i,X3: $i,X0: $i,X1: $i] :
( pair_in_list(update_slb(X0,X3),X1,X2)
| ~ less_than(X3,X2)
| ~ pair_in_list(X0,X1,X2) ),
inference(cnf_transformation,[],[f58]) ).
tff(f58,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,[],[f57]) ).
tff(f57,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]) ).
tff(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/sandbox/tmp/tmp.6JFXVXOcAl/Vampire---4.8_23042',l49_li3637) ).
tff(f172,plain,
! [X0: $i] :
( less_than(findmin_pqp_res(sK1),X0)
| ~ pair_in_list(sK2,sK4,X0) ),
inference(resolution,[],[f162,f90]) ).
tff(f90,plain,
~ pair_in_list(update_slb(sK2,findmin_pqp_res(sK1)),sK4,findmin_pqp_res(sK1)),
inference(cnf_transformation,[],[f78]) ).
tff(f162,plain,
! [X2: $i,X3: $i,X0: $i,X1: $i] :
( pair_in_list(update_slb(X0,X3),X1,X3)
| less_than(X3,X2)
| ~ pair_in_list(X0,X1,X2) ),
inference(forward_literal_rewriting,[],[f86,f153]) ).
tff(f153,plain,
! [X0: $i,X1: $i] :
( strictly_less_than(X0,X1)
| less_than(X1,X0) ),
inference(subsumption_resolution,[],[f109,f113]) ).
tff(f113,plain,
! [X0: $i,X1: $i] :
( less_than(X1,X0)
| less_than(X0,X1) ),
inference(cnf_transformation,[],[f2]) ).
tff(f2,axiom,
! [X0,X1] :
( less_than(X1,X0)
| less_than(X0,X1) ),
file('/export/starexec/sandbox/tmp/tmp.6JFXVXOcAl/Vampire---4.8_23042',totality) ).
tff(f109,plain,
! [X0: $i,X1: $i] :
( strictly_less_than(X0,X1)
| less_than(X1,X0)
| ~ less_than(X0,X1) ),
inference(cnf_transformation,[],[f84]) ).
tff(f84,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,[],[f83]) ).
tff(f83,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]) ).
tff(f4,axiom,
! [X0,X1] :
( strictly_less_than(X0,X1)
<=> ( ~ less_than(X1,X0)
& less_than(X0,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.6JFXVXOcAl/Vampire---4.8_23042',stricly_smaller_definition) ).
tff(f86,plain,
! [X2: $i,X3: $i,X0: $i,X1: $i] :
( pair_in_list(update_slb(X0,X3),X1,X3)
| ~ strictly_less_than(X2,X3)
| ~ pair_in_list(X0,X1,X2) ),
inference(cnf_transformation,[],[f56]) ).
tff(f56,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,[],[f55]) ).
tff(f55,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]) ).
tff(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/sandbox/tmp/tmp.6JFXVXOcAl/Vampire---4.8_23042',l48_li3839) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SWV408+2 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.16 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.36 % Computer : n026.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 21:10:08 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.36 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.6JFXVXOcAl/Vampire---4.8_23042
% 0.59/0.79 % (23150)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2995ds/34Mi)
% 0.59/0.79 % (23153)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.59/0.79 % (23152)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.59/0.79 % (23154)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2995ds/34Mi)
% 0.59/0.79 % (23155)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.59/0.79 % (23151)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2995ds/51Mi)
% 0.59/0.80 % (23156)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2995ds/83Mi)
% 0.59/0.80 % (23157)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.59/0.80 % (23150)First to succeed.
% 0.59/0.80 % (23150)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-23149"
% 0.59/0.80 % (23153)Also succeeded, but the first one will report.
% 0.59/0.80 % (23155)Also succeeded, but the first one will report.
% 0.59/0.80 % (23150)Refutation found. Thanks to Tanya!
% 0.59/0.80 % SZS status Theorem for Vampire---4
% 0.59/0.80 % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.80 % (23150)------------------------------
% 0.59/0.80 % (23150)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.80 % (23150)Termination reason: Refutation
% 0.59/0.80
% 0.59/0.80 % (23150)Memory used [KB]: 1108
% 0.59/0.80 % (23150)Time elapsed: 0.004 s
% 0.59/0.80 % (23150)Instructions burned: 7 (million)
% 0.59/0.80 % (23149)Success in time 0.432 s
% 0.59/0.80 % Vampire---4.8 exiting
%------------------------------------------------------------------------------