%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : BOO021-1 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n014.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:13:59 AM UTC 2026
% Result : Unsatisfiable 120.31s 120.61s
% Output : Proof 120.92s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(multiply_add,axiom,
multiply(add(X,Y),Y) = Y,
file('theBenchmark.p',multiply_add) ).
cnf(multiply_add_property,axiom,
multiply(X,add(Y,Z)) = add(multiply(Y,X),multiply(Z,X)),
file('theBenchmark.p',multiply_add_property) ).
cnf(additive_inverse,axiom,
add(X,inverse(X)) = n1,
file('theBenchmark.p',additive_inverse) ).
cnf(add_multiply,axiom,
add(multiply(X,Y),Y) = Y,
file('theBenchmark.p',add_multiply) ).
cnf(add_multiply_property,axiom,
add(X,multiply(Y,Z)) = multiply(add(Y,X),add(Z,X)),
file('theBenchmark.p',add_multiply_property) ).
cnf(multiplicative_inverse,axiom,
multiply(X,inverse(X)) = n0,
file('theBenchmark.p',multiplicative_inverse) ).
cnf(prove_commutativity_of_multiply,negated_conjecture,
multiply(b,a) != multiply(a,b),
file('theBenchmark.p',prove_commutativity_of_multiply) ).
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,
( add(Eq_x_0,Eq_x_1) = add(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(equality_6,axiom,
( inverse(Eq_x_0) = inverse(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : BOO021-1 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.03 This is a CNF_UNS_RFO_PEQ_UEQ problem
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n014.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 20 13:36:34 UTC 2026
% 0.14/0.36 % CPUTime :
% 120.31/120.61 % SZS status Unsatisfiable for theBenchmark
% 120.31/120.61 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------