%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : FLD025-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n012.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:30 AM UTC 2026
% Result : Unsatisfiable 0.12s 0.43s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of formulae : 38 ( 21 unt; 0 def)
% Number of atoms : 68 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 74 ( 44 ~; 30 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn 18 !; 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(associativity_multiplication_2,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4,VAR_5] :
( ~ product(VAR_3,VAR_5,VAR_2)
| ~ product(VAR_4,VAR_1,VAR_5)
| ~ product(VAR_3,VAR_4,VAR_0)
| product(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',associativity_multiplication_2) ).
cnf(c_7,plain,
( ~ product(D,F,C)
| ~ product(E,B,F)
| ~ product(D,E,A)
| product(A,B,C) ),
inference(clausify,[status(thm)],[associativity_multiplication_2]) ).
fof(existence_of_identity_multiplication,axiom,
! [VAR_0] :
( ~ defined(VAR_0)
| product(multiplicative_identity,VAR_0,VAR_0) ),
file('theBenchmark.p',existence_of_identity_multiplication) ).
cnf(c_8,plain,
( ~ defined(A)
| product(multiplicative_identity,A,A) ),
inference(clausify,[status(thm)],[existence_of_identity_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(totality_of_multiplication,axiom,
! [VAR_0,VAR_1] :
( ~ defined(VAR_1)
| ~ defined(VAR_0)
| product(VAR_0,VAR_1,multiply(VAR_0,VAR_1)) ),
file('theBenchmark.p',totality_of_multiplication) ).
cnf(c_20,plain,
( ~ defined(B)
| ~ defined(A)
| product(A,B,multiply(A,B)) ),
inference(clausify,[status(thm)],[totality_of_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(c_is_defined,axiom,
defined(c),
file('theBenchmark.p',c_is_defined) ).
cnf(c_29,plain,
defined(c),
inference(clausify,[status(thm)],[c_is_defined]) ).
fof(d_is_defined,axiom,
defined(d),
file('theBenchmark.p',d_is_defined) ).
cnf(c_30,plain,
defined(d),
inference(clausify,[status(thm)],[d_is_defined]) ).
fof(product_5,axiom,
product(multiplicative_identity,a,b),
file('theBenchmark.p',product_5) ).
cnf(c_31,plain,
product(multiplicative_identity,a,b),
inference(clausify,[status(thm)],[product_5]) ).
fof(product_6,axiom,
product(multiplicative_identity,c,d),
file('theBenchmark.p',product_6) ).
cnf(c_32,plain,
product(multiplicative_identity,c,d),
inference(clausify,[status(thm)],[product_6]) ).
fof(not_product_7,axiom,
~ product(d,b,multiply(a,c)),
file('theBenchmark.p',not_product_7) ).
cnf(c_33,plain,
~ product(d,b,multiply(a,c)),
inference(clausify,[status(thm)],[not_product_7]) ).
cnf(c_132,plain,
product(multiplicative_identity,c,c),
inference(resolve,[status(thm)],[c_29,c_8]) ).
cnf(c_148,plain,
product(multiplicative_identity,d,d),
inference(resolve,[status(thm)],[c_30,c_8]) ).
cnf(c_153,plain,
product(a,multiplicative_identity,b),
inference(resolve,[status(thm)],[c_31,c_10]) ).
cnf(c_168,plain,
~ product(b,d,multiply(a,c)),
inference(resolve,[status(thm)],[c_10,c_33]) ).
cnf(c_792,plain,
( ~ product(A,C,multiply(a,c))
| ~ product(B,d,C)
| ~ product(A,B,b) ),
inference(resolve,[status(thm)],[c_7,c_168]) ).
cnf(c_793,plain,
( ~ product(a,A,multiply(a,c))
| ~ product(multiplicative_identity,d,A) ),
inference(resolve,[status(thm)],[c_792,c_153]) ).
cnf(c_593,plain,
~ product(a,d,multiply(a,c)),
inference(resolve,[status(thm)],[c_793,c_148]) ).
cnf(c_794,plain,
( ~ product(B,C,multiply(a,c))
| ~ product(A,C,d)
| ~ product(a,A,B) ),
inference(resolve,[status(thm)],[c_6,c_593]) ).
cnf(c_795,plain,
( ~ product(b,A,multiply(a,c))
| ~ product(multiplicative_identity,A,d) ),
inference(resolve,[status(thm)],[c_794,c_153]) ).
cnf(c_667,plain,
~ product(b,c,multiply(a,c)),
inference(resolve,[status(thm)],[c_795,c_32]) ).
cnf(c_796,plain,
( ~ product(A,C,multiply(a,c))
| ~ product(B,c,C)
| ~ product(A,B,b) ),
inference(resolve,[status(thm)],[c_7,c_667]) ).
cnf(c_797,plain,
( ~ product(a,A,multiply(a,c))
| ~ product(multiplicative_identity,c,A) ),
inference(resolve,[status(thm)],[c_796,c_153]) ).
cnf(c_669,plain,
~ product(a,c,multiply(a,c)),
inference(resolve,[status(thm)],[c_797,c_132]) ).
cnf(c_798,plain,
( ~ defined(c)
| ~ defined(a) ),
inference(resolve,[status(thm)],[c_20,c_669]) ).
cnf(c_799,plain,
~ defined(a),
inference(resolve,[status(thm)],[c_798,c_29]) ).
cnf(c_791,plain,
$false,
inference(resolve,[status(thm)],[c_27,c_799]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : FLD025-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n012.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sun Sep 27 02:23:19 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.36 % Process 1962602 was started by sandbox2 on n012,
% 0.09/0.36 % Sun Sep 27 02:23:19 2026
% 0.09/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.12/0.36
% 0.12/0.36 % From the command line: assign(max_seconds, 300).
% 0.12/0.43
% 0.12/0.43 % SZS status Unsatisfiable for theBenchmark
% 0.12/0.43
% 0.12/0.43 % Proof 1 at 0.05 (+ 0.01) seconds.
% 0.12/0.43 % Length of proof is 19.
% 0.12/0.43 % Level of proof is 5.
% 0.12/0.43 % Maximum clause weight is 16.000.
% 0.12/0.43 % Given clauses 116.
% 0.12/0.43
% 0.12/0.43 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------