%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KLE003+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 : n001.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:34 AM UTC 2026
% Result : Theorem 0.18s 0.46s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 9 unt; 2 def)
% Number of atoms : 47 ( 28 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 38 ( 16 ~; 14 |; 3 &)
% ( 4 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 3 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn 9 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
fof(f13,conjecture,
( ! [X0] : addition(X0,X0) = X0
<=> addition(one,one) = one ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f14,negated_conjecture,
~ ( ! [X0] : addition(X0,X0) = X0
<=> addition(one,one) = one ),
inference(negated_conjecture,[status(cth)],[f13]) ).
fof(f15,plain,
( ! [X0] : addition(X0,X0) = X0
<~> addition(one,one) = one ),
inference(ennf_transformation,[],[f14]) ).
fof(f16,plain,
( ( one != addition(one,one)
| ? [X0] : addition(X0,X0) != X0 )
& ( addition(one,one) = one
| ! [X0] : addition(X0,X0) = X0 ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f17,plain,
( ( one != addition(one,one)
| ? [X0] : addition(X0,X0) != X0 )
& ( addition(one,one) = one
| ! [X1] : addition(X1,X1) = X1 ) ),
inference(rectify,[],[f16]) ).
fof(f18,plain,
( ( one != addition(one,one)
| sK0 != addition(sK0,sK0) )
& ( addition(one,one) = one
| ! [X1] : addition(X1,X1) = X1 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f17]) ).
fof(f22,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f31,plain,
( one != addition(one,one)
| sK0 != addition(sK0,sK0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f33,definition,
( spl1_1
<=> sK0 = addition(sK0,sK0) ),
introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition]) ).
fof(f35,plain,
( sK0 != addition(sK0,sK0)
| spl1_1 ),
inference(avatar_component_clause,[],[f33]) ).
fof(f37,definition,
( spl1_2
<=> one = addition(one,one) ),
introduced(definition,[new_symbols(definition,[spl1_2])],[avatar_definition]) ).
fof(f39,plain,
( one != addition(one,one)
| spl1_2 ),
inference(avatar_component_clause,[],[f37]) ).
fof(f40,plain,
( ~ spl1_1
| ~ spl1_2 ),
inference(avatar_split_clause,[],[f31,f37,f33]) ).
fof(f41,plain,
! [X1] : addition(X1,X1) = X1,
inference(global_subsumption,[],[f22]) ).
fof(f42,plain,
( sK0 != sK0
| spl1_1 ),
inference(superposition,[],[f35,f41]) ).
fof(f43,plain,
( $false
| spl1_1 ),
inference(trivial_inequality_removal,[],[f42]) ).
fof(f44,plain,
spl1_1,
inference(avatar_contradiction_clause,[],[f43]) ).
fof(f45,plain,
( $false
| spl1_2 ),
inference(forward_subsumption_resolution,[],[f39,f41]) ).
fof(f46,plain,
spl1_2,
inference(avatar_contradiction_clause,[],[f45]) ).
cnf(s15,plain,
( ~ spl1_1
| ~ spl1_2 ),
inference(sat_conversion,[],[f40]) ).
cnf(s21,plain,
spl1_1,
inference(sat_conversion,[],[f44]) ).
cnf(s22,plain,
spl1_2,
inference(sat_conversion,[],[f46]) ).
cnf(s23,plain,
$false,
inference(rat,[],[s15,s22,s21]) ).
fof(f47,plain,
$false,
inference(avatar_sat_refutation,[],[s23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE003+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.12/0.38 % Computer : n001.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:03:45 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42 Running first-order model finding
% 0.12/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.18/0.46 % (3554250)Will run a generic schedule for satisfiability detection.
% 0.18/0.46 % (3554257)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=31939088:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.46 % (3554257) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3554250-3554257"...
% 0.18/0.46 % (3554257)...printing done.
% 0.18/0.46 % (3554256)% WARNING: option uhcvi not known.
% 0.18/0.46 % (3554257)Refutation found. Thanks to Tanya!
% 0.18/0.46 % SZS status Theorem for theBenchmark
% 0.18/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.46 % (3554257)------------------------------
% 0.18/0.46 % (3554257)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.46 % (3554257)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.46 % (3554257)CaDiCaL version: 2.1.3
% 0.18/0.46 % (3554257)Termination reason: Refutation
% 0.18/0.46 % (3554257)Time elapsed: 0.001 s
% 0.18/0.46 % (3554257)Peak memory usage: 12 MB
% 0.18/0.46 % (3554257)Instructions burned: 1 (million)
% 0.18/0.46 % (3554250)Success in time 0.035 s
% 0.18/0.46 % Vampire exiting
%------------------------------------------------------------------------------