%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : GRP142-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 : n001.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:27 AM UTC 2026
% Result : Unsatisfiable 0.09s 0.40s
% Output : Proof 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 9 unt; 0 nHn; 9 RR)
% Number of literals : 15 ( 12 equ; 6 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 7 ( 1 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(lub_absorbtion,axiom,
least_upper_bound(X,greatest_lower_bound(X,Y)) = X,
file('GRP004-2.ax',lub_absorbtion) ).
cnf(prove_ax_glb2a,negated_conjecture,
least_upper_bound(greatest_lower_bound(a,b),a) != a,
file('theBenchmark.p',prove_ax_glb2a) ).
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(t1,plain,
least_upper_bound(greatest_lower_bound(a,b),a) != a,
inference(start,[status(thm),parent(0:0)],[prove_ax_glb2a]) ).
cnf(t2,plain,
( least_upper_bound(a,greatest_lower_bound(a,b)) != a
| least_upper_bound(greatest_lower_bound(a,b),a) != least_upper_bound(a,greatest_lower_bound(a,b))
| least_upper_bound(greatest_lower_bound(a,b),a) = 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,
least_upper_bound(greatest_lower_bound(a,b),a) = least_upper_bound(a,greatest_lower_bound(a,b)),
inference(extension,[status(thm),parent(t2:2)],[symmetry_of_lub]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
least_upper_bound(a,greatest_lower_bound(a,b)) = a,
inference(extension,[status(thm),parent(t2:3)],[lub_absorbtion]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP142-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.09/0.37 % Computer : n001.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sat Sep 19 08:57:23 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.40 % SZS status Unsatisfiable for theBenchmark
% 0.09/0.40 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------