↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : GRA120-1 : TPTP v9.3.1. Released v9.3.0.
% 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:40:57 AM UTC 2026

% Result   : Unsatisfiable 189.88s 190.14s
% Output   : Proof 189.93s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(rsym,axiom,
    ( r(Y,X)
    | ~ r(X,Y) ),
    file('theBenchmark.p',rsym) ).

cnf(rno3cl,axiom,
    ( ~ r(Y,Z)
    | ~ r(X,Z)
    | ~ r(X,Y)
    | Y = Z
    | X = Z
    | X = Y ),
    file('theBenchmark.p',rno3cl) ).

cnf(rno4acl,axiom,
    ( r(Z,W)
    | r(Y,W)
    | r(X,W)
    | r(Y,Z)
    | r(X,Z)
    | r(X,Y)
    | Z = W
    | Y = W
    | X = W
    | Y = Z
    | X = Z
    | X = Y ),
    file('theBenchmark.p',rno4acl) ).

cnf(v0nv1,axiom,
    v0 != v1,
    file('theBenchmark.p',v0nv1) ).

cnf(v0nv2,axiom,
    v0 != v2,
    file('theBenchmark.p',v0nv2) ).

cnf(v1nv2,axiom,
    v1 != v2,
    file('theBenchmark.p',v1nv2) ).

cnf(v0nv3,axiom,
    v0 != v3,
    file('theBenchmark.p',v0nv3) ).

cnf(v1nv3,axiom,
    v1 != v3,
    file('theBenchmark.p',v1nv3) ).

cnf(v2nv3,axiom,
    v2 != v3,
    file('theBenchmark.p',v2nv3) ).

cnf(v0nv4,axiom,
    v0 != v4,
    file('theBenchmark.p',v0nv4) ).

cnf(v1nv4,axiom,
    v1 != v4,
    file('theBenchmark.p',v1nv4) ).

cnf(v2nv4,axiom,
    v2 != v4,
    file('theBenchmark.p',v2nv4) ).

cnf(v3nv4,axiom,
    v3 != v4,
    file('theBenchmark.p',v3nv4) ).

cnf(v0nv5,axiom,
    v0 != v5,
    file('theBenchmark.p',v0nv5) ).

cnf(v1nv5,axiom,
    v1 != v5,
    file('theBenchmark.p',v1nv5) ).

cnf(v2nv5,axiom,
    v2 != v5,
    file('theBenchmark.p',v2nv5) ).

cnf(v3nv5,axiom,
    v3 != v5,
    file('theBenchmark.p',v3nv5) ).

cnf(v4nv5,axiom,
    v4 != v5,
    file('theBenchmark.p',v4nv5) ).

cnf(v0nv6,axiom,
    v0 != v6,
    file('theBenchmark.p',v0nv6) ).

cnf(v1nv6,axiom,
    v1 != v6,
    file('theBenchmark.p',v1nv6) ).

cnf(v2nv6,axiom,
    v2 != v6,
    file('theBenchmark.p',v2nv6) ).

cnf(v3nv6,axiom,
    v3 != v6,
    file('theBenchmark.p',v3nv6) ).

cnf(v4nv6,axiom,
    v4 != v6,
    file('theBenchmark.p',v4nv6) ).

cnf(v5nv6,axiom,
    v5 != v6,
    file('theBenchmark.p',v5nv6) ).

cnf(v0nv7,axiom,
    v0 != v7,
    file('theBenchmark.p',v0nv7) ).

cnf(v1nv7,axiom,
    v1 != v7,
    file('theBenchmark.p',v1nv7) ).

cnf(v2nv7,axiom,
    v2 != v7,
    file('theBenchmark.p',v2nv7) ).

cnf(v3nv7,axiom,
    v3 != v7,
    file('theBenchmark.p',v3nv7) ).

cnf(v4nv7,axiom,
    v4 != v7,
    file('theBenchmark.p',v4nv7) ).

cnf(v5nv7,axiom,
    v5 != v7,
    file('theBenchmark.p',v5nv7) ).

cnf(v6nv7,axiom,
    v6 != v7,
    file('theBenchmark.p',v6nv7) ).

cnf(v0nv8,axiom,
    v0 != v8,
    file('theBenchmark.p',v0nv8) ).

cnf(v1nv8,axiom,
    v1 != v8,
    file('theBenchmark.p',v1nv8) ).

cnf(v2nv8,axiom,
    v2 != v8,
    file('theBenchmark.p',v2nv8) ).

cnf(v3nv8,axiom,
    v3 != v8,
    file('theBenchmark.p',v3nv8) ).

cnf(v4nv8,axiom,
    v4 != v8,
    file('theBenchmark.p',v4nv8) ).

cnf(v5nv8,axiom,
    v5 != v8,
    file('theBenchmark.p',v5nv8) ).

cnf(v6nv8,axiom,
    v6 != v8,
    file('theBenchmark.p',v6nv8) ).

cnf(v7nv8,axiom,
    v7 != v8,
    file('theBenchmark.p',v7nv8) ).

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_4,axiom,
    ( r(Eq_y_0,Eq_y_1)
    | ~ r(Eq_x_0,Eq_x_1)
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_predicates]) ).

cnf(sat_proved,plain,
    $false,
    inference(cadical,[status(thm)],[]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRA120-1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.03  This is a CNF_UNS_EPR_SEQ_NHN 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.10/0.37  % Computer : n003.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sat Sep 19 08:25:29 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 189.88/190.14  % SZS status Unsatisfiable for theBenchmark
% 189.88/190.14  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------