%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : KLE022+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 : n013.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.14s 5.60s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 25 ( 16 unt; 0 def)
% Number of atoms : 38 ( 24 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 24 ( 11 ~; 4 |; 4 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 1 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 : 30 ( 0 sgn 14 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(additive_commutativity,axiom,
! [A,B] : addition(A,B) = addition(B,A),
file('theBenchmark.p',additive_commutativity) ).
fof(multiplicative_right_identity,axiom,
! [A] : multiplication(A,one) = A,
file('theBenchmark.p',multiplicative_right_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(X1)
=> X0 = addition(multiplication(X0,X1),multiplication(X0,c(X1))) ),
file('theBenchmark.p',goals) ).
fof(goals_neg,negated_conjecture,
~ ! [X0,X1] :
( test(X1)
=> X0 = addition(multiplication(X0,X1),multiplication(X0,c(X1))) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(nnf_17,plain,
? [X0,X1] :
( addition(multiplication(X0,X1),multiplication(X0,c(X1))) != X0
& test(X1) ),
inference(fof_nnf,[status(thm)],[goals_neg]) ).
fof(sk_goals_neg,plain,
( addition(multiplication(sK1,sK0),multiplication(sK1,c(sK0))) != 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,plain,
( complement(A,B)
| c(A) != B
| ~ test(A) ),
inference(clausify,[status(thm)],[test_3]) ).
cnf(c_31,negated_conjecture,
( complement(sK0,A)
| c(sK0) != A ),
inference(resolve,[status(thm)],[c_23,c_22]) ).
cnf(c_35,plain,
addition(A,B) = addition(B,A),
inference(clausify,[status(thm)],[additive_commutativity]) ).
cnf(c_40,plain,
multiplication(A,one) = A,
inference(clausify,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_42,plain,
multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)),
inference(clausify,[status(thm)],[right_distributivity]) ).
cnf(c_43,plain,
addition(multiplication(A,B),multiplication(A,C)) = multiplication(A,addition(B,C)),
inference(copy,[status(thm)],[c_42]) ).
cnf(c_50,plain,
( addition(B,A) = one
| ~ complement(A,B) ),
inference(clausify,[status(thm)],[test_2]) ).
cnf(c_52,negated_conjecture,
addition(multiplication(sK1,sK0),multiplication(sK1,c(sK0))) != sK1,
inference(split_conjunct,[status(thm)],[sk_goals_neg]) ).
cnf(c_53,negated_conjecture,
multiplication(sK1,addition(sK0,c(sK0))) != sK1,
inference(paramod,[status(thm)],[c_43,c_52]) ).
cnf(c_59,plain,
complement(sK0,c(sK0)),
inference(xxres,[status(thm)],[c_31]) ).
cnf(c_107,plain,
addition(c(sK0),sK0) = one,
inference(resolve,[status(thm)],[c_59,c_50]) ).
cnf(c_100,plain,
addition(sK0,c(sK0)) = one,
inference(paramod,[status(thm)],[c_35,c_107]) ).
cnf(c_108,negated_conjecture,
multiplication(sK1,one) != sK1,
inference(paramod,[status(thm)],[c_100,c_53]) ).
cnf(c_109,negated_conjecture,
sK1 != sK1,
inference(paramod,[status(thm)],[c_40,c_108]) ).
cnf(c_106,negated_conjecture,
$false,
inference(copy,[status(thm)],[c_109]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE022+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/5.58 % Computer : n013.cluster.edu
% 0.09/5.58 % Model : x86_64 x86_64
% 0.09/5.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.58 % Memory : 8046.5625MB
% 0.09/5.58 % OS : Linux 6.8.0-71-generic
% 0.09/5.58 % CPULimit : 300
% 0.09/5.58 % WCLimit : 300
% 0.09/5.58 % DateTime : Fri Sep 25 19:14:00 UTC 2026
% 0.09/5.58 % CPUTime :
% 0.09/5.58 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/5.58 % Process 979668 was started by sandbox2 on n013,
% 0.09/5.58 % Fri Sep 25 19:14:00 2026
% 0.09/5.58 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/5.59
% 0.09/5.59 % From the command line: assign(max_seconds, 300).
% 0.14/5.60
% 0.14/5.60 % SZS status Theorem for theBenchmark
% 0.14/5.60
% 0.14/5.60 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.14/5.60 % Length of proof is 19.
% 0.14/5.60 % Level of proof is 5.
% 0.14/5.60 % Maximum clause weight is 13.000.
% 0.14/5.60 % Given clauses 31.
% 0.14/5.60
% 0.14/5.60 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------