%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : GRP162-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 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 : n020.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:29 AM UTC 2026
% Result : Unsatisfiable 15.35s 15.69s
% Output : Proof 15.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 10
% Syntax : Number of clauses : 53 ( 39 unt; 0 nHn; 47 RR)
% Number of literals : 78 ( 57 equ; 27 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 21 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(symmetry_of_lub,axiom,
least_upper_bound(X,Y) = least_upper_bound(Y,X),
file('GRP004-2.ax',symmetry_of_lub) ).
cnf(associativity_of_lub,axiom,
least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z),
file('GRP004-2.ax',associativity_of_lub) ).
cnf(glb_absorbtion,axiom,
greatest_lower_bound(X,least_upper_bound(X,Y)) = X,
file('GRP004-2.ax',glb_absorbtion) ).
cnf(ax_transa_1,hypothesis,
least_upper_bound(a,b) = b,
file('theBenchmark.p',ax_transa_1) ).
cnf(ax_transa_2,hypothesis,
least_upper_bound(b,c) = c,
file('theBenchmark.p',ax_transa_2) ).
cnf(prove_ax_transa,negated_conjecture,
least_upper_bound(a,c) != c,
file('theBenchmark.p',prove_ax_transa) ).
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_7,axiom,
( least_upper_bound(Eq_x_0,Eq_x_1) = least_upper_bound(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,
least_upper_bound(a,c) != c,
inference(start,[status(thm),parent(0:0)],[prove_ax_transa]) ).
cnf(t2,plain,
( least_upper_bound(a,least_upper_bound(c,b)) != c
| least_upper_bound(a,c) != least_upper_bound(a,least_upper_bound(c,b))
| least_upper_bound(a,c) = c ),
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,
( c != least_upper_bound(c,b)
| a != a
| least_upper_bound(a,c) = least_upper_bound(a,least_upper_bound(c,b)) ),
inference(extension,[status(thm),parent(t2:2)],[equality_7]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
( greatest_lower_bound(a,least_upper_bound(a,U_319)) != a
| a != greatest_lower_bound(a,least_upper_bound(a,U_319))
| a = a ),
inference(extension,[status(thm),parent(t4:2)],[equality_3]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
( greatest_lower_bound(a,least_upper_bound(a,U_319)) != a
| a = greatest_lower_bound(a,least_upper_bound(a,U_319)) ),
inference(extension,[status(thm),parent(t6:2)],[equality_2]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).
cnf(t10,plain,
greatest_lower_bound(a,least_upper_bound(a,U_319)) = a,
inference(extension,[status(thm),parent(t8:2)],[glb_absorbtion]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
cnf(t12,plain,
greatest_lower_bound(a,least_upper_bound(a,U_319)) = a,
inference(extension,[status(thm),parent(t6:3)],[glb_absorbtion]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t6:3]) ).
cnf(t14,plain,
( least_upper_bound(b,c) != least_upper_bound(c,b)
| c != least_upper_bound(b,c)
| c = least_upper_bound(c,b) ),
inference(extension,[status(thm),parent(t4:3)],[equality_3]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t4:3]) ).
cnf(t16,plain,
( least_upper_bound(b,c) != c
| c = least_upper_bound(b,c) ),
inference(extension,[status(thm),parent(t14:2)],[equality_2]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t14:2]) ).
cnf(t18,plain,
least_upper_bound(b,c) = c,
inference(extension,[status(thm),parent(t16:2)],[ax_transa_2]) ).
cnf(t19,plain,
$false,
inference(connection,[status(thm),parent(t18:1)],[t18:1,t16:2]) ).
cnf(t20,plain,
least_upper_bound(b,c) = least_upper_bound(c,b),
inference(extension,[status(thm),parent(t14:3)],[symmetry_of_lub]) ).
cnf(t21,plain,
$false,
inference(connection,[status(thm),parent(t20:1)],[t20:1,t14:3]) ).
cnf(t22,plain,
( least_upper_bound(least_upper_bound(a,b),c) != c
| least_upper_bound(a,least_upper_bound(c,b)) != least_upper_bound(least_upper_bound(a,b),c)
| least_upper_bound(a,least_upper_bound(c,b)) = c ),
inference(extension,[status(thm),parent(t2:3)],[equality_3]) ).
cnf(t23,plain,
$false,
inference(connection,[status(thm),parent(t22:1)],[t22:1,t2:3]) ).
cnf(t24,plain,
( least_upper_bound(a,least_upper_bound(b,c)) != least_upper_bound(least_upper_bound(a,b),c)
| least_upper_bound(a,least_upper_bound(c,b)) != least_upper_bound(a,least_upper_bound(b,c))
| least_upper_bound(a,least_upper_bound(c,b)) = least_upper_bound(least_upper_bound(a,b),c) ),
inference(extension,[status(thm),parent(t22:2)],[equality_3]) ).
cnf(t25,plain,
$false,
inference(connection,[status(thm),parent(t24:1)],[t24:1,t22:2]) ).
cnf(t26,plain,
( least_upper_bound(c,b) != least_upper_bound(b,c)
| a != a
| least_upper_bound(a,least_upper_bound(c,b)) = least_upper_bound(a,least_upper_bound(b,c)) ),
inference(extension,[status(thm),parent(t24:2)],[equality_7]) ).
cnf(t27,plain,
$false,
inference(connection,[status(thm),parent(t26:1)],[t26:1,t24:2]) ).
cnf(t28,plain,
a = a,
inference(extension,[status(thm),parent(t26:2)],[equality_1]) ).
cnf(t29,plain,
$false,
inference(connection,[status(thm),parent(t28:1)],[t28:1,t26:2]) ).
cnf(t30,plain,
least_upper_bound(c,b) = least_upper_bound(b,c),
inference(extension,[status(thm),parent(t26:3)],[symmetry_of_lub]) ).
cnf(t31,plain,
$false,
inference(connection,[status(thm),parent(t30:1)],[t30:1,t26:3]) ).
cnf(t32,plain,
least_upper_bound(a,least_upper_bound(b,c)) = least_upper_bound(least_upper_bound(a,b),c),
inference(extension,[status(thm),parent(t24:3)],[associativity_of_lub]) ).
cnf(t33,plain,
$false,
inference(connection,[status(thm),parent(t32:1)],[t32:1,t24:3]) ).
cnf(t34,plain,
( least_upper_bound(b,c) != c
| least_upper_bound(least_upper_bound(a,b),c) != least_upper_bound(b,c)
| least_upper_bound(least_upper_bound(a,b),c) = c ),
inference(extension,[status(thm),parent(t22:3)],[equality_3]) ).
cnf(t35,plain,
$false,
inference(connection,[status(thm),parent(t34:1)],[t34:1,t22:3]) ).
cnf(t36,plain,
( c != c
| least_upper_bound(a,b) != b
| least_upper_bound(least_upper_bound(a,b),c) = least_upper_bound(b,c) ),
inference(extension,[status(thm),parent(t34:2)],[equality_7]) ).
cnf(t37,plain,
$false,
inference(connection,[status(thm),parent(t36:1)],[t36:1,t34:2]) ).
cnf(t38,plain,
least_upper_bound(a,b) = b,
inference(extension,[status(thm),parent(t36:2)],[ax_transa_1]) ).
cnf(t39,plain,
$false,
inference(connection,[status(thm),parent(t38:1)],[t38:1,t36:2]) ).
cnf(t40,plain,
c = c,
inference(extension,[status(thm),parent(t36:3)],[equality_1]) ).
cnf(t41,plain,
$false,
inference(connection,[status(thm),parent(t40:1)],[t40:1,t36:3]) ).
cnf(t42,plain,
least_upper_bound(b,c) = c,
inference(extension,[status(thm),parent(t34:3)],[ax_transa_2]) ).
cnf(t43,plain,
$false,
inference(connection,[status(thm),parent(t42:1)],[t42:1,t34:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP162-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.03 This is a CNF_UNS_RFO_PEQ_UEQ problem
% 0.00/0.03 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.34 % Computer : n020.cluster.edu
% 0.07/0.34 % Model : x86_64 x86_64
% 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34 % Memory : 8046.5625MB
% 0.07/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/0.34 % CPULimit : 300
% 0.07/0.34 % WCLimit : 300
% 0.07/0.34 % DateTime : Sat Sep 19 08:53:32 UTC 2026
% 0.07/0.34 % CPUTime :
% 15.35/15.69 % SZS status Unsatisfiable for theBenchmark
% 15.35/15.69 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------