%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : KLE150+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 : n006.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:25 AM UTC 2026
% Result : Theorem 0.10s 0.47s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 28 unt; 0 def)
% Number of atoms : 28 ( 27 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 7 ( 7 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 30 ( 1 sgn 10 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(additive_commutativity,axiom,
! [A,B] : addition(A,B) = addition(B,A),
file('theBenchmark.p',additive_commutativity) ).
fof(multiplicative_associativity,axiom,
! [A,B,C] : multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C),
file('theBenchmark.p',multiplicative_associativity) ).
fof(left_annihilation,axiom,
! [A] : multiplication(zero,A) = zero,
file('theBenchmark.p',left_annihilation) ).
fof(star_unfold1,axiom,
! [A] : addition(one,multiplication(A,star(A))) = star(A),
file('theBenchmark.p',star_unfold1) ).
fof(infty_unfold1,axiom,
! [A] : strong_iteration(A) = addition(multiplication(A,strong_iteration(A)),one),
file('theBenchmark.p',infty_unfold1) ).
fof(goals,conjecture,
! [X0] : strong_iteration(multiplication(X0,zero)) = addition(one,multiplication(X0,zero)),
file('theBenchmark.p',goals) ).
fof(goals_neg,negated_conjecture,
~ ! [X0] : strong_iteration(multiplication(X0,zero)) = addition(one,multiplication(X0,zero)),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_20,plain,
addition(A,B) = addition(B,A),
inference(clausify,[status(thm)],[additive_commutativity]) ).
cnf(c_24,plain,
multiplication(multiplication(A,B),C) = multiplication(A,multiplication(B,C)),
inference(clausify,[status(thm)],[multiplicative_associativity]) ).
cnf(c_31,plain,
multiplication(zero,A) = zero,
inference(clausify,[status(thm)],[left_annihilation]) ).
cnf(c_32,plain,
star(A) = addition(one,multiplication(A,star(A))),
inference(clausify,[status(thm)],[star_unfold1]) ).
cnf(c_33,plain,
addition(one,multiplication(A,star(A))) = star(A),
inference(copy,[status(thm)],[c_32]) ).
cnf(c_38,plain,
strong_iteration(A) = addition(multiplication(A,strong_iteration(A)),one),
inference(clausify,[status(thm)],[infty_unfold1]) ).
cnf(c_777,plain,
strong_iteration(A) = addition(one,multiplication(A,strong_iteration(A))),
inference(paramod,[status(thm)],[c_20,c_38]) ).
cnf(c_39,plain,
addition(one,multiplication(A,strong_iteration(A))) = strong_iteration(A),
inference(copy,[status(thm)],[c_777]) ).
fof(nnf_19,plain,
? [X0] : strong_iteration(multiplication(X0,zero)) != addition(one,multiplication(X0,zero)),
inference(fof_nnf,[status(thm)],[goals_neg]) ).
fof(sk_goals_neg,plain,
strong_iteration(multiplication(sK0,zero)) != addition(one,multiplication(sK0,zero)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[nnf_19]) ).
cnf(c_45,negated_conjecture,
strong_iteration(multiplication(sK0,zero)) != addition(one,multiplication(sK0,zero)),
inference(split_conjunct,[status(thm)],[sk_goals_neg]) ).
cnf(c_46,negated_conjecture,
addition(one,multiplication(sK0,zero)) != strong_iteration(multiplication(sK0,zero)),
inference(copy,[status(thm)],[c_45]) ).
cnf(c_62,plain,
addition(one,multiplication(A,multiplication(B,star(multiplication(A,B))))) = star(multiplication(A,B)),
inference(paramod,[status(thm)],[c_24,c_33]) ).
cnf(c_71,plain,
addition(one,multiplication(A,multiplication(B,strong_iteration(multiplication(A,B))))) = strong_iteration(multiplication(A,B)),
inference(paramod,[status(thm)],[c_24,c_39]) ).
cnf(c_588,plain,
addition(one,multiplication(A,zero)) = star(multiplication(A,zero)),
inference(paramod,[status(thm)],[c_31,c_62]) ).
cnf(c_778,negated_conjecture,
star(multiplication(sK0,zero)) != strong_iteration(multiplication(sK0,zero)),
inference(paramod,[status(thm)],[c_588,c_46]) ).
cnf(c_612,negated_conjecture,
strong_iteration(multiplication(sK0,zero)) != star(multiplication(sK0,zero)),
inference(copy,[status(thm)],[c_778]) ).
cnf(c_779,plain,
addition(one,multiplication(A,zero)) = strong_iteration(multiplication(A,zero)),
inference(paramod,[status(thm)],[c_31,c_71]) ).
cnf(c_780,plain,
star(multiplication(A,zero)) = strong_iteration(multiplication(A,zero)),
inference(paramod,[status(thm)],[c_588,c_779]) ).
cnf(c_775,plain,
strong_iteration(multiplication(A,zero)) = star(multiplication(A,zero)),
inference(copy,[status(thm)],[c_780]) ).
cnf(c_776,plain,
$false,
inference(resolve,[status(thm)],[c_775,c_612]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE150+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.10/0.38 % Computer : n006.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Fri Sep 25 19:27:11 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.38 % Process 3548867 was started by sandbox on n006,
% 0.10/0.38 % Fri Sep 25 19:27:11 2026
% 0.10/0.38 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.38
% 0.10/0.38 % From the command line: assign(max_seconds, 300).
% 0.10/0.47
% 0.10/0.47 % SZS status Theorem for theBenchmark
% 0.10/0.47
% 0.10/0.47 % Proof 1 at 0.05 (+ 0.03) seconds.
% 0.10/0.47 % Length of proof is 21.
% 0.10/0.47 % Level of proof is 6.
% 0.10/0.47 % Maximum clause weight is 47.000.
% 0.10/0.47 % Given clauses 134.
% 0.10/0.47
% 0.10/0.47 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------