%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP543-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n018.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:30:19 AM UTC 2026
% Result : Unsatisfiable 0.15s 0.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 4
% Syntax : Number of formulae : 55 ( 55 unt; 0 def)
% Number of atoms : 55 ( 54 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 15 ( 15 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 84 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(single_axiom,axiom,
! [VAR_0,VAR_1,VAR_2] : divide(divide(identity,divide(divide(divide(VAR_0,VAR_1),VAR_2),VAR_0)),VAR_2) = VAR_1,
file('theBenchmark.p',single_axiom) ).
cnf(c_1,plain,
divide(divide(identity,divide(divide(divide(A,B),C),A)),C) = B,
inference(clausify,[status(thm)],[single_axiom]) ).
fof(multiply,axiom,
! [VAR_0,VAR_1] : multiply(VAR_0,VAR_1) = divide(VAR_0,divide(identity,VAR_1)),
file('theBenchmark.p',multiply) ).
cnf(c_2,plain,
multiply(A,B) = divide(A,divide(identity,B)),
inference(clausify,[status(thm)],[multiply]) ).
fof(identity,axiom,
! [VAR_0] : identity = divide(VAR_0,VAR_0),
file('theBenchmark.p',identity) ).
cnf(c_4,plain,
identity = divide(A,A),
inference(clausify,[status(thm)],[identity]) ).
cnf(c_5,plain,
divide(A,A) = identity,
inference(copy,[status(thm)],[c_4]) ).
fof(prove_these_axioms_3,axiom,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('theBenchmark.p',prove_these_axioms_3) ).
cnf(c_6,plain,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(clausify,[status(thm)],[prove_these_axioms_3]) ).
cnf(c_74,plain,
multiply(divide(a3,divide(identity,b3)),c3) != multiply(a3,multiply(b3,c3)),
inference(paramod,[status(thm)],[c_2,c_6]) ).
cnf(c_75,plain,
divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != multiply(a3,multiply(b3,c3)),
inference(paramod,[status(thm)],[c_2,c_74]) ).
cnf(c_76,plain,
divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != multiply(a3,divide(b3,divide(identity,c3))),
inference(paramod,[status(thm)],[c_2,c_75]) ).
cnf(c_7,plain,
divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3)))),
inference(paramod,[status(thm)],[c_2,c_76]) ).
cnf(c_8,plain,
divide(divide(identity,divide(divide(A,B),divide(identity,divide(divide(divide(C,A),D),C)))),B) = D,
inference(paramod,[status(thm)],[c_1,c_1]) ).
cnf(c_11,plain,
divide(divide(identity,divide(identity,A)),divide(A,B)) = B,
inference(paramod,[status(thm)],[c_5,c_1]) ).
cnf(c_17,plain,
divide(divide(identity,divide(divide(A,B),divide(identity,divide(identity,C)))),B) = divide(C,A),
inference(paramod,[status(thm)],[c_5,c_8]) ).
cnf(c_77,plain,
divide(divide(identity,identity),divide(divide(divide(A,identity),B),A)) = B,
inference(paramod,[status(thm)],[c_5,c_8]) ).
cnf(c_18,plain,
divide(identity,divide(divide(divide(A,identity),B),A)) = B,
inference(paramod,[status(thm)],[c_5,c_77]) ).
cnf(c_21,plain,
divide(divide(identity,divide(A,identity)),divide(B,A)) = divide(identity,B),
inference(paramod,[status(thm)],[c_11,c_1]) ).
cnf(c_78,plain,
multiply(divide(identity,divide(identity,identity)),A) = A,
inference(paramod,[status(thm)],[c_11,c_2]) ).
cnf(c_79,plain,
multiply(divide(identity,identity),A) = A,
inference(paramod,[status(thm)],[c_5,c_78]) ).
cnf(c_80,plain,
multiply(identity,A) = A,
inference(paramod,[status(thm)],[c_5,c_79]) ).
cnf(c_22,plain,
divide(identity,divide(identity,A)) = A,
inference(paramod,[status(thm)],[c_2,c_80]) ).
cnf(c_81,plain,
divide(divide(identity,divide(identity,A)),identity) = A,
inference(paramod,[status(thm)],[c_5,c_11]) ).
cnf(c_23,plain,
divide(A,identity) = A,
inference(paramod,[status(thm)],[c_22,c_81]) ).
cnf(c_24,plain,
divide(divide(identity,divide(divide(A,B),C)),B) = divide(C,A),
inference(paramod,[status(thm)],[c_22,c_17]) ).
cnf(c_26,plain,
divide(A,divide(A,B)) = B,
inference(paramod,[status(thm)],[c_22,c_11]) ).
cnf(c_27,plain,
divide(divide(identity,A),divide(B,A)) = divide(identity,B),
inference(paramod,[status(thm)],[c_23,c_21]) ).
cnf(c_29,plain,
divide(identity,divide(divide(A,B),A)) = B,
inference(paramod,[status(thm)],[c_23,c_18]) ).
cnf(c_33,plain,
divide(divide(identity,A),divide(identity,B)) = divide(B,A),
inference(paramod,[status(thm)],[c_27,c_26]) ).
cnf(c_34,plain,
divide(A,divide(B,divide(identity,A))) = divide(identity,B),
inference(paramod,[status(thm)],[c_26,c_27]) ).
cnf(c_36,plain,
divide(A,divide(identity,B)) = divide(B,divide(identity,A)),
inference(paramod,[status(thm)],[c_26,c_33]) ).
cnf(c_37,plain,
divide(divide(identity,A),B) = divide(divide(identity,B),A),
inference(paramod,[status(thm)],[c_26,c_33]) ).
cnf(c_38,plain,
divide(c3,divide(identity,divide(a3,divide(identity,b3)))) != divide(a3,divide(identity,divide(b3,divide(identity,c3)))),
inference(paramod,[status(thm)],[c_36,c_7]) ).
cnf(c_39,plain,
divide(divide(identity,A),divide(divide(B,A),C)) = divide(C,B),
inference(paramod,[status(thm)],[c_37,c_24]) ).
cnf(c_82,plain,
divide(identity,A) = divide(divide(B,A),B),
inference(paramod,[status(thm)],[c_29,c_26]) ).
cnf(c_40,plain,
divide(divide(A,B),A) = divide(identity,B),
inference(copy,[status(thm)],[c_82]) ).
cnf(c_41,plain,
divide(identity,divide(A,B)) = divide(B,A),
inference(paramod,[status(thm)],[c_26,c_29]) ).
cnf(c_83,plain,
divide(c3,divide(divide(identity,b3),a3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3)))),
inference(paramod,[status(thm)],[c_41,c_38]) ).
cnf(c_84,plain,
divide(c3,divide(divide(identity,a3),b3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3)))),
inference(paramod,[status(thm)],[c_37,c_83]) ).
cnf(c_85,plain,
divide(c3,divide(divide(identity,a3),b3)) != divide(a3,divide(divide(identity,c3),b3)),
inference(paramod,[status(thm)],[c_41,c_84]) ).
cnf(c_42,plain,
divide(c3,divide(divide(identity,a3),b3)) != divide(a3,divide(divide(identity,b3),c3)),
inference(paramod,[status(thm)],[c_37,c_85]) ).
cnf(c_47,plain,
divide(divide(identity,A),divide(B,C)) = divide(divide(C,B),A),
inference(paramod,[status(thm)],[c_41,c_33]) ).
cnf(c_48,plain,
divide(divide(A,divide(B,C)),C) = divide(A,B),
inference(paramod,[status(thm)],[c_47,c_39]) ).
cnf(c_54,plain,
divide(divide(A,divide(identity,B)),C) = divide(A,divide(C,B)),
inference(paramod,[status(thm)],[c_40,c_48]) ).
cnf(c_86,plain,
divide(A,divide(B,C)) = divide(identity,divide(B,divide(C,divide(identity,A)))),
inference(paramod,[status(thm)],[c_48,c_34]) ).
cnf(c_87,plain,
divide(A,divide(B,C)) = divide(divide(C,divide(identity,A)),B),
inference(paramod,[status(thm)],[c_41,c_86]) ).
cnf(c_58,plain,
divide(A,divide(B,C)) = divide(C,divide(B,A)),
inference(paramod,[status(thm)],[c_54,c_87]) ).
cnf(c_61,plain,
divide(b3,divide(divide(identity,a3),c3)) != divide(a3,divide(divide(identity,b3),c3)),
inference(paramod,[status(thm)],[c_58,c_42]) ).
cnf(c_88,plain,
divide(identity,divide(A,divide(B,C))) = divide(divide(B,A),C),
inference(paramod,[status(thm)],[c_58,c_41]) ).
cnf(c_65,plain,
divide(divide(A,B),C) = divide(divide(A,C),B),
inference(paramod,[status(thm)],[c_41,c_88]) ).
cnf(c_89,plain,
divide(b3,divide(divide(identity,a3),c3)) != divide(c3,divide(divide(identity,b3),a3)),
inference(paramod,[status(thm)],[c_58,c_61]) ).
cnf(c_90,plain,
divide(b3,divide(divide(identity,a3),c3)) != divide(c3,divide(divide(identity,a3),b3)),
inference(paramod,[status(thm)],[c_65,c_89]) ).
cnf(c_91,plain,
divide(b3,divide(divide(identity,a3),c3)) != divide(b3,divide(divide(identity,a3),c3)),
inference(paramod,[status(thm)],[c_58,c_90]) ).
cnf(c_73,plain,
$false,
inference(copy,[status(thm)],[c_91]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : GRP543-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.41 % Computer : n018.cluster.edu
% 0.15/0.41 % Model : x86_64 x86_64
% 0.15/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.41 % Memory : 8046.5625MB
% 0.15/0.41 % OS : Linux 6.8.0-71-generic
% 0.15/0.41 % CPULimit : 300
% 0.15/0.41 % WCLimit : 300
% 0.15/0.41 % DateTime : Fri Sep 25 15:01:21 UTC 2026
% 0.15/0.42 % CPUTime :
% 0.15/0.42 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.15/0.42 % Process 2246698 was started by sandbox on n018,
% 0.15/0.42 % Fri Sep 25 15:01:21 2026
% 0.15/0.42 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.15/0.42
% 0.15/0.42 % From the command line: assign(max_seconds, 300).
% 0.15/0.45
% 0.15/0.45 % Assigning unary symbol inverse kb_weight 0 and highest precedence (8).
% 0.15/0.45
% 0.15/0.45 % SZS status Unsatisfiable for theBenchmark
% 0.15/0.45
% 0.15/0.45 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.15/0.45 % Length of proof is 33.
% 0.15/0.45 % Level of proof is 13.
% 0.15/0.45 % Maximum clause weight is 94.000.
% 0.15/0.45 % Given clauses 22.
% 0.15/0.45
% 0.15/0.45 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------