%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP555-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 : n019.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:21 AM UTC 2026
% Result : Unsatisfiable 0.14s 0.39s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of formulae : 42 ( 42 unt; 0 def)
% Number of atoms : 42 ( 41 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 10 ( 10 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 96 ( 0 sgn 5 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(single_axiom,axiom,
! [VAR_0,VAR_1,VAR_2] : divide(divide(VAR_0,inverse(divide(VAR_1,divide(VAR_0,VAR_2)))),VAR_2) = VAR_1,
file('theBenchmark.p',single_axiom) ).
cnf(c_1,plain,
divide(divide(A,inverse(divide(B,divide(A,C)))),C) = B,
inference(clausify,[status(thm)],[single_axiom]) ).
fof(multiply,axiom,
! [VAR_0,VAR_1] : multiply(VAR_0,VAR_1) = divide(VAR_0,inverse(VAR_1)),
file('theBenchmark.p',multiply) ).
cnf(c_2,plain,
multiply(A,B) = divide(A,inverse(B)),
inference(clausify,[status(thm)],[multiply]) ).
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_3,plain,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(clausify,[status(thm)],[prove_these_axioms_3]) ).
cnf(c_63,plain,
multiply(divide(a3,inverse(b3)),c3) != multiply(a3,multiply(b3,c3)),
inference(paramod,[status(thm)],[c_2,c_3]) ).
cnf(c_64,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != multiply(a3,multiply(b3,c3)),
inference(paramod,[status(thm)],[c_2,c_63]) ).
cnf(c_65,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != multiply(a3,divide(b3,inverse(c3))),
inference(paramod,[status(thm)],[c_2,c_64]) ).
cnf(c_4,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference(paramod,[status(thm)],[c_2,c_65]) ).
cnf(c_5,plain,
divide(divide(divide(A,inverse(divide(B,divide(A,C)))),inverse(divide(D,B))),C) = D,
inference(paramod,[status(thm)],[c_1,c_1]) ).
cnf(c_66,plain,
divide(divide(A,inverse(B)),C) = divide(D,inverse(divide(B,divide(D,divide(A,C))))),
inference(paramod,[status(thm)],[c_1,c_1]) ).
cnf(c_6,plain,
divide(A,inverse(divide(B,divide(A,divide(C,D))))) = divide(divide(C,inverse(B)),D),
inference(copy,[status(thm)],[c_66]) ).
cnf(c_10,plain,
divide(A,inverse(divide(B,A))) = B,
inference(paramod,[status(thm)],[c_1,c_5]) ).
cnf(c_12,plain,
divide(divide(divide(A,inverse(divide(B,divide(A,C)))),inverse(D)),C) = divide(divide(E,inverse(divide(F,divide(E,B)))),inverse(divide(D,F))),
inference(paramod,[status(thm)],[c_5,c_5]) ).
cnf(c_67,plain,
divide(A,inverse(B)) = divide(C,inverse(divide(B,divide(C,A)))),
inference(paramod,[status(thm)],[c_1,c_10]) ).
cnf(c_14,plain,
divide(A,inverse(divide(B,divide(A,C)))) = divide(C,inverse(B)),
inference(copy,[status(thm)],[c_67]) ).
cnf(c_68,plain,
divide(A,inverse(B)) = divide(divide(C,inverse(divide(D,divide(C,A)))),inverse(divide(B,D))),
inference(paramod,[status(thm)],[c_5,c_10]) ).
cnf(c_69,plain,
divide(A,inverse(B)) = divide(divide(A,inverse(D)),inverse(divide(B,D))),
inference(paramod,[status(thm)],[c_14,c_68]) ).
cnf(c_17,plain,
divide(divide(A,inverse(B)),inverse(divide(C,B))) = divide(A,inverse(C)),
inference(copy,[status(thm)],[c_69]) ).
cnf(c_18,plain,
divide(inverse(divide(A,B)),inverse(A)) = B,
inference(paramod,[status(thm)],[c_10,c_10]) ).
cnf(c_70,plain,
divide(divide(divide(C,inverse(B)),inverse(D)),C) = divide(divide(E,inverse(divide(F,divide(E,B)))),inverse(divide(D,F))),
inference(paramod,[status(thm)],[c_14,c_12]) ).
cnf(c_71,plain,
divide(divide(divide(C,inverse(B)),inverse(D)),C) = divide(divide(B,inverse(F)),inverse(divide(D,F))),
inference(paramod,[status(thm)],[c_14,c_70]) ).
cnf(c_19,plain,
divide(divide(divide(A,inverse(B)),inverse(C)),A) = divide(B,inverse(C)),
inference(paramod,[status(thm)],[c_17,c_71]) ).
cnf(c_72,plain,
divide(divide(C,D),inverse(B)) = divide(divide(C,inverse(B)),D),
inference(paramod,[status(thm)],[c_14,c_6]) ).
cnf(c_21,plain,
divide(divide(A,inverse(B)),C) = divide(divide(A,C),inverse(B)),
inference(copy,[status(thm)],[c_72]) ).
cnf(c_73,plain,
divide(inverse(A),inverse(B)) = inverse(divide(A,B)),
inference(paramod,[status(thm)],[c_18,c_10]) ).
cnf(c_22,plain,
inverse(divide(A,B)) = divide(inverse(A),inverse(B)),
inference(copy,[status(thm)],[c_73]) ).
cnf(c_30,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(b3),inverse(inverse(c3)))),
inference(paramod,[status(thm)],[c_22,c_4]) ).
cnf(c_74,plain,
divide(divide(divide(A,inverse(B)),inverse(C)),A) = divide(C,inverse(B)),
inference(paramod,[status(thm)],[c_21,c_19]) ).
cnf(c_49,plain,
divide(A,inverse(B)) = divide(B,inverse(A)),
inference(paramod,[status(thm)],[c_19,c_74]) ).
cnf(c_75,plain,
divide(c3,inverse(divide(a3,inverse(b3)))) != divide(a3,divide(inverse(b3),inverse(inverse(c3)))),
inference(paramod,[status(thm)],[c_49,c_30]) ).
cnf(c_54,plain,
divide(c3,divide(inverse(a3),inverse(inverse(b3)))) != divide(a3,divide(inverse(b3),inverse(inverse(c3)))),
inference(paramod,[status(thm)],[c_22,c_75]) ).
cnf(c_76,plain,
divide(A,inverse(divide(B,inverse(C)))) = divide(divide(B,inverse(A)),inverse(C)),
inference(paramod,[status(thm)],[c_49,c_21]) ).
cnf(c_77,plain,
divide(A,divide(inverse(B),inverse(inverse(C)))) = divide(divide(B,inverse(A)),inverse(C)),
inference(paramod,[status(thm)],[c_22,c_76]) ).
cnf(c_60,plain,
divide(divide(A,inverse(B)),inverse(C)) = divide(B,divide(inverse(A),inverse(inverse(C)))),
inference(copy,[status(thm)],[c_77]) ).
cnf(c_78,plain,
divide(divide(A,inverse(B)),inverse(C)) = divide(divide(C,inverse(A)),inverse(B)),
inference(paramod,[status(thm)],[c_49,c_21]) ).
cnf(c_79,plain,
divide(B,divide(inverse(A),inverse(inverse(C)))) = divide(divide(C,inverse(A)),inverse(B)),
inference(paramod,[status(thm)],[c_60,c_78]) ).
cnf(c_80,plain,
divide(B,divide(inverse(A),inverse(inverse(C)))) = divide(A,divide(inverse(C),inverse(inverse(B)))),
inference(paramod,[status(thm)],[c_60,c_79]) ).
cnf(c_61,plain,
divide(A,divide(inverse(B),inverse(inverse(C)))) = divide(C,divide(inverse(A),inverse(inverse(B)))),
inference(copy,[status(thm)],[c_80]) ).
cnf(c_81,plain,
divide(a3,divide(inverse(b3),inverse(inverse(c3)))) != divide(c3,divide(inverse(a3),inverse(inverse(b3)))),
inference(copy,[status(thm)],[c_54]) ).
cnf(c_62,plain,
$false,
inference(resolve,[status(thm)],[c_61,c_81]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP555-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n019.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Fri Sep 25 15:00:03 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.37 % Process 3044661 was started by sandbox on n019,
% 0.10/0.37 % Fri Sep 25 15:00:03 2026
% 0.10/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.14/0.37
% 0.14/0.37 % From the command line: assign(max_seconds, 300).
% 0.14/0.39
% 0.14/0.39 % Assigning unary symbol inverse kb_weight 0 and highest precedence (7).
% 0.14/0.39
% 0.14/0.39 % SZS status Unsatisfiable for theBenchmark
% 0.14/0.39
% 0.14/0.39 % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.14/0.39 % Length of proof is 20.
% 0.14/0.39 % Level of proof is 9.
% 0.14/0.39 % Maximum clause weight is 87.000.
% 0.14/0.39 % Given clauses 13.
% 0.14/0.39
% 0.14/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------