TSTP Solution File: SWV144+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV144+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 : n025.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 : Wed May 1 04:02:42 EDT 2024
% Result : Theorem 0.60s 0.80s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 8 unt; 0 def)
% Number of atoms : 124 ( 2 equ)
% Maximal formula atoms : 27 ( 7 avg)
% Number of connectives : 142 ( 34 ~; 27 |; 54 &)
% ( 0 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-1 aty)
% Number of variables : 6 ( 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f162,plain,
$false,
inference(subsumption_resolution,[],[f161,f109]) ).
fof(f109,plain,
leq(n1,loopcounter),
inference(cnf_transformation,[],[f88]) ).
fof(f88,plain,
( ~ leq(s_worst7,n3)
& ( leq(s_worst7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(s_sworst7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(s_best7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_worst7)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_sworst7)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_best7)
| ~ gt(loopcounter,n0) )
& ( leq(s_worst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_sworst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_best7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_worst7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_sworst7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_best7)
| leq(tptp_float_0_001,pv1341) )
& leq(n1,loopcounter)
& leq(tptp_float_0_001,pv1341) ),
inference(flattening,[],[f87]) ).
fof(f87,plain,
( ~ leq(s_worst7,n3)
& ( leq(s_worst7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(s_sworst7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(s_best7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_worst7)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_sworst7)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_best7)
| ~ gt(loopcounter,n0) )
& ( leq(s_worst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_sworst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_best7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_worst7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_sworst7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_best7)
| leq(tptp_float_0_001,pv1341) )
& leq(n1,loopcounter)
& leq(tptp_float_0_001,pv1341) ),
inference(ennf_transformation,[],[f54]) ).
fof(f54,negated_conjecture,
~ ( ( ( gt(loopcounter,n0)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& leq(n1,loopcounter)
& leq(tptp_float_0_001,pv1341) )
=> leq(s_worst7,n3) ),
inference(negated_conjecture,[],[f53]) ).
fof(f53,conjecture,
( ( ( gt(loopcounter,n0)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& leq(n1,loopcounter)
& leq(tptp_float_0_001,pv1341) )
=> leq(s_worst7,n3) ),
file('/export/starexec/sandbox/tmp/tmp.SbXJEp7mux/Vampire---4.8_15854',gauss_array_0014) ).
fof(f161,plain,
~ leq(n1,loopcounter),
inference(forward_demodulation,[],[f159,f131]) ).
fof(f131,plain,
n1 = succ(n0),
inference(cnf_transformation,[],[f84]) ).
fof(f84,axiom,
n1 = succ(n0),
file('/export/starexec/sandbox/tmp/tmp.SbXJEp7mux/Vampire---4.8_15854',successor_1) ).
fof(f159,plain,
~ leq(succ(n0),loopcounter),
inference(resolution,[],[f139,f150]) ).
fof(f150,plain,
~ gt(loopcounter,n0),
inference(subsumption_resolution,[],[f121,f122]) ).
fof(f122,plain,
~ leq(s_worst7,n3),
inference(cnf_transformation,[],[f88]) ).
fof(f121,plain,
( leq(s_worst7,n3)
| ~ gt(loopcounter,n0) ),
inference(cnf_transformation,[],[f88]) ).
fof(f139,plain,
! [X0,X1] :
( gt(X1,X0)
| ~ leq(succ(X0),X1) ),
inference(cnf_transformation,[],[f102]) ).
fof(f102,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.SbXJEp7mux/Vampire---4.8_15854',leq_succ_gt) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWV144+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.11/0.12 % 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.11/0.32 % Computer : n025.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Apr 30 18:53:11 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.32 This is a FOF_THM_RFO_SEQ problem
% 0.11/0.32 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.SbXJEp7mux/Vampire---4.8_15854
% 0.60/0.80 % (15967)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.60/0.80 % (15966)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.60/0.80 % (15965)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.60/0.80 % (15963)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.60/0.80 % (15964)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.60/0.80 % (15968)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.60/0.80 % (15969)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.60/0.80 % (15970)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.60/0.80 % (15965)First to succeed.
% 0.60/0.80 % (15966)Also succeeded, but the first one will report.
% 0.60/0.80 % (15968)Also succeeded, but the first one will report.
% 0.60/0.80 % (15965)Refutation found. Thanks to Tanya!
% 0.60/0.80 % SZS status Theorem for Vampire---4
% 0.60/0.80 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.80 % (15965)------------------------------
% 0.60/0.80 % (15965)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.80 % (15965)Termination reason: Refutation
% 0.60/0.80
% 0.60/0.80 % (15965)Memory used [KB]: 1098
% 0.60/0.80 % (15965)Time elapsed: 0.004 s
% 0.60/0.80 % (15965)Instructions burned: 5 (million)
% 0.60/0.80 % (15965)------------------------------
% 0.60/0.80 % (15965)------------------------------
% 0.60/0.80 % (15962)Success in time 0.478 s
% 0.60/0.80 % Vampire---4.8 exiting
%------------------------------------------------------------------------------