%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KLE142+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n011.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:58 AM UTC 2026
% Result : Theorem 1.35s 0.67s
% Output : Refutation 1.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of formulae : 45 ( 35 unt; 0 def)
% Number of atoms : 57 ( 35 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 26 ( 14 ~; 9 |; 1 &)
% ( 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/Axioms/KLE004+0.ax',additive_commutativity) ).
fof(f2,axiom,
! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',additive_associativity) ).
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',idempotence) ).
fof(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',multiplicative_right_identity) ).
fof(f7,axiom,
! [X0] : multiplication(one,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',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/Axioms/KLE004+0.ax',distributivity2) ).
fof(f15,axiom,
! [X0] : strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',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/Axioms/KLE004+0.ax',infty_coinduction) ).
fof(f18,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',order) ).
fof(f19,conjecture,
! [X0] : strong_iteration(strong_iteration(X0)) = strong_iteration(one),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f20,negated_conjecture,
~ ! [X0] : strong_iteration(strong_iteration(X0)) = strong_iteration(one),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f23,plain,
! [X0,X1,X2] :
( leq(X2,multiplication(strong_iteration(X0),X1))
| ~ leq(X2,addition(multiplication(X0,X2),X1)) ),
inference(ennf_transformation,[],[f16]) ).
fof(f24,plain,
? [X0] : strong_iteration(strong_iteration(X0)) != strong_iteration(one),
inference(ennf_transformation,[],[f20]) ).
fof(f25,plain,
! [X0,X1] :
( ( leq(X0,X1)
| addition(X0,X1) != X1 )
& ( addition(X0,X1) = X1
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f18]) ).
fof(f26,plain,
strong_iteration(one) != strong_iteration(strong_iteration(sK0)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f24]) ).
fof(f27,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f28,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f2]) ).
fof(f30,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f32,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f33,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f35,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f41,plain,
! [X0] : strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
inference(cnf_transformation,[],[f15]) ).
fof(f42,plain,
! [X2,X0,X1] :
( ~ leq(X2,addition(multiplication(X0,X2),X1))
| leq(X2,multiplication(strong_iteration(X0),X1)) ),
inference(cnf_transformation,[],[f23]) ).
fof(f44,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| addition(X0,X1) = X1 ),
inference(cnf_transformation,[],[f25]) ).
fof(f45,plain,
! [X0,X1] :
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f46,plain,
strong_iteration(one) != strong_iteration(strong_iteration(sK0)),
inference(cnf_transformation,[],[f26]) ).
fof(f248,plain,
! [X0] : strong_iteration(X0) = addition(one,multiplication(X0,strong_iteration(X0))),
inference(forward_demodulation,[],[f41,f27]) ).
fof(f519,plain,
! [X0,X1] : addition(X0,X1) = addition(X0,addition(X0,X1)),
inference(superposition,[],[f28,f30]) ).
fof(f564,plain,
! [X0,X1] :
( addition(X0,X1) != addition(X0,X1)
| leq(X0,addition(X0,X1)) ),
inference(superposition,[],[f45,f519]) ).
fof(f566,plain,
! [X0,X1] : leq(X0,addition(X0,X1)),
inference(trivial_inequality_removal,[],[f564]) ).
fof(f12438,plain,
! [X0,X1] : multiplication(addition(one,X1),X0) = addition(X0,multiplication(X1,X0)),
inference(superposition,[],[f35,f33]) ).
fof(f21369,plain,
! [X0,X1] :
( ~ leq(X0,addition(X0,X1))
| leq(X0,multiplication(strong_iteration(one),X1)) ),
inference(superposition,[],[f42,f33]) ).
fof(f21396,plain,
! [X0,X1] : leq(X0,multiplication(strong_iteration(one),X1)),
inference(forward_subsumption_resolution,[],[f21369,f566]) ).
fof(f21892,plain,
! [X0] : leq(X0,strong_iteration(one)),
inference(superposition,[],[f21396,f32]) ).
fof(f21895,plain,
! [X0] : strong_iteration(one) = addition(X0,strong_iteration(one)),
inference(resolution,[],[f21892,f44]) ).
fof(f21898,plain,
! [X0] : strong_iteration(one) = addition(strong_iteration(one),X0),
inference(superposition,[],[f21895,f27]) ).
fof(f26303,plain,
! [X0] : strong_iteration(one) = multiplication(addition(one,X0),strong_iteration(one)),
inference(superposition,[],[f12438,f21898]) ).
fof(f28128,plain,
! [X0] : strong_iteration(one) = multiplication(strong_iteration(X0),strong_iteration(one)),
inference(superposition,[],[f26303,f248]) ).
fof(f28391,plain,
! [X0,X1] :
( ~ leq(strong_iteration(one),addition(strong_iteration(one),X1))
| leq(strong_iteration(one),multiplication(strong_iteration(strong_iteration(X0)),X1)) ),
inference(superposition,[],[f42,f28128]) ).
fof(f28411,plain,
! [X0,X1] : leq(strong_iteration(one),multiplication(strong_iteration(strong_iteration(X0)),X1)),
inference(forward_subsumption_resolution,[],[f28391,f566]) ).
fof(f28763,plain,
! [X0] : leq(strong_iteration(one),strong_iteration(strong_iteration(X0))),
inference(superposition,[],[f28411,f32]) ).
fof(f28765,plain,
! [X0] : strong_iteration(strong_iteration(X0)) = addition(strong_iteration(one),strong_iteration(strong_iteration(X0))),
inference(resolution,[],[f28763,f44]) ).
fof(f28771,plain,
! [X0] : strong_iteration(strong_iteration(X0)) = strong_iteration(one),
inference(forward_demodulation,[],[f28765,f21898]) ).
fof(f28800,plain,
strong_iteration(one) != strong_iteration(one),
inference(superposition,[],[f46,f28771]) ).
fof(f28992,plain,
$false,
inference(trivial_inequality_removal,[],[f28800]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE142+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38 % Computer : n011.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 27 13:12:00 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.35/0.67 % (2393935)Will run a generic schedule for satisfiability detection.
% 1.35/0.67 % (2393942)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2588520000:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.35/0.67 % (2393941)% WARNING: option uhcvi not known.
% 1.35/0.67 % (2393943)dis+10_1_sil=32000:sp=arity:random_seed=1429039488:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.35/0.67 % (2393940)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=886410774_2999 on theBenchmark for (2999ds/0Mi)
% 1.35/0.67 % (2393941)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2054807232:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.35/0.67 % (2393944)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1676761040:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.35/0.67 % (2393946)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=596055636:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.35/0.67 % (2393945)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1628484304:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.35/0.67 % TRYING [1]
% 1.35/0.67 % TRYING [2]
% 1.35/0.67 % TRYING [3]
% 1.35/0.67 % TRYING [4]
% 1.35/0.67 % TRYING [5]
% 1.35/0.67 % (2393943)Instruction limit reached!
% 1.35/0.67 % (2393943)------------------------------
% 1.35/0.67 % (2393943)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.35/0.67 % (2393943)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.35/0.67 % (2393943)CaDiCaL version: 2.1.3
% 1.35/0.67 % (2393943)Termination reason: Instruction limit
% 1.35/0.67 % (2393943)Termination phase: Saturation
% 1.35/0.67 % (2393943)Time elapsed: 0.064 s
% 1.35/0.67 % (2393943)Peak memory usage: 12 MB
% 1.35/0.67 % (2393943)Instructions burned: 104 (million)
% 1.35/0.67 % (2393944)Instruction limit reached!
% 1.35/0.67 % (2393944)------------------------------
% 1.35/0.67 % (2393944)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.35/0.67 % (2393944)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.35/0.67 % (2393944)CaDiCaL version: 2.1.3
% 1.35/0.67 % (2393944)Termination reason: Instruction limit
% 1.35/0.67 % (2393944)Termination phase: Saturation
% 1.35/0.67 % (2393944)Time elapsed: 0.075 s
% 1.35/0.67 % (2393944)Peak memory usage: 13 MB
% 1.35/0.67 % (2393944)Instructions burned: 117 (million)
% 1.35/0.67 % (2393945)Instruction limit reached!
% 1.35/0.67 % (2393945)------------------------------
% 1.35/0.67 % (2393945)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.35/0.67 % (2393945)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.35/0.67 % (2393945)CaDiCaL version: 2.1.3
% 1.35/0.67 % (2393945)Termination reason: Instruction limit
% 1.35/0.67 % (2393945)Termination phase: Saturation
% 1.35/0.67 % (2393945)Time elapsed: 0.082 s
% 1.35/0.67 % (2393945)Peak memory usage: 13 MB
% 1.35/0.67 % (2393945)Instructions burned: 131 (million)
% 1.35/0.67 % (2393954)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2113128658:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.35/0.67 % TRYING [1]
% 1.35/0.67 % TRYING [2]
% 1.35/0.67 % TRYING [3]
% 1.35/0.67 % TRYING [6]
% 1.35/0.67 % TRYING [4]
% 1.35/0.67 % (2393955)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=4181401155:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.35/0.67 % (2393946)Instruction limit reached!
% 1.35/0.67 % (2393946)------------------------------
% 1.35/0.67 % (2393946)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.35/0.67 % (2393946)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.35/0.67 % (2393946)CaDiCaL version: 2.1.3
% 1.35/0.67 % (2393946)Termination reason: Instruction limit
% 1.35/0.67 % (2393946)Termination phase: Saturation
% 1.35/0.67 % (2393946)Time elapsed: 0.101 s
% 1.35/0.67 % (2393946)Peak memory usage: 13 MB
% 1.35/0.67 % (2393946)Instructions burned: 159 (million)
% 1.35/0.67 % (2393956)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=451199221:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.35/0.67 % TRYING [5]
% 1.35/0.67 % (2393960)ott-21_1_sil=16000:fs=off:random_seed=3498359506:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.35/0.67 % (2393955)Instruction limit reached!
% 1.35/0.67 % (2393955)------------------------------
% 1.35/0.67 % (2393955)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.35/0.67 % (2393955)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.35/0.67 % (2393955)CaDiCaL version: 2.1.3
% 1.35/0.67 % (2393955)Termination reason: Instruction limit
% 1.35/0.67 % (2393955)Termination phase: Saturation
% 1.35/0.67 % (2393955)Time elapsed: 0.091 s
% 1.35/0.67 % (2393955)Peak memory usage: 13 MB
% 1.35/0.67 % (2393955)Instructions burned: 131 (million)
% 1.35/0.67 % TRYING [6]
% 1.35/0.67 % (2393960)Instruction limit reached!
% 1.35/0.67 % (2393960)------------------------------
% 1.35/0.67 % (2393960)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.35/0.67 % (2393960)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.35/0.67 % (2393960)CaDiCaL version: 2.1.3
% 1.35/0.67 % (2393960)Termination reason: Instruction limit
% 1.35/0.67 % (2393960)Termination phase: Saturation
% 1.35/0.67 % (2393960)Time elapsed: 0.074 s
% 1.35/0.67 % (2393960)Peak memory usage: 12 MB
% 1.35/0.67 % (2393960)Instructions burned: 181 (million)
% 1.35/0.67 % (2393942) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2393935-2393942"...
% 1.35/0.67 % (2393962)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1178669854:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 1.35/0.67 % (2393942)...printing done.
% 1.35/0.67 % (2393942)Refutation found. Thanks to Tanya!
% 1.35/0.67 % SZS status Theorem for theBenchmark
% 1.35/0.67 % SZS output start Proof for theBenchmark
% See solution above
% 1.35/0.67 % (2393942)------------------------------
% 1.35/0.67 % (2393942)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.35/0.67 % (2393942)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.35/0.67 % (2393942)CaDiCaL version: 2.1.3
% 1.35/0.67 % (2393942)Termination reason: Refutation
% 1.35/0.67 % (2393942)Time elapsed: 0.215 s
% 1.35/0.67 % (2393942)Peak memory usage: 19 MB
% 1.35/0.67 % (2393942)Instructions burned: 682 (million)
% 1.35/0.67 % (2393935)Success in time 0.248 s
% 1.35/0.67 % Vampire exiting
%------------------------------------------------------------------------------