↑ Up

ConnectPP---0.7.2.UNS-Prf.s

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

% Result   : Unsatisfiable 0.04s 10.55s
% Output   : Proof 0.04s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   26 (  20 unt;   0 nHn;  21 RR)
%            Number of literals    :   38 (   0 equ;  14 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   13 (   0 sgn)

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

cnf(yql,axiom,
    is_a_theorem(equivalent(equivalent(X,Y),equivalent(equivalent(Z,Y),equivalent(X,Z)))),
    file('theBenchmark.p',yql) ).

cnf(prove_ec_4,negated_conjecture,
    ~ is_a_theorem(equivalent(equivalent(a,b),equivalent(b,a))),
    file('theBenchmark.p',prove_ec_4) ).

cnf(t1,plain,
    ~ is_a_theorem(equivalent(equivalent(a,b),equivalent(b,a))),
    inference(start,[status(thm),parent(0:0)],[prove_ec_4]) ).

cnf(t2,plain,
    ( ~ is_a_theorem(equivalent(b,b))
    | ~ is_a_theorem(equivalent(equivalent(b,b),equivalent(equivalent(a,b),equivalent(b,a))))
    | is_a_theorem(equivalent(equivalent(a,b),equivalent(b,a))) ),
    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(equivalent(equivalent(b,b),equivalent(equivalent(a,b),equivalent(b,a)))),
    inference(extension,[status(thm),parent(t2:2)],[yql]) ).

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

cnf(t6,plain,
    ( ~ is_a_theorem(equivalent(equivalent(b,b),equivalent(equivalent(U_101,b),equivalent(b,U_101))))
    | ~ is_a_theorem(equivalent(equivalent(equivalent(b,b),equivalent(equivalent(U_101,b),equivalent(b,U_101))),equivalent(b,b)))
    | is_a_theorem(equivalent(b,b)) ),
    inference(extension,[status(thm),parent(t2:3)],[condensed_detachment]) ).

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

cnf(t8,plain,
    ( ~ is_a_theorem(equivalent(equivalent(b,b),equivalent(equivalent(b,b),equivalent(b,b))))
    | ~ is_a_theorem(equivalent(equivalent(equivalent(b,b),equivalent(equivalent(b,b),equivalent(b,b))),equivalent(equivalent(equivalent(b,b),equivalent(equivalent(U_101,b),equivalent(b,U_101))),equivalent(b,b))))
    | is_a_theorem(equivalent(equivalent(equivalent(b,b),equivalent(equivalent(U_101,b),equivalent(b,U_101))),equivalent(b,b))) ),
    inference(extension,[status(thm),parent(t6:2)],[condensed_detachment]) ).

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

cnf(t10,plain,
    ( ~ is_a_theorem(equivalent(equivalent(equivalent(b,b),equivalent(equivalent(U_101,b),equivalent(b,U_101))),equivalent(equivalent(b,b),equivalent(b,b))))
    | ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(b,b),equivalent(equivalent(U_101,b),equivalent(b,U_101))),equivalent(equivalent(b,b),equivalent(b,b))),equivalent(equivalent(equivalent(b,b),equivalent(equivalent(b,b),equivalent(b,b))),equivalent(equivalent(equivalent(b,b),equivalent(equivalent(U_101,b),equivalent(b,U_101))),equivalent(b,b)))))
    | is_a_theorem(equivalent(equivalent(equivalent(b,b),equivalent(equivalent(b,b),equivalent(b,b))),equivalent(equivalent(equivalent(b,b),equivalent(equivalent(U_101,b),equivalent(b,U_101))),equivalent(b,b)))) ),
    inference(extension,[status(thm),parent(t8:2)],[condensed_detachment]) ).

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

cnf(t12,plain,
    is_a_theorem(equivalent(equivalent(equivalent(equivalent(b,b),equivalent(equivalent(U_101,b),equivalent(b,U_101))),equivalent(equivalent(b,b),equivalent(b,b))),equivalent(equivalent(equivalent(b,b),equivalent(equivalent(b,b),equivalent(b,b))),equivalent(equivalent(equivalent(b,b),equivalent(equivalent(U_101,b),equivalent(b,U_101))),equivalent(b,b))))),
    inference(extension,[status(thm),parent(t10:2)],[yql]) ).

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

cnf(t14,plain,
    ( ~ is_a_theorem(equivalent(equivalent(b,b),equivalent(equivalent(U_101,b),equivalent(b,U_101))))
    | ~ is_a_theorem(equivalent(equivalent(equivalent(b,b),equivalent(equivalent(U_101,b),equivalent(b,U_101))),equivalent(equivalent(equivalent(b,b),equivalent(equivalent(U_101,b),equivalent(b,U_101))),equivalent(equivalent(b,b),equivalent(b,b)))))
    | is_a_theorem(equivalent(equivalent(equivalent(b,b),equivalent(equivalent(U_101,b),equivalent(b,U_101))),equivalent(equivalent(b,b),equivalent(b,b)))) ),
    inference(extension,[status(thm),parent(t10:3)],[condensed_detachment]) ).

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

cnf(t16,plain,
    is_a_theorem(equivalent(equivalent(equivalent(b,b),equivalent(equivalent(U_101,b),equivalent(b,U_101))),equivalent(equivalent(equivalent(b,b),equivalent(equivalent(U_101,b),equivalent(b,U_101))),equivalent(equivalent(b,b),equivalent(b,b))))),
    inference(extension,[status(thm),parent(t14:2)],[yql]) ).

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

cnf(t18,plain,
    is_a_theorem(equivalent(equivalent(b,b),equivalent(equivalent(U_101,b),equivalent(b,U_101)))),
    inference(extension,[status(thm),parent(t14:3)],[yql]) ).

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

cnf(t20,plain,
    is_a_theorem(equivalent(equivalent(b,b),equivalent(equivalent(b,b),equivalent(b,b)))),
    inference(extension,[status(thm),parent(t8:3)],[yql]) ).

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

cnf(t22,plain,
    is_a_theorem(equivalent(equivalent(b,b),equivalent(equivalent(U_101,b),equivalent(b,U_101)))),
    inference(extension,[status(thm),parent(t6:3)],[yql]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : LCL008-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.02  This is a CNF_UNS_RFO_NEQ_HRN problem
% 0.00/0.02  % Command  : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.04/10.51  % Computer : n012.cluster.edu
% 0.04/10.51  % Model    : x86_64 x86_64
% 0.04/10.51  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/10.51  % Memory   : 8046.5625MB
% 0.04/10.51  % OS       : Linux 6.8.0-71-generic
% 0.04/10.51  % CPULimit : 300
% 0.04/10.51  % WCLimit  : 300
% 0.04/10.51  % DateTime : Sat Sep 19 13:55:14 UTC 2026
% 0.04/10.51  % CPUTime  : 
% 0.04/10.55  % SZS status Unsatisfiable for theBenchmark
% 0.04/10.55  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------