%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : KLE021+2 : 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 : n004.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:06 AM UTC 2026
% Result : Theorem 0.10s 0.40s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 16 unt; 0 def)
% Number of atoms : 60 ( 20 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 51 ( 25 ~; 14 |; 6 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn 17 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(additive_commutativity,axiom,
! [A,B] : addition(A,B) = addition(B,A),
file('theBenchmark.p',additive_commutativity) ).
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(test_2,axiom,
! [X0,X1] :
( complement(X1,X0)
<=> ( addition(X0,X1) = one
& multiplication(X1,X0) = zero
& multiplication(X0,X1) = zero ) ),
file('theBenchmark.p',test_2) ).
fof(test_3,axiom,
! [X0,X1] :
( test(X0)
=> ( c(X0) = X1
<=> complement(X0,X1) ) ),
file('theBenchmark.p',test_3) ).
fof(goals,conjecture,
! [X0,X1] :
( test(X1)
=> ( leq(addition(multiplication(X1,X0),multiplication(c(X1),X0)),X0)
& leq(X0,addition(multiplication(X1,X0),multiplication(c(X1),X0))) ) ),
file('theBenchmark.p',goals) ).
fof(goals_neg,negated_conjecture,
~ ! [X0,X1] :
( test(X1)
=> ( leq(addition(multiplication(X1,X0),multiplication(c(X1),X0)),X0)
& leq(X0,addition(multiplication(X1,X0),multiplication(c(X1),X0))) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_20,plain,
( complement(A,B)
| c(A) != B
| ~ test(A) ),
inference(clausify,[status(thm)],[test_3]) ).
fof(nnf_17,plain,
? [X0,X1] :
( ( ~ leq(addition(multiplication(X1,X0),multiplication(c(X1),X0)),X0)
| ~ leq(X0,addition(multiplication(X1,X0),multiplication(c(X1),X0))) )
& test(X1) ),
inference(fof_nnf,[status(thm)],[goals_neg]) ).
fof(sk_goals_neg,plain,
( ( ~ leq(addition(multiplication(sK0,sK1),multiplication(c(sK0),sK1)),sK1)
| ~ leq(sK1,addition(multiplication(sK0,sK1),multiplication(c(sK0),sK1))) )
& test(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK1),skolemize(X1,sK0)],[nnf_17]) ).
cnf(c_23,negated_conjecture,
test(sK0),
inference(split_conjunct,[status(thm)],[sk_goals_neg]) ).
cnf(c_25,negated_conjecture,
( complement(sK0,A)
| c(sK0) != A ),
inference(resolve,[status(thm)],[c_23,c_20]) ).
cnf(c_33,negated_conjecture,
( ~ leq(addition(multiplication(sK0,sK1),multiplication(c(sK0),sK1)),sK1)
| ~ leq(sK1,addition(multiplication(sK0,sK1),multiplication(c(sK0),sK1))) ),
inference(split_conjunct,[status(thm)],[sk_goals_neg]) ).
cnf(c_35,plain,
( addition(B,A) = one
| ~ complement(A,B) ),
inference(clausify,[status(thm)],[test_2]) ).
cnf(c_38,plain,
( addition(A,B) != B
| leq(A,B) ),
inference(clausify,[status(thm)],[order]) ).
cnf(c_42,plain,
multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)),
inference(clausify,[status(thm)],[left_distributivity]) ).
cnf(c_43,plain,
addition(multiplication(A,B),multiplication(C,B)) = multiplication(addition(A,C),B),
inference(copy,[status(thm)],[c_42]) ).
cnf(c_46,plain,
multiplication(one,A) = A,
inference(clausify,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_49,plain,
addition(A,A) = A,
inference(clausify,[status(thm)],[additive_idempotence]) ).
cnf(c_52,plain,
addition(A,B) = addition(B,A),
inference(clausify,[status(thm)],[additive_commutativity]) ).
cnf(c_113,negated_conjecture,
( ~ leq(addition(multiplication(sK0,sK1),multiplication(c(sK0),sK1)),sK1)
| ~ leq(sK1,multiplication(addition(sK0,c(sK0)),sK1)) ),
inference(paramod,[status(thm)],[c_43,c_33]) ).
cnf(c_56,negated_conjecture,
( ~ leq(multiplication(addition(sK0,c(sK0)),sK1),sK1)
| ~ leq(sK1,multiplication(addition(sK0,c(sK0)),sK1)) ),
inference(paramod,[status(thm)],[c_43,c_113]) ).
cnf(c_57,plain,
complement(sK0,c(sK0)),
inference(xxres,[status(thm)],[c_25]) ).
cnf(c_85,plain,
leq(A,A),
inference(resolve,[status(thm)],[c_49,c_38]) ).
cnf(c_114,plain,
addition(c(sK0),sK0) = one,
inference(resolve,[status(thm)],[c_57,c_35]) ).
cnf(c_108,plain,
addition(sK0,c(sK0)) = one,
inference(paramod,[status(thm)],[c_52,c_114]) ).
cnf(c_115,negated_conjecture,
( ~ leq(multiplication(addition(sK0,c(sK0)),sK1),sK1)
| ~ leq(sK1,multiplication(one,sK1)) ),
inference(paramod,[status(thm)],[c_108,c_56]) ).
cnf(c_116,negated_conjecture,
( ~ leq(multiplication(addition(sK0,c(sK0)),sK1),sK1)
| ~ leq(sK1,sK1) ),
inference(paramod,[status(thm)],[c_46,c_115]) ).
cnf(c_117,negated_conjecture,
( ~ leq(multiplication(one,sK1),sK1)
| ~ leq(sK1,sK1) ),
inference(paramod,[status(thm)],[c_108,c_116]) ).
cnf(c_118,negated_conjecture,
( ~ leq(sK1,sK1)
| ~ leq(sK1,sK1) ),
inference(paramod,[status(thm)],[c_46,c_117]) ).
cnf(c_119,negated_conjecture,
~ leq(sK1,sK1),
inference(copy,[status(thm)],[c_118]) ).
cnf(c_112,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_85,c_119]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE021+2 : 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 : n004.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:13:36 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 3845600 was started by sandbox on n004,
% 0.10/0.37 % Fri Sep 25 19:13:36 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.10/0.40
% 0.10/0.40 % SZS status Theorem for theBenchmark
% 0.10/0.40
% 0.10/0.40 % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.10/0.40 % Length of proof is 24.
% 0.10/0.40 % Level of proof is 5.
% 0.10/0.40 % Maximum clause weight is 20.000.
% 0.10/0.40 % Given clauses 31.
% 0.10/0.40
% 0.10/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------