%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : KLE007+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 : n011.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:02 AM UTC 2026
% Result : Theorem 0.15s 5.60s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 20 unt; 0 def)
% Number of atoms : 48 ( 27 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 30 ( 12 ~; 5 |; 8 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn 14 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(additive_commutativity,axiom,
! [A,B] : addition(A,B) = addition(B,A),
file('theBenchmark.p',additive_commutativity) ).
fof(multiplicative_left_identity,axiom,
! [A] : multiplication(one,A) = A,
file('theBenchmark.p',multiplicative_left_identity) ).
fof(right_distributivity,axiom,
! [A,B,C] : multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)),
file('theBenchmark.p',right_distributivity) ).
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(X0)
& test(X1) )
=> one = addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1))) ),
file('theBenchmark.p',goals) ).
fof(goals_neg,negated_conjecture,
~ ! [X0,X1] :
( ( test(X0)
& test(X1) )
=> one = addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1))) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(nnf_17,plain,
? [X0,X1] :
( addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1))) != one
& test(X0)
& test(X1) ),
inference(fof_nnf,[status(thm)],[goals_neg]) ).
fof(sk_goals_neg,plain,
( addition(multiplication(addition(sK1,c(sK1)),sK0),multiplication(addition(sK1,c(sK1)),c(sK0))) != one
& test(sK1)
& test(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK1),skolemize(X1,sK0)],[nnf_17]) ).
cnf(c_22,negated_conjecture,
test(sK0),
inference(split_conjunct,[status(thm)],[sk_goals_neg]) ).
cnf(c_23,negated_conjecture,
test(sK1),
inference(split_conjunct,[status(thm)],[sk_goals_neg]) ).
cnf(c_24,plain,
( complement(A,B)
| c(A) != B
| ~ test(A) ),
inference(clausify,[status(thm)],[test_3]) ).
cnf(c_33,negated_conjecture,
( complement(sK1,A)
| c(sK1) != A ),
inference(resolve,[status(thm)],[c_24,c_23]) ).
cnf(c_34,negated_conjecture,
( complement(sK0,A)
| c(sK0) != A ),
inference(resolve,[status(thm)],[c_24,c_22]) ).
cnf(c_39,plain,
addition(A,B) = addition(B,A),
inference(clausify,[status(thm)],[additive_commutativity]) ).
cnf(c_45,plain,
multiplication(one,A) = A,
inference(clausify,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_46,plain,
multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)),
inference(clausify,[status(thm)],[right_distributivity]) ).
cnf(c_47,plain,
addition(multiplication(A,B),multiplication(A,C)) = multiplication(A,addition(B,C)),
inference(copy,[status(thm)],[c_46]) ).
cnf(c_54,plain,
( addition(B,A) = one
| ~ complement(A,B) ),
inference(clausify,[status(thm)],[test_2]) ).
cnf(c_56,negated_conjecture,
addition(multiplication(addition(sK1,c(sK1)),sK0),multiplication(addition(sK1,c(sK1)),c(sK0))) != one,
inference(split_conjunct,[status(thm)],[sk_goals_neg]) ).
cnf(c_57,negated_conjecture,
multiplication(addition(sK1,c(sK1)),addition(sK0,c(sK0))) != one,
inference(paramod,[status(thm)],[c_47,c_56]) ).
cnf(c_64,plain,
complement(sK1,c(sK1)),
inference(xxres,[status(thm)],[c_33]) ).
cnf(c_65,plain,
complement(sK0,c(sK0)),
inference(xxres,[status(thm)],[c_34]) ).
cnf(c_119,plain,
addition(c(sK1),sK1) = one,
inference(resolve,[status(thm)],[c_64,c_54]) ).
cnf(c_111,plain,
addition(sK1,c(sK1)) = one,
inference(paramod,[status(thm)],[c_39,c_119]) ).
cnf(c_120,negated_conjecture,
multiplication(one,addition(sK0,c(sK0))) != one,
inference(paramod,[status(thm)],[c_111,c_57]) ).
cnf(c_117,negated_conjecture,
addition(sK0,c(sK0)) != one,
inference(paramod,[status(thm)],[c_45,c_120]) ).
cnf(c_121,plain,
addition(c(sK0),sK0) = one,
inference(resolve,[status(thm)],[c_65,c_54]) ).
cnf(c_122,plain,
addition(sK0,c(sK0)) = one,
inference(paramod,[status(thm)],[c_39,c_121]) ).
cnf(c_118,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_117,c_122]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE007+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.11/5.58 % Computer : n011.cluster.edu
% 0.11/5.58 % Model : x86_64 x86_64
% 0.11/5.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.58 % Memory : 8046.5625MB
% 0.11/5.58 % OS : Linux 6.8.0-71-generic
% 0.11/5.58 % CPULimit : 300
% 0.11/5.58 % WCLimit : 300
% 0.11/5.58 % DateTime : Fri Sep 25 19:12:05 UTC 2026
% 0.11/5.58 % CPUTime :
% 0.11/5.58 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/5.58 % Process 2647206 was started by sandbox on n011,
% 0.11/5.58 % Fri Sep 25 19:12:05 2026
% 0.11/5.58 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.11/5.59
% 0.11/5.59 % From the command line: assign(max_seconds, 300).
% 0.15/5.60
% 0.15/5.60 % SZS status Theorem for theBenchmark
% 0.15/5.60
% 0.15/5.60 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.15/5.60 % Length of proof is 23.
% 0.15/5.60 % Level of proof is 6.
% 0.15/5.60 % Maximum clause weight is 13.000.
% 0.15/5.60 % Given clauses 35.
% 0.15/5.60
% 0.15/5.60 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------