%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KLE065+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 : n016.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:48 AM UTC 2026
% Result : Theorem 0.57s 0.51s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 21 ( 18 unt; 0 def)
% Number of atoms : 24 ( 23 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 3 ~; 0 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 18 ( 16 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] : addition(X0,zero) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(f11,axiom,
! [X0] : multiplication(zero,X0) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',left_annihilation) ).
fof(f13,axiom,
! [X0] : addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain1) ).
fof(f14,axiom,
! [X0,X1] : domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain2) ).
fof(f16,axiom,
domain(zero) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain4) ).
fof(f18,conjecture,
! [X0,X1] :
( multiplication(X0,X1) = zero
=> multiplication(X0,domain(X1)) = zero ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f19,negated_conjecture,
~ ! [X0,X1] :
( multiplication(X0,X1) = zero
=> multiplication(X0,domain(X1)) = zero ),
inference(negated_conjecture,[status(cth)],[f18]) ).
fof(f20,plain,
? [X0,X1] :
( zero != multiplication(X0,domain(X1))
& multiplication(X0,X1) = zero ),
inference(ennf_transformation,[],[f19]) ).
fof(f23,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f31,plain,
! [X0] : zero = multiplication(zero,X0),
inference(cnf_transformation,[],[f11]) ).
fof(f32,plain,
! [X0] : multiplication(domain(X0),X0) = addition(X0,multiplication(domain(X0),X0)),
inference(cnf_transformation,[],[f13]) ).
fof(f33,plain,
! [X0,X1] : domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))),
inference(cnf_transformation,[],[f14]) ).
fof(f35,plain,
zero = domain(zero),
inference(cnf_transformation,[],[f16]) ).
fof(f37,plain,
zero = multiplication(sK0,sK1),
inference(cnf_transformation,[],[f20]) ).
fof(f38,plain,
zero != multiplication(sK0,domain(sK1)),
inference(cnf_transformation,[],[f20]) ).
fof(f111,plain,
! [X0,X1] : multiplication(domain(multiplication(X0,X1)),multiplication(X0,domain(X1))) = addition(multiplication(X0,domain(X1)),multiplication(domain(multiplication(X0,X1)),multiplication(X0,domain(X1)))),
inference(superposition,[],[f32,f33]) ).
fof(f3613,plain,
multiplication(domain(zero),multiplication(sK0,domain(sK1))) = addition(multiplication(sK0,domain(sK1)),multiplication(domain(zero),multiplication(sK0,domain(sK1)))),
inference(superposition,[],[f111,f37]) ).
fof(f3667,plain,
multiplication(zero,multiplication(sK0,domain(sK1))) = addition(multiplication(sK0,domain(sK1)),multiplication(zero,multiplication(sK0,domain(sK1)))),
inference(forward_demodulation,[],[f3613,f35]) ).
fof(f3684,plain,
zero = addition(multiplication(sK0,domain(sK1)),zero),
inference(forward_demodulation,[],[f3667,f31]) ).
fof(f3708,plain,
zero = multiplication(sK0,domain(sK1)),
inference(superposition,[],[f23,f3684]) ).
fof(f3724,plain,
$false,
inference(forward_subsumption_resolution,[],[f3708,f38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE065+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.13/0.39 % Computer : n016.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Sun Sep 27 13:13:33 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.42 Running first-order model finding
% 0.13/0.42 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.57/0.51 % (2629436)Will run a generic schedule for satisfiability detection.
% 0.57/0.51 % (2629444)dis+10_1_sil=32000:sp=arity:random_seed=1576209022:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.57/0.51 % (2629446)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4087601715:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.57/0.51 % (2629445)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2135593750:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.57/0.51 % (2629441)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2413752363_2999 on theBenchmark for (2999ds/0Mi)
% 0.57/0.51 % (2629443)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=328294378:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.57/0.51 % (2629447)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4012323905:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.57/0.51 % (2629442)% WARNING: option uhcvi not known.
% 0.57/0.51 % TRYING [1]
% 0.57/0.51 % TRYING [2]
% 0.57/0.51 % TRYING [3]
% 0.57/0.51 % (2629442)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=684676069:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.57/0.51 % TRYING [4]
% 0.57/0.51 % TRYING [5]
% 0.57/0.51 % (2629442) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2629436-2629442"...
% 0.57/0.51 % (2629442)...printing done.
% 0.57/0.51 % (2629442)Refutation found. Thanks to Tanya!
% 0.57/0.51 % SZS status Theorem for theBenchmark
% 0.57/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.57/0.51 % (2629442)------------------------------
% 0.57/0.51 % (2629442)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.57/0.51 % (2629442)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.57/0.51 % (2629442)CaDiCaL version: 2.1.3
% 0.57/0.51 % (2629442)Termination reason: Refutation
% 0.57/0.51 % (2629442)Time elapsed: 0.047 s
% 0.57/0.51 % (2629442)Peak memory usage: 14 MB
% 0.57/0.51 % (2629442)Instructions burned: 148 (million)
% 0.57/0.51 % (2629436)Success in time 0.081 s
% 0.57/0.51 % Vampire exiting
%------------------------------------------------------------------------------