%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KLE004+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 : n020.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:34 AM UTC 2026
% Result : Theorem 0.11s 0.45s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 40 ( 18 unt; 0 def)
% Number of atoms : 96 ( 51 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 99 ( 43 ~; 39 |; 12 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 47 ( 44 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(f3,axiom,
! [X0] : addition(X0,zero) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(f10,axiom,
! [X0] : multiplication(X0,zero) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',right_annihilation) ).
fof(f11,axiom,
! [X0] : multiplication(zero,X0) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',left_annihilation) ).
fof(f13,axiom,
! [X0] :
( test(X0)
<=> ? [X1] : complement(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_1) ).
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,
c(zero) = one,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f18,negated_conjecture,
c(zero) != one,
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f19,plain,
one != c(zero),
inference(flattening,[],[f18]) ).
fof(f20,plain,
! [X0,X1] :
( ( c(X0) = X1
<=> complement(X0,X1) )
| ~ test(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f22,plain,
! [X0] :
( ( test(X0)
| ! [X1] : ~ complement(X1,X0) )
& ( ? [X1] : complement(X1,X0)
| ~ test(X0) ) ),
inference(nnf_transformation,[],[f13]) ).
fof(f23,plain,
! [X0] :
( ( test(X0)
| ! [X1] : ~ complement(X1,X0) )
& ( ? [X2] : complement(X2,X0)
| ~ test(X0) ) ),
inference(rectify,[],[f22]) ).
fof(f24,plain,
! [X0] :
( ( test(X0)
| ! [X1] : ~ complement(X1,X0) )
& ( complement(sK0(X0),X0)
| ~ test(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0))],[f23]) ).
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,[],[f20]) ).
fof(f28,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f30,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f37,plain,
! [X0] : zero = multiplication(X0,zero),
inference(cnf_transformation,[],[f10]) ).
fof(f38,plain,
! [X0] : zero = multiplication(zero,X0),
inference(cnf_transformation,[],[f11]) ).
fof(f40,plain,
! [X0,X1] :
( ~ complement(X1,X0)
| test(X0) ),
inference(cnf_transformation,[],[f24]) ).
fof(f44,plain,
! [X0,X1] :
( zero != multiplication(X1,X0)
| zero != multiplication(X0,X1)
| complement(X1,X0)
| addition(X0,X1) != one ),
inference(cnf_transformation,[],[f26]) ).
fof(f46,plain,
! [X0,X1] :
( ~ complement(X0,X1)
| c(X0) = X1
| ~ test(X0) ),
inference(cnf_transformation,[],[f27]) ).
fof(f48,plain,
one != c(zero),
inference(cnf_transformation,[],[f19]) ).
fof(f52,plain,
! [X0] : addition(zero,X0) = X0,
inference(superposition,[],[f28,f30]) ).
fof(f172,plain,
! [X0] :
( zero != zero
| zero != multiplication(zero,X0)
| complement(X0,zero)
| one != addition(zero,X0) ),
inference(superposition,[],[f44,f37]) ).
fof(f173,plain,
! [X0] :
( zero != zero
| zero != multiplication(X0,zero)
| complement(zero,X0)
| addition(X0,zero) != one ),
inference(superposition,[],[f44,f38]) ).
fof(f176,plain,
! [X0] :
( zero != multiplication(X0,zero)
| complement(zero,X0)
| addition(X0,zero) != one ),
inference(trivial_inequality_removal,[],[f173]) ).
fof(f177,plain,
! [X0] :
( zero != multiplication(zero,X0)
| complement(X0,zero)
| one != addition(zero,X0) ),
inference(trivial_inequality_removal,[],[f172]) ).
fof(f180,plain,
! [X0] :
( complement(zero,X0)
| addition(X0,zero) != one ),
inference(forward_subsumption_resolution,[],[f176,f37]) ).
fof(f181,plain,
! [X0] :
( complement(X0,zero)
| one != addition(zero,X0) ),
inference(forward_subsumption_resolution,[],[f177,f38]) ).
fof(f184,plain,
! [X0] :
( one != X0
| complement(zero,X0) ),
inference(forward_demodulation,[],[f180,f30]) ).
fof(f185,plain,
! [X0] :
( one != X0
| complement(X0,zero) ),
inference(forward_demodulation,[],[f181,f52]) ).
fof(f186,plain,
complement(zero,one),
inference(equality_resolution,[],[f184]) ).
fof(f187,plain,
complement(one,zero),
inference(equality_resolution,[],[f185]) ).
fof(f188,plain,
( one = c(zero)
| ~ test(zero) ),
inference(resolution,[],[f186,f46]) ).
fof(f193,plain,
~ test(zero),
inference(forward_subsumption_resolution,[],[f188,f48]) ).
fof(f280,plain,
test(zero),
inference(resolution,[],[f187,f40]) ).
fof(f281,plain,
$false,
inference(forward_subsumption_resolution,[],[f280,f193]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE004+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.36 % Computer : n020.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 12:58:50 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40 Running first-order model finding
% 0.11/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.11/0.45 % (3364636)Will run a generic schedule for satisfiability detection.
% 0.11/0.45 % (3364641)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=552530493_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.45 % TRYING [1]
% 0.11/0.45 % TRYING [2]
% 0.11/0.45 % TRYING [3]
% 0.11/0.45 % TRYING [4]
% 0.11/0.45 % (3364642)% WARNING: option uhcvi not known.
% 0.11/0.45 % (3364647)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=776205470:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.45 % (3364643)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3787299239:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.45 % (3364644)dis+10_1_sil=32000:sp=arity:random_seed=1128447599:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.45 % (3364645)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=795782805:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.45 % (3364646)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3573665097:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.45 % (3364642)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1063361967:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.45 % TRYING [5]
% 0.11/0.45 % (3364644) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3364636-3364644"...
% 0.11/0.45 % (3364644)...printing done.
% 0.11/0.45 % (3364644)Refutation found. Thanks to Tanya!
% 0.11/0.45 % SZS status Theorem for theBenchmark
% 0.11/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.45 % (3364644)------------------------------
% 0.11/0.45 % (3364644)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.45 % (3364644)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.45 % (3364644)CaDiCaL version: 2.1.3
% 0.11/0.45 % (3364644)Termination reason: Refutation
% 0.11/0.45 % (3364644)Time elapsed: 0.008 s
% 0.11/0.45 % (3364644)Peak memory usage: 12 MB
% 0.11/0.45 % (3364644)Instructions burned: 11 (million)
% 0.11/0.45 % (3364636)Success in time 0.044 s
% 0.11/0.45 % Vampire exiting
%------------------------------------------------------------------------------