↑ Up

ConnectPP---0.7.2.UNS-Prf.s

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

% Result   : Unsatisfiable 0.14s 5.65s
% Output   : Proof 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :   16
% Syntax   : Number of clauses     :   51 (  33 unt;   0 nHn;  49 RR)
%            Number of literals    :   83 (   0 equ;  34 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   15 (  14 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   20 (   7 sgn)

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

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_28,axiom,
    k0(e),
    file('SYN001-0.ax',axiom_28) ).

cnf(axiom_30,axiom,
    n0(e,e),
    file('SYN001-0.ax',axiom_30) ).

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

cnf(rule_002,axiom,
    ( ~ n0(H,G)
    | l1(G,G) ),
    file('SYN001-0.ax',rule_002) ).

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

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_130,axiom,
    ( ~ l1(e,e)
    | k2(e,e) ),
    file('SYN001-0.ax',rule_130) ).

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

cnf(rule_231,axiom,
    ( ~ k2(c,I)
    | ~ r2(H)
    | m3(H,I,H) ),
    file('SYN001-0.ax',rule_231) ).

cnf(prove_this,negated_conjecture,
    ~ m3(c,e,c),
    file('theBenchmark.p',prove_this) ).

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

cnf(t2,plain,
    ( ~ r2(c)
    | ~ k2(c,e)
    | m3(c,e,c) ),
    inference(extension,[status(thm),parent(t1:1)],[rule_231]) ).

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

cnf(t4,plain,
    ( ~ m1(c,e,c)
    | ~ k1(e)
    | ~ k2(e,e)
    | k2(c,e) ),
    inference(extension,[status(thm),parent(t2:2)],[rule_127]) ).

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

cnf(t6,plain,
    ( ~ l1(e,e)
    | k2(e,e) ),
    inference(extension,[status(thm),parent(t4:2)],[rule_130]) ).

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

cnf(t8,plain,
    ( ~ n0(e,e)
    | l1(e,e) ),
    inference(extension,[status(thm),parent(t6:2)],[rule_002]) ).

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

cnf(t10,plain,
    n0(e,e),
    inference(extension,[status(thm),parent(t8:2)],[axiom_30]) ).

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

cnf(t12,plain,
    ( ~ n0(e,e)
    | k1(e) ),
    inference(extension,[status(thm),parent(t4:3)],[rule_001]) ).

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

cnf(t14,plain,
    n0(e,e),
    inference(extension,[status(thm),parent(t12:2)],[axiom_30]) ).

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

cnf(t16,plain,
    ( ~ l0(c)
    | ~ k0(e)
    | m1(c,e,c) ),
    inference(extension,[status(thm),parent(t4:4)],[rule_021]) ).

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

cnf(t18,plain,
    k0(e),
    inference(extension,[status(thm),parent(t16:2)],[axiom_28]) ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN138-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/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/5.37  % Computer : n010.cluster.edu
% 0.10/5.37  % Model    : x86_64 x86_64
% 0.10/5.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37  % Memory   : 8046.5625MB
% 0.10/5.37  % OS       : Linux 6.8.0-71-generic
% 0.10/5.37  % CPULimit : 300
% 0.10/5.37  % WCLimit  : 300
% 0.10/5.37  % DateTime : Sun Sep 20 06:26:17 UTC 2026
% 0.10/5.38  % CPUTime  : 
% 0.14/5.65  % SZS status Unsatisfiable for theBenchmark
% 0.14/5.65  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------