TSTP Solution File: SWV134+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV134+1 : TPTP v8.1.2. Bugfixed 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 : n021.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:28:12 EDT 2024
% Result : Theorem 0.63s 0.80s
% Output : Refutation 0.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 14 unt; 0 def)
% Number of atoms : 74 ( 5 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 68 ( 18 ~; 4 |; 42 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 12 ( 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f190,plain,
$false,
inference(subsumption_resolution,[],[f189,f127]) ).
fof(f127,plain,
leq(n2,pv1325),
inference(cnf_transformation,[],[f93]) ).
fof(f93,plain,
( ~ leq(n0,pv1325)
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_sworst7))
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
& leq(pv1325,n3)
& leq(s_worst7,n3)
& leq(s_sworst7,n3)
& leq(s_best7,n3)
& leq(n2,pv1325)
& leq(n0,s_worst7)
& leq(n0,s_sworst7)
& leq(n0,s_best7)
& ~ leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7)) ),
inference(flattening,[],[f92]) ).
fof(f92,plain,
( ~ leq(n0,pv1325)
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_sworst7))
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
& leq(pv1325,n3)
& leq(s_worst7,n3)
& leq(s_sworst7,n3)
& leq(s_best7,n3)
& leq(n2,pv1325)
& leq(n0,s_worst7)
& leq(n0,s_sworst7)
& leq(n0,s_best7)
& ~ leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7)) ),
inference(ennf_transformation,[],[f54]) ).
fof(f54,negated_conjecture,
~ ( ( leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_sworst7))
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
& leq(pv1325,n3)
& leq(s_worst7,n3)
& leq(s_sworst7,n3)
& leq(s_best7,n3)
& leq(n2,pv1325)
& leq(n0,s_worst7)
& leq(n0,s_sworst7)
& leq(n0,s_best7)
& ~ leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7)) )
=> leq(n0,pv1325) ),
inference(negated_conjecture,[],[f53]) ).
fof(f53,conjecture,
( ( leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_sworst7))
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
& leq(pv1325,n3)
& leq(s_worst7,n3)
& leq(s_sworst7,n3)
& leq(s_best7,n3)
& leq(n2,pv1325)
& leq(n0,s_worst7)
& leq(n0,s_sworst7)
& leq(n0,s_best7)
& ~ leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7)) )
=> leq(n0,pv1325) ),
file('/export/starexec/sandbox/tmp/tmp.kZi0Lm3Nxm/Vampire---4.8_19364',gauss_array_0004) ).
fof(f189,plain,
~ leq(n2,pv1325),
inference(forward_demodulation,[],[f188,f171]) ).
fof(f171,plain,
n2 = succ(n1),
inference(backward_demodulation,[],[f144,f161]) ).
fof(f161,plain,
n1 = succ(n0),
inference(cnf_transformation,[],[f84]) ).
fof(f84,axiom,
n1 = succ(n0),
file('/export/starexec/sandbox/tmp/tmp.kZi0Lm3Nxm/Vampire---4.8_19364',successor_1) ).
fof(f144,plain,
n2 = succ(succ(n0)),
inference(cnf_transformation,[],[f85]) ).
fof(f85,axiom,
n2 = succ(succ(n0)),
file('/export/starexec/sandbox/tmp/tmp.kZi0Lm3Nxm/Vampire---4.8_19364',successor_2) ).
fof(f188,plain,
~ leq(succ(n1),pv1325),
inference(resolution,[],[f184,f154]) ).
fof(f154,plain,
! [X0,X1] :
( gt(X1,X0)
| ~ leq(succ(X0),X1) ),
inference(cnf_transformation,[],[f110]) ).
fof(f110,plain,
! [X0,X1] :
( gt(X1,X0)
| ~ leq(succ(X0),X1) ),
inference(ennf_transformation,[],[f43]) ).
fof(f43,axiom,
! [X0,X1] :
( leq(succ(X0),X1)
=> gt(X1,X0) ),
file('/export/starexec/sandbox/tmp/tmp.kZi0Lm3Nxm/Vampire---4.8_19364',leq_succ_gt) ).
fof(f184,plain,
~ gt(pv1325,n1),
inference(resolution,[],[f179,f165]) ).
fof(f165,plain,
! [X0,X1] :
( leq(X0,X1)
| ~ gt(X1,X0) ),
inference(cnf_transformation,[],[f116]) ).
fof(f116,plain,
! [X0,X1] :
( leq(X0,X1)
| ~ gt(X1,X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0,X1] :
( gt(X1,X0)
=> leq(X0,X1) ),
file('/export/starexec/sandbox/tmp/tmp.kZi0Lm3Nxm/Vampire---4.8_19364',leq_gt1) ).
fof(f179,plain,
~ leq(n1,pv1325),
inference(forward_demodulation,[],[f178,f161]) ).
fof(f178,plain,
~ leq(succ(n0),pv1325),
inference(resolution,[],[f175,f154]) ).
fof(f175,plain,
~ gt(pv1325,n0),
inference(resolution,[],[f165,f134]) ).
fof(f134,plain,
~ leq(n0,pv1325),
inference(cnf_transformation,[],[f93]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWV134+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.10/0.11 % 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.10/0.31 % Computer : n021.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Fri May 3 21:16:08 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.31 This is a FOF_THM_RFO_SEQ problem
% 0.10/0.31 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.kZi0Lm3Nxm/Vampire---4.8_19364
% 0.63/0.79 % (19474)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.63/0.79 % (19472)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.63/0.79 % (19473)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.63/0.79 % (19475)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.63/0.79 % (19476)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.63/0.79 % (19477)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.63/0.79 % (19478)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.63/0.79 % (19479)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.63/0.80 % (19474)First to succeed.
% 0.63/0.80 % (19474)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-19471"
% 0.63/0.80 % (19472)Also succeeded, but the first one will report.
% 0.63/0.80 % (19477)Also succeeded, but the first one will report.
% 0.63/0.80 % (19474)Refutation found. Thanks to Tanya!
% 0.63/0.80 % SZS status Theorem for Vampire---4
% 0.63/0.80 % SZS output start Proof for Vampire---4
% See solution above
% 0.63/0.80 % (19474)------------------------------
% 0.63/0.80 % (19474)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.63/0.80 % (19474)Termination reason: Refutation
% 0.63/0.80
% 0.63/0.80 % (19474)Memory used [KB]: 1108
% 0.63/0.80 % (19474)Time elapsed: 0.005 s
% 0.63/0.80 % (19474)Instructions burned: 6 (million)
% 0.63/0.80 % (19471)Success in time 0.482 s
% 0.63/0.80 % Vampire---4.8 exiting
%------------------------------------------------------------------------------