%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KLE148+2 : 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 : 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:59 AM UTC 2026
% Result : Theorem 0.16s 0.48s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of formulae : 61 ( 28 unt; 3 def)
% Number of atoms : 98 ( 42 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 70 ( 33 ~; 28 |; 3 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 52 ( 0 sgn 50 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',additive_commutativity) ).
fof(f2,axiom,
! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',additive_associativity) ).
fof(f3,axiom,
! [X0] : addition(X0,zero) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',additive_identity) ).
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',idempotence) ).
fof(f5,axiom,
! [X0,X1,X2] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',multiplicative_associativity) ).
fof(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+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/sandbox2/benchmark/Axioms/KLE004+0.ax',distributivity1) ).
fof(f10,axiom,
! [X0] : multiplication(zero,X0) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',left_annihilation) ).
fof(f15,axiom,
! [X0] : strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',infty_unfold1) ).
fof(f18,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',order) ).
fof(f19,conjecture,
! [X0,X1] :
( ( multiplication(X0,X1) = zero
=> leq(multiplication(X0,strong_iteration(X1)),X0) )
& leq(X0,multiplication(X0,strong_iteration(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f20,negated_conjecture,
~ ! [X0,X1] :
( ( multiplication(X0,X1) = zero
=> leq(multiplication(X0,strong_iteration(X1)),X0) )
& leq(X0,multiplication(X0,strong_iteration(X1))) ),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f24,plain,
? [X0,X1] :
( ( ~ leq(multiplication(X0,strong_iteration(X1)),X0)
& multiplication(X0,X1) = zero )
| ~ leq(X0,multiplication(X0,strong_iteration(X1))) ),
inference(ennf_transformation,[],[f20]) ).
fof(f25,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f26,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f2]) ).
fof(f27,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f28,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f29,plain,
! [X2,X0,X1] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
inference(cnf_transformation,[],[f5]) ).
fof(f30,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f32,plain,
! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
inference(cnf_transformation,[],[f8]) ).
fof(f34,plain,
! [X0] : zero = multiplication(zero,X0),
inference(cnf_transformation,[],[f10]) ).
fof(f39,plain,
! [X0] : strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
inference(cnf_transformation,[],[f15]) ).
fof(f42,plain,
! [X0,X1] :
( leq(X0,X1)
| addition(X0,X1) != X1 ),
inference(cnf_transformation,[],[f18]) ).
fof(f44,plain,
( ~ leq(sK0,multiplication(sK0,strong_iteration(sK1)))
| zero = multiplication(sK0,sK1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f45,plain,
( ~ leq(sK0,multiplication(sK0,strong_iteration(sK1)))
| ~ leq(multiplication(sK0,strong_iteration(sK1)),sK0) ),
inference(cnf_transformation,[],[f24]) ).
fof(f47,definition,
( spl2_1
<=> zero = multiplication(sK0,sK1) ),
introduced(definition,[new_symbols(definition,[spl2_1])],[avatar_definition]) ).
fof(f49,plain,
( zero = multiplication(sK0,sK1)
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f47]) ).
fof(f51,definition,
( spl2_2
<=> leq(sK0,multiplication(sK0,strong_iteration(sK1))) ),
introduced(definition,[new_symbols(definition,[spl2_2])],[avatar_definition]) ).
fof(f53,plain,
( ~ leq(sK0,multiplication(sK0,strong_iteration(sK1)))
| spl2_2 ),
inference(avatar_component_clause,[],[f51]) ).
fof(f54,plain,
( spl2_1
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f44,f51,f47]) ).
fof(f56,definition,
( spl2_3
<=> leq(multiplication(sK0,strong_iteration(sK1)),sK0) ),
introduced(definition,[new_symbols(definition,[spl2_3])],[avatar_definition]) ).
fof(f58,plain,
( ~ leq(multiplication(sK0,strong_iteration(sK1)),sK0)
| spl2_3 ),
inference(avatar_component_clause,[],[f56]) ).
fof(f59,plain,
( ~ spl2_3
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f45,f51,f56]) ).
fof(f64,plain,
( multiplication(sK0,strong_iteration(sK1)) != addition(sK0,multiplication(sK0,strong_iteration(sK1)))
| spl2_2 ),
inference(resolution,[],[f42,f53]) ).
fof(f83,plain,
! [X0] : strong_iteration(X0) = addition(one,multiplication(X0,strong_iteration(X0))),
inference(superposition,[],[f25,f39]) ).
fof(f96,plain,
! [X0,X1] : addition(X0,X1) = addition(X0,addition(X0,X1)),
inference(superposition,[],[f26,f28]) ).
fof(f146,plain,
! [X0] : strong_iteration(X0) = addition(one,strong_iteration(X0)),
inference(superposition,[],[f96,f83]) ).
fof(f163,plain,
! [X0,X1] : multiplication(X0,addition(one,X1)) = addition(X0,multiplication(X0,X1)),
inference(superposition,[],[f32,f30]) ).
fof(f787,plain,
( multiplication(sK0,strong_iteration(sK1)) != multiplication(sK0,addition(one,strong_iteration(sK1)))
| spl2_2 ),
inference(superposition,[],[f64,f163]) ).
fof(f788,plain,
( multiplication(sK0,strong_iteration(sK1)) != multiplication(sK0,strong_iteration(sK1))
| spl2_2 ),
inference(forward_demodulation,[],[f787,f146]) ).
fof(f789,plain,
( $false
| spl2_2 ),
inference(trivial_inequality_removal,[],[f788]) ).
fof(f790,plain,
spl2_2,
inference(avatar_contradiction_clause,[],[f789]) ).
fof(f821,plain,
( ! [X0] : multiplication(zero,X0) = multiplication(sK0,multiplication(sK1,X0))
| ~ spl2_1 ),
inference(superposition,[],[f29,f49]) ).
fof(f839,plain,
( ! [X0] : zero = multiplication(sK0,multiplication(sK1,X0))
| ~ spl2_1 ),
inference(forward_demodulation,[],[f821,f34]) ).
fof(f842,plain,
( sK0 != addition(multiplication(sK0,strong_iteration(sK1)),sK0)
| spl2_3 ),
inference(resolution,[],[f58,f42]) ).
fof(f843,plain,
( sK0 != addition(sK0,multiplication(sK0,strong_iteration(sK1)))
| spl2_3 ),
inference(forward_demodulation,[],[f842,f25]) ).
fof(f844,plain,
( sK0 != multiplication(sK0,addition(one,strong_iteration(sK1)))
| spl2_3 ),
inference(forward_demodulation,[],[f843,f163]) ).
fof(f845,plain,
( sK0 != multiplication(sK0,strong_iteration(sK1))
| spl2_3 ),
inference(forward_demodulation,[],[f844,f146]) ).
fof(f855,plain,
( ! [X0] : addition(sK0,zero) = multiplication(sK0,addition(one,multiplication(sK1,X0)))
| ~ spl2_1 ),
inference(superposition,[],[f163,f839]) ).
fof(f857,plain,
( ! [X0] : sK0 = multiplication(sK0,addition(one,multiplication(sK1,X0)))
| ~ spl2_1 ),
inference(forward_demodulation,[],[f855,f27]) ).
fof(f1235,plain,
( sK0 = multiplication(sK0,strong_iteration(sK1))
| ~ spl2_1 ),
inference(superposition,[],[f857,f83]) ).
fof(f1256,plain,
( $false
| ~ spl2_1
| spl2_3 ),
inference(forward_subsumption_resolution,[],[f1235,f845]) ).
fof(f1257,plain,
( ~ spl2_1
| spl2_3 ),
inference(avatar_contradiction_clause,[],[f1256]) ).
cnf(s1,plain,
( spl2_1
| ~ spl2_2 ),
inference(sat_conversion,[],[f54]) ).
cnf(s2,plain,
( ~ spl2_2
| ~ spl2_3 ),
inference(sat_conversion,[],[f59]) ).
cnf(s5,plain,
spl2_2,
inference(sat_conversion,[],[f790]) ).
cnf(s9,plain,
( ~ spl2_1
| spl2_3 ),
inference(sat_conversion,[],[f1257]) ).
cnf(s10,plain,
~ spl2_3,
inference(rat,[],[s2,s5]) ).
cnf(s11,plain,
~ spl2_1,
inference(rat,[],[s9,s10]) ).
cnf(s12,plain,
$false,
inference(rat,[],[s1,s5,s11]) ).
fof(f1266,plain,
$false,
inference(avatar_sat_refutation,[],[s12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE148+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.36 % Computer : n016.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Sun Sep 27 13:17:17 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.16/0.42 Running first-order model finding
% 0.16/0.42 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.16/0.48 % (2636141)Will run a generic schedule for satisfiability detection.
% 0.16/0.48 % (2636147)% WARNING: option uhcvi not known.
% 0.16/0.48 % (2636147)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=743320048:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.48 % (2636146)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1905180818_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.48 % (2636148)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3799247980:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.48 % (2636150)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1392538651:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.48 % (2636152)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2071837631:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.48 % (2636151)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2983396820:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.48 % TRYING [1]
% 0.16/0.48 % TRYING [2]
% 0.16/0.48 % TRYING [3]
% 0.16/0.48 % TRYING [4]
% 0.16/0.48 % (2636149)dis+10_1_sil=32000:sp=arity:random_seed=2665049571:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.48 % (2636150) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2636141-2636150"...
% 0.16/0.48 % TRYING [5]
% 0.16/0.48 % (2636150)...printing done.
% 0.16/0.48 % (2636150)Refutation found. Thanks to Tanya!
% 0.16/0.48 % SZS status Theorem for theBenchmark
% 0.16/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.49 % (2636150)------------------------------
% 0.16/0.49 % (2636150)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.49 % (2636150)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.49 % (2636150)CaDiCaL version: 2.1.3
% 0.16/0.49 % (2636150)Termination reason: Refutation
% 0.16/0.49 % (2636150)Time elapsed: 0.029 s
% 0.16/0.49 % (2636150)Peak memory usage: 13 MB
% 0.16/0.49 % (2636150)Instructions burned: 44 (million)
% 0.16/0.49 % (2636141)Success in time 0.057 s
% 0.16/0.49 % Vampire exiting
%------------------------------------------------------------------------------