%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : KLE146+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:59 AM UTC 2026
% Result : Theorem 0.13s 0.46s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 22 ( 18 unt; 0 def)
% Number of atoms : 28 ( 15 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 14 ( 8 ~; 4 |; 1 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 31 ( 30 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/KLE004+0.ax',additive_associativity) ).
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',idempotence) ).
fof(f15,axiom,
! [X0] : strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',infty_unfold1) ).
fof(f18,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',order) ).
fof(f19,conjecture,
! [X0] : leq(one,strong_iteration(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f20,negated_conjecture,
~ ! [X0] : leq(one,strong_iteration(X0)),
inference(negated_conjecture,[status(cth)],[f19]) ).
fof(f24,plain,
? [X0] : ~ leq(one,strong_iteration(X0)),
inference(ennf_transformation,[],[f20]) ).
fof(f25,plain,
! [X0,X1] :
( ( leq(X0,X1)
| addition(X0,X1) != X1 )
& ( addition(X0,X1) = X1
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f18]) ).
fof(f26,plain,
~ leq(one,strong_iteration(sK0)),
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(f30,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f41,plain,
! [X0] : strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
inference(cnf_transformation,[],[f15]) ).
fof(f45,plain,
! [X0,X1] :
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f46,plain,
~ leq(one,strong_iteration(sK0)),
inference(cnf_transformation,[],[f26]) ).
fof(f264,plain,
! [X0] : strong_iteration(X0) = addition(one,multiplication(X0,strong_iteration(X0))),
inference(forward_demodulation,[],[f41,f27]) ).
fof(f536,plain,
! [X0,X1] : addition(X0,X1) = addition(X0,addition(X0,X1)),
inference(superposition,[],[f28,f30]) ).
fof(f584,plain,
! [X0,X1] :
( addition(X0,X1) != addition(X0,X1)
| leq(X0,addition(X0,X1)) ),
inference(superposition,[],[f45,f536]) ).
fof(f586,plain,
! [X0,X1] : leq(X0,addition(X0,X1)),
inference(trivial_inequality_removal,[],[f584]) ).
fof(f600,plain,
! [X0] : leq(one,strong_iteration(X0)),
inference(superposition,[],[f586,f264]) ).
fof(f610,plain,
$false,
inference(resolution,[],[f600,f46]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE146+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.08/0.36 % Computer : n001.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sun Sep 27 13:18:15 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.39 Running first-order model finding
% 0.13/0.39 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.13/0.46 % (3565713)Will run a generic schedule for satisfiability detection.
% 0.13/0.46 % (3565724)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3314011436:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.13/0.46 % (3565723)% WARNING: option uhcvi not known.
% 0.13/0.46 % (3565722)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2709162312_2999 on theBenchmark for (2999ds/0Mi)
% 0.13/0.46 % (3565724) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3565713-3565724"...
% 0.13/0.46 % (3565725)dis+10_1_sil=32000:sp=arity:random_seed=1441329993:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.13/0.46 % (3565726)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=250038978:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.13/0.46 % (3565723)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2610316901:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.13/0.46 % (3565724)...printing done.
% 0.13/0.46 % (3565728)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2026272921:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.13/0.46 % TRYING [1]
% 0.13/0.46 % TRYING [2]
% 0.13/0.46 % TRYING [3]
% 0.13/0.46 % (3565724)Refutation found. Thanks to Tanya!
% 0.13/0.46 % SZS status Theorem for theBenchmark
% 0.13/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.46 % (3565724)------------------------------
% 0.13/0.46 % (3565724)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.13/0.46 % (3565724)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.13/0.46 % (3565724)CaDiCaL version: 2.1.3
% 0.13/0.46 % (3565724)Termination reason: Refutation
% 0.13/0.46 % (3565724)Time elapsed: 0.007 s
% 0.13/0.46 % (3565724)Peak memory usage: 12 MB
% 0.13/0.46 % (3565724)Instructions burned: 17 (million)
% 0.13/0.46 % (3565713)Success in time 0.05 s
% 0.13/0.46 % Vampire exiting
%------------------------------------------------------------------------------