↑ Up

ConnectPP---0.7.2.UNS-Prf.s

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

% Result   : Unsatisfiable 0.24s 0.47s
% Output   : Proof 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   29 (  19 unt;   0 nHn;  28 RR)
%            Number of literals    :   45 (   0 equ;  18 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    9 (   8 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   14 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(axiom_9,axiom,
    r0(b),
    file('SYN001-0.ax',axiom_9) ).

cnf(axiom_19,axiom,
    m0(X,d,Y),
    file('SYN001-0.ax',axiom_19) ).

cnf(axiom_24,axiom,
    l0(c),
    file('SYN001-0.ax',axiom_24) ).

cnf(axiom_26,axiom,
    n0(d,c),
    file('SYN001-0.ax',axiom_26) ).

cnf(rule_001,axiom,
    ( ~ n0(J,I)
    | k1(I) ),
    file('SYN001-0.ax',rule_001) ).

cnf(rule_035,axiom,
    ( ~ l0(J)
    | ~ r0(I)
    | m1(I,J,I) ),
    file('SYN001-0.ax',rule_035) ).

cnf(rule_122,axiom,
    ( ~ m0(G,H,G)
    | q1(G,G,G) ),
    file('SYN001-0.ax',rule_122) ).

cnf(rule_127,axiom,
    ( ~ k2(F,D)
    | ~ k1(F)
    | ~ m1(E,D,C)
    | k2(C,D) ),
    file('SYN001-0.ax',rule_127) ).

cnf(rule_129,axiom,
    ( ~ q1(A,J,J)
    | k2(J,J) ),
    file('SYN001-0.ax',rule_129) ).

cnf(prove_this,negated_conjecture,
    ~ k2(b,c),
    file('theBenchmark.p',prove_this) ).

cnf(t1,plain,
    ~ k2(b,c),
    inference(start,[status(thm),parent(0:0)],[prove_this]) ).

cnf(t2,plain,
    ( ~ m1(b,c,b)
    | ~ k1(c)
    | ~ k2(c,c)
    | k2(b,c) ),
    inference(extension,[status(thm),parent(t1:1)],[rule_127]) ).

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

cnf(t4,plain,
    ( ~ q1(c,c,c)
    | k2(c,c) ),
    inference(extension,[status(thm),parent(t2:2)],[rule_129]) ).

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

cnf(t6,plain,
    ( ~ m0(c,d,c)
    | q1(c,c,c) ),
    inference(extension,[status(thm),parent(t4:2)],[rule_122]) ).

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

cnf(t8,plain,
    m0(c,d,c),
    inference(extension,[status(thm),parent(t6:2)],[axiom_19]) ).

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

cnf(t10,plain,
    ( ~ n0(d,c)
    | k1(c) ),
    inference(extension,[status(thm),parent(t2:3)],[rule_001]) ).

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

cnf(t12,plain,
    n0(d,c),
    inference(extension,[status(thm),parent(t10:2)],[axiom_26]) ).

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

cnf(t14,plain,
    ( ~ r0(b)
    | ~ l0(c)
    | m1(b,c,b) ),
    inference(extension,[status(thm),parent(t2:4)],[rule_035]) ).

cnf(t15,plain,
    $false,
    inference(connection,[status(thm),parent(t14:1)],[t14:1,t2:4]) ).

cnf(t16,plain,
    l0(c),
    inference(extension,[status(thm),parent(t14:2)],[axiom_24]) ).

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

cnf(t18,plain,
    r0(b),
    inference(extension,[status(thm),parent(t14:3)],[axiom_9]) ).

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


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