↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SYN039-1 : TPTP v9.3.1. Released v1.0.0.
% 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 09:09:16 AM UTC 2026

% Result   : Unsatisfiable 58.36s 58.66s
% Output   : Proof 58.36s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_1,negated_conjecture,
    ( ~ q(X1,f1(X,X1))
    | ~ s(X,f1(X,X1))
    | p(f1(X,X1),f1(X,X1)) ),
    file('theBenchmark.p',c_1) ).

cnf(c_2,negated_conjecture,
    ( q(f1(X,X1),Z1)
    | ~ s(X,f1(X,X1))
    | p(f1(X,X1),f1(X,X1)) ),
    file('theBenchmark.p',c_2) ).

cnf(c_3,negated_conjecture,
    ( ~ s(X1,X1)
    | ~ s(X,f1(X,X1))
    | p(f1(X,X1),f1(X,X1)) ),
    file('theBenchmark.p',c_3) ).

cnf(c_4,negated_conjecture,
    ( ~ q(X1,f1(X,X1))
    | s(f1(X,X1),Z)
    | p(f1(X,X1),f1(X,X1)) ),
    file('theBenchmark.p',c_4) ).

cnf(c_5,negated_conjecture,
    ( q(f1(X,X1),Z1)
    | s(f1(X,X1),Z)
    | p(f1(X,X1),f1(X,X1)) ),
    file('theBenchmark.p',c_5) ).

cnf(c_6,negated_conjecture,
    ( ~ s(X1,X1)
    | s(f1(X,X1),Z)
    | p(f1(X,X1),f1(X,X1)) ),
    file('theBenchmark.p',c_6) ).

cnf(c_7,negated_conjecture,
    ( ~ q(X1,f1(X,X1))
    | ~ q(Z1,Z1)
    | p(f1(X,X1),f1(X,X1)) ),
    file('theBenchmark.p',c_7) ).

cnf(c_8,negated_conjecture,
    ( q(f1(X,X1),Z1)
    | ~ q(Z1,Z1)
    | p(f1(X,X1),f1(X,X1)) ),
    file('theBenchmark.p',c_8) ).

cnf(c_9,negated_conjecture,
    ( ~ s(X1,X1)
    | ~ q(Z1,Z1)
    | p(f1(X,X1),f1(X,X1)) ),
    file('theBenchmark.p',c_9) ).

cnf(c_10,negated_conjecture,
    ( ~ q(X1,f1(X,X1))
    | ~ s(X,f1(X,X1))
    | ~ p(X,X) ),
    file('theBenchmark.p',c_10) ).

cnf(c_11,negated_conjecture,
    ( q(f1(X,X1),Z1)
    | ~ s(X,f1(X,X1))
    | ~ p(X,X) ),
    file('theBenchmark.p',c_11) ).

cnf(c_12,negated_conjecture,
    ( ~ s(X1,X1)
    | ~ s(X,f1(X,X1))
    | ~ p(X,X) ),
    file('theBenchmark.p',c_12) ).

cnf(c_13,negated_conjecture,
    ( ~ q(X1,f1(X,X1))
    | s(f1(X,X1),Z)
    | ~ p(X,X) ),
    file('theBenchmark.p',c_13) ).

cnf(c_14,negated_conjecture,
    ( q(f1(X,X1),Z1)
    | s(f1(X,X1),Z)
    | ~ p(X,X) ),
    file('theBenchmark.p',c_14) ).

cnf(c_15,negated_conjecture,
    ( ~ s(X1,X1)
    | s(f1(X,X1),Z)
    | ~ p(X,X) ),
    file('theBenchmark.p',c_15) ).

cnf(c_16,negated_conjecture,
    ( ~ q(X1,f1(X,X1))
    | ~ q(Z1,Z1)
    | ~ p(X,X) ),
    file('theBenchmark.p',c_16) ).

cnf(c_17,negated_conjecture,
    ( q(f1(X,X1),Z1)
    | ~ q(Z1,Z1)
    | ~ p(X,X) ),
    file('theBenchmark.p',c_17) ).

cnf(c_18,negated_conjecture,
    ( ~ s(X1,X1)
    | ~ q(Z1,Z1)
    | ~ p(X,X) ),
    file('theBenchmark.p',c_18) ).

cnf(c_19,negated_conjecture,
    ( ~ q(X1,f1(X,X1))
    | ~ s(X,f1(X,X1))
    | s(Z,X) ),
    file('theBenchmark.p',c_19) ).

cnf(c_20,negated_conjecture,
    ( q(f1(X,X1),Z1)
    | ~ s(X,f1(X,X1))
    | s(Z,X) ),
    file('theBenchmark.p',c_20) ).

cnf(c_21,negated_conjecture,
    ( ~ s(X1,X1)
    | ~ s(X,f1(X,X1))
    | s(Z,X) ),
    file('theBenchmark.p',c_21) ).

cnf(c_22,negated_conjecture,
    ( ~ q(X1,f1(X,X1))
    | s(f1(X,X1),Z)
    | s(Z,X) ),
    file('theBenchmark.p',c_22) ).

cnf(c_23,negated_conjecture,
    ( q(f1(X,X1),Z1)
    | s(f1(X,X1),Z)
    | s(Z,X) ),
    file('theBenchmark.p',c_23) ).

cnf(c_24,negated_conjecture,
    ( ~ s(X1,X1)
    | s(f1(X,X1),Z)
    | s(Z,X) ),
    file('theBenchmark.p',c_24) ).

cnf(c_25,negated_conjecture,
    ( ~ q(X1,f1(X,X1))
    | ~ q(Z1,Z1)
    | s(Z,X) ),
    file('theBenchmark.p',c_25) ).

cnf(c_26,negated_conjecture,
    ( q(f1(X,X1),Z1)
    | ~ q(Z1,Z1)
    | s(Z,X) ),
    file('theBenchmark.p',c_26) ).

cnf(c_27,negated_conjecture,
    ( ~ s(X1,X1)
    | ~ q(Z1,Z1)
    | s(Z,X) ),
    file('theBenchmark.p',c_27) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN039-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  This is a CNF_UNS_RFO_NEQ_NHN 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.10/0.36  % Computer : n011.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Sun Sep 20 06:22:55 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 58.36/58.66  % SZS status Unsatisfiable for theBenchmark
% 58.36/58.66  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------