↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SYN328-1 : TPTP v9.3.1. Released v1.2.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 : n012.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:10:03 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(clause1,negated_conjecture,
    ( ~ f(X)
    | g(y(X))
    | ~ f(y(X)) ),
    file('theBenchmark.p',clause1) ).

cnf(clause2,negated_conjecture,
    ( f(X)
    | f(y(X)) ),
    file('theBenchmark.p',clause2) ).

cnf(clause3,negated_conjecture,
    ( f(X)
    | ~ g(y(X)) ),
    file('theBenchmark.p',clause3) ).

cnf(clause4,negated_conjecture,
    ( ~ g(X)
    | h(y(X))
    | ~ f(y(X)) ),
    file('theBenchmark.p',clause4) ).

cnf(clause5,negated_conjecture,
    ( g(X)
    | f(y(X)) ),
    file('theBenchmark.p',clause5) ).

cnf(clause6,negated_conjecture,
    ( g(X)
    | ~ h(y(X)) ),
    file('theBenchmark.p',clause6) ).

cnf(clause7,negated_conjecture,
    ( ~ h(X)
    | h(y(X))
    | f(y(X)) ),
    file('theBenchmark.p',clause7) ).

cnf(clause8,negated_conjecture,
    ( ~ h(X)
    | h(y(X))
    | ~ g(y(X)) ),
    file('theBenchmark.p',clause8) ).

cnf(clause9,negated_conjecture,
    ( h(X)
    | g(y(X))
    | ~ f(y(X)) ),
    file('theBenchmark.p',clause9) ).

cnf(clause10,negated_conjecture,
    ( h(X)
    | ~ h(y(X)) ),
    file('theBenchmark.p',clause10) ).

cnf(clause11,negated_conjecture,
    ( ~ h(z(X))
    | ~ g(z(X))
    | ~ f(z(X)) ),
    file('theBenchmark.p',clause11) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : SYN328-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.01  This is a CNF_UNS_RFO_NEQ_NHN problem
% 0.00/0.02  % Command  : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.29  % Computer : n012.cluster.edu
% 0.03/0.29  % Model    : x86_64 x86_64
% 0.03/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.29  % Memory   : 8046.5625MB
% 0.03/0.29  % OS       : Linux 6.8.0-71-generic
% 0.03/0.29  % CPULimit : 300
% 0.03/0.29  % WCLimit  : 300
% 0.03/0.29  % DateTime : Sun Sep 20 06:28:37 UTC 2026
% 0.03/0.29  % CPUTime  : 
% 0.03/0.31  % SZS status Unsatisfiable for theBenchmark
% 0.03/0.31  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------