%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KLE026+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 : n015.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:41 AM UTC 2026
% Result : Theorem 0.15s 0.46s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 43 ( 28 unt; 0 def)
% Number of atoms : 68 ( 37 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 42 ( 17 ~; 7 |; 10 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 56 ( 49 !; 7 ?)
% 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(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
fof(f7,axiom,
! [X0] : multiplication(one,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
fof(f9,axiom,
! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).
fof(f12,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',order) ).
fof(f13,axiom,
! [X0] :
( test(X0)
<=> ? [X1] : complement(X1,X0) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/KLE001+1.ax',test_2) ).
fof(f17,conjecture,
! [X0,X1,X2] :
( ( test(X1)
& test(X2) )
=> ( multiplication(X1,X0) = multiplication(multiplication(X1,X0),X2)
=> leq(multiplication(X1,X0),multiplication(X0,X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f18,negated_conjecture,
~ ! [X0,X1,X2] :
( ( test(X1)
& test(X2) )
=> ( multiplication(X1,X0) = multiplication(multiplication(X1,X0),X2)
=> leq(multiplication(X1,X0),multiplication(X0,X2)) ) ),
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f19,plain,
! [X0,X1] :
( addition(X0,X1) = X1
=> leq(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f12]) ).
fof(f20,plain,
! [X0,X1] :
( leq(X0,X1)
| addition(X0,X1) != X1 ),
inference(ennf_transformation,[],[f19]) ).
fof(f23,plain,
? [X0,X1,X2] :
( ~ leq(multiplication(X1,X0),multiplication(X0,X2))
& multiplication(X1,X0) = multiplication(multiplication(X1,X0),X2)
& test(X1)
& test(X2) ),
inference(ennf_transformation,[],[f18]) ).
fof(f24,plain,
? [X0,X1,X2] :
( ~ leq(multiplication(X1,X0),multiplication(X0,X2))
& multiplication(X1,X0) = multiplication(multiplication(X1,X0),X2)
& test(X1)
& test(X2) ),
inference(flattening,[],[f23]) ).
fof(f25,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f26,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f2]) ).
fof(f28,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f31,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f33,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f36,plain,
! [X0,X1] :
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f38,plain,
! [X0] :
( complement(sK0(X0),X0)
| ~ test(X0) ),
inference(cnf_transformation,[],[f13]) ).
fof(f39,plain,
! [X0,X1] :
( ~ complement(X1,X0)
| addition(X0,X1) = one ),
inference(cnf_transformation,[],[f14]) ).
fof(f47,plain,
test(sK2),
inference(cnf_transformation,[],[f24]) ).
fof(f48,plain,
multiplication(sK2,sK1) = multiplication(multiplication(sK2,sK1),sK3),
inference(cnf_transformation,[],[f24]) ).
fof(f49,plain,
~ leq(multiplication(sK2,sK1),multiplication(sK1,sK3)),
inference(cnf_transformation,[],[f24]) ).
fof(f51,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| addition(X0,X1) != X1 ),
inference(consistent_polarity_flipping,[],[f36]) ).
fof(f52,plain,
! [X0] :
( complement(sK0(X0),X0)
| test(X0) ),
inference(consistent_polarity_flipping,[],[f38]) ).
fof(f57,plain,
leq(multiplication(sK2,sK1),multiplication(sK1,sK3)),
inference(consistent_polarity_flipping,[],[f49]) ).
fof(f58,plain,
~ test(sK2),
inference(consistent_polarity_flipping,[],[f47]) ).
fof(f70,plain,
! [X0] :
( test(X0)
| one = addition(X0,sK0(X0)) ),
inference(resolution,[],[f39,f52]) ).
fof(f77,plain,
multiplication(sK1,sK3) != addition(multiplication(sK2,sK1),multiplication(sK1,sK3)),
inference(resolution,[],[f51,f57]) ).
fof(f82,plain,
! [X0,X1] : addition(X0,X1) = addition(X0,addition(X0,X1)),
inference(superposition,[],[f26,f28]) ).
fof(f157,plain,
! [X0] : multiplication(addition(multiplication(sK2,sK1),X0),sK3) = addition(multiplication(sK2,sK1),multiplication(X0,sK3)),
inference(superposition,[],[f33,f48]) ).
fof(f159,plain,
! [X0,X1] : multiplication(addition(one,X1),X0) = addition(X0,multiplication(X1,X0)),
inference(superposition,[],[f33,f31]) ).
fof(f260,plain,
multiplication(sK1,sK3) != multiplication(addition(multiplication(sK2,sK1),sK1),sK3),
inference(superposition,[],[f77,f157]) ).
fof(f266,plain,
multiplication(sK1,sK3) != multiplication(addition(sK1,multiplication(sK2,sK1)),sK3),
inference(forward_demodulation,[],[f260,f25]) ).
fof(f335,plain,
one = addition(sK2,sK0(sK2)),
inference(resolution,[],[f70,f58]) ).
fof(f371,plain,
one = addition(sK2,one),
inference(superposition,[],[f82,f335]) ).
fof(f383,plain,
one = addition(one,sK2),
inference(superposition,[],[f371,f25]) ).
fof(f818,plain,
multiplication(sK1,sK3) != multiplication(multiplication(addition(one,sK2),sK1),sK3),
inference(superposition,[],[f266,f159]) ).
fof(f819,plain,
multiplication(sK1,sK3) != multiplication(multiplication(one,sK1),sK3),
inference(forward_demodulation,[],[f818,f383]) ).
fof(f835,plain,
multiplication(sK1,sK3) != multiplication(sK1,sK3),
inference(forward_demodulation,[],[f819,f31]) ).
fof(f836,plain,
$false,
inference(trivial_inequality_removal,[],[f835]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE026+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.11/0.36 % Computer : n015.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.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Sun Sep 27 13:07:00 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/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.15/0.46 % (1649703)Will run a generic schedule for satisfiability detection.
% 0.15/0.46 % (1649710)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1199248427:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.15/0.46 % (1649709)% WARNING: option uhcvi not known.
% 0.15/0.46 % (1649708)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1299560905_2999 on theBenchmark for (2999ds/0Mi)
% 0.15/0.46 % (1649713)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=651881212:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.15/0.46 % (1649709)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3582186386:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/0.46 % (1649711)dis+10_1_sil=32000:sp=arity:random_seed=1380519184:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.15/0.46 % (1649712)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1264435393:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/0.46 % (1649714)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3130230013:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.15/0.46 % TRYING [1]
% 0.15/0.46 % TRYING [2]
% 0.15/0.46 % TRYING [3]
% 0.15/0.46 % TRYING [4]
% 0.15/0.46 % (1649709) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1649703-1649709"...
% 0.15/0.46 % (1649709)...printing done.
% 0.15/0.46 % (1649709)Refutation found. Thanks to Tanya!
% 0.15/0.46 % SZS status Theorem for theBenchmark
% 0.15/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.46 % (1649709)------------------------------
% 0.15/0.46 % (1649709)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.46 % (1649709)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.46 % (1649709)CaDiCaL version: 2.1.3
% 0.15/0.46 % (1649709)Termination reason: Refutation
% 0.15/0.46 % (1649709)Time elapsed: 0.021 s
% 0.15/0.46 % (1649709)Peak memory usage: 12 MB
% 0.15/0.46 % (1649709)Instructions burned: 34 (million)
% 0.15/0.46 % (1649703)Success in time 0.058 s
% 0.15/0.46 % Vampire exiting
%------------------------------------------------------------------------------