%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : GRP536-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n004.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 : Thu Sep 24 08:41:56 AM UTC 2026
% Result : Unsatisfiable 273.80s 279.09s
% Output : Proof 273.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 8
% Syntax : Number of clauses : 33 ( 23 unt; 0 nHn; 30 RR)
% Number of literals : 51 ( 39 equ; 20 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(A,divide(divide(A,B),C)),B) = C,
file('theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(A,B) = divide(A,divide(divide(C,C),B)),
file('theBenchmark.p',multiply) ).
cnf(prove_these_axioms_4,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('theBenchmark.p',prove_these_axioms_4) ).
cnf(equality_1,axiom,
Eq_x_0 = Eq_x_0,
theory(equality,[reflexivity]) ).
cnf(equality_2,axiom,
( Eq_x_1 = Eq_x_0
| Eq_x_0 != Eq_x_1 ),
theory(equality,[symmetry]) ).
cnf(equality_3,axiom,
( Eq_x_0 = Eq_x_2
| Eq_x_1 != Eq_x_2
| Eq_x_0 != Eq_x_1 ),
theory(equality,[transitivity]) ).
cnf(equality_4,axiom,
( divide(Eq_x_0,Eq_x_1) = divide(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_5,axiom,
( multiply(Eq_x_0,Eq_x_1) = multiply(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(t1,plain,
multiply(a,b) != multiply(b,a),
inference(start,[status(thm),parent(0:0)],[prove_these_axioms_4]) ).
cnf(t2,plain,
( multiply(a,b) != divide(divide(multiply(b,a),divide(divide(multiply(b,a),divide(divide(multiply(b,a),multiply(b,a)),b)),multiply(b,a))),divide(divide(multiply(b,a),multiply(b,a)),b))
| divide(divide(multiply(b,a),divide(divide(multiply(b,a),divide(divide(multiply(b,a),multiply(b,a)),b)),multiply(b,a))),divide(divide(multiply(b,a),multiply(b,a)),b)) != multiply(b,a)
| multiply(a,b) = multiply(b,a) ),
inference(extension,[status(thm),parent(t1:1)],[equality_3]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
divide(divide(multiply(b,a),divide(divide(multiply(b,a),divide(divide(multiply(b,a),multiply(b,a)),b)),multiply(b,a))),divide(divide(multiply(b,a),multiply(b,a)),b)) = multiply(b,a),
inference(extension,[status(thm),parent(t2:2)],[single_axiom]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
( multiply(a,b) != multiply(divide(multiply(b,a),divide(divide(multiply(b,a),divide(divide(multiply(b,a),multiply(b,a)),b)),multiply(b,a))),b)
| multiply(divide(multiply(b,a),divide(divide(multiply(b,a),divide(divide(multiply(b,a),multiply(b,a)),b)),multiply(b,a))),b) != divide(divide(multiply(b,a),divide(divide(multiply(b,a),divide(divide(multiply(b,a),multiply(b,a)),b)),multiply(b,a))),divide(divide(multiply(b,a),multiply(b,a)),b))
| multiply(a,b) = divide(divide(multiply(b,a),divide(divide(multiply(b,a),divide(divide(multiply(b,a),multiply(b,a)),b)),multiply(b,a))),divide(divide(multiply(b,a),multiply(b,a)),b)) ),
inference(extension,[status(thm),parent(t2:3)],[equality_3]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
cnf(t8,plain,
multiply(divide(multiply(b,a),divide(divide(multiply(b,a),divide(divide(multiply(b,a),multiply(b,a)),b)),multiply(b,a))),b) = divide(divide(multiply(b,a),divide(divide(multiply(b,a),divide(divide(multiply(b,a),multiply(b,a)),b)),multiply(b,a))),divide(divide(multiply(b,a),multiply(b,a)),b)),
inference(extension,[status(thm),parent(t6:2)],[multiply]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).
cnf(t10,plain,
( b != b
| a != divide(multiply(b,a),divide(divide(multiply(b,a),divide(divide(multiply(b,a),multiply(b,a)),b)),multiply(b,a)))
| multiply(a,b) = multiply(divide(multiply(b,a),divide(divide(multiply(b,a),divide(divide(multiply(b,a),multiply(b,a)),b)),multiply(b,a))),b) ),
inference(extension,[status(thm),parent(t6:3)],[equality_5]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t6:3]) ).
cnf(t12,plain,
( divide(multiply(b,a),divide(divide(multiply(b,a),divide(divide(multiply(b,a),multiply(b,a)),b)),multiply(b,a))) != a
| a = divide(multiply(b,a),divide(divide(multiply(b,a),divide(divide(multiply(b,a),multiply(b,a)),b)),multiply(b,a))) ),
inference(extension,[status(thm),parent(t10:2)],[equality_2]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t10:2]) ).
cnf(t14,plain,
( divide(multiply(b,a),divide(divide(multiply(b,a),divide(divide(multiply(b,a),multiply(b,a)),b)),multiply(b,a))) != divide(divide(b,divide(divide(b,b),a)),b)
| divide(divide(b,divide(divide(b,b),a)),b) != a
| divide(multiply(b,a),divide(divide(multiply(b,a),divide(divide(multiply(b,a),multiply(b,a)),b)),multiply(b,a))) = a ),
inference(extension,[status(thm),parent(t12:2)],[equality_3]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t12:2]) ).
cnf(t16,plain,
divide(divide(b,divide(divide(b,b),a)),b) = a,
inference(extension,[status(thm),parent(t14:2)],[single_axiom]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t14:2]) ).
cnf(t18,plain,
( divide(divide(multiply(b,a),divide(divide(multiply(b,a),multiply(b,a)),b)),multiply(b,a)) != b
| multiply(b,a) != divide(b,divide(divide(b,b),a))
| divide(multiply(b,a),divide(divide(multiply(b,a),divide(divide(multiply(b,a),multiply(b,a)),b)),multiply(b,a))) = divide(divide(b,divide(divide(b,b),a)),b) ),
inference(extension,[status(thm),parent(t14:3)],[equality_4]) ).
cnf(t19,plain,
$false,
inference(connection,[status(thm),parent(t18:1)],[t18:1,t14:3]) ).
cnf(t20,plain,
multiply(b,a) = divide(b,divide(divide(b,b),a)),
inference(extension,[status(thm),parent(t18:2)],[multiply]) ).
cnf(t21,plain,
$false,
inference(connection,[status(thm),parent(t20:1)],[t20:1,t18:2]) ).
cnf(t22,plain,
divide(divide(multiply(b,a),divide(divide(multiply(b,a),multiply(b,a)),b)),multiply(b,a)) = b,
inference(extension,[status(thm),parent(t18:3)],[single_axiom]) ).
cnf(t23,plain,
$false,
inference(connection,[status(thm),parent(t22:1)],[t22:1,t18:3]) ).
cnf(t24,plain,
b = b,
inference(extension,[status(thm),parent(t10:3)],[equality_1]) ).
cnf(t25,plain,
$false,
inference(connection,[status(thm),parent(t24:1)],[t24:1,t10:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP536-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.03 This is a CNF_UNS_RFO_PEQ_UEQ problem
% 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/5.37 % Computer : n004.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Sat Sep 19 09:41:12 UTC 2026
% 0.10/5.37 % CPUTime :
% 273.80/279.09 % SZS status Unsatisfiable for theBenchmark
% 273.80/279.09 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------