↑ Up

ConnectPP---0.7.2.UNS-Prf.s

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

% Result   : Unsatisfiable 0.13s 0.37s
% Output   : Proof 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   27 (  15 unt;   2 nHn;  27 RR)
%            Number of literals    :   43 (   0 equ;  16 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :    1 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(thm31_3,negated_conjecture,
    ( ~ r(A)
    | s(A) ),
    file('theBenchmark.p',thm31_3) ).

cnf(thm31_4,negated_conjecture,
    ( r(sk2)
    | r(sk1) ),
    file('theBenchmark.p',thm31_4) ).

cnf(thm31_9,negated_conjecture,
    ( ~ s(sk2)
    | ~ r(sk2)
    | r(sk1) ),
    file('theBenchmark.p',thm31_9) ).

cnf(thm31_10,negated_conjecture,
    ( ~ s(sk1)
    | r(sk2) ),
    file('theBenchmark.p',thm31_10) ).

cnf(thm31_15,negated_conjecture,
    ( ~ s(sk2)
    | ~ s(sk1)
    | ~ r(sk2) ),
    file('theBenchmark.p',thm31_15) ).

cnf(t1,plain,
    ( ~ s(sk1)
    | ~ s(sk2)
    | ~ r(sk2) ),
    inference(start,[status(thm),parent(0:0)],[thm31_15]) ).

cnf(t2,plain,
    ( ~ s(sk1)
    | r(sk2) ),
    inference(extension,[status(thm),parent(t1:1)],[thm31_10]) ).

cnf(t3,plain,
    $false,
    inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).

cnf(t4,plain,
    ( ~ r(sk1)
    | s(sk1) ),
    inference(extension,[status(thm),parent(t2:2)],[thm31_3]) ).

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

cnf(t6,plain,
    ( r(sk2)
    | r(sk1) ),
    inference(extension,[status(thm),parent(t4:2)],[thm31_4]) ).

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

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

cnf(l1,lemma,
    r(sk2),
    inference(lemma,[status(cth),parent(t1:1),below(0:0)],[t1:1]) ).

cnf(t9,plain,
    ( ~ r(sk2)
    | s(sk2) ),
    inference(extension,[status(thm),parent(t1:2)],[thm31_3]) ).

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

cnf(t11,plain,
    r(sk2),
    inference(lemma_extension,[status(thm),parent(t9:2)],[l1:1]) ).

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

cnf(l5,lemma,
    s(sk2),
    inference(lemma,[status(cth),parent(t1:2),below(0:0)],[t1:2]) ).

cnf(t13,plain,
    ( ~ r(sk1)
    | s(sk1) ),
    inference(extension,[status(thm),parent(t1:3)],[thm31_3]) ).

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

cnf(t15,plain,
    ( ~ r(sk2)
    | ~ s(sk2)
    | r(sk1) ),
    inference(extension,[status(thm),parent(t13:2)],[thm31_9]) ).

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

cnf(t17,plain,
    s(sk2),
    inference(lemma_extension,[status(thm),parent(t15:2)],[l5:1]) ).

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

cnf(t19,plain,
    r(sk2),
    inference(lemma_extension,[status(thm),parent(t15:3)],[l1:1]) ).

cnf(t20,plain,
    $false,
    inference(connection,[status(thm),parent(t19:1)],[t19:1,t15:3]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN724-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.03  This is a CNF_UNS_EPR_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.07/0.35  % Computer : n018.cluster.edu
% 0.07/0.35  % Model    : x86_64 x86_64
% 0.07/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35  % Memory   : 8046.5625MB
% 0.07/0.35  % OS       : Linux 6.8.0-71-generic
% 0.07/0.35  % CPULimit : 300
% 0.07/0.35  % WCLimit  : 300
% 0.07/0.35  % DateTime : Sun Sep 20 07:09:27 UTC 2026
% 0.07/0.35  % CPUTime  : 
% 0.13/0.37  % SZS status Unsatisfiable for theBenchmark
% 0.13/0.37  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------