↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : GRP146-1 : 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 : n011.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 2.97s 3.23s
% Output   : Proof 2.97s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   34 (  25 unt;   0 nHn;  31 RR)
%            Number of literals    :   50 (  38 equ;  18 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;   3 con; 0-2 aty)
%            Number of variables   :   15 (   0 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(ax_lub1a_1,hypothesis,
    least_upper_bound(a,c) = c,
    file('theBenchmark.p',ax_lub1a_1) ).

cnf(ax_lub1a_2,hypothesis,
    least_upper_bound(b,c) = c,
    file('theBenchmark.p',ax_lub1a_2) ).

cnf(prove_ax_lub1a,negated_conjecture,
    least_upper_bound(least_upper_bound(a,b),c) != c,
    file('theBenchmark.p',prove_ax_lub1a) ).

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(least_upper_bound(a,b),c) != c,
    inference(start,[status(thm),parent(0:0)],[prove_ax_lub1a]) ).

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

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

cnf(t6,plain,
    ( c != c
    | least_upper_bound(a,b) != least_upper_bound(b,a)
    | least_upper_bound(least_upper_bound(a,b),c) = least_upper_bound(least_upper_bound(b,a),c) ),
    inference(extension,[status(thm),parent(t4:2)],[equality_7]) ).

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(t6:2)],[symmetry_of_lub]) ).

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

cnf(t10,plain,
    c = c,
    inference(extension,[status(thm),parent(t6:3)],[equality_1]) ).

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

cnf(t12,plain,
    ( least_upper_bound(b,least_upper_bound(a,c)) != least_upper_bound(least_upper_bound(b,a),c)
    | least_upper_bound(least_upper_bound(b,a),c) = least_upper_bound(b,least_upper_bound(a,c)) ),
    inference(extension,[status(thm),parent(t4:3)],[equality_2]) ).

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

cnf(t14,plain,
    least_upper_bound(b,least_upper_bound(a,c)) = least_upper_bound(least_upper_bound(b,a),c),
    inference(extension,[status(thm),parent(t12:2)],[associativity_of_lub]) ).

cnf(t15,plain,
    $false,
    inference(connection,[status(thm),parent(t14:1)],[t14:1,t12:2]) ).

cnf(t16,plain,
    ( least_upper_bound(b,c) != c
    | least_upper_bound(b,least_upper_bound(a,c)) != least_upper_bound(b,c)
    | least_upper_bound(b,least_upper_bound(a,c)) = c ),
    inference(extension,[status(thm),parent(t2:3)],[equality_3]) ).

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

cnf(t18,plain,
    ( least_upper_bound(a,c) != c
    | b != b
    | least_upper_bound(b,least_upper_bound(a,c)) = least_upper_bound(b,c) ),
    inference(extension,[status(thm),parent(t16:2)],[equality_7]) ).

cnf(t19,plain,
    $false,
    inference(connection,[status(thm),parent(t18:1)],[t18:1,t16:2]) ).

cnf(t20,plain,
    b = b,
    inference(extension,[status(thm),parent(t18:2)],[equality_1]) ).

cnf(t21,plain,
    $false,
    inference(connection,[status(thm),parent(t20:1)],[t20:1,t18:2]) ).

cnf(t22,plain,
    least_upper_bound(a,c) = c,
    inference(extension,[status(thm),parent(t18:3)],[ax_lub1a_1]) ).

cnf(t23,plain,
    $false,
    inference(connection,[status(thm),parent(t22:1)],[t22:1,t18:3]) ).

cnf(t24,plain,
    least_upper_bound(b,c) = c,
    inference(extension,[status(thm),parent(t16:3)],[ax_lub1a_2]) ).

cnf(t25,plain,
    $false,
    inference(connection,[status(thm),parent(t24:1)],[t24:1,t16:3]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP146-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.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.36  % Computer : n011.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sat Sep 19 08:52:09 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 2.97/3.23  % SZS status Unsatisfiable for theBenchmark
% 2.97/3.23  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------