↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SYN318-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 : n017.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:01 AM UTC 2026

% Result   : Unsatisfiable 0.13s 0.37s
% Output   : Proof 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   11 (   9 unt;   0 nHn;  10 RR)
%            Number of literals    :   15 (   0 equ;   6 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    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :    2 (   1 sgn)

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

cnf(clause3,negated_conjecture,
    f(X),
    file('theBenchmark.p',clause3) ).

cnf(clause4,negated_conjecture,
    ~ g(b),
    file('theBenchmark.p',clause4) ).

cnf(t1,plain,
    ~ g(b),
    inference(start,[status(thm),parent(0:0)],[clause4]) ).

cnf(t2,plain,
    ( ~ f(b)
    | ~ f(b)
    | g(b) ),
    inference(extension,[status(thm),parent(t1:1)],[clause1]) ).

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

cnf(t4,plain,
    f(b),
    inference(extension,[status(thm),parent(t2:2)],[clause3]) ).

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

cnf(l2,lemma,
    f(b),
    inference(lemma,[status(cth),parent(t2:2),below(t1:1)],[t2:2]) ).

cnf(t6,plain,
    f(b),
    inference(lemma_extension,[status(thm),parent(t2:3)],[l2:1]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN318-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.03  This is a CNF_UNS_EPR_NEQ_HRN problem
% 0.00/0.03  % Command  : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35  % Computer : n017.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 06:23:40 UTC 2026
% 0.09/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
%------------------------------------------------------------------------------