%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV140+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 01:08:14 PM UTC 2026
% Result : Theorem 2.55s 1.06s
% Output : Refutation 2.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 7 unt; 0 def)
% Number of atoms : 125 ( 2 equ)
% Maximal formula atoms : 27 ( 7 avg)
% Number of connectives : 143 ( 34 ~; 28 |; 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 : 7 ( 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f43,axiom,
! [X0,X1] :
( leq(succ(X0),X1)
=> gt(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leq_succ_gt) ).
fof(f53,conjecture,
( ( leq(tptp_float_0_001,pv1341)
& leq(n1,loopcounter)
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_worst7,n3) ) )
=> leq(n0,s_sworst7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gauss_array_0010) ).
fof(f54,negated_conjecture,
~ ( ( leq(tptp_float_0_001,pv1341)
& leq(n1,loopcounter)
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_worst7,n3) ) )
=> leq(n0,s_sworst7) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f84,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_1) ).
fof(f87,plain,
( ~ leq(n0,s_sworst7)
& leq(tptp_float_0_001,pv1341)
& leq(n1,loopcounter)
& ( leq(n0,s_best7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_sworst7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_worst7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_best7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_sworst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_worst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_best7)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_sworst7)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_worst7)
| ~ gt(loopcounter,n0) )
& ( leq(s_best7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(s_sworst7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(s_worst7,n3)
| ~ gt(loopcounter,n0) ) ),
inference(ennf_transformation,[],[f54]) ).
fof(f88,plain,
( ~ leq(n0,s_sworst7)
& leq(tptp_float_0_001,pv1341)
& leq(n1,loopcounter)
& ( leq(n0,s_best7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_sworst7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_worst7)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_best7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_sworst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(s_worst7,n3)
| leq(tptp_float_0_001,pv1341) )
& ( leq(n0,s_best7)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_sworst7)
| ~ gt(loopcounter,n0) )
& ( leq(n0,s_worst7)
| ~ gt(loopcounter,n0) )
& ( leq(s_best7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(s_sworst7,n3)
| ~ gt(loopcounter,n0) )
& ( leq(s_worst7,n3)
| ~ gt(loopcounter,n0) ) ),
inference(flattening,[],[f87]) ).
fof(f102,plain,
! [X0,X1] :
( gt(X1,X0)
| ~ leq(succ(X0),X1) ),
inference(ennf_transformation,[],[f43]) ).
fof(f112,plain,
( leq(n0,s_sworst7)
| ~ gt(loopcounter,n0) ),
inference(cnf_transformation,[],[f88]) ).
fof(f120,plain,
leq(n1,loopcounter),
inference(cnf_transformation,[],[f88]) ).
fof(f122,plain,
~ leq(n0,s_sworst7),
inference(cnf_transformation,[],[f88]) ).
fof(f131,plain,
n1 = succ(n0),
inference(cnf_transformation,[],[f84]) ).
fof(f139,plain,
! [X0,X1] :
( ~ leq(succ(X0),X1)
| gt(X1,X0) ),
inference(cnf_transformation,[],[f102]) ).
fof(f150,plain,
~ gt(loopcounter,n0),
inference(forward_subsumption_resolution,[],[f112,f122]) ).
fof(f160,plain,
! [X0] :
( gt(X0,n0)
| ~ leq(n1,X0) ),
inference(superposition,[],[f139,f131]) ).
fof(f294,plain,
~ leq(n1,loopcounter),
inference(resolution,[],[f160,f150]) ).
fof(f300,plain,
$false,
inference(forward_subsumption_resolution,[],[f294,f120]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV140+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.19 % Computer : n001.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Mon Sep 28 10:05:33 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.23 Running first-order theorem proving
% 0.09/0.23 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.55/1.06 % (259674)Detected formulas, will run a generic FOF schedule.
% 2.55/1.06 % (259683)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=525934383:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.55/1.06 % (259683)First to succeed.
% 2.55/1.06 % (259683)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-259674"
% 2.55/1.06 % (259681)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=3026320051:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.55/1.06 % (259682)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2987382170:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.55/1.06 % (259684)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1119155581:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.55/1.06 % (259679)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=1535578148:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.55/1.06 % (259680)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=3916753033:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.55/1.06 % (259685)dis-21_1_sil=8000:lcm=predicate:random_seed=1122770079:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.55/1.06 % (259684)Also succeeded, but the first one will report.
% 2.55/1.06 % (259682)Instruction limit reached!
% 2.55/1.06 % (259682)------------------------------
% 2.55/1.06 % (259682)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.55/1.06 % (259682)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.55/1.06 % (259682)CaDiCaL version: 2.1.3
% 2.55/1.06 % (259682)Termination reason: Instruction limit
% 2.55/1.06 % (259682)Termination phase: Saturation
% 2.55/1.06 % (259682)Time elapsed: 0.044 s
% 2.55/1.06 % (259682)Peak memory usage: 88 MB
% 2.55/1.06 % (259682)Instructions burned: 110 (million)
% 2.55/1.06 % (259685)Instruction limit reached!
% 2.55/1.06 % (259685)------------------------------
% 2.55/1.06 % (259685)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.55/1.06 % (259685)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.55/1.06 % (259685)CaDiCaL version: 2.1.3
% 2.55/1.06 % (259685)Termination reason: Instruction limit
% 2.55/1.06 % (259685)Termination phase: Saturation
% 2.55/1.06 % (259685)Time elapsed: 0.077 s
% 2.55/1.06 % (259685)Peak memory usage: 89 MB
% 2.55/1.06 % (259685)Instructions burned: 129 (million)
% 2.55/1.06 % (259683)Refutation found. Thanks to Tanya!
% 2.55/1.06 % SZS status Theorem for theBenchmark
% 2.55/1.06 % SZS output start Proof for theBenchmark
% See solution above
% 2.55/1.06 % (259683)------------------------------
% 2.55/1.06 % (259683)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.55/1.06 % (259683)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.55/1.06 % (259683)CaDiCaL version: 2.1.3
% 2.55/1.06 % (259683)Termination reason: Refutation
% 2.55/1.06 % (259683)Time elapsed: 0.003 s
% 2.55/1.06 % (259683)Peak memory usage: 88 MB
% 2.55/1.06 % (259683)Instructions burned: 6 (million)
% 2.55/1.06 % (259683)------------------------------
% 2.55/1.06 % (259683)------------------------------
% 2.55/1.06 % (259674)Success in time 0.283 s
% 2.55/1.06 % Vampire exiting
%------------------------------------------------------------------------------