%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KLE007+3 : 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 : n014.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:35 AM UTC 2026
% Result : Theorem 0.17s 0.46s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 35 ( 18 unt; 0 def)
% Number of atoms : 77 ( 41 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 70 ( 28 ~; 19 |; 17 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 35 ( 31 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(f7,axiom,
! [X0] : multiplication(one,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
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/Axioms/KLE001+1.ax',test_2) ).
fof(f15,axiom,
! [X0,X1] :
( test(X0)
=> ( c(X0) = X1
<=> complement(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_3) ).
fof(f19,conjecture,
! [X0,X1] :
( ( test(X1)
& test(X0) )
=> one = addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f20,negated_conjecture,
~ ! [X0,X1] :
( ( test(X1)
& test(X0) )
=> one = addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1))) ),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f21,plain,
! [X0,X1] :
( ( c(X0) = X1
<=> complement(X0,X1) )
| ~ test(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f27,plain,
? [X0,X1] :
( one != addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1)))
& test(X1)
& test(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f28,plain,
? [X0,X1] :
( one != addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1)))
& test(X1)
& test(X0) ),
inference(flattening,[],[f27]) ).
fof(f32,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(f33,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,[],[f32]) ).
fof(f34,plain,
! [X0,X1] :
( ( ( c(X0) = X1
| ~ complement(X0,X1) )
& ( complement(X0,X1)
| c(X0) != X1 ) )
| ~ test(X0) ),
inference(nnf_transformation,[],[f21]) ).
fof(f35,plain,
( one != addition(multiplication(addition(sK1,c(sK1)),sK2),multiplication(addition(sK1,c(sK1)),c(sK2)))
& test(sK2)
& test(sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X0,sK1),skolemize(X1,sK2)],[f28]) ).
fof(f36,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f42,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f49,plain,
! [X0,X1] :
( addition(X0,X1) = one
| ~ complement(X1,X0) ),
inference(cnf_transformation,[],[f33]) ).
fof(f53,plain,
! [X0,X1] :
( complement(X0,X1)
| c(X0) != X1
| ~ test(X0) ),
inference(cnf_transformation,[],[f34]) ).
fof(f58,plain,
test(sK1),
inference(cnf_transformation,[],[f35]) ).
fof(f59,plain,
test(sK2),
inference(cnf_transformation,[],[f35]) ).
fof(f60,plain,
one != addition(multiplication(addition(sK1,c(sK1)),sK2),multiplication(addition(sK1,c(sK1)),c(sK2))),
inference(cnf_transformation,[],[f35]) ).
fof(f61,plain,
! [X0] :
( complement(X0,c(X0))
| ~ test(X0) ),
inference(equality_resolution,[],[f53]) ).
fof(f67,plain,
! [X0,X1] :
( complement(X1,X0)
| addition(X0,X1) = one ),
inference(consistent_polarity_flipping,[],[f49]) ).
fof(f69,plain,
! [X0] :
( ~ complement(X0,c(X0))
| test(X0) ),
inference(consistent_polarity_flipping,[],[f61]) ).
fof(f73,plain,
~ test(sK2),
inference(consistent_polarity_flipping,[],[f59]) ).
fof(f74,plain,
~ test(sK1),
inference(consistent_polarity_flipping,[],[f58]) ).
fof(f90,plain,
! [X0] :
( test(X0)
| one = addition(c(X0),X0) ),
inference(resolution,[],[f67,f69]) ).
fof(f113,plain,
one = addition(c(sK1),sK1),
inference(resolution,[],[f90,f74]) ).
fof(f114,plain,
one = addition(c(sK2),sK2),
inference(resolution,[],[f90,f73]) ).
fof(f122,plain,
one = addition(sK1,c(sK1)),
inference(superposition,[],[f36,f113]) ).
fof(f126,plain,
one = addition(sK2,c(sK2)),
inference(superposition,[],[f36,f114]) ).
fof(f127,plain,
one != addition(multiplication(one,sK2),multiplication(one,c(sK2))),
inference(superposition,[],[f60,f122]) ).
fof(f130,plain,
one != addition(sK2,multiplication(one,c(sK2))),
inference(superposition,[],[f127,f42]) ).
fof(f132,plain,
one != addition(sK2,c(sK2)),
inference(superposition,[],[f130,f42]) ).
fof(f133,plain,
one != one,
inference(superposition,[],[f132,f126]) ).
fof(f134,plain,
$false,
inference(trivial_inequality_removal,[],[f133]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE007+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.38 % Computer : n014.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Sun Sep 27 12:58:02 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.42 Running first-order model finding
% 0.13/0.42 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
% 0.17/0.46 % (796658)Will run a generic schedule for satisfiability detection.
% 0.17/0.46 % (796663)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=447334435_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.46 % TRYING [1]
% 0.17/0.46 % TRYING [2]
% 0.17/0.46 % TRYING [3]
% 0.17/0.46 % (796664)% WARNING: option uhcvi not known.
% 0.17/0.46 % TRYING [4]
% 0.17/0.46 % (796665)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2543619765:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.46 % (796664)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2383116017:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.46 % (796668)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2738848061:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.46 % (796666)dis+10_1_sil=32000:sp=arity:random_seed=3893964084:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.46 % (796667)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4215013558:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.46 % (796669)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=991186074:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.46 % (796669) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-796658-796669"...
% 0.17/0.46 % (796669)...printing done.
% 0.17/0.46 % TRYING [5]
% 0.17/0.46 % (796669)Refutation found. Thanks to Tanya!
% 0.17/0.46 % SZS status Theorem for theBenchmark
% 0.17/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.46 % (796669)------------------------------
% 0.17/0.46 % (796669)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.46 % (796669)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.46 % (796669)CaDiCaL version: 2.1.3
% 0.17/0.46 % (796669)Termination reason: Refutation
% 0.17/0.46 % (796669)Time elapsed: 0.005 s
% 0.17/0.46 % (796669)Peak memory usage: 12 MB
% 0.17/0.46 % (796669)Instructions burned: 6 (million)
% 0.17/0.46 % (796658)Success in time 0.03 s
% 0.17/0.46 % Vampire exiting
%------------------------------------------------------------------------------