↑ Up

hopCoP---0.1.THM-CRf.s

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

% Computer : n018.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 03:32:53 PM UTC 2025

% Result   : Theorem 0.13s 0.32s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   19 (   8 unt;   0 def)
%            Number of atoms       :   38 (  16 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   32 (  13   ~;  13   |;   0   &)
%                                         (   5 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   29 (   1 sgn  16   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t12_zfmisc_1,plain,
    ! [A,B] : subset(singleton(A),unordered_pair(A,B)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_zfmisc_1) ).

fof(t12_zfmisc_1_negated,plain,
    ~ ! [A,B] : subset(singleton(A),unordered_pair(A,B)),
    inference(negate_conjecture,[status(cth)],[t12_zfmisc_1]) ).

cnf(22,plain,
    ~ subset(singleton(sK6),unordered_pair(sK6,sK7)),
    inference(cnf,[status(esa)],[t12_zfmisc_1_negated]) ).

cnf(l0,plain,
    ~ subset(singleton(sK6),unordered_pair(sK6,sK7)),
    inference(instantiation,[status(thm)],[22]) ).

fof(d3_tarski,plain,
    ! [A,B] :
      ( subset(A,B)
    <=> ! [C] :
          ( in(C,A)
         => in(C,B) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).

cnf(18,plain,
    ( ~ in(sK3(X0,X1),X1)
    | subset(X0,X1) ),
    inference(cnf,[status(esa)],[d3_tarski]) ).

cnf(l1,plain,
    ( ~ in(sK3(singleton(sK6),unordered_pair(sK6,sK7)),unordered_pair(sK6,sK7))
    | subset(singleton(sK6),unordered_pair(sK6,sK7)) ),
    inference(instantiation,[status(thm)],[18]) ).

fof(d2_tarski,plain,
    ! [A,B,C] :
      ( C = unordered_pair(A,B)
    <=> ! [D] :
          ( in(D,C)
        <=> ( D = A
            | D = B ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).

cnf(10,plain,
    ( X0 != unordered_pair(X1,X2)
    | X3 != X2
    | in(X3,X0) ),
    inference(cnf,[status(esa)],[d2_tarski]) ).

cnf(l2,plain,
    ( unordered_pair(sK6,sK7) != unordered_pair(sK7,sK6)
    | sK3(singleton(sK6),unordered_pair(sK6,sK7)) != sK6
    | in(sK3(singleton(sK6),unordered_pair(sK6,sK7)),unordered_pair(sK6,sK7)) ),
    inference(instantiation,[status(thm)],[10]) ).

fof(d1_tarski,plain,
    ! [A,B] :
      ( B = singleton(A)
    <=> ! [C] :
          ( in(C,B)
        <=> C = A ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).

cnf(2,plain,
    ( X0 != singleton(X1)
    | ~ in(X2,X0)
    | X2 = X1 ),
    inference(cnf,[status(esa)],[d1_tarski]) ).

cnf(l4,plain,
    ( singleton(sK6) != singleton(sK6)
    | ~ in(sK3(singleton(sK6),unordered_pair(sK6,sK7)),singleton(sK6))
    | sK3(singleton(sK6),unordered_pair(sK6,sK7)) = sK6 ),
    inference(instantiation,[status(thm)],[2]) ).

cnf(17,plain,
    ( in(sK3(X0,X1),X0)
    | subset(X0,X1) ),
    inference(cnf,[status(esa)],[d3_tarski]) ).

cnf(l8,plain,
    ( in(sK3(singleton(sK6),unordered_pair(sK6,sK7)),singleton(sK6))
    | subset(singleton(sK6),unordered_pair(sK6,sK7)) ),
    inference(instantiation,[status(thm)],[17]) ).

fof(commutativity_k2_tarski,plain,
    ! [A,B] : unordered_pair(A,B) = unordered_pair(B,A),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).

cnf(1,plain,
    unordered_pair(X0,X1) = unordered_pair(X1,X0),
    inference(cnf,[status(esa)],[commutativity_k2_tarski]) ).

cnf(l6,plain,
    unordered_pair(sK7,sK6) = unordered_pair(sK6,sK7),
    inference(instantiation,[status(thm)],[1]) ).

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l1,l2,l4,l8,l6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.08  % Problem  : SET872+1 : TPTP v9.0.0. Released v3.2.0.
% 0.08/0.09  % Command  : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.29  % Computer : n018.cluster.edu
% 0.08/0.29  % Model    : x86_64 x86_64
% 0.08/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29  % Memory   : 8042.1875MB
% 0.08/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29  % CPULimit : 300
% 0.08/0.29  % WCLimit  : 300
% 0.08/0.29  % DateTime : Mon Jul 21 22:57:04 EDT 2025
% 0.08/0.29  % CPUTime  : 
% 0.08/0.29  % launching worker at depth: 2
% 0.08/0.29  % launching worker at depth: 8
% 0.08/0.29  % launching worker at depth: 4
% 0.08/0.29  % launching worker at depth: 5
% 0.08/0.29  % launching worker at depth: 3
% 0.08/0.29  % launching worker at depth: 6
% 0.08/0.29  % launching worker at depth: 7
% 0.08/0.29  % launching worker at depth: 1
% 0.08/0.29  % launching worker at depth: 9
% 0.08/0.30  % launching worker at depth: 10
% 0.13/0.32  % SZS status Theorem for theBenchmark
% 0.13/0.32  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------