%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KLE025+2 : 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 : n012.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.07s 0.36s
% Output : Refutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 22 unt; 0 def)
% Number of atoms : 59 ( 37 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 37 ( 12 ~; 7 |; 10 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 49 ( 43 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(f3,axiom,
! [X0] : addition(X0,zero) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(f5,axiom,
! [X0,X1,X2] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_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(f19,conjecture,
! [X0,X1,X2] :
( ( test(X1)
& test(X2) )
=> ( multiplication(multiplication(X1,X0),c(X2)) = zero
=> multiplication(X1,X0) = multiplication(multiplication(X1,X0),X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f20,negated_conjecture,
~ ! [X0,X1,X2] :
( ( test(X1)
& test(X2) )
=> ( multiplication(multiplication(X1,X0),c(X2)) = zero
=> multiplication(X1,X0) = multiplication(multiplication(X1,X0),X2) ) ),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f21,plain,
! [X0,X1] :
( ( c(X0) = X1
<=> complement(X0,X1) )
| ~ test(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f27,plain,
? [X0,X1,X2] :
( multiplication(X1,X0) != multiplication(multiplication(X1,X0),X2)
& multiplication(multiplication(X1,X0),c(X2)) = zero
& test(X1)
& test(X2) ),
inference(ennf_transformation,[],[f20]) ).
fof(f28,plain,
? [X0,X1,X2] :
( multiplication(X1,X0) != multiplication(multiplication(X1,X0),X2)
& multiplication(multiplication(X1,X0),c(X2)) = zero
& test(X1)
& test(X2) ),
inference(flattening,[],[f27]) ).
fof(f29,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f31,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f33,plain,
! [X2,X0,X1] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
inference(cnf_transformation,[],[f5]) ).
fof(f34,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f36,plain,
! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
inference(cnf_transformation,[],[f8]) ).
fof(f42,plain,
! [X0,X1] :
( ~ complement(X1,X0)
| addition(X0,X1) = one ),
inference(cnf_transformation,[],[f14]) ).
fof(f47,plain,
! [X0,X1] :
( ~ test(X0)
| complement(X0,X1)
| c(X0) != X1 ),
inference(cnf_transformation,[],[f21]) ).
fof(f51,plain,
test(sK3),
inference(cnf_transformation,[],[f28]) ).
fof(f53,plain,
zero = multiplication(multiplication(sK2,sK1),c(sK3)),
inference(cnf_transformation,[],[f28]) ).
fof(f54,plain,
multiplication(sK2,sK1) != multiplication(multiplication(sK2,sK1),sK3),
inference(cnf_transformation,[],[f28]) ).
fof(f55,plain,
! [X0] :
( complement(X0,c(X0))
| ~ test(X0) ),
inference(equality_resolution,[],[f47]) ).
fof(f67,plain,
! [X0] :
( one = addition(c(X0),X0)
| ~ test(X0) ),
inference(resolution,[],[f42,f55]) ).
fof(f68,plain,
! [X0] :
( ~ test(X0)
| one = addition(X0,c(X0)) ),
inference(forward_demodulation,[],[f67,f29]) ).
fof(f108,plain,
multiplication(sK2,sK1) != multiplication(sK2,multiplication(sK1,sK3)),
inference(superposition,[],[f54,f33]) ).
fof(f132,plain,
! [X0] : multiplication(multiplication(sK2,sK1),addition(X0,c(sK3))) = addition(multiplication(multiplication(sK2,sK1),X0),zero),
inference(superposition,[],[f36,f53]) ).
fof(f146,plain,
! [X0] : multiplication(multiplication(sK2,sK1),X0) = multiplication(multiplication(sK2,sK1),addition(X0,c(sK3))),
inference(forward_demodulation,[],[f132,f31]) ).
fof(f157,plain,
! [X0] : multiplication(multiplication(sK2,sK1),X0) = multiplication(sK2,multiplication(sK1,addition(X0,c(sK3)))),
inference(forward_demodulation,[],[f146,f33]) ).
fof(f163,plain,
! [X0] : multiplication(sK2,multiplication(sK1,addition(X0,c(sK3)))) = multiplication(sK2,multiplication(sK1,X0)),
inference(forward_demodulation,[],[f157,f33]) ).
fof(f559,plain,
one = addition(sK3,c(sK3)),
inference(resolution,[],[f68,f51]) ).
fof(f623,plain,
multiplication(sK2,multiplication(sK1,sK3)) = multiplication(sK2,multiplication(sK1,one)),
inference(superposition,[],[f163,f559]) ).
fof(f625,plain,
multiplication(sK2,sK1) = multiplication(sK2,multiplication(sK1,sK3)),
inference(forward_demodulation,[],[f623,f34]) ).
fof(f626,plain,
$false,
inference(forward_subsumption_resolution,[],[f625,f108]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : KLE025+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.05/0.30 % Computer : n012.cluster.edu
% 0.05/0.30 % Model : x86_64 x86_64
% 0.05/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.30 % Memory : 8046.5625MB
% 0.05/0.30 % OS : Linux 6.8.0-71-generic
% 0.05/0.30 % CPULimit : 300
% 0.05/0.30 % WCLimit : 300
% 0.05/0.30 % DateTime : Sun Sep 27 13:03:05 UTC 2026
% 0.05/0.30 % CPUTime :
% 0.05/0.30 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.05/0.32 Running first-order model finding
% 0.05/0.32 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.07/0.36 % (2372800)Will run a generic schedule for satisfiability detection.
% 0.07/0.36 % (2372806)% WARNING: option uhcvi not known.
% 0.07/0.36 % (2372805)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1046685310_2999 on theBenchmark for (2999ds/0Mi)
% 0.07/0.36 % (2372806)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2044085481:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.07/0.36 % (2372807)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=62782779:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.07/0.36 % (2372808)dis+10_1_sil=32000:sp=arity:random_seed=1772844629:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.07/0.36 % (2372809)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1084279811:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.07/0.36 % (2372810)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=682798670:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.07/0.36 % (2372811)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2555936898:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.07/0.36 % TRYING [1]
% 0.07/0.36 % TRYING [2]
% 0.07/0.36 % TRYING [3]
% 0.07/0.36 % TRYING [4]
% 0.07/0.36 % (2372809) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2372800-2372809"...
% 0.07/0.36 % (2372809)...printing done.
% 0.07/0.36 % (2372809)Refutation found. Thanks to Tanya!
% 0.07/0.36 % SZS status Theorem for theBenchmark
% 0.07/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.37 % (2372809)------------------------------
% 0.07/0.37 % (2372809)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.37 % (2372809)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.37 % (2372809)CaDiCaL version: 2.1.3
% 0.07/0.37 % (2372809)Termination reason: Refutation
% 0.07/0.37 % (2372809)Time elapsed: 0.009 s
% 0.07/0.37 % (2372809)Peak memory usage: 12 MB
% 0.07/0.37 % (2372809)Instructions burned: 25 (million)
% 0.07/0.37 % (2372800)Success in time 0.039 s
% 0.07/0.37 % Vampire exiting
%------------------------------------------------------------------------------