%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : KLE025+1 : 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 : n015.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:06 AM UTC 2026
% Result : Theorem 0.16s 1.50s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 38 ( 22 unt; 0 def)
% Number of atoms : 84 ( 53 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 70 ( 24 ~; 18 |; 20 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 55 ( 49 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_commutativity) ).
fof(f3,axiom,
! [X0] : addition(X0,zero) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_identity) ).
fof(f5,axiom,
! [X0,X1,X2] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_associativity) ).
fof(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_right_identity) ).
fof(f8,axiom,
! [X0,X1,X2] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_distributivity) ).
fof(f14,axiom,
! [X0,X1] :
( complement(X1,X0)
<=> ( multiplication(X0,X1) = zero
& multiplication(X1,X0) = zero
& addition(X0,X1) = one ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',test_2) ).
fof(f15,axiom,
! [X0,X1] :
( test(X0)
=> ( c(X0) = X1
<=> complement(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',test_3) ).
fof(f17,conjecture,
! [X0,X1,X2] :
( ( test(X1)
& test(X2) )
=> ( multiplication(multiplication(X1,X0),c(X2)) = zero
=> multiplication(X1,X0) = multiplication(multiplication(X1,X0),X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f18,negated_conjecture,
~ ! [X0,X1,X2] :
( ( test(X1)
& test(X2) )
=> ( multiplication(multiplication(X1,X0),c(X2)) = zero
=> multiplication(X1,X0) = multiplication(multiplication(X1,X0),X2) ) ),
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f19,plain,
! [X0,X1] :
( ( c(X0) = X1
<=> complement(X0,X1) )
| ~ test(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f21,plain,
? [X0,X1,X2] :
( multiplication(X1,X0) != multiplication(multiplication(X1,X0),X2)
& multiplication(multiplication(X1,X0),c(X2)) = zero
& test(X1)
& test(X2) ),
inference(ennf_transformation,[],[f18]) ).
fof(f22,plain,
? [X0,X1,X2] :
( multiplication(X1,X0) != multiplication(multiplication(X1,X0),X2)
& multiplication(multiplication(X1,X0),c(X2)) = zero
& test(X1)
& test(X2) ),
inference(flattening,[],[f21]) ).
fof(f26,plain,
! [X0,X1] :
( ( complement(X1,X0)
| zero != multiplication(X0,X1)
| zero != multiplication(X1,X0)
| addition(X0,X1) != one )
& ( ( multiplication(X0,X1) = zero
& multiplication(X1,X0) = zero
& addition(X0,X1) = one )
| ~ complement(X1,X0) ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f27,plain,
! [X0,X1] :
( ( complement(X1,X0)
| zero != multiplication(X0,X1)
| zero != multiplication(X1,X0)
| addition(X0,X1) != one )
& ( ( multiplication(X0,X1) = zero
& multiplication(X1,X0) = zero
& addition(X0,X1) = one )
| ~ complement(X1,X0) ) ),
inference(flattening,[],[f26]) ).
fof(f28,plain,
! [X0,X1] :
( ( ( c(X0) = X1
| ~ complement(X0,X1) )
& ( complement(X0,X1)
| c(X0) != X1 ) )
| ~ test(X0) ),
inference(nnf_transformation,[],[f19]) ).
fof(f29,plain,
( multiplication(sK2,sK1) != multiplication(multiplication(sK2,sK1),sK3)
& zero = multiplication(multiplication(sK2,sK1),c(sK3))
& test(sK2)
& test(sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(X0,sK1),skolemize(X1,sK2),skolemize(X2,sK3)],[f22]) ).
fof(f30,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f32,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f34,plain,
! [X2,X0,X1] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
inference(cnf_transformation,[],[f5]) ).
fof(f35,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f37,plain,
! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
inference(cnf_transformation,[],[f8]) ).
fof(f43,plain,
! [X0,X1] :
( ~ complement(X1,X0)
| addition(X0,X1) = one ),
inference(cnf_transformation,[],[f27]) ).
fof(f47,plain,
! [X0,X1] :
( complement(X0,X1)
| c(X0) != X1
| ~ test(X0) ),
inference(cnf_transformation,[],[f28]) ).
fof(f50,plain,
test(sK3),
inference(cnf_transformation,[],[f29]) ).
fof(f52,plain,
zero = multiplication(multiplication(sK2,sK1),c(sK3)),
inference(cnf_transformation,[],[f29]) ).
fof(f53,plain,
multiplication(sK2,sK1) != multiplication(multiplication(sK2,sK1),sK3),
inference(cnf_transformation,[],[f29]) ).
fof(f54,plain,
! [X0] :
( complement(X0,c(X0))
| ~ test(X0) ),
inference(equality_resolution,[],[f47]) ).
fof(f60,plain,
! [X0] :
( one = addition(c(X0),X0)
| ~ test(X0) ),
inference(resolution,[],[f43,f54]) ).
fof(f61,plain,
! [X0] :
( ~ test(X0)
| one = addition(X0,c(X0)) ),
inference(forward_demodulation,[],[f60,f30]) ).
fof(f103,plain,
multiplication(sK2,sK1) != multiplication(sK2,multiplication(sK1,sK3)),
inference(superposition,[],[f53,f34]) ).
fof(f124,plain,
! [X0] : multiplication(multiplication(sK2,sK1),addition(X0,c(sK3))) = addition(multiplication(multiplication(sK2,sK1),X0),zero),
inference(superposition,[],[f37,f52]) ).
fof(f136,plain,
! [X0] : multiplication(multiplication(sK2,sK1),X0) = multiplication(multiplication(sK2,sK1),addition(X0,c(sK3))),
inference(forward_demodulation,[],[f124,f32]) ).
fof(f146,plain,
! [X0] : multiplication(multiplication(sK2,sK1),X0) = multiplication(sK2,multiplication(sK1,addition(X0,c(sK3)))),
inference(forward_demodulation,[],[f136,f34]) ).
fof(f152,plain,
! [X0] : multiplication(sK2,multiplication(sK1,addition(X0,c(sK3)))) = multiplication(sK2,multiplication(sK1,X0)),
inference(forward_demodulation,[],[f146,f34]) ).
fof(f313,plain,
one = addition(sK3,c(sK3)),
inference(resolution,[],[f61,f50]) ).
fof(f317,plain,
multiplication(sK2,multiplication(sK1,sK3)) = multiplication(sK2,multiplication(sK1,one)),
inference(superposition,[],[f152,f313]) ).
fof(f319,plain,
multiplication(sK2,sK1) = multiplication(sK2,multiplication(sK1,sK3)),
inference(forward_demodulation,[],[f317,f35]) ).
fof(f320,plain,
$false,
inference(forward_subsumption_resolution,[],[f319,f103]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE025+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.38 % Computer : n015.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 27 13:06:46 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 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
% 0.16/1.50 % (1649038)Detected formulas, will run a generic FOF schedule.
% 0.16/1.50 % (1649046)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=651122266:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.16/1.50 % (1649046)Refutation not found, incomplete strategy
% 0.16/1.50 % (1649046)------------------------------
% 0.16/1.50 % (1649046)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.16/1.50 % (1649046)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/1.50 % (1649046)CaDiCaL version: 2.1.3
% 0.16/1.50 % (1649046)Termination reason: Refutation not found, incomplete strategy
% 0.16/1.50 % (1649046)Time elapsed: 0.001 s
% 0.16/1.50 % (1649046)Peak memory usage: 88 MB
% 0.16/1.50 % (1649046)Instructions burned: 1 (million)
% 0.16/1.50 % (1649047)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3467567629:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.16/1.50 % (1649048)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4000784404:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.16/1.50 % (1649044)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=770214468:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.16/1.50 % (1649045)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=651340560:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.16/1.50 % (1649043)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=2870087001:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.16/1.50 % (1649049)dis-21_1_sil=8000:lcm=predicate:random_seed=2926826922: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)
% 0.16/1.50 % (1649049)Refutation not found, incomplete strategy
% 0.16/1.50 % (1649049)------------------------------
% 0.16/1.50 % (1649049)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.16/1.50 % (1649049)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/1.50 % (1649049)CaDiCaL version: 2.1.3
% 0.16/1.50 % (1649049)Termination reason: Refutation not found, incomplete strategy
% 0.16/1.50 % (1649049)Time elapsed: 0.002 s
% 0.16/1.50 % (1649049)Peak memory usage: 88 MB
% 0.16/1.50 % (1649049)Instructions burned: 2 (million)
% 0.16/1.50 % (1649048)First to succeed.
% 0.16/1.50 % (1649048)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1649038"
% 0.16/1.50 % (1649047)Instruction limit reached!
% 0.16/1.50 % (1649047)------------------------------
% 0.16/1.50 % (1649047)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.16/1.50 % (1649047)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/1.50 % (1649047)CaDiCaL version: 2.1.3
% 0.16/1.50 % (1649047)Termination reason: Instruction limit
% 0.16/1.50 % (1649047)Termination phase: Saturation
% 0.16/1.50 % (1649047)Time elapsed: 0.070 s
% 0.16/1.50 % (1649047)Peak memory usage: 88 MB
% 0.16/1.50 % (1649047)Instructions burned: 120 (million)
% 0.16/1.50 % (1649046)------------------------------
% 0.16/1.50 % (1649046)------------------------------
% 0.16/1.50 % (1649058)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1765636187:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 0.16/1.50 % (1649057)lrs+10_1_sil=8000:sp=occurrence:random_seed=3296905726:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 0.16/1.50 % (1649049)------------------------------
% 0.16/1.50 % (1649049)------------------------------
% 0.16/1.50 % (1649048)Refutation found. Thanks to Tanya!
% 0.16/1.50 % SZS status Theorem for theBenchmark
% 0.16/1.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/1.50 % (1649048)------------------------------
% 0.16/1.50 % (1649048)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.16/1.50 % (1649048)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/1.50 % (1649048)CaDiCaL version: 2.1.3
% 0.16/1.50 % (1649048)Termination reason: Refutation
% 0.16/1.50 % (1649048)Time elapsed: 0.010 s
% 0.16/1.50 % (1649048)Peak memory usage: 89 MB
% 0.16/1.50 % (1649048)Instructions burned: 13 (million)
% 0.16/1.50 % (1649048)------------------------------
% 0.16/1.50 % (1649048)------------------------------
% 0.16/1.50 % (1649038)Success in time 0.439 s
% 0.16/1.50 % Vampire exiting
%------------------------------------------------------------------------------