%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : KLE070+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 : n015.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:15 AM UTC 2026
% Result : Theorem 0.17s 0.47s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 22 ( 22 unt; 0 def)
% Number of atoms : 22 ( 21 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 8 ( 8 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 28 ( 2 sgn 11 !; 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(domain3,axiom,
! [X0] : addition(domain(X0),one) = one,
file('theBenchmark.p',domain3) ).
fof(goals,conjecture,
! [X0,X1] : addition(domain(X0),multiplication(domain(X0),domain(X1))) = domain(X0),
file('theBenchmark.p',goals) ).
fof(goals_neg,negated_conjecture,
~ ! [X0,X1] : addition(domain(X0),multiplication(domain(X0),domain(X1))) = domain(X0),
inference(assume_negation,[status(cth)],[goals]) ).
fof(nnf_17,plain,
? [X0,X1] : domain(X0) != addition(domain(X0),multiplication(domain(X0),domain(X1))),
inference(fof_nnf,[status(thm)],[goals_neg]) ).
fof(sk_goals_neg,plain,
domain(sK0) != addition(domain(sK0),multiplication(domain(sK0),domain(sK1))),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[nnf_17]) ).
cnf(c_20,negated_conjecture,
domain(sK0) != addition(domain(sK0),multiplication(domain(sK0),domain(sK1))),
inference(split_conjunct,[status(thm)],[sk_goals_neg]) ).
cnf(c_21,negated_conjecture,
addition(domain(sK0),multiplication(domain(sK0),domain(sK1))) != domain(sK0),
inference(copy,[status(thm)],[c_20]) ).
cnf(c_24,plain,
addition(domain(A),one) = one,
inference(clausify,[status(thm)],[domain3]) ).
cnf(c_32,plain,
multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)),
inference(clausify,[status(thm)],[right_distributivity]) ).
cnf(c_33,plain,
addition(multiplication(A,B),multiplication(A,C)) = multiplication(A,addition(B,C)),
inference(copy,[status(thm)],[c_32]) ).
cnf(c_35,plain,
multiplication(A,one) = A,
inference(clausify,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_40,plain,
addition(A,B) = addition(B,A),
inference(clausify,[status(thm)],[additive_commutativity]) ).
cnf(c_41,plain,
addition(one,domain(A)) = one,
inference(paramod,[status(thm)],[c_40,c_24]) ).
cnf(c_64,plain,
addition(A,multiplication(A,B)) = multiplication(A,addition(one,B)),
inference(paramod,[status(thm)],[c_35,c_33]) ).
cnf(c_61,plain,
multiplication(A,addition(one,B)) = addition(A,multiplication(A,B)),
inference(copy,[status(thm)],[c_64]) ).
cnf(c_65,negated_conjecture,
multiplication(domain(sK0),addition(one,domain(sK1))) != domain(sK0),
inference(paramod,[status(thm)],[c_61,c_21]) ).
cnf(c_66,negated_conjecture,
multiplication(domain(sK0),one) != domain(sK0),
inference(paramod,[status(thm)],[c_41,c_65]) ).
cnf(c_67,negated_conjecture,
domain(sK0) != domain(sK0),
inference(paramod,[status(thm)],[c_35,c_66]) ).
cnf(c_63,negated_conjecture,
$false,
inference(copy,[status(thm)],[c_67]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : KLE070+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.43 % Computer : n015.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.44 % CPULimit : 300
% 0.17/0.44 % WCLimit : 300
% 0.17/0.44 % DateTime : Fri Sep 25 19:22:57 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/0.44 % Process 2043189 was started by sandbox2 on n015,
% 0.17/0.44 % Fri Sep 25 19:22:57 2026
% 0.17/0.44 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.17/0.45
% 0.17/0.45 % From the command line: assign(max_seconds, 300).
% 0.17/0.47
% 0.17/0.47 % SZS status Theorem for theBenchmark
% 0.17/0.47
% 0.17/0.47 % Proof 1 at 0.00 (+ 0.01) seconds.
% 0.17/0.47 % Length of proof is 15.
% 0.17/0.47 % Level of proof is 4.
% 0.17/0.47 % Maximum clause weight is 13.000.
% 0.17/0.47 % Given clauses 11.
% 0.17/0.47
% 0.17/0.47 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------