TSTP Solution File: SWV402+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV402+1 : 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/sandbox2/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:29 EDT 2024
% Result : Theorem 0.56s 0.73s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 13 ( 4 unt; 1 typ; 0 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 6 ( 6 avg)
% Number of connectives : 29 ( 10 ~; 0 |; 15 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 46 ( 46 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 9 ( 8 usr; 5 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 28 ( 15 !; 12 ?; 3 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_6,type,
sQ3_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f59,plain,
$false,
inference(resolution,[],[f39,f35]) ).
tff(f35,plain,
pair_in_list(create_slb,sK0,sK1),
inference(cnf_transformation,[],[f30]) ).
tff(f30,plain,
( ~ pair_in_list(update_slb(create_slb,sK2),sK0,sK2)
& strictly_less_than(sK1,sK2)
& pair_in_list(create_slb,sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f28,f29]) ).
tff(f29,plain,
( ? [X0,X1,X2] :
( ~ pair_in_list(update_slb(create_slb,X2),X0,X2)
& strictly_less_than(X1,X2)
& pair_in_list(create_slb,X0,X1) )
=> ( ~ pair_in_list(update_slb(create_slb,sK2),sK0,sK2)
& strictly_less_than(sK1,sK2)
& pair_in_list(create_slb,sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f28,plain,
? [X0,X1,X2] :
( ~ pair_in_list(update_slb(create_slb,X2),X0,X2)
& strictly_less_than(X1,X2)
& pair_in_list(create_slb,X0,X1) ),
inference(rectify,[],[f25]) ).
tff(f25,plain,
? [X1,X2,X3] :
( ~ pair_in_list(update_slb(create_slb,X3),X1,X3)
& strictly_less_than(X2,X3)
& pair_in_list(create_slb,X1,X2) ),
inference(flattening,[],[f24]) ).
tff(f24,plain,
? [X1,X2,X3] :
( ~ pair_in_list(update_slb(create_slb,X3),X1,X3)
& strictly_less_than(X2,X3)
& pair_in_list(create_slb,X1,X2) ),
inference(ennf_transformation,[],[f21]) ).
tff(f21,plain,
~ ! [X1,X2,X3] :
( ( strictly_less_than(X2,X3)
& pair_in_list(create_slb,X1,X2) )
=> pair_in_list(update_slb(create_slb,X3),X1,X3) ),
inference(rectify,[],[f20]) ).
tff(f20,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( strictly_less_than(X2,X3)
& pair_in_list(create_slb,X1,X2) )
=> pair_in_list(update_slb(create_slb,X3),X1,X3) ),
inference(negated_conjecture,[],[f19]) ).
tff(f19,conjecture,
! [X0,X1,X2,X3] :
( ( strictly_less_than(X2,X3)
& pair_in_list(create_slb,X1,X2) )
=> pair_in_list(update_slb(create_slb,X3),X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.Co35Ela91x/Vampire---4.8_6523',l38_co) ).
tff(f39,plain,
! [X0: $i,X1: $i] : ~ pair_in_list(create_slb,X0,X1),
inference(cnf_transformation,[],[f10]) ).
tff(f10,axiom,
! [X0,X1] : ~ pair_in_list(create_slb,X0,X1),
file('/export/starexec/sandbox2/tmp/tmp.Co35Ela91x/Vampire---4.8_6523',ax22) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWV402+1 : TPTP v8.1.2. Released v3.3.0.
% 0.14/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/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:15:38 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.Co35Ela91x/Vampire---4.8_6523
% 0.56/0.73 % (6632)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 (2996ds/34Mi)
% 0.56/0.73 % (6637)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.56/0.73 % (6634)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.56/0.73 % (6635)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.56/0.73 % (6633)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 (2996ds/51Mi)
% 0.56/0.73 % (6638)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 (2996ds/83Mi)
% 0.56/0.73 % (6632)First to succeed.
% 0.56/0.73 % (6632)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-6631"
% 0.56/0.73 % (6637)Also succeeded, but the first one will report.
% 0.56/0.73 % (6635)Also succeeded, but the first one will report.
% 0.56/0.73 % (6633)Also succeeded, but the first one will report.
% 0.56/0.73 % (6638)Also succeeded, but the first one will report.
% 0.56/0.73 % (6632)Refutation found. Thanks to Tanya!
% 0.56/0.73 % SZS status Theorem for Vampire---4
% 0.56/0.73 % SZS output start Proof for Vampire---4
% See solution above
% 0.56/0.73 % (6632)------------------------------
% 0.56/0.73 % (6632)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.73 % (6632)Termination reason: Refutation
% 0.56/0.73
% 0.56/0.73 % (6632)Memory used [KB]: 982
% 0.56/0.73 % (6632)Time elapsed: 0.002 s
% 0.56/0.73 % (6632)Instructions burned: 3 (million)
% 0.56/0.73 % (6631)Success in time 0.366 s
% 0.56/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------