↑ Up

ConnectPP---0.7.2.UNS-Prf.s

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

% Result   : Unsatisfiable 0.14s 5.80s
% Output   : Proof 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :   19
% Syntax   : Number of clauses     :   68 (  44 unt;   0 nHn;  66 RR)
%            Number of literals    :  111 (   0 equ;  45 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   16 (  15 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   28 (   8 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(axiom_1,axiom,
    s0(d),
    file('SYN001-0.ax',axiom_1) ).

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

cnf(axiom_13,axiom,
    r0(e),
    file('SYN001-0.ax',axiom_13) ).

cnf(axiom_17,axiom,
    q0(X,d),
    file('SYN001-0.ax',axiom_17) ).

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_124,axiom,
    ( ~ q1(d,E,d)
    | ~ s0(d)
    | ~ q0(D,E)
    | r1(D) ),
    file('SYN001-0.ax',rule_124) ).

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(rule_176,axiom,
    ( ~ m1(E,D,E)
    | p2(D,E,D) ),
    file('SYN001-0.ax',rule_176) ).

cnf(rule_188,axiom,
    ( ~ l0(G)
    | ~ r1(G)
    | r2(G) ),
    file('SYN001-0.ax',rule_188) ).

cnf(rule_267,axiom,
    ( ~ p2(B,D,C)
    | r3(B,C,B) ),
    file('SYN001-0.ax',rule_267) ).

cnf(rule_272,axiom,
    ( ~ r3(B,J,J)
    | ~ r2(B)
    | ~ k2(A,B)
    | r3(J,A,B) ),
    file('SYN001-0.ax',rule_272) ).

cnf(rule_285,axiom,
    ( ~ r3(H,G,H)
    | ~ r0(G)
    | p4(G,G,H) ),
    file('SYN001-0.ax',rule_285) ).

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

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

cnf(t2,plain,
    ( ~ r0(b)
    | ~ r3(c,b,c)
    | p4(b,b,c) ),
    inference(extension,[status(thm),parent(t1:1)],[rule_285]) ).

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

cnf(t4,plain,
    ( ~ k2(b,c)
    | ~ r2(c)
    | ~ r3(c,c,c)
    | r3(c,b,c) ),
    inference(extension,[status(thm),parent(t2:2)],[rule_272]) ).

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

cnf(t6,plain,
    ( ~ p2(c,e,c)
    | r3(c,c,c) ),
    inference(extension,[status(thm),parent(t4:2)],[rule_267]) ).

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

cnf(t8,plain,
    ( ~ m1(e,c,e)
    | p2(c,e,c) ),
    inference(extension,[status(thm),parent(t6:2)],[rule_176]) ).

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

cnf(t10,plain,
    ( ~ r0(e)
    | ~ l0(c)
    | m1(e,c,e) ),
    inference(extension,[status(thm),parent(t8:2)],[rule_035]) ).

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

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

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

cnf(t14,plain,
    r0(e),
    inference(extension,[status(thm),parent(t10:3)],[axiom_13]) ).

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

cnf(t16,plain,
    ( ~ r1(c)
    | ~ l0(c)
    | r2(c) ),
    inference(extension,[status(thm),parent(t4:3)],[rule_188]) ).

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

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

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

cnf(t20,plain,
    ( ~ q0(c,d)
    | ~ s0(d)
    | ~ q1(d,d,d)
    | r1(c) ),
    inference(extension,[status(thm),parent(t16:3)],[rule_124]) ).

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

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

cnf(t23,plain,
    $false,
    inference(connection,[status(thm),parent(t22:1)],[t22:1,t20:2]) ).

cnf(t24,plain,
    m0(d,d,d),
    inference(extension,[status(thm),parent(t22:2)],[axiom_19]) ).

cnf(t25,plain,
    $false,
    inference(connection,[status(thm),parent(t24:1)],[t24:1,t22:2]) ).

cnf(t26,plain,
    s0(d),
    inference(extension,[status(thm),parent(t20:3)],[axiom_1]) ).

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

cnf(t28,plain,
    q0(c,d),
    inference(extension,[status(thm),parent(t20:4)],[axiom_17]) ).

cnf(t29,plain,
    $false,
    inference(connection,[status(thm),parent(t28:1)],[t28:1,t20:4]) ).

cnf(t30,plain,
    ( ~ m1(b,c,b)
    | ~ k1(c)
    | ~ k2(c,c)
    | k2(b,c) ),
    inference(extension,[status(thm),parent(t4:4)],[rule_127]) ).

cnf(t31,plain,
    $false,
    inference(connection,[status(thm),parent(t30:1)],[t30:1,t4:4]) ).

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

cnf(t33,plain,
    $false,
    inference(connection,[status(thm),parent(t32:1)],[t32:1,t30:2]) ).

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

cnf(t35,plain,
    $false,
    inference(connection,[status(thm),parent(t34:1)],[t34:1,t32:2]) ).

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

cnf(t37,plain,
    $false,
    inference(connection,[status(thm),parent(t36:1)],[t36:1,t34:2]) ).

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

cnf(t39,plain,
    $false,
    inference(connection,[status(thm),parent(t38:1)],[t38:1,t30:3]) ).

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

cnf(t41,plain,
    $false,
    inference(connection,[status(thm),parent(t40:1)],[t40:1,t38:2]) ).

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

cnf(t43,plain,
    $false,
    inference(connection,[status(thm),parent(t42:1)],[t42:1,t30:4]) ).

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

cnf(t45,plain,
    $false,
    inference(connection,[status(thm),parent(t44:1)],[t44:1,t42:2]) ).

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

cnf(t47,plain,
    $false,
    inference(connection,[status(thm),parent(t46:1)],[t46:1,t42:3]) ).

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

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN270-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.09/5.37  % Computer : n001.cluster.edu
% 0.09/5.37  % Model    : x86_64 x86_64
% 0.09/5.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37  % Memory   : 8046.5625MB
% 0.09/5.37  % OS       : Linux 6.8.0-71-generic
% 0.09/5.37  % CPULimit : 300
% 0.09/5.37  % WCLimit  : 300
% 0.09/5.37  % DateTime : Sun Sep 20 06:33:31 UTC 2026
% 0.09/5.37  % CPUTime  : 
% 0.14/5.80  % SZS status Unsatisfiable for theBenchmark
% 0.14/5.80  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------