↑ Up

ConnectPP---0.7.2.UNS-Prf.s

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

% Result   : Unsatisfiable 0.23s 0.47s
% Output   : Proof 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    4
% 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  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :    6 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(axiom_14,axiom,
    p0(b,X),
    file('SYN001-0.ax',axiom_14) ).

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

cnf(rule_092,axiom,
    ( ~ p0(C,J)
    | ~ n0(B,A)
    | q1(J,A,J) ),
    file('SYN001-0.ax',rule_092) ).

cnf(prove_this,negated_conjecture,
    ~ q1(a,e,X),
    file('theBenchmark.p',prove_this) ).

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

cnf(t2,plain,
    ( ~ n0(e,e)
    | ~ p0(b,a)
    | q1(a,e,a) ),
    inference(extension,[status(thm),parent(t1:1)],[rule_092]) ).

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

cnf(t4,plain,
    p0(b,a),
    inference(extension,[status(thm),parent(t2:2)],[axiom_14]) ).

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

cnf(t6,plain,
    n0(e,e),
    inference(extension,[status(thm),parent(t2:3)],[axiom_30]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN286-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.08/0.35  % Computer : n002.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Sun Sep 20 06:30:47 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.23/0.47  % SZS status Unsatisfiable for theBenchmark
% 0.23/0.47  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------