%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KLE086+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 : n009.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:50 AM UTC 2026
% Result : Theorem 0.12s 0.45s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 24 ( 24 unt; 0 def)
% Number of atoms : 24 ( 23 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 16 ( 16 !; 0 ?)
% 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(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
fof(f13,axiom,
! [X0] : multiplication(antidomain(X0),X0) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain1) ).
fof(f15,axiom,
! [X0] : addition(antidomain(antidomain(X0)),antidomain(X0)) = one,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain3) ).
fof(f16,axiom,
! [X0] : domain(X0) = antidomain(antidomain(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain4) ).
fof(f21,conjecture,
domain(zero) = zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f22,negated_conjecture,
domain(zero) != zero,
inference(negated_conjecture,[status(cth)],[f21]) ).
fof(f23,plain,
zero != domain(zero),
inference(flattening,[],[f22]) ).
fof(f24,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f26,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f29,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f35,plain,
! [X0] : zero = multiplication(antidomain(X0),X0),
inference(cnf_transformation,[],[f13]) ).
fof(f37,plain,
! [X0] : one = addition(antidomain(antidomain(X0)),antidomain(X0)),
inference(cnf_transformation,[],[f15]) ).
fof(f38,plain,
! [X0] : antidomain(antidomain(X0)) = domain(X0),
inference(cnf_transformation,[],[f16]) ).
fof(f43,plain,
zero != domain(zero),
inference(cnf_transformation,[],[f23]) ).
fof(f44,plain,
zero != antidomain(antidomain(zero)),
inference(definition_unfolding,[],[f43,f38]) ).
fof(f45,plain,
zero = antidomain(one),
inference(superposition,[],[f35,f29]) ).
fof(f51,plain,
! [X0] : addition(zero,X0) = X0,
inference(superposition,[],[f24,f26]) ).
fof(f59,plain,
! [X0] : one = addition(antidomain(X0),antidomain(antidomain(X0))),
inference(forward_demodulation,[],[f37,f24]) ).
fof(f61,plain,
one = addition(zero,antidomain(zero)),
inference(superposition,[],[f59,f45]) ).
fof(f62,plain,
one = antidomain(zero),
inference(forward_demodulation,[],[f61,f51]) ).
fof(f63,plain,
zero != antidomain(one),
inference(superposition,[],[f44,f62]) ).
fof(f67,plain,
$false,
inference(forward_subsumption_resolution,[],[f63,f45]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE086+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.12/0.38 % Computer : n009.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Sun Sep 27 13:09:30 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41 Running first-order model finding
% 0.12/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.12/0.45 % (2024225)Will run a generic schedule for satisfiability detection.
% 0.12/0.45 % (2024232)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=471720774:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.12/0.45 % (2024232) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2024225-2024232"...
% 0.12/0.45 % (2024232)...printing done.
% 0.12/0.45 % (2024232)Refutation found. Thanks to Tanya!
% 0.12/0.45 % SZS status Theorem for theBenchmark
% 0.12/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.45 % (2024232)------------------------------
% 0.12/0.45 % (2024232)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.45 % (2024232)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.45 % (2024232)CaDiCaL version: 2.1.3
% 0.12/0.45 % (2024232)Termination reason: Refutation
% 0.12/0.45 % (2024232)Time elapsed: 0.002 s
% 0.12/0.45 % (2024232)Peak memory usage: 11 MB
% 0.12/0.45 % (2024232)Instructions burned: 3 (million)
% 0.12/0.45 % (2024225)Success in time 0.029 s
% 0.12/0.45 % Vampire exiting
%------------------------------------------------------------------------------