↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SWV009-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 : n008.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:02:27 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(clause_1,negated_conjecture,
    ( less(Y,X)
    | less_or_equal(X,Y) ),
    file('theBenchmark.p',clause_1) ).

cnf(clause_2,negated_conjecture,
    less(j,i),
    file('theBenchmark.p',clause_2) ).

cnf(clause_3,negated_conjecture,
    less_or_equal(m,p),
    file('theBenchmark.p',clause_3) ).

cnf(clause_4,negated_conjecture,
    less_or_equal(p,q),
    file('theBenchmark.p',clause_4) ).

cnf(clause_5,negated_conjecture,
    less_or_equal(q,n),
    file('theBenchmark.p',clause_5) ).

cnf(clause_6,negated_conjecture,
    ( less_or_equal(a(X),a(Y))
    | ~ less_or_equal(Y,n)
    | ~ less(j,Y)
    | ~ less(X,i)
    | ~ less_or_equal(m,X) ),
    file('theBenchmark.p',clause_6) ).

cnf(clause_7,negated_conjecture,
    ( less_or_equal(a(X),a(Y))
    | ~ less_or_equal(Y,j)
    | ~ less_or_equal(X,Y)
    | ~ less_or_equal(m,X) ),
    file('theBenchmark.p',clause_7) ).

cnf(clause_8,negated_conjecture,
    ( less_or_equal(a(X),a(Y))
    | ~ less_or_equal(Y,n)
    | ~ less_or_equal(X,Y)
    | ~ less_or_equal(i,X) ),
    file('theBenchmark.p',clause_8) ).

cnf(clause_9,negated_conjecture,
    ~ less_or_equal(a(p),a(q)),
    file('theBenchmark.p',clause_9) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV009-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.03  % 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.35  % Computer : n008.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Sun Sep 20 02:59:38 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.38  % SZS status Unsatisfiable for theBenchmark
% 0.09/0.38  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------