%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KLE007+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 : n006.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.09s 0.44s
% Output : Refutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 15 unt; 0 def)
% Number of atoms : 72 ( 40 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 67 ( 26 ~; 18 |; 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 : 39 ( 35 !; 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(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',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/Axioms/KLE001+0.ax',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/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(f17,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(f18,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)],[f17]) ).
fof(f19,plain,
! [X0,X1] :
( ( c(X0) = X1
<=> complement(X0,X1) )
| ~ test(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f21,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,[],[f18]) ).
fof(f22,plain,
? [X0,X1] :
( one != addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1)))
& test(X1)
& test(X0) ),
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,
( 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)],[f22]) ).
fof(f30,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
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(sK1),
inference(cnf_transformation,[],[f29]) ).
fof(f51,plain,
test(sK2),
inference(cnf_transformation,[],[f29]) ).
fof(f52,plain,
one != addition(multiplication(addition(sK1,c(sK1)),sK2),multiplication(addition(sK1,c(sK1)),c(sK2))),
inference(cnf_transformation,[],[f29]) ).
fof(f53,plain,
! [X0] :
( complement(X0,c(X0))
| ~ test(X0) ),
inference(equality_resolution,[],[f47]) ).
fof(f61,plain,
! [X0] :
( one = addition(c(X0),X0)
| ~ test(X0) ),
inference(resolution,[],[f43,f53]) ).
fof(f62,plain,
! [X0] :
( ~ test(X0)
| one = addition(X0,c(X0)) ),
inference(forward_demodulation,[],[f61,f30]) ).
fof(f123,plain,
one != multiplication(addition(sK1,c(sK1)),addition(sK2,c(sK2))),
inference(superposition,[],[f52,f37]) ).
fof(f227,plain,
one = addition(sK1,c(sK1)),
inference(resolution,[],[f62,f50]) ).
fof(f228,plain,
one = addition(sK2,c(sK2)),
inference(resolution,[],[f62,f51]) ).
fof(f244,plain,
one != multiplication(addition(sK1,c(sK1)),one),
inference(superposition,[],[f123,f228]) ).
fof(f246,plain,
one != addition(sK1,c(sK1)),
inference(forward_demodulation,[],[f244,f35]) ).
fof(f247,plain,
$false,
inference(forward_subsumption_resolution,[],[f246,f227]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE007+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.37 % Computer : n006.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sun Sep 27 12:57:56 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.09/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.41 Running first-order model finding
% 0.09/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
% 0.09/0.44 % (2959291)Will run a generic schedule for satisfiability detection.
% 0.09/0.44 % (2959302)dis+10_1_sil=32000:sp=arity:random_seed=2734990444:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.44 % (2959300)% WARNING: option uhcvi not known.
% 0.09/0.44 % (2959302) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2959291-2959302"...
% 0.09/0.44 % (2959302)...printing done.
% 0.09/0.44 % (2959302)Refutation found. Thanks to Tanya!
% 0.09/0.44 % SZS status Theorem for theBenchmark
% 0.09/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.44 % (2959302)------------------------------
% 0.09/0.44 % (2959302)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.44 % (2959302)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.44 % (2959302)CaDiCaL version: 2.1.3
% 0.09/0.44 % (2959302)Termination reason: Refutation
% 0.09/0.44 % (2959302)Time elapsed: 0.004 s
% 0.09/0.44 % (2959302)Peak memory usage: 12 MB
% 0.09/0.44 % (2959302)Instructions burned: 11 (million)
% 0.09/0.44 % (2959291)Success in time 0.021 s
% 0.09/0.44 % Vampire exiting
%------------------------------------------------------------------------------