%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KLE005+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 : n026.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:35 AM UTC 2026
% Result : Theorem 0.14s 0.47s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 40 ( 11 unt; 2 def)
% Number of atoms : 89 ( 38 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 85 ( 36 ~; 33 |; 9 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0] : multiplication(one,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
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(f16,axiom,
! [X0] :
( ~ test(X0)
=> c(X0) = zero ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_4) ).
fof(f17,conjecture,
c(one) = zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f18,negated_conjecture,
c(one) != zero,
inference(negated_conjecture,[status(cth)],[f17]) ).
fof(f19,plain,
zero != c(one),
inference(flattening,[],[f18]) ).
fof(f20,plain,
! [X0,X1] :
( ( c(X0) = X1
<=> complement(X0,X1) )
| ~ test(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f21,plain,
! [X0] :
( c(X0) = zero
| test(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f25,plain,
! [X0,X1] :
( ( complement(X1,X0)
| zero != multiplication(X0,X1)
| zero != multiplication(X1,X0)
| addition(X0,X1) != one )
& ( ( multiplication(X0,X1) = zero
& multiplication(X1,X0) = zero
& addition(X0,X1) = one )
| ~ complement(X1,X0) ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f26,plain,
! [X0,X1] :
( ( complement(X1,X0)
| zero != multiplication(X0,X1)
| zero != multiplication(X1,X0)
| addition(X0,X1) != one )
& ( ( multiplication(X0,X1) = zero
& multiplication(X1,X0) = zero
& addition(X0,X1) = one )
| ~ complement(X1,X0) ) ),
inference(flattening,[],[f25]) ).
fof(f27,plain,
! [X0,X1] :
( ( ( c(X0) = X1
| ~ complement(X0,X1) )
& ( complement(X0,X1)
| c(X0) != X1 ) )
| ~ test(X0) ),
inference(nnf_transformation,[],[f20]) ).
fof(f34,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f42,plain,
! [X0,X1] :
( zero = multiplication(X1,X0)
| ~ complement(X1,X0) ),
inference(cnf_transformation,[],[f26]) ).
fof(f45,plain,
! [X0,X1] :
( complement(X0,X1)
| c(X0) != X1
| ~ test(X0) ),
inference(cnf_transformation,[],[f27]) ).
fof(f47,plain,
! [X0] :
( test(X0)
| zero = c(X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f48,plain,
zero != c(one),
inference(cnf_transformation,[],[f19]) ).
fof(f49,plain,
! [X0] :
( complement(X0,c(X0))
| ~ test(X0) ),
inference(equality_resolution,[],[f45]) ).
fof(f54,plain,
! [X0,X1] :
( complement(X1,X0)
| zero = multiplication(X1,X0) ),
inference(consistent_polarity_flipping,[],[f42]) ).
fof(f57,plain,
! [X0] :
( ~ complement(X0,c(X0))
| ~ test(X0) ),
inference(consistent_polarity_flipping,[],[f49]) ).
fof(f69,plain,
! [X0] :
( ~ test(X0)
| zero = multiplication(X0,c(X0)) ),
inference(resolution,[],[f54,f57]) ).
fof(f104,definition,
( spl1_1
<=> zero = c(one) ),
introduced(definition,[new_symbols(definition,[spl1_1])],[avatar_definition]) ).
fof(f106,plain,
( zero = c(one)
| ~ spl1_1 ),
inference(avatar_component_clause,[],[f104]) ).
fof(f117,definition,
( spl1_3
<=> test(one) ),
introduced(definition,[new_symbols(definition,[spl1_3])],[avatar_definition]) ).
fof(f118,plain,
( test(one)
| ~ spl1_3 ),
inference(avatar_component_clause,[],[f117]) ).
fof(f119,plain,
( ~ test(one)
| spl1_3 ),
inference(avatar_component_clause,[],[f117]) ).
fof(f134,plain,
( zero = c(one)
| spl1_3 ),
inference(resolution,[],[f119,f47]) ).
fof(f136,plain,
( spl1_1
| spl1_3 ),
inference(avatar_split_clause,[],[f134,f117,f104]) ).
fof(f139,plain,
( zero = multiplication(one,c(one))
| ~ spl1_3 ),
inference(resolution,[],[f118,f69]) ).
fof(f180,plain,
( zero = c(one)
| ~ spl1_3 ),
inference(superposition,[],[f34,f139]) ).
fof(f181,plain,
( spl1_1
| ~ spl1_3 ),
inference(avatar_split_clause,[],[f180,f117,f104]) ).
fof(f184,plain,
( zero != zero
| ~ spl1_1 ),
inference(superposition,[],[f48,f106]) ).
fof(f186,plain,
( $false
| ~ spl1_1 ),
inference(trivial_inequality_removal,[],[f184]) ).
fof(f187,plain,
~ spl1_1,
inference(avatar_contradiction_clause,[],[f186]) ).
cnf(s5,plain,
( spl1_1
| spl1_3 ),
inference(sat_conversion,[],[f136]) ).
cnf(s6,plain,
( spl1_1
| ~ spl1_3 ),
inference(sat_conversion,[],[f181]) ).
cnf(s8,plain,
~ spl1_1,
inference(sat_conversion,[],[f187]) ).
cnf(s10,plain,
~ spl1_3,
inference(rat,[],[s6,s8]) ).
cnf(s11,plain,
$false,
inference(rat,[],[s5,s10,s8]) ).
fof(f193,plain,
$false,
inference(avatar_sat_refutation,[],[s11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE005+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.14/0.40 % Computer : n026.cluster.edu
% 0.14/0.40 % Model : x86_64 x86_64
% 0.14/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40 % Memory : 8046.5625MB
% 0.14/0.40 % OS : Linux 6.8.0-71-generic
% 0.14/0.40 % CPULimit : 300
% 0.14/0.40 % WCLimit : 300
% 0.14/0.40 % DateTime : Sun Sep 27 13:00:41 UTC 2026
% 0.14/0.40 % CPUTime :
% 0.14/0.40 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.14/0.43 Running first-order model finding
% 0.14/0.44 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.14/0.47 % (2825941)Will run a generic schedule for satisfiability detection.
% 0.14/0.47 % (2825952)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2522116646:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.14/0.47 % (2825952) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2825941-2825952"...
% 0.14/0.47 % (2825947)% WARNING: option uhcvi not known.
% 0.14/0.47 % (2825952)...printing done.
% 0.14/0.47 % (2825952)Refutation found. Thanks to Tanya!
% 0.14/0.47 % SZS status Theorem for theBenchmark
% 0.14/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.47 % (2825952)------------------------------
% 0.14/0.47 % (2825952)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.14/0.47 % (2825952)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.14/0.47 % (2825952)CaDiCaL version: 2.1.3
% 0.14/0.47 % (2825952)Termination reason: Refutation
% 0.14/0.47 % (2825952)Time elapsed: 0.005 s
% 0.14/0.47 % (2825952)Peak memory usage: 13 MB
% 0.14/0.47 % (2825952)Instructions burned: 6 (million)
% 0.14/0.47 % (2825941)Success in time 0.029 s
% 0.14/0.47 % Vampire exiting
%------------------------------------------------------------------------------