↑ Up

hopCoP---0.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : hopCoP---0.1
% Problem  : REL003+1 : TPTP v9.0.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n017.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri Jul 25 02:39:06 PM UTC 2025

% Result   : Theorem 14.52s 2.16s
% Output   : CNFRefutation 14.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   20 (   9 unt;   0 def)
%            Number of atoms       :   35 (  25 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   26 (  11   ~;   9   |;   2   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   2 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   10 (   0 sgn   7   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(goals,plain,
    ! [X0,X1] :
      ( ( join(X0,X1) = X1
       => join(converse(X0),converse(X1)) = converse(X1) )
      & ( join(converse(X0),converse(X1)) = converse(X1)
       => join(X0,X1) = X1 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

fof(goals_negated,plain,
    ~ ! [X0,X1] :
        ( ( join(X0,X1) = X1
         => join(converse(X0),converse(X1)) = converse(X1) )
        & ( join(converse(X0),converse(X1)) = converse(X1)
         => join(X0,X1) = X1 ) ),
    inference(negate_conjecture,[status(cth)],[goals]) ).

cnf(13,plain,
    ( join(sK1,sK2) = sK2
    | sP0 ),
    inference(cnf,[status(esa)],[goals_negated]) ).

cnf(l0,plain,
    ( join(sK1,sK2) = sK2
    | sP0 ),
    inference(instantiation,[status(thm)],[13]) ).

cnf(15,plain,
    ( join(sK1,sK2) != sK2
    | ~ sP0 ),
    inference(cnf,[status(esa)],[goals_negated]) ).

cnf(l1,plain,
    ( join(sK1,sK2) != sK2
    | ~ sP0 ),
    inference(instantiation,[status(thm)],[15]) ).

cnf(l3,plain,
    ( join(sK1,sK2) != sK2
    | ~ sP0 ),
    inference(instantiation,[status(thm)],[15]) ).

fof(converse_idempotence,plain,
    ! [X0] : converse(converse(X0)) = X0,
    file('Axioms/REL001+0.ax',converse_idempotence) ).

cnf(7,plain,
    converse(converse(X0)) = X0,
    inference(cnf,[status(esa)],[converse_idempotence]) ).

cnf(l19,plain,
    converse(converse(sK2)) = sK2,
    inference(instantiation,[status(thm)],[7]) ).

cnf(14,plain,
    ( join(converse(sK1),converse(sK2)) != converse(sK2)
    | sP0 ),
    inference(cnf,[status(esa)],[goals_negated]) ).

cnf(l39,plain,
    ( join(converse(sK1),converse(sK2)) != converse(sK2)
    | sP0 ),
    inference(instantiation,[status(thm)],[14]) ).

cnf(16,plain,
    ( join(converse(sK1),converse(sK2)) = converse(sK2)
    | ~ sP0 ),
    inference(cnf,[status(esa)],[goals_negated]) ).

cnf(l15,plain,
    ( join(converse(sK1),converse(sK2)) = converse(sK2)
    | ~ sP0 ),
    inference(instantiation,[status(thm)],[16]) ).

fof(converse_additivity,plain,
    ! [X0,X1] : converse(join(X0,X1)) = join(converse(X0),converse(X1)),
    file('Axioms/REL001+0.ax',converse_additivity) ).

cnf(8,plain,
    converse(join(X0,X1)) = join(converse(X0),converse(X1)),
    inference(cnf,[status(esa)],[converse_additivity]) ).

cnf(l73,plain,
    converse(join(sK1,sK2)) = join(converse(sK1),converse(sK2)),
    inference(instantiation,[status(thm)],[8]) ).

cnf(l12,plain,
    converse(join(sK1,sK2)) = join(converse(sK1),converse(sK2)),
    inference(instantiation,[status(thm)],[8]) ).

cnf(l16,plain,
    converse(converse(join(sK1,sK2))) = join(sK1,sK2),
    inference(instantiation,[status(thm)],[7]) ).

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l1,l3,l19,l39,l15,l73,l12,l16]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : REL003+1 : TPTP v9.0.0. Released v4.0.0.
% 0.00/0.09  % Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.29  % Computer : n017.cluster.edu
% 0.09/0.29  % Model    : x86_64 x86_64
% 0.09/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29  % Memory   : 8042.1875MB
% 0.09/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29  % CPULimit : 300
% 0.09/0.29  % WCLimit  : 300
% 0.09/0.29  % DateTime : Mon Jul 21 16:24:49 EDT 2025
% 0.09/0.29  % CPUTime  : 
% 0.09/0.29  % launching worker at depth: 1
% 0.09/0.29  % launching worker at depth: 6
% 0.09/0.29  % launching worker at depth: 3
% 0.09/0.29  % launching worker at depth: 2
% 0.09/0.29  % launching worker at depth: 4
% 0.09/0.29  % launching worker at depth: 5
% 0.09/0.29  % launching worker at depth: 7
% 0.09/0.29  % launching worker at depth: 8
% 0.09/0.30  % launching worker at depth: 9
% 0.09/0.30  % launching worker at depth: 10
% 0.09/0.31  % launching worker at depth: 11
% 0.14/0.39  % launching worker at depth: 12
% 14.52/2.16  % SZS status Theorem for theBenchmark
% 14.52/2.16  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------