%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KLE035+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 : 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:43 AM UTC 2026
% Result : Theorem 0.15s 0.47s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 37 ( 27 unt; 0 def)
% Number of atoms : 64 ( 22 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 43 ( 16 ~; 5 |; 19 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 48 ( 40 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] : addition(X0,zero) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
fof(f5,axiom,
! [X0,X1,X2] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_associativity) ).
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(f9,axiom,
! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).
fof(f12,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',order) ).
fof(f17,conjecture,
! [X0,X1,X2,X3] :
( ( test(X3)
& test(X2)
& leq(multiplication(multiplication(X2,X0),c(X3)),zero)
& leq(multiplication(multiplication(X2,X1),c(X3)),zero) )
=> leq(multiplication(multiplication(X2,addition(X0,X1)),c(X3)),zero) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f18,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ( test(X3)
& test(X2)
& leq(multiplication(multiplication(X2,X0),c(X3)),zero)
& leq(multiplication(multiplication(X2,X1),c(X3)),zero) )
=> leq(multiplication(multiplication(X2,addition(X0,X1)),c(X3)),zero) ),
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f21,plain,
? [X0,X1,X2,X3] :
( ~ leq(multiplication(multiplication(X2,addition(X0,X1)),c(X3)),zero)
& test(X3)
& test(X2)
& leq(multiplication(multiplication(X2,X0),c(X3)),zero)
& leq(multiplication(multiplication(X2,X1),c(X3)),zero) ),
inference(ennf_transformation,[],[f18]) ).
fof(f22,plain,
? [X0,X1,X2,X3] :
( ~ leq(multiplication(multiplication(X2,addition(X0,X1)),c(X3)),zero)
& test(X3)
& test(X2)
& leq(multiplication(multiplication(X2,X0),c(X3)),zero)
& leq(multiplication(multiplication(X2,X1),c(X3)),zero) ),
inference(flattening,[],[f21]) ).
fof(f23,plain,
! [X0,X1] :
( ( leq(X0,X1)
| addition(X0,X1) != X1 )
& ( addition(X0,X1) = X1
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f12]) ).
fof(f30,plain,
( ~ leq(multiplication(multiplication(sK3,addition(sK1,sK2)),c(sK4)),zero)
& test(sK4)
& test(sK3)
& leq(multiplication(multiplication(sK3,sK1),c(sK4)),zero)
& leq(multiplication(multiplication(sK3,sK2),c(sK4)),zero) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4]),skolemize(X0,sK1),skolemize(X1,sK2),skolemize(X2,sK3),skolemize(X3,sK4)],[f22]) ).
fof(f33,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f34,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f35,plain,
! [X2,X0,X1] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
inference(cnf_transformation,[],[f5]) ).
fof(f38,plain,
! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
inference(cnf_transformation,[],[f8]) ).
fof(f39,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f42,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| addition(X0,X1) = X1 ),
inference(cnf_transformation,[],[f23]) ).
fof(f43,plain,
! [X0,X1] :
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f53,plain,
leq(multiplication(multiplication(sK3,sK2),c(sK4)),zero),
inference(cnf_transformation,[],[f30]) ).
fof(f54,plain,
leq(multiplication(multiplication(sK3,sK1),c(sK4)),zero),
inference(cnf_transformation,[],[f30]) ).
fof(f57,plain,
~ leq(multiplication(multiplication(sK3,addition(sK1,sK2)),c(sK4)),zero),
inference(cnf_transformation,[],[f30]) ).
fof(f67,plain,
zero = addition(multiplication(multiplication(sK3,sK2),c(sK4)),zero),
inference(resolution,[],[f42,f53]) ).
fof(f68,plain,
zero = addition(multiplication(multiplication(sK3,sK1),c(sK4)),zero),
inference(resolution,[],[f42,f54]) ).
fof(f69,plain,
zero = multiplication(multiplication(sK3,sK1),c(sK4)),
inference(forward_demodulation,[],[f68,f33]) ).
fof(f70,plain,
zero = multiplication(multiplication(sK3,sK2),c(sK4)),
inference(forward_demodulation,[],[f67,f33]) ).
fof(f71,plain,
zero = multiplication(sK3,multiplication(sK1,c(sK4))),
inference(forward_demodulation,[],[f69,f35]) ).
fof(f72,plain,
zero = multiplication(sK3,multiplication(sK2,c(sK4))),
inference(forward_demodulation,[],[f70,f35]) ).
fof(f74,plain,
! [X0] :
( X0 != X0
| leq(X0,X0) ),
inference(superposition,[],[f43,f34]) ).
fof(f77,plain,
! [X0] : leq(X0,X0),
inference(trivial_inequality_removal,[],[f74]) ).
fof(f141,plain,
~ leq(multiplication(sK3,multiplication(addition(sK1,sK2),c(sK4))),zero),
inference(superposition,[],[f57,f35]) ).
fof(f145,plain,
~ leq(multiplication(sK3,addition(multiplication(sK1,c(sK4)),multiplication(sK2,c(sK4)))),zero),
inference(forward_demodulation,[],[f141,f39]) ).
fof(f156,plain,
~ leq(addition(multiplication(sK3,multiplication(sK1,c(sK4))),multiplication(sK3,multiplication(sK2,c(sK4)))),zero),
inference(forward_demodulation,[],[f145,f38]) ).
fof(f160,plain,
~ leq(addition(multiplication(sK3,multiplication(sK1,c(sK4))),zero),zero),
inference(forward_demodulation,[],[f156,f72]) ).
fof(f161,plain,
~ leq(multiplication(sK3,multiplication(sK1,c(sK4))),zero),
inference(forward_demodulation,[],[f160,f33]) ).
fof(f162,plain,
~ leq(zero,zero),
inference(forward_demodulation,[],[f161,f71]) ).
fof(f163,plain,
$false,
inference(forward_subsumption_resolution,[],[f162,f77]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KLE035+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.11/0.38 % Computer : n011.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 13:04:00 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/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.15/0.47 % (2384067)Will run a generic schedule for satisfiability detection.
% 0.15/0.47 % (2384074)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2325131775:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.15/0.47 % (2384073)% WARNING: option uhcvi not known.
% 0.15/0.47 % (2384075)dis+10_1_sil=32000:sp=arity:random_seed=774026226:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.15/0.47 % (2384072)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3730460082_2999 on theBenchmark for (2999ds/0Mi)
% 0.15/0.47 % (2384073)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=434096505:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/0.47 % (2384077)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2751146131:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.15/0.47 % (2384076)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=797521978:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/0.47 % (2384078)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1848985109:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.15/0.47 % TRYING [1]
% 0.15/0.47 % TRYING [2]
% 0.15/0.47 % TRYING [3]
% 0.15/0.47 % (2384077) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2384067-2384077"...
% 0.15/0.47 % (2384077)...printing done.
% 0.15/0.47 % (2384077)Refutation found. Thanks to Tanya!
% 0.15/0.47 % SZS status Theorem for theBenchmark
% 0.15/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.47 % (2384077)------------------------------
% 0.15/0.47 % (2384077)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.47 % (2384077)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.47 % (2384077)CaDiCaL version: 2.1.3
% 0.15/0.47 % (2384077)Termination reason: Refutation
% 0.15/0.47 % (2384077)Time elapsed: 0.005 s
% 0.15/0.47 % (2384077)Peak memory usage: 12 MB
% 0.15/0.47 % (2384077)Instructions burned: 6 (million)
% 0.15/0.47 % (2384067)Success in time 0.043 s
% 0.15/0.47 % Vampire exiting
%------------------------------------------------------------------------------