%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : KLE037+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n002.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:10 AM UTC 2026
% Result : Theorem 0.13s 0.47s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 35 ( 32 unt; 0 def)
% Number of atoms : 38 ( 27 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 7 ~; 2 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 5 ( 2 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 : 54 ( 0 sgn 15 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(additive_commutativity,axiom,
! [A,B] : addition(A,B) = addition(B,A),
file('theBenchmark.p',additive_commutativity) ).
fof(additive_associativity,axiom,
! [C,B,A] : addition(A,addition(B,C)) = addition(addition(A,B),C),
file('theBenchmark.p',additive_associativity) ).
fof(additive_idempotence,axiom,
! [A] : addition(A,A) = A,
file('theBenchmark.p',additive_idempotence) ).
fof(multiplicative_left_identity,axiom,
! [A] : multiplication(one,A) = A,
file('theBenchmark.p',multiplicative_left_identity) ).
fof(left_distributivity,axiom,
! [A,B,C] : multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)),
file('theBenchmark.p',left_distributivity) ).
fof(order,axiom,
! [A,B] :
( leq(A,B)
<=> addition(A,B) = B ),
file('theBenchmark.p',order) ).
fof(star_unfold_right,axiom,
! [A] : leq(addition(one,multiplication(A,star(A))),star(A)),
file('theBenchmark.p',star_unfold_right) ).
fof(goals,conjecture,
! [X0] : leq(one,star(X0)),
file('theBenchmark.p',goals) ).
fof(goals_neg,negated_conjecture,
~ ! [X0] : leq(one,star(X0)),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_18,plain,
addition(A,B) = addition(B,A),
inference(clausify,[status(thm)],[additive_commutativity]) ).
cnf(c_19,plain,
addition(addition(A,B),C) = addition(A,addition(B,C)),
inference(clausify,[status(thm)],[additive_associativity]) ).
cnf(c_21,plain,
addition(A,A) = A,
inference(clausify,[status(thm)],[additive_idempotence]) ).
cnf(c_24,plain,
multiplication(one,A) = A,
inference(clausify,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_27,plain,
multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)),
inference(clausify,[status(thm)],[left_distributivity]) ).
cnf(c_28,plain,
addition(multiplication(A,B),multiplication(C,B)) = multiplication(addition(A,C),B),
inference(copy,[status(thm)],[c_27]) ).
cnf(c_31,plain,
( addition(A,B) = B
| ~ leq(A,B) ),
inference(clausify,[status(thm)],[order]) ).
cnf(c_32,plain,
( addition(A,B) != B
| leq(A,B) ),
inference(clausify,[status(thm)],[order]) ).
cnf(c_33,plain,
leq(addition(one,multiplication(A,star(A))),star(A)),
inference(clausify,[status(thm)],[star_unfold_right]) ).
fof(nnf_17,plain,
? [X0] : ~ leq(one,star(X0)),
inference(fof_nnf,[status(thm)],[goals_neg]) ).
fof(sk_goals_neg,plain,
~ leq(one,star(sK0)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[nnf_17]) ).
cnf(c_37,negated_conjecture,
~ leq(one,star(sK0)),
inference(split_conjunct,[status(thm)],[sk_goals_neg]) ).
cnf(c_497,plain,
addition(addition(A,B),C) = addition(B,addition(A,C)),
inference(paramod,[status(thm)],[c_18,c_19]) ).
cnf(c_39,plain,
addition(A,addition(B,C)) = addition(B,addition(A,C)),
inference(paramod,[status(thm)],[c_19,c_497]) ).
cnf(c_498,plain,
addition(A,B) = addition(A,addition(A,B)),
inference(paramod,[status(thm)],[c_21,c_19]) ).
cnf(c_41,plain,
addition(A,addition(A,B)) = addition(A,B),
inference(copy,[status(thm)],[c_498]) ).
cnf(c_499,plain,
addition(A,multiplication(B,A)) = multiplication(addition(one,B),A),
inference(paramod,[status(thm)],[c_24,c_28]) ).
cnf(c_50,plain,
multiplication(addition(one,A),B) = addition(B,multiplication(A,B)),
inference(copy,[status(thm)],[c_499]) ).
cnf(c_500,plain,
addition(addition(one,multiplication(A,star(A))),star(A)) = star(A),
inference(resolve,[status(thm)],[c_31,c_33]) ).
cnf(c_501,plain,
addition(star(A),addition(one,multiplication(A,star(A)))) = star(A),
inference(paramod,[status(thm)],[c_18,c_500]) ).
cnf(c_502,plain,
addition(one,addition(star(A),multiplication(A,star(A)))) = star(A),
inference(paramod,[status(thm)],[c_39,c_501]) ).
cnf(c_58,plain,
addition(one,multiplication(addition(one,A),star(A))) = star(A),
inference(paramod,[status(thm)],[c_50,c_502]) ).
cnf(c_83,negated_conjecture,
addition(one,star(sK0)) != star(sK0),
inference(resolve,[status(thm)],[c_32,c_37]) ).
cnf(c_503,plain,
addition(one,star(A)) = addition(one,multiplication(addition(one,A),star(A))),
inference(paramod,[status(thm)],[c_58,c_41]) ).
cnf(c_495,plain,
addition(one,star(A)) = star(A),
inference(paramod,[status(thm)],[c_58,c_503]) ).
cnf(c_496,plain,
$false,
inference(resolve,[status(thm)],[c_495,c_83]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KLE037+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n002.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 : Fri Sep 25 19:19:19 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.13/0.36 % Process 3917459 was started by sandbox2 on n002,
% 0.13/0.36 % Fri Sep 25 19:19:19 2026
% 0.13/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.13/0.37
% 0.13/0.37 % From the command line: assign(max_seconds, 300).
% 0.13/0.47
% 0.13/0.47 % SZS status Theorem for theBenchmark
% 0.13/0.47
% 0.13/0.47 % Proof 1 at 0.06 (+ 0.02) seconds.
% 0.13/0.47 % Length of proof is 25.
% 0.13/0.47 % Level of proof is 6.
% 0.13/0.47 % Maximum clause weight is 13.000.
% 0.13/0.47 % Given clauses 90.
% 0.13/0.47
% 0.13/0.47 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------