%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KLE139+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 : n005.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:57 AM UTC 2026
% Result : Theorem 0.42s 0.52s
% Output : Refutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 35 ( 35 unt; 0 def)
% Number of atoms : 35 ( 34 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 8 ( 8 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 45 ( 44 !; 1 ?)
% 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(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(f9,axiom,
! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',distributivity2) ).
fof(f10,axiom,
! [X0] : multiplication(zero,X0) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',left_annihilation) ).
fof(f11,axiom,
! [X0] : addition(one,multiplication(X0,star(X0))) = star(X0),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',star_unfold1) ).
fof(f12,axiom,
! [X0] : addition(one,multiplication(star(X0),X0)) = star(X0),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',star_unfold2) ).
fof(f17,axiom,
! [X0] : strong_iteration(X0) = addition(star(X0),multiplication(strong_iteration(X0),zero)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE004+0.ax',isolation) ).
fof(f19,conjecture,
! [X0] : strong_iteration(X0) = addition(multiplication(strong_iteration(X0),X0),one),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f20,negated_conjecture,
~ ! [X0] : strong_iteration(X0) = addition(multiplication(strong_iteration(X0),X0),one),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f24,plain,
? [X0] : strong_iteration(X0) != addition(multiplication(strong_iteration(X0),X0),one),
inference(ennf_transformation,[],[f20]) ).
fof(f26,plain,
strong_iteration(sK0) != addition(multiplication(strong_iteration(sK0),sK0),one),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f24]) ).
fof(f27,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f28,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f2]) ).
fof(f29,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f31,plain,
! [X2,X0,X1] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
inference(cnf_transformation,[],[f5]) ).
fof(f35,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f36,plain,
! [X0] : zero = multiplication(zero,X0),
inference(cnf_transformation,[],[f10]) ).
fof(f37,plain,
! [X0] : star(X0) = addition(one,multiplication(X0,star(X0))),
inference(cnf_transformation,[],[f11]) ).
fof(f38,plain,
! [X0] : star(X0) = addition(one,multiplication(star(X0),X0)),
inference(cnf_transformation,[],[f12]) ).
fof(f43,plain,
! [X0] : strong_iteration(X0) = addition(star(X0),multiplication(strong_iteration(X0),zero)),
inference(cnf_transformation,[],[f17]) ).
fof(f46,plain,
strong_iteration(sK0) != addition(multiplication(strong_iteration(sK0),sK0),one),
inference(cnf_transformation,[],[f26]) ).
fof(f51,plain,
strong_iteration(sK0) != addition(one,multiplication(strong_iteration(sK0),sK0)),
inference(superposition,[],[f46,f27]) ).
fof(f60,plain,
star(zero) = addition(one,zero),
inference(superposition,[],[f37,f36]) ).
fof(f66,plain,
one = star(zero),
inference(forward_demodulation,[],[f60,f29]) ).
fof(f68,plain,
strong_iteration(sK0) != addition(star(zero),multiplication(strong_iteration(sK0),sK0)),
inference(superposition,[],[f51,f66]) ).
fof(f119,plain,
! [X0,X1] : addition(star(X0),X1) = addition(one,addition(multiplication(star(X0),X0),X1)),
inference(superposition,[],[f28,f38]) ).
fof(f130,plain,
! [X0,X1] : addition(star(X0),X1) = addition(star(zero),addition(multiplication(star(X0),X0),X1)),
inference(forward_demodulation,[],[f119,f66]) ).
fof(f218,plain,
! [X0,X1] : multiplication(strong_iteration(X0),X1) = addition(multiplication(star(X0),X1),multiplication(multiplication(strong_iteration(X0),zero),X1)),
inference(superposition,[],[f35,f43]) ).
fof(f233,plain,
! [X0,X1] : multiplication(strong_iteration(X0),X1) = addition(multiplication(star(X0),X1),multiplication(strong_iteration(X0),multiplication(zero,X1))),
inference(forward_demodulation,[],[f218,f31]) ).
fof(f244,plain,
! [X0,X1] : multiplication(strong_iteration(X0),X1) = addition(multiplication(star(X0),X1),multiplication(strong_iteration(X0),zero)),
inference(forward_demodulation,[],[f233,f36]) ).
fof(f3317,plain,
strong_iteration(sK0) != addition(star(zero),addition(multiplication(star(sK0),sK0),multiplication(strong_iteration(sK0),zero))),
inference(superposition,[],[f68,f244]) ).
fof(f3418,plain,
strong_iteration(sK0) != addition(star(sK0),multiplication(strong_iteration(sK0),zero)),
inference(forward_demodulation,[],[f3317,f130]) ).
fof(f3446,plain,
$false,
inference(forward_subsumption_resolution,[],[f3418,f43]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KLE139+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.36 % Computer : n005.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sun Sep 27 13:12:02 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.39 Running first-order model finding
% 0.09/0.39 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.42/0.52 % (3983250)Will run a generic schedule for satisfiability detection.
% 0.42/0.52 % (3983257)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=564616360:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.42/0.52 % (3983256)% WARNING: option uhcvi not known.
% 0.42/0.52 % (3983255)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1266932907_2999 on theBenchmark for (2999ds/0Mi)
% 0.42/0.52 % (3983258)dis+10_1_sil=32000:sp=arity:random_seed=3676600057:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.42/0.52 % (3983259)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2132855389:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.42/0.52 % (3983260)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2409124493:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.42/0.52 % (3983256)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2666718105:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.42/0.52 % (3983261)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3741780814:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.42/0.52 % TRYING [1]
% 0.42/0.52 % TRYING [2]
% 0.42/0.52 % TRYING [3]
% 0.42/0.52 % TRYING [4]
% 0.42/0.52 % TRYING [5]
% 0.42/0.52 % (3983258)Instruction limit reached!
% 0.42/0.52 % (3983258)------------------------------
% 0.42/0.52 % (3983258)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.42/0.52 % (3983258)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.42/0.52 % (3983258)CaDiCaL version: 2.1.3
% 0.42/0.52 % (3983258)Termination reason: Instruction limit
% 0.42/0.52 % (3983258)Termination phase: Saturation
% 0.42/0.52 % (3983258)Time elapsed: 0.064 s
% 0.42/0.52 % (3983258)Peak memory usage: 12 MB
% 0.42/0.52 % (3983258)Instructions burned: 104 (million)
% 0.42/0.52 % (3983259)Instruction limit reached!
% 0.42/0.52 % (3983259)------------------------------
% 0.42/0.52 % (3983259)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.42/0.52 % (3983259)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.42/0.52 % (3983259)CaDiCaL version: 2.1.3
% 0.42/0.52 % (3983259)Termination reason: Instruction limit
% 0.42/0.52 % (3983259)Termination phase: Saturation
% 0.42/0.52 % (3983259)Time elapsed: 0.073 s
% 0.42/0.52 % (3983259)Peak memory usage: 13 MB
% 0.42/0.52 % (3983259)Instructions burned: 116 (million)
% 0.42/0.52 % (3983260) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3983250-3983260"...
% 0.42/0.52 % (3983260)...printing done.
% 0.42/0.52 % (3983260)Refutation found. Thanks to Tanya!
% 0.42/0.52 % SZS status Theorem for theBenchmark
% 0.42/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.42/0.52 % (3983260)------------------------------
% 0.42/0.52 % (3983260)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.42/0.52 % (3983260)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.42/0.52 % (3983260)CaDiCaL version: 2.1.3
% 0.42/0.52 % (3983260)Termination reason: Refutation
% 0.42/0.52 % (3983260)Time elapsed: 0.077 s
% 0.42/0.52 % (3983260)Peak memory usage: 13 MB
% 0.42/0.52 % (3983260)Instructions burned: 124 (million)
% 0.42/0.52 % (3983250)Success in time 0.119 s
% 0.42/0.52 % Vampire exiting
%------------------------------------------------------------------------------