%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : GRP176-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 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 : n007.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:32 AM UTC 2026
% Result : Unsatisfiable 0.09s 0.40s
% Output : Proof 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 13 unt; 0 nHn; 14 RR)
% Number of literals : 25 ( 20 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 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 : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(monotony_lub1,axiom,
multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)),
file('GRP004-2.ax',monotony_lub1) ).
cnf(monotony_lub2,axiom,
multiply(least_upper_bound(Y,Z),X) = least_upper_bound(multiply(Y,X),multiply(Z,X)),
file('GRP004-2.ax',monotony_lub2) ).
cnf(prove_p07,negated_conjecture,
multiply(c,multiply(least_upper_bound(a,b),d)) != least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d))),
file('theBenchmark.p',prove_p07) ).
cnf(equality_1,axiom,
Eq_x_0 = Eq_x_0,
theory(equality,[reflexivity]) ).
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,
( 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(c,multiply(least_upper_bound(a,b),d)) != least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d))),
inference(start,[status(thm),parent(0:0)],[prove_p07]) ).
cnf(t2,plain,
( multiply(c,least_upper_bound(multiply(a,d),multiply(b,d))) != least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d)))
| multiply(c,multiply(least_upper_bound(a,b),d)) != multiply(c,least_upper_bound(multiply(a,d),multiply(b,d)))
| multiply(c,multiply(least_upper_bound(a,b),d)) = least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d))) ),
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,
( multiply(least_upper_bound(a,b),d) != least_upper_bound(multiply(a,d),multiply(b,d))
| c != c
| multiply(c,multiply(least_upper_bound(a,b),d)) = multiply(c,least_upper_bound(multiply(a,d),multiply(b,d))) ),
inference(extension,[status(thm),parent(t2:2)],[equality_4]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
c = c,
inference(extension,[status(thm),parent(t4:2)],[equality_1]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
multiply(least_upper_bound(a,b),d) = least_upper_bound(multiply(a,d),multiply(b,d)),
inference(extension,[status(thm),parent(t4:3)],[monotony_lub2]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t4:3]) ).
cnf(t10,plain,
multiply(c,least_upper_bound(multiply(a,d),multiply(b,d))) = least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d))),
inference(extension,[status(thm),parent(t2:3)],[monotony_lub1]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t2:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP176-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 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.38 % Computer : n007.cluster.edu
% 0.09/0.38 % Model : x86_64 x86_64
% 0.09/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.38 % Memory : 8046.5625MB
% 0.09/0.38 % OS : Linux 6.8.0-71-generic
% 0.09/0.38 % CPULimit : 300
% 0.09/0.38 % WCLimit : 300
% 0.09/0.38 % DateTime : Sat Sep 19 08:53:53 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.09/0.40 % SZS status Unsatisfiable for theBenchmark
% 0.09/0.40 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------