↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : LCL079-1 : TPTP v9.3.1. Released v1.0.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 : 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 08:48:38 AM UTC 2026

% Result   : Unsatisfiable 0.12s 0.38s
% Output   : Proof 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   21 (  17 unt;   0 nHn;  19 RR)
%            Number of literals    :   29 (   0 equ;  10 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :    7 (   1 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
    ( is_a_theorem(Y)
    | ~ is_a_theorem(X)
    | ~ is_a_theorem(implies(X,Y)) ),
    file('theBenchmark.p',condensed_detachment) ).

cnf(cn_18,axiom,
    is_a_theorem(implies(X,implies(Y,X))),
    file('theBenchmark.p',cn_18) ).

cnf(cn_35,axiom,
    is_a_theorem(implies(implies(X,implies(Y,Z)),implies(implies(X,Y),implies(X,Z)))),
    file('theBenchmark.p',cn_35) ).

cnf(a_implies_b,hypothesis,
    is_a_theorem(implies(a,b)),
    file('theBenchmark.p',a_implies_b) ).

cnf(b_implies_c,hypothesis,
    is_a_theorem(implies(b,c)),
    file('theBenchmark.p',b_implies_c) ).

cnf(prove_transitivity,negated_conjecture,
    ~ is_a_theorem(implies(a,c)),
    file('theBenchmark.p',prove_transitivity) ).

cnf(t1,plain,
    ~ is_a_theorem(implies(a,c)),
    inference(start,[status(thm),parent(0:0)],[prove_transitivity]) ).

cnf(t2,plain,
    ( ~ is_a_theorem(implies(a,b))
    | ~ is_a_theorem(implies(implies(a,b),implies(a,c)))
    | is_a_theorem(implies(a,c)) ),
    inference(extension,[status(thm),parent(t1:1)],[condensed_detachment]) ).

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

cnf(t4,plain,
    ( ~ is_a_theorem(implies(a,implies(b,c)))
    | ~ is_a_theorem(implies(implies(a,implies(b,c)),implies(implies(a,b),implies(a,c))))
    | is_a_theorem(implies(implies(a,b),implies(a,c))) ),
    inference(extension,[status(thm),parent(t2:2)],[condensed_detachment]) ).

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

cnf(t6,plain,
    is_a_theorem(implies(implies(a,implies(b,c)),implies(implies(a,b),implies(a,c)))),
    inference(extension,[status(thm),parent(t4:2)],[cn_35]) ).

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

cnf(t8,plain,
    ( ~ is_a_theorem(implies(b,c))
    | ~ is_a_theorem(implies(implies(b,c),implies(a,implies(b,c))))
    | is_a_theorem(implies(a,implies(b,c))) ),
    inference(extension,[status(thm),parent(t4:3)],[condensed_detachment]) ).

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

cnf(t10,plain,
    is_a_theorem(implies(implies(b,c),implies(a,implies(b,c)))),
    inference(extension,[status(thm),parent(t8:2)],[cn_18]) ).

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

cnf(t12,plain,
    is_a_theorem(implies(b,c)),
    inference(extension,[status(thm),parent(t8:3)],[b_implies_c]) ).

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

cnf(t14,plain,
    is_a_theorem(implies(a,b)),
    inference(extension,[status(thm),parent(t2:3)],[a_implies_b]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL079-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  This is a CNF_UNS_RFO_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 : n010.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.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Sat Sep 19 14:03:38 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.12/0.38  % SZS status Unsatisfiable for theBenchmark
% 0.12/0.38  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------