%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : KLE137+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n003.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 : Sun Sep 27 07:44:22 AM UTC 2026
% Result : Theorem 0.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 24 ( 19 unt; 0 def)
% Number of atoms : 29 ( 12 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 12 ( 7 ~; 3 |; 0 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 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 : 36 ( 4 sgn 13 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(additive_associativity,axiom,
! [C,B,A] : addition(A,addition(B,C)) = addition(addition(A,B),C),
file('theBenchmark.p',additive_associativity) ).
fof(idempotence,axiom,
! [A] : addition(A,A) = A,
file('theBenchmark.p',idempotence) ).
fof(multiplicative_right_identity,axiom,
! [A] : multiplication(A,one) = A,
file('theBenchmark.p',multiplicative_right_identity) ).
fof(multiplicative_left_identity,axiom,
! [A] : multiplication(one,A) = A,
file('theBenchmark.p',multiplicative_left_identity) ).
fof(infty_coinduction,axiom,
! [A,B,C] :
( leq(C,addition(multiplication(A,C),B))
=> leq(C,multiplication(strong_iteration(A),B)) ),
file('theBenchmark.p',infty_coinduction) ).
fof(order,axiom,
! [A,B] :
( leq(A,B)
<=> addition(A,B) = B ),
file('theBenchmark.p',order) ).
fof(goals,conjecture,
! [X0] : leq(X0,strong_iteration(one)),
file('theBenchmark.p',goals) ).
fof(goals_neg,negated_conjecture,
~ ! [X0] : leq(X0,strong_iteration(one)),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_21,plain,
addition(addition(A,B),C) = addition(A,addition(B,C)),
inference(clausify,[status(thm)],[additive_associativity]) ).
cnf(c_23,plain,
addition(A,A) = A,
inference(clausify,[status(thm)],[idempotence]) ).
cnf(c_25,plain,
multiplication(A,one) = A,
inference(clausify,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_26,plain,
multiplication(one,A) = A,
inference(clausify,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_40,plain,
( leq(A,multiplication(strong_iteration(B),C))
| ~ leq(A,addition(multiplication(B,A),C)) ),
inference(clausify,[status(thm)],[infty_coinduction]) ).
cnf(c_44,plain,
( addition(A,B) != B
| leq(A,B) ),
inference(clausify,[status(thm)],[order]) ).
fof(nnf_19,plain,
? [X0] : ~ leq(X0,strong_iteration(one)),
inference(fof_nnf,[status(thm)],[goals_neg]) ).
fof(sk_goals_neg,plain,
~ leq(sK0,strong_iteration(one)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[nnf_19]) ).
cnf(c_45,negated_conjecture,
~ leq(sK0,strong_iteration(one)),
inference(split_conjunct,[status(thm)],[sk_goals_neg]) ).
cnf(c_215,plain,
addition(A,B) = addition(A,addition(A,B)),
inference(paramod,[status(thm)],[c_23,c_21]) ).
cnf(c_49,plain,
addition(A,addition(A,B)) = addition(A,B),
inference(copy,[status(thm)],[c_215]) ).
cnf(c_97,plain,
( leq(A,multiplication(strong_iteration(one),B))
| ~ leq(A,addition(A,B)) ),
inference(paramod,[status(thm)],[c_26,c_40]) ).
cnf(c_124,plain,
leq(A,addition(A,B)),
inference(resolve,[status(thm)],[c_49,c_44]) ).
cnf(c_133,plain,
leq(A,multiplication(strong_iteration(one),B)),
inference(resolve,[status(thm)],[c_124,c_97]) ).
cnf(c_213,plain,
leq(A,strong_iteration(one)),
inference(paramod,[status(thm)],[c_25,c_133]) ).
cnf(c_214,plain,
$false,
inference(resolve,[status(thm)],[c_213,c_45]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE137+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n003.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Fri Sep 25 19:27:38 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.37 % Process 882352 was started by sandbox on n003,
% 0.10/0.37 % Fri Sep 25 19:27:38 2026
% 0.10/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.37
% 0.10/0.37 % From the command line: assign(max_seconds, 300).
% 0.14/0.41
% 0.14/0.41 % SZS status Theorem for theBenchmark
% 0.14/0.41
% 0.14/0.41 % Proof 1 at 0.02 (+ 0.01) seconds.
% 0.14/0.41 % Length of proof is 20.
% 0.14/0.41 % Level of proof is 6.
% 0.14/0.41 % Maximum clause weight is 36.000.
% 0.14/0.41 % Given clauses 45.
% 0.14/0.41
% 0.14/0.41 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------