↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : GRP189-2 : 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 : n003.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:34 AM UTC 2026

% Result   : Unsatisfiable 0.12s 0.39s
% Output   : Proof 0.12s
% 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    :    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   :   12 (   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(glb_absorbtion,axiom,
    greatest_lower_bound(X,least_upper_bound(X,Y)) = X,
    file('GRP004-2.ax',glb_absorbtion) ).

cnf(prove_p38b,negated_conjecture,
    greatest_lower_bound(b,least_upper_bound(a,b)) != b,
    file('theBenchmark.p',prove_p38b) ).

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_6,axiom,
    ( greatest_lower_bound(Eq_x_0,Eq_x_1) = greatest_lower_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,
    greatest_lower_bound(b,least_upper_bound(a,b)) != b,
    inference(start,[status(thm),parent(0:0)],[prove_p38b]) ).

cnf(t2,plain,
    ( greatest_lower_bound(b,least_upper_bound(b,a)) != b
    | greatest_lower_bound(b,least_upper_bound(a,b)) != greatest_lower_bound(b,least_upper_bound(b,a))
    | greatest_lower_bound(b,least_upper_bound(a,b)) = b ),
    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(a,b) != least_upper_bound(b,a)
    | b != b
    | greatest_lower_bound(b,least_upper_bound(a,b)) = greatest_lower_bound(b,least_upper_bound(b,a)) ),
    inference(extension,[status(thm),parent(t2:2)],[equality_6]) ).

cnf(t5,plain,
    $false,
    inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).

cnf(t6,plain,
    b = b,
    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,
    least_upper_bound(a,b) = least_upper_bound(b,a),
    inference(extension,[status(thm),parent(t4:3)],[symmetry_of_lub]) ).

cnf(t9,plain,
    $false,
    inference(connection,[status(thm),parent(t8:1)],[t8:1,t4:3]) ).

cnf(t10,plain,
    greatest_lower_bound(b,least_upper_bound(b,a)) = b,
    inference(extension,[status(thm),parent(t2:3)],[glb_absorbtion]) ).

cnf(t11,plain,
    $false,
    inference(connection,[status(thm),parent(t10:1)],[t10:1,t2:3]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP189-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/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n003.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Sat Sep 19 09:00:59 UTC 2026
% 0.12/0.36  % CPUTime  : 
% 0.12/0.39  % SZS status Unsatisfiable for theBenchmark
% 0.12/0.39  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------