%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : FLD033-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n016.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:11:33 AM UTC 2026
% Result : Unsatisfiable 0.12s 0.38s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 22 ( 13 unt; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 37 ( 21 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 28 ( 4 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(associativity_multiplication_1,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4,VAR_5] :
( ~ product(VAR_4,VAR_5,VAR_2)
| ~ product(VAR_3,VAR_5,VAR_1)
| ~ product(VAR_0,VAR_3,VAR_4)
| product(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',associativity_multiplication_1) ).
cnf(c_6,plain,
( ~ product(E,F,C)
| ~ product(D,F,B)
| ~ product(A,D,E)
| product(A,B,C) ),
inference(clausify,[status(thm)],[associativity_multiplication_1]) ).
fof(existence_of_inverse_multiplication,axiom,
! [VAR_0] :
( ~ defined(VAR_0)
| sum(additive_identity,VAR_0,additive_identity)
| product(multiplicative_inverse(VAR_0),VAR_0,multiplicative_identity) ),
file('theBenchmark.p',existence_of_inverse_multiplication) ).
cnf(c_9,plain,
( ~ defined(A)
| sum(additive_identity,A,additive_identity)
| product(multiplicative_inverse(A),A,multiplicative_identity) ),
inference(clausify,[status(thm)],[existence_of_inverse_multiplication]) ).
fof(commutativity_multiplication,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ product(VAR_1,VAR_0,VAR_2)
| product(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',commutativity_multiplication) ).
cnf(c_10,plain,
( ~ product(B,A,C)
| product(A,B,C) ),
inference(clausify,[status(thm)],[commutativity_multiplication]) ).
fof(a_is_defined,axiom,
defined(a),
file('theBenchmark.p',a_is_defined) ).
cnf(c_27,plain,
defined(a),
inference(clausify,[status(thm)],[a_is_defined]) ).
fof(not_sum_3,axiom,
~ sum(additive_identity,a,additive_identity),
file('theBenchmark.p',not_sum_3) ).
cnf(c_29,plain,
~ sum(additive_identity,a,additive_identity),
inference(clausify,[status(thm)],[not_sum_3]) ).
fof(product_4,axiom,
product(m,a,a),
file('theBenchmark.p',product_4) ).
cnf(c_30,plain,
product(m,a,a),
inference(clausify,[status(thm)],[product_4]) ).
fof(not_product_5,axiom,
~ product(multiplicative_identity,m,multiplicative_identity),
file('theBenchmark.p',not_product_5) ).
cnf(c_31,plain,
~ product(multiplicative_identity,m,multiplicative_identity),
inference(clausify,[status(thm)],[not_product_5]) ).
cnf(c_37,plain,
( ~ product(C,D,B)
| ~ product(A,C,C)
| product(A,B,B) ),
inference(factor,[status(thm)],[c_6]) ).
cnf(c_165,plain,
( sum(additive_identity,a,additive_identity)
| product(multiplicative_inverse(a),a,multiplicative_identity) ),
inference(resolve,[status(thm)],[c_27,c_9]) ).
cnf(c_97,plain,
product(multiplicative_inverse(a),a,multiplicative_identity),
inference(resolve,[status(thm)],[c_29,c_165]) ).
cnf(c_135,plain,
~ product(m,multiplicative_identity,multiplicative_identity),
inference(resolve,[status(thm)],[c_10,c_31]) ).
cnf(c_166,plain,
( ~ product(A,B,multiplicative_identity)
| ~ product(m,A,A) ),
inference(resolve,[status(thm)],[c_37,c_135]) ).
cnf(c_162,plain,
~ product(a,A,multiplicative_identity),
inference(resolve,[status(thm)],[c_166,c_30]) ).
cnf(c_163,plain,
~ product(A,a,multiplicative_identity),
inference(resolve,[status(thm)],[c_10,c_162]) ).
cnf(c_164,plain,
$false,
inference(resolve,[status(thm)],[c_163,c_97]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : FLD033-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n016.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sun Sep 27 02:30:16 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.36 % Process 2226516 was started by sandbox on n016,
% 0.08/0.36 % Sun Sep 27 02:30:16 2026
% 0.08/0.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.08/0.36
% 0.08/0.36 % From the command line: assign(max_seconds, 300).
% 0.12/0.38
% 0.12/0.38 % SZS status Unsatisfiable for theBenchmark
% 0.12/0.38
% 0.12/0.38 % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.12/0.38 % Length of proof is 13.
% 0.12/0.38 % Level of proof is 4.
% 0.12/0.38 % Maximum clause weight is 16.000.
% 0.12/0.38 % Given clauses 58.
% 0.12/0.38
% 0.12/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------