%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : KLE055+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:13 AM UTC 2026
% Result : Theorem 0.19s 0.46s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 37 ( 33 unt; 0 def)
% Number of atoms : 41 ( 40 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 9 ( 5 ~; 0 |; 2 &)
% ( 0 <=>; 2 =>; 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 46 ( 5 sgn 14 !; 1 ?)
% 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(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(left_distributivity,axiom,
! [A,B,C] : multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)),
file('theBenchmark.p',left_distributivity) ).
fof(domain1,axiom,
! [X0] : addition(X0,multiplication(domain(X0),X0)) = multiplication(domain(X0),X0),
file('theBenchmark.p',domain1) ).
fof(domain3,axiom,
! [X0] : addition(domain(X0),one) = one,
file('theBenchmark.p',domain3) ).
fof(goals,conjecture,
! [X0] :
( addition(X0,one) = one
=> addition(X0,domain(X0)) = domain(X0) ),
file('theBenchmark.p',goals) ).
fof(goals_neg,negated_conjecture,
~ ! [X0] :
( addition(X0,one) = one
=> addition(X0,domain(X0)) = domain(X0) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(nnf_17,plain,
? [X0] :
( domain(X0) != addition(X0,domain(X0))
& addition(X0,one) = one ),
inference(fof_nnf,[status(thm)],[goals_neg]) ).
fof(sk_goals_neg,plain,
( domain(sK0) != addition(sK0,domain(sK0))
& addition(sK0,one) = one ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[nnf_17]) ).
cnf(c_20,negated_conjecture,
domain(sK0) != addition(sK0,domain(sK0)),
inference(split_conjunct,[status(thm)],[sk_goals_neg]) ).
cnf(c_21,negated_conjecture,
addition(sK0,domain(sK0)) != domain(sK0),
inference(copy,[status(thm)],[c_20]) ).
cnf(c_22,negated_conjecture,
addition(sK0,one) = one,
inference(split_conjunct,[status(thm)],[sk_goals_neg]) ).
cnf(c_25,plain,
addition(domain(A),one) = one,
inference(clausify,[status(thm)],[domain3]) ).
cnf(c_27,plain,
multiplication(domain(A),A) = addition(A,multiplication(domain(A),A)),
inference(clausify,[status(thm)],[domain1]) ).
cnf(c_28,plain,
addition(A,multiplication(domain(A),A)) = multiplication(domain(A),A),
inference(copy,[status(thm)],[c_27]) ).
cnf(c_31,plain,
multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)),
inference(clausify,[status(thm)],[left_distributivity]) ).
cnf(c_32,plain,
addition(multiplication(A,B),multiplication(C,B)) = multiplication(addition(A,C),B),
inference(copy,[status(thm)],[c_31]) ).
cnf(c_33,plain,
multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)),
inference(clausify,[status(thm)],[right_distributivity]) ).
cnf(c_34,plain,
addition(multiplication(A,B),multiplication(A,C)) = multiplication(A,addition(B,C)),
inference(copy,[status(thm)],[c_33]) ).
cnf(c_35,plain,
multiplication(one,A) = A,
inference(clausify,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_36,plain,
multiplication(A,one) = A,
inference(clausify,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_41,plain,
addition(A,B) = addition(B,A),
inference(clausify,[status(thm)],[additive_commutativity]) ).
cnf(c_42,plain,
addition(one,domain(A)) = one,
inference(paramod,[status(thm)],[c_41,c_25]) ).
cnf(c_43,negated_conjecture,
addition(one,sK0) = one,
inference(paramod,[status(thm)],[c_41,c_22]) ).
cnf(c_101,plain,
addition(multiplication(one,A),multiplication(domain(B),A)) = multiplication(one,A),
inference(paramod,[status(thm)],[c_42,c_32]) ).
cnf(c_102,plain,
addition(A,multiplication(domain(B),A)) = multiplication(one,A),
inference(paramod,[status(thm)],[c_35,c_101]) ).
cnf(c_75,plain,
addition(A,multiplication(domain(B),A)) = A,
inference(paramod,[status(thm)],[c_35,c_102]) ).
cnf(c_103,plain,
A = multiplication(domain(A),A),
inference(paramod,[status(thm)],[c_75,c_28]) ).
cnf(c_78,plain,
multiplication(domain(A),A) = A,
inference(copy,[status(thm)],[c_103]) ).
cnf(c_104,plain,
addition(multiplication(A,one),multiplication(A,sK0)) = multiplication(A,one),
inference(paramod,[status(thm)],[c_43,c_34]) ).
cnf(c_105,plain,
addition(A,multiplication(A,sK0)) = multiplication(A,one),
inference(paramod,[status(thm)],[c_36,c_104]) ).
cnf(c_80,plain,
addition(A,multiplication(A,sK0)) = A,
inference(paramod,[status(thm)],[c_36,c_105]) ).
cnf(c_106,plain,
addition(domain(sK0),sK0) = domain(sK0),
inference(paramod,[status(thm)],[c_78,c_80]) ).
cnf(c_99,plain,
addition(sK0,domain(sK0)) = domain(sK0),
inference(paramod,[status(thm)],[c_41,c_106]) ).
cnf(c_100,plain,
$false,
inference(resolve,[status(thm)],[c_99,c_21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : KLE055+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.19/0.42 % Computer : n013.cluster.edu
% 0.19/0.42 % Model : x86_64 x86_64
% 0.19/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.42 % Memory : 8046.5625MB
% 0.19/0.42 % OS : Linux 6.8.0-71-generic
% 0.19/0.42 % CPULimit : 300
% 0.19/0.42 % WCLimit : 300
% 0.19/0.42 % DateTime : Fri Sep 25 19:18:21 UTC 2026
% 0.19/0.43 % CPUTime :
% 0.19/0.43 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.19/0.43 % Process 989313 was started by sandbox2 on n013,
% 0.19/0.43 % Fri Sep 25 19:18:21 2026
% 0.19/0.43 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.19/0.43
% 0.19/0.43 % From the command line: assign(max_seconds, 300).
% 0.19/0.46
% 0.19/0.46 % SZS status Theorem for theBenchmark
% 0.19/0.46
% 0.19/0.46 % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.19/0.46 % Length of proof is 28.
% 0.19/0.46 % Level of proof is 6.
% 0.19/0.46 % Maximum clause weight is 19.000.
% 0.19/0.46 % Given clauses 25.
% 0.19/0.46
% 0.19/0.46 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------