%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KLE006+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 : n018.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.12s 0.44s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 8 unt; 0 def)
% Number of atoms : 54 ( 31 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 53 ( 20 ~; 16 |; 11 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 24 ( 23 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
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] :
( test(X0)
=> one = addition(X0,c(X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f18,negated_conjecture,
~ ! [X0] :
( test(X0)
=> one = addition(X0,c(X0)) ),
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] :
( one != addition(X0,c(X0))
& test(X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f25,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(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(flattening,[],[f25]) ).
fof(f27,plain,
! [X0,X1] :
( ( ( c(X0) = X1
| ~ complement(X0,X1) )
& ( complement(X0,X1)
| c(X0) != X1 ) )
| ~ test(X0) ),
inference(nnf_transformation,[],[f19]) ).
fof(f28,plain,
( one != addition(sK1,c(sK1))
& test(sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X0,sK1)],[f21]) ).
fof(f29,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f42,plain,
! [X0,X1] :
( ~ complement(X1,X0)
| addition(X0,X1) = one ),
inference(cnf_transformation,[],[f26]) ).
fof(f46,plain,
! [X0,X1] :
( ~ test(X0)
| c(X0) != X1
| complement(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f49,plain,
test(sK1),
inference(cnf_transformation,[],[f28]) ).
fof(f50,plain,
one != addition(sK1,c(sK1)),
inference(cnf_transformation,[],[f28]) ).
fof(f61,plain,
! [X0] :
( c(sK1) != X0
| complement(sK1,X0) ),
inference(resolution,[],[f46,f49]) ).
fof(f63,plain,
complement(sK1,c(sK1)),
inference(equality_resolution,[],[f61]) ).
fof(f68,plain,
one = addition(c(sK1),sK1),
inference(resolution,[],[f63,f42]) ).
fof(f70,plain,
one = addition(sK1,c(sK1)),
inference(forward_demodulation,[],[f68,f29]) ).
fof(f71,plain,
$false,
inference(forward_subsumption_resolution,[],[f70,f50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE006+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.12/0.36 % Computer : n018.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Sun Sep 27 13:00:08 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.40 Running first-order model finding
% 0.12/0.40 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.12/0.44 % (2333516)Will run a generic schedule for satisfiability detection.
% 0.12/0.44 % (2333526)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1093076927:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.12/0.44 % (2333526) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2333516-2333526"...
% 0.12/0.44 % (2333526)...printing done.
% 0.12/0.44 % (2333522)% WARNING: option uhcvi not known.
% 0.12/0.44 % (2333526)Refutation found. Thanks to Tanya!
% 0.12/0.44 % SZS status Theorem for theBenchmark
% 0.12/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.44 % (2333526)------------------------------
% 0.12/0.44 % (2333526)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.44 % (2333526)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.44 % (2333526)CaDiCaL version: 2.1.3
% 0.12/0.44 % (2333526)Termination reason: Refutation
% 0.12/0.44 % (2333526)Time elapsed: 0.002 s
% 0.12/0.44 % (2333526)Peak memory usage: 12 MB
% 0.12/0.44 % (2333526)Instructions burned: 3 (million)
% 0.12/0.44 % (2333516)Success in time 0.033 s
% 0.12/0.44 % Vampire exiting
%------------------------------------------------------------------------------