↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SYN079+1 : TPTP v9.3.1. Released v2.0.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 : n007.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:26 AM UTC 2026

% Result   : Theorem 0.13s 0.38s
% Output   : Proof 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   21 (  16 unt;   0 def)
%            Number of atoms       :   31 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   22 (  12   ~;   8   |;   1   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   12 (   0 sgn   9   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(pel57_1,axiom,
    big_f(f(a,b),f(b,c)),
    file('theBenchmark.p',pel57_1) ).

fof(pel57_2,axiom,
    big_f(f(b,c),f(a,c)),
    file('theBenchmark.p',pel57_2) ).

fof(pel57_3,axiom,
    ! [X,Y,Z] :
      ( ( big_f(Y,Z)
        & big_f(X,Y) )
     => big_f(X,Z) ),
    file('theBenchmark.p',pel57_3) ).

fof(pel57,conjecture,
    big_f(f(a,b),f(a,c)),
    file('theBenchmark.p',pel57) ).

fof(f_1_1,plain,
    big_f(f(a,b),f(b,c)),
    inference(fof_nnf,[status(thm)],[pel57_1]) ).

cnf(f_1_2,plain,
    big_f(f(a,b),f(b,c)),
    inference(clausify,[status(thm)],[f_1_1]) ).

fof(f_2_1,plain,
    big_f(f(b,c),f(a,c)),
    inference(fof_nnf,[status(thm)],[pel57_2]) ).

cnf(f_2_2,plain,
    big_f(f(b,c),f(a,c)),
    inference(clausify,[status(thm)],[f_2_1]) ).

fof(f_3_1,plain,
    ! [X,Y,Z] :
      ( big_f(X,Z)
      | ~ big_f(Y,Z)
      | ~ big_f(X,Y) ),
    inference(fof_nnf,[status(thm)],[pel57_3]) ).

fof(f_3_2,plain,
    ! [U_2,U_1,U_0] :
      ( big_f(U_2,U_0)
      | ~ big_f(U_1,U_0)
      | ~ big_f(U_2,U_1) ),
    inference(variable_rename,[status(thm)],[f_3_1]) ).

cnf(f_3_3,plain,
    ( big_f(U_2,U_0)
    | ~ big_f(U_1,U_0)
    | ~ big_f(U_2,U_1) ),
    inference(clausify,[status(thm)],[f_3_2]) ).

fof(f_4_1,negated_conjecture,
    ~ big_f(f(a,b),f(a,c)),
    inference(negate,[status(cth)],[pel57]) ).

fof(f_4_2,negated_conjecture,
    ~ big_f(f(a,b),f(a,c)),
    inference(definitional_conversion,[status(esa)],[f_4_1]) ).

cnf(f_4_3,negated_conjecture,
    ~ big_f(f(a,b),f(a,c)),
    inference(clausify,[status(thm)],[f_4_2]) ).

cnf(t1,plain,
    ~ big_f(f(a,b),f(a,c)),
    inference(start,[status(thm),parent(0:0)],[f_4_3]) ).

cnf(t2,plain,
    ( ~ big_f(f(b,c),f(a,c))
    | ~ big_f(f(a,b),f(b,c))
    | big_f(f(a,b),f(a,c)) ),
    inference(extension,[status(thm),parent(t1:1)],[f_3_3]) ).

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

cnf(t4,plain,
    big_f(f(a,b),f(b,c)),
    inference(extension,[status(thm),parent(t2:2)],[f_1_2]) ).

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

cnf(t6,plain,
    big_f(f(b,c),f(a,c)),
    inference(extension,[status(thm),parent(t2:3)],[f_2_2]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN079+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03  This is a FOF_THM_RFO_NEQ problem
% 0.00/0.03  % Command  : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35  % Computer : n007.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Sun Sep 20 06:22:05 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.13/0.38  % SZS status Theorem for theBenchmark
% 0.13/0.38  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------