%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KLE009+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/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:36 AM UTC 2026
% Result : Theorem 0.12s 0.44s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 35 ( 22 unt; 0 def)
% Number of atoms : 57 ( 30 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 39 ( 17 ~; 8 |; 8 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 6 ( 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 : 40 ( 36 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(f2,axiom,
! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_associativity) ).
fof(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/Axioms/KLE001+1.ax',test_2) ).
fof(f15,axiom,
! [X0,X1] :
( test(X0)
=> ( c(X0) = X1
<=> complement(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_3) ).
fof(f17,conjecture,
! [X0,X1] :
( ( test(X1)
& test(X0) )
=> one = addition(addition(addition(multiplication(X0,X1),multiplication(X0,c(X1))),multiplication(c(X0),X1)),multiplication(c(X0),c(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f18,negated_conjecture,
~ ! [X0,X1] :
( ( test(X1)
& test(X0) )
=> one = addition(addition(addition(multiplication(X0,X1),multiplication(X0,c(X1))),multiplication(c(X0),X1)),multiplication(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(addition(addition(multiplication(X0,X1),multiplication(X0,c(X1))),multiplication(c(X0),X1)),multiplication(c(X0),c(X1)))
& test(X1)
& test(X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f22,plain,
? [X0,X1] :
( one != addition(addition(addition(multiplication(X0,X1),multiplication(X0,c(X1))),multiplication(c(X0),X1)),multiplication(c(X0),c(X1)))
& test(X1)
& test(X0) ),
inference(flattening,[],[f21]) ).
fof(f23,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f24,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f2]) ).
fof(f28,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f30,plain,
! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
inference(cnf_transformation,[],[f8]) ).
fof(f36,plain,
! [X0,X1] :
( ~ complement(X1,X0)
| addition(X0,X1) = one ),
inference(cnf_transformation,[],[f14]) ).
fof(f41,plain,
! [X0,X1] :
( ~ test(X0)
| complement(X0,X1)
| c(X0) != X1 ),
inference(cnf_transformation,[],[f19]) ).
fof(f43,plain,
test(sK1),
inference(cnf_transformation,[],[f22]) ).
fof(f44,plain,
test(sK2),
inference(cnf_transformation,[],[f22]) ).
fof(f45,plain,
one != addition(addition(addition(multiplication(sK1,sK2),multiplication(sK1,c(sK2))),multiplication(c(sK1),sK2)),multiplication(c(sK1),c(sK2))),
inference(cnf_transformation,[],[f22]) ).
fof(f46,plain,
! [X0] :
( ~ test(X0)
| complement(X0,c(X0)) ),
inference(equality_resolution,[],[f41]) ).
fof(f49,plain,
! [X0] :
( complement(X0,c(X0))
| test(X0) ),
inference(consistent_polarity_flipping,[],[f46]) ).
fof(f52,plain,
~ test(sK2),
inference(consistent_polarity_flipping,[],[f44]) ).
fof(f53,plain,
~ test(sK1),
inference(consistent_polarity_flipping,[],[f43]) ).
fof(f69,plain,
! [X0] :
( one = addition(c(X0),X0)
| test(X0) ),
inference(resolution,[],[f36,f49]) ).
fof(f70,plain,
! [X0] :
( test(X0)
| one = addition(X0,c(X0)) ),
inference(forward_demodulation,[],[f69,f23]) ).
fof(f92,plain,
one != addition(addition(multiplication(sK1,sK2),multiplication(sK1,c(sK2))),addition(multiplication(c(sK1),sK2),multiplication(c(sK1),c(sK2)))),
inference(superposition,[],[f45,f24]) ).
fof(f194,plain,
one != addition(addition(multiplication(sK1,sK2),multiplication(sK1,c(sK2))),multiplication(c(sK1),addition(sK2,c(sK2)))),
inference(forward_demodulation,[],[f92,f30]) ).
fof(f195,plain,
one != addition(multiplication(sK1,addition(sK2,c(sK2))),multiplication(c(sK1),addition(sK2,c(sK2)))),
inference(forward_demodulation,[],[f194,f30]) ).
fof(f211,plain,
one = addition(sK1,c(sK1)),
inference(resolution,[],[f70,f53]) ).
fof(f212,plain,
one = addition(sK2,c(sK2)),
inference(resolution,[],[f70,f52]) ).
fof(f232,plain,
one != addition(multiplication(sK1,one),multiplication(c(sK1),one)),
inference(superposition,[],[f195,f212]) ).
fof(f236,plain,
one != addition(multiplication(sK1,one),c(sK1)),
inference(forward_demodulation,[],[f232,f28]) ).
fof(f238,plain,
one != addition(sK1,c(sK1)),
inference(forward_demodulation,[],[f236,f28]) ).
fof(f239,plain,
$false,
inference(forward_subsumption_resolution,[],[f238,f211]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KLE009+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.35 % Computer : n011.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Sun Sep 27 12:58:30 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.39 Running first-order model finding
% 0.12/0.39 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.44 % (2381942)Will run a generic schedule for satisfiability detection.
% 0.12/0.44 % (2381952)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2999989922:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.12/0.44 % (2381948)% WARNING: option uhcvi not known.
% 0.12/0.44 % (2381947)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2614320209_2999 on theBenchmark for (2999ds/0Mi)
% 0.12/0.44 % (2381950)dis+10_1_sil=32000:sp=arity:random_seed=1491806391:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.12/0.44 % (2381948)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2646109754:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.12/0.44 % (2381953)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2009912700:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.12/0.44 % (2381949)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2065735226:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.12/0.44 % TRYING [1]
% 0.12/0.44 % TRYING [2]
% 0.12/0.44 % (2381951)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3522273194:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.12/0.44 % TRYING [3]
% 0.12/0.44 % (2381948) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2381942-2381948"...
% 0.12/0.44 % TRYING [4]
% 0.12/0.44 % (2381948)...printing done.
% 0.12/0.44 % (2381951) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2381942-2381951"...
% 0.12/0.44 % (2381948)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 % (2381948)------------------------------
% 0.12/0.44 % (2381948)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.44 % (2381948)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.44 % (2381948)CaDiCaL version: 2.1.3
% 0.12/0.44 % (2381948)Termination reason: Refutation
% 0.12/0.44 % (2381948)Time elapsed: 0.009 s
% 0.12/0.44 % (2381948)Peak memory usage: 12 MB
% 0.12/0.44 % (2381948)Instructions burned: 12 (million)
% 0.12/0.44 % (2381942)Success in time 0.044 s
% 0.12/0.45 % Vampire exiting
%------------------------------------------------------------------------------