%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : KLE142+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n009.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 11:40:27 AM UTC 2026
% Result : Theorem 4.68s 2.13s
% Output : Refutation 4.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 40 ( 25 unt; 0 def)
% Number of atoms : 57 ( 22 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 34 ( 17 ~; 12 |; 3 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 69 ( 68 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_commutativity) ).
fof(f2,axiom,
! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_associativity) ).
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',idempotence) ).
fof(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_right_identity) ).
fof(f7,axiom,
! [X0] : multiplication(one,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_left_identity) ).
fof(f9,axiom,
! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distributivity2) ).
fof(f15,axiom,
! [X0] : strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',infty_unfold1) ).
fof(f16,axiom,
! [X0,X1,X2] :
( leq(X2,addition(multiplication(X0,X2),X1))
=> leq(X2,multiplication(strong_iteration(X0),X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',infty_coinduction) ).
fof(f18,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',order) ).
fof(f19,conjecture,
! [X0] :
( leq(strong_iteration(strong_iteration(X0)),strong_iteration(one))
& leq(strong_iteration(one),strong_iteration(strong_iteration(X0))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f20,negated_conjecture,
~ ! [X0] :
( leq(strong_iteration(strong_iteration(X0)),strong_iteration(one))
& leq(strong_iteration(one),strong_iteration(strong_iteration(X0))) ),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f21,plain,
? [X0] :
( ~ leq(strong_iteration(strong_iteration(X0)),strong_iteration(one))
| ~ leq(strong_iteration(one),strong_iteration(strong_iteration(X0))) ),
inference(ennf_transformation,[],[f20]) ).
fof(f24,plain,
! [X0,X1,X2] :
( leq(X2,multiplication(strong_iteration(X0),X1))
| ~ leq(X2,addition(multiplication(X0,X2),X1)) ),
inference(ennf_transformation,[],[f16]) ).
fof(f25,plain,
( ~ leq(strong_iteration(strong_iteration(sK0)),strong_iteration(one))
| ~ leq(strong_iteration(one),strong_iteration(strong_iteration(sK0))) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f21]) ).
fof(f26,plain,
! [X0,X1] :
( ( leq(X0,X1)
| addition(X0,X1) != X1 )
& ( addition(X0,X1) = X1
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f18]) ).
fof(f27,plain,
( ~ leq(strong_iteration(strong_iteration(sK0)),strong_iteration(one))
| ~ leq(strong_iteration(one),strong_iteration(strong_iteration(sK0))) ),
inference(cnf_transformation,[],[f25]) ).
fof(f29,plain,
! [X0,X1] :
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f32,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f33,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f34,plain,
! [X2,X0,X1] :
( ~ leq(X2,addition(multiplication(X0,X2),X1))
| leq(X2,multiplication(strong_iteration(X0),X1)) ),
inference(cnf_transformation,[],[f24]) ).
fof(f35,plain,
! [X0] : strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
inference(cnf_transformation,[],[f15]) ).
fof(f36,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f37,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f2]) ).
fof(f38,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f39,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f53,plain,
! [X0] : strong_iteration(X0) = addition(one,multiplication(X0,strong_iteration(X0))),
inference(forward_demodulation,[],[f35,f38]) ).
fof(f87,plain,
! [X0,X1] : addition(X0,X1) = addition(X0,addition(X0,X1)),
inference(superposition,[],[f37,f36]) ).
fof(f149,plain,
! [X0,X1] :
( ~ leq(X0,addition(X0,X1))
| leq(X0,multiplication(strong_iteration(one),X1)) ),
inference(superposition,[],[f34,f32]) ).
fof(f157,plain,
! [X0,X1] : multiplication(addition(one,X1),X0) = addition(X0,multiplication(X1,X0)),
inference(superposition,[],[f39,f32]) ).
fof(f235,plain,
! [X0,X1] :
( addition(X0,X1) != addition(X0,X1)
| leq(X0,addition(X0,X1)) ),
inference(superposition,[],[f29,f87]) ).
fof(f243,plain,
! [X0,X1] : leq(X0,addition(X0,X1)),
inference(trivial_inequality_removal,[],[f235]) ).
fof(f683,plain,
! [X0,X1] : leq(X0,multiplication(strong_iteration(one),X1)),
inference(forward_subsumption_resolution,[],[f149,f243]) ).
fof(f686,plain,
! [X0] : leq(X0,strong_iteration(one)),
inference(superposition,[],[f683,f33]) ).
fof(f690,plain,
~ leq(strong_iteration(one),strong_iteration(strong_iteration(sK0))),
inference(resolution,[],[f686,f27]) ).
fof(f718,plain,
! [X2,X0,X1] :
( ~ leq(X0,addition(addition(X0,multiplication(X1,X0)),X2))
| leq(X0,multiplication(strong_iteration(addition(one,X1)),X2)) ),
inference(superposition,[],[f34,f157]) ).
fof(f752,plain,
! [X2,X0,X1] :
( ~ leq(X0,addition(X0,addition(multiplication(X1,X0),X2)))
| leq(X0,multiplication(strong_iteration(addition(one,X1)),X2)) ),
inference(forward_demodulation,[],[f718,f37]) ).
fof(f765,plain,
! [X2,X0,X1] : leq(X0,multiplication(strong_iteration(addition(one,X1)),X2)),
inference(forward_subsumption_resolution,[],[f752,f243]) ).
fof(f2542,plain,
! [X0,X1] : leq(X1,strong_iteration(addition(one,X0))),
inference(superposition,[],[f765,f33]) ).
fof(f2559,plain,
! [X0,X1] : leq(X1,strong_iteration(strong_iteration(X0))),
inference(superposition,[],[f2542,f53]) ).
fof(f2619,plain,
$false,
inference(resolution,[],[f2559,f690]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : KLE142+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.09 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/0.48 % Computer : n009.cluster.edu
% 0.22/0.48 % Model : x86_64 x86_64
% 0.22/0.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.22/0.48 % Memory : 8046.5625MB
% 0.22/0.48 % OS : Linux 6.8.0-71-generic
% 0.22/0.48 % CPULimit : 300
% 0.22/0.48 % WCLimit : 300
% 0.22/0.48 % DateTime : Sun Sep 27 13:12:00 UTC 2026
% 0.22/0.48 % CPUTime :
% 0.22/0.48 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.54 Running first-order theorem proving
% 0.25/0.54 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.68/2.13 % (2027815)Detected formulas, will run a generic FOF schedule.
% 4.68/2.13 % (2027824)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2453442610:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 4.68/2.13 % (2027824)First to succeed.
% 4.68/2.13 % (2027824)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2027815"
% 4.68/2.13 % (2027820)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=69331521:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 4.68/2.13 % (2027821)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=3038385700:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 4.68/2.13 % (2027822)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=4054321509:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 4.68/2.13 % (2027823)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=584050613:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 4.68/2.13 % (2027823)Refutation not found, incomplete strategy
% 4.68/2.13 % (2027823)------------------------------
% 4.68/2.13 % (2027823)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.68/2.13 % (2027823)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.68/2.13 % (2027823)CaDiCaL version: 2.1.3
% 4.68/2.13 % (2027823)Termination reason: Refutation not found, incomplete strategy
% 4.68/2.13 % (2027823)Time elapsed: 0.002 s
% 4.68/2.13 % (2027823)Peak memory usage: 88 MB
% 4.68/2.13 % (2027826)dis-21_1_sil=8000:lcm=predicate:random_seed=461205997: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)
% 4.68/2.13 % (2027825)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2903845756:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 4.68/2.13 % (2027826)Refutation not found, incomplete strategy
% 4.68/2.13 % (2027826)------------------------------
% 4.68/2.13 % (2027826)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.68/2.13 % (2027826)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.68/2.13 % (2027826)CaDiCaL version: 2.1.3
% 4.68/2.13 % (2027826)Termination reason: Refutation not found, incomplete strategy
% 4.68/2.13 % (2027826)Time elapsed: 0.003 s
% 4.68/2.13 % (2027826)Peak memory usage: 88 MB
% 4.68/2.13 % (2027826)Instructions burned: 1 (million)
% 4.68/2.13 % (2027825)Also succeeded, but the first one will report.
% 4.68/2.13 % (2027824)Refutation found. Thanks to Tanya!
% 4.68/2.13 % SZS status Theorem for theBenchmark
% 4.68/2.13 % SZS output start Proof for theBenchmark
% See solution above
% 4.68/2.13 % (2027824)------------------------------
% 4.68/2.13 % (2027824)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.68/2.13 % (2027824)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.68/2.13 % (2027824)CaDiCaL version: 2.1.3
% 4.68/2.13 % (2027824)Termination reason: Refutation
% 4.68/2.13 % (2027824)Time elapsed: 0.044 s
% 4.68/2.13 % (2027824)Peak memory usage: 89 MB
% 4.68/2.13 % (2027824)Instructions burned: 86 (million)
% 4.68/2.13 % (2027824)------------------------------
% 4.68/2.13 % (2027824)------------------------------
% 4.68/2.13 % (2027815)Success in time 0.536 s
% 4.68/2.13 % Vampire exiting
%------------------------------------------------------------------------------