%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KLE007+4 : 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 : n014.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.20s 0.46s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 10
% Syntax : Number of formulae : 58 ( 17 unt; 2 def)
% Number of atoms : 113 ( 24 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 94 ( 39 ~; 35 |; 10 &)
% ( 6 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn 39 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
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(f12,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',order) ).
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] :
( ( test(X1)
& test(X0) )
=> ( leq(one,addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1))))
& leq(addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1))),one) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f20,negated_conjecture,
~ ! [X0,X1] :
( ( test(X1)
& test(X0) )
=> ( leq(one,addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1))))
& leq(addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1))),one) ) ),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f21,plain,
! [X0,X1] :
( addition(X0,X1) = X1
=> leq(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f12]) ).
fof(f22,plain,
! [X0,X1] :
( leq(X0,X1)
| addition(X0,X1) != X1 ),
inference(ennf_transformation,[],[f21]) ).
fof(f23,plain,
! [X0,X1] :
( ( c(X0) = X1
<=> complement(X0,X1) )
| ~ test(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f29,plain,
? [X0,X1] :
( ( ~ leq(one,addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1))))
| ~ leq(addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1))),one) )
& test(X1)
& test(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f30,plain,
? [X0,X1] :
( ( ~ leq(one,addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1))))
| ~ leq(addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1))),one) )
& test(X1)
& test(X0) ),
inference(flattening,[],[f29]) ).
fof(f31,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f34,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f36,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f38,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] :
( leq(X0,X1)
| addition(X0,X1) != X1 ),
inference(cnf_transformation,[],[f22]) ).
fof(f45,plain,
! [X0,X1] :
( ~ complement(X1,X0)
| addition(X0,X1) = one ),
inference(cnf_transformation,[],[f14]) ).
fof(f50,plain,
! [X0,X1] :
( ~ test(X0)
| complement(X0,X1)
| c(X0) != X1 ),
inference(cnf_transformation,[],[f23]) ).
fof(f54,plain,
( ~ leq(addition(multiplication(addition(sK1,c(sK1)),sK2),multiplication(addition(sK1,c(sK1)),c(sK2))),one)
| ~ leq(one,addition(multiplication(addition(sK1,c(sK1)),sK2),multiplication(addition(sK1,c(sK1)),c(sK2)))) ),
inference(cnf_transformation,[],[f30]) ).
fof(f55,plain,
test(sK1),
inference(cnf_transformation,[],[f30]) ).
fof(f56,plain,
test(sK2),
inference(cnf_transformation,[],[f30]) ).
fof(f57,plain,
! [X0] :
( complement(X0,c(X0))
| ~ test(X0) ),
inference(equality_resolution,[],[f50]) ).
fof(f59,definition,
( spl3_1
<=> leq(one,addition(multiplication(addition(sK1,c(sK1)),sK2),multiplication(addition(sK1,c(sK1)),c(sK2)))) ),
introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).
fof(f61,plain,
( ~ leq(one,addition(multiplication(addition(sK1,c(sK1)),sK2),multiplication(addition(sK1,c(sK1)),c(sK2))))
| spl3_1 ),
inference(avatar_component_clause,[],[f59]) ).
fof(f63,definition,
( spl3_2
<=> leq(addition(multiplication(addition(sK1,c(sK1)),sK2),multiplication(addition(sK1,c(sK1)),c(sK2))),one) ),
introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).
fof(f64,plain,
( leq(addition(multiplication(addition(sK1,c(sK1)),sK2),multiplication(addition(sK1,c(sK1)),c(sK2))),one)
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f63]) ).
fof(f65,plain,
( ~ leq(addition(multiplication(addition(sK1,c(sK1)),sK2),multiplication(addition(sK1,c(sK1)),c(sK2))),one)
| spl3_2 ),
inference(avatar_component_clause,[],[f63]) ).
fof(f66,plain,
( ~ spl3_1
| ~ spl3_2 ),
inference(avatar_split_clause,[],[f54,f63,f59]) ).
fof(f67,plain,
( ~ leq(one,multiplication(addition(sK1,c(sK1)),addition(sK2,c(sK2))))
| spl3_1 ),
inference(forward_demodulation,[],[f61,f38]) ).
fof(f76,plain,
! [X0] :
( one = addition(c(X0),X0)
| ~ test(X0) ),
inference(resolution,[],[f45,f57]) ).
fof(f77,plain,
! [X0] :
( ~ test(X0)
| one = addition(X0,c(X0)) ),
inference(forward_demodulation,[],[f76,f31]) ).
fof(f357,plain,
one = addition(sK1,c(sK1)),
inference(resolution,[],[f77,f55]) ).
fof(f358,plain,
one = addition(sK2,c(sK2)),
inference(resolution,[],[f77,f56]) ).
fof(f1067,plain,
( ~ leq(multiplication(addition(sK1,c(sK1)),addition(sK2,c(sK2))),one)
| spl3_2 ),
inference(forward_demodulation,[],[f65,f38]) ).
fof(f1072,plain,
( ~ leq(multiplication(addition(sK1,c(sK1)),one),one)
| spl3_2 ),
inference(forward_demodulation,[],[f1067,f358]) ).
fof(f1073,plain,
( ~ leq(addition(sK1,c(sK1)),one)
| spl3_2 ),
inference(forward_demodulation,[],[f1072,f36]) ).
fof(f1074,plain,
( ~ leq(one,one)
| spl3_2 ),
inference(forward_demodulation,[],[f1073,f357]) ).
fof(f1078,plain,
( ~ leq(one,multiplication(addition(sK1,c(sK1)),one))
| spl3_1 ),
inference(forward_demodulation,[],[f67,f358]) ).
fof(f1080,plain,
( ~ leq(one,addition(sK1,c(sK1)))
| spl3_1 ),
inference(forward_demodulation,[],[f1078,f36]) ).
fof(f1082,plain,
( ~ leq(one,one)
| spl3_1 ),
inference(forward_demodulation,[],[f1080,f357]) ).
fof(f1084,plain,
( one != addition(one,one)
| spl3_2 ),
inference(resolution,[],[f1074,f42]) ).
fof(f1085,plain,
( $false
| spl3_2 ),
inference(forward_subsumption_resolution,[],[f1084,f34]) ).
fof(f1086,plain,
spl3_2,
inference(avatar_contradiction_clause,[],[f1085]) ).
fof(f1087,plain,
( leq(multiplication(addition(sK1,c(sK1)),addition(sK2,c(sK2))),one)
| ~ spl3_2 ),
inference(forward_demodulation,[],[f64,f38]) ).
fof(f1088,plain,
( leq(multiplication(addition(sK1,c(sK1)),one),one)
| ~ spl3_2 ),
inference(forward_demodulation,[],[f1087,f358]) ).
fof(f1089,plain,
( leq(addition(sK1,c(sK1)),one)
| ~ spl3_2 ),
inference(forward_demodulation,[],[f1088,f36]) ).
fof(f1090,plain,
( leq(one,one)
| ~ spl3_2 ),
inference(forward_demodulation,[],[f1089,f357]) ).
fof(f1091,plain,
( $false
| spl3_1
| ~ spl3_2 ),
inference(forward_subsumption_resolution,[],[f1090,f1082]) ).
fof(f1092,plain,
( spl3_1
| ~ spl3_2 ),
inference(avatar_contradiction_clause,[],[f1091]) ).
cnf(s1,plain,
( ~ spl3_1
| ~ spl3_2 ),
inference(sat_conversion,[],[f66]) ).
cnf(s12,plain,
spl3_2,
inference(sat_conversion,[],[f1086]) ).
cnf(s13,plain,
( spl3_1
| ~ spl3_2 ),
inference(sat_conversion,[],[f1092]) ).
cnf(s14,plain,
spl3_1,
inference(rat,[],[s13,s12]) ).
cnf(s15,plain,
$false,
inference(rat,[],[s1,s12,s14]) ).
fof(f1093,plain,
$false,
inference(avatar_sat_refutation,[],[s15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KLE007+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n014.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 12:58:16 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 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.20/0.46 % (797264)Will run a generic schedule for satisfiability detection.
% 0.20/0.46 % (797278)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2406543740:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.46 % (797274)% WARNING: option uhcvi not known.
% 0.20/0.46 % (797273)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3262364516_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.46 % (797276)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3006543929:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.46 % (797277)dis+10_1_sil=32000:sp=arity:random_seed=2324846340:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.46 % (797274)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1452827580:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.46 % (797279)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2448176982:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.46 % (797280)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1554623290:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.46 % TRYING [1]
% 0.20/0.46 % TRYING [2]
% 0.20/0.46 % TRYING [3]
% 0.20/0.46 % (797278) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-797264-797278"...
% 0.20/0.46 % (797278)...printing done.
% 0.20/0.46 % TRYING [4]
% 0.20/0.46 % (797278)Refutation found. Thanks to Tanya!
% 0.20/0.46 % SZS status Theorem for theBenchmark
% 0.20/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.46 % (797278)------------------------------
% 0.20/0.46 % (797278)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.46 % (797278)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.46 % (797278)CaDiCaL version: 2.1.3
% 0.20/0.46 % (797278)Termination reason: Refutation
% 0.20/0.46 % (797278)Time elapsed: 0.014 s
% 0.20/0.46 % (797278)Peak memory usage: 13 MB
% 0.20/0.46 % (797278)Instructions burned: 37 (million)
% 0.20/0.46 % (797264)Success in time 0.041 s
% 0.20/0.46 % Vampire exiting
%------------------------------------------------------------------------------