↑ Up

hopCoP---0.1.THM-CRf.s

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

% Computer : n027.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:31:40 PM UTC 2025

% Result   : Theorem 0.19s 0.48s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   20 (   5 unt;   0 def)
%            Number of atoms       :   42 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   38 (  16   ~;  16   |;   2   &)
%                                         (   3 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   22 (   1 sgn  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(thI13,plain,
    ! [A] : equal_set(intersection(A,A),A),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI13) ).

fof(thI13_negated,plain,
    ~ ! [A] : equal_set(intersection(A,A),A),
    inference(negate_conjecture,[status(cth)],[thI13]) ).

cnf(29,plain,
    ~ equal_set(intersection(sK5,sK5),sK5),
    inference(cnf,[status(esa)],[thI13_negated]) ).

cnf(l0,plain,
    ~ equal_set(intersection(sK5,sK5),sK5),
    inference(instantiation,[status(thm)],[29]) ).

fof(equal_set,plain,
    ! [A,B] :
      ( equal_set(A,B)
    <=> ( subset(A,B)
        & subset(B,A) ) ),
    file('Axioms/SET006+0.ax',equal_set) ).

cnf(5,plain,
    ( ~ subset(X0,X1)
    | ~ subset(X1,X0)
    | equal_set(X0,X1) ),
    inference(cnf,[status(esa)],[equal_set]) ).

cnf(l1,plain,
    ( ~ subset(intersection(sK5,sK5),sK5)
    | ~ subset(sK5,intersection(sK5,sK5))
    | equal_set(intersection(sK5,sK5),sK5) ),
    inference(instantiation,[status(thm)],[5]) ).

fof(subset,plain,
    ! [A,B] :
      ( subset(A,B)
    <=> ! [X] :
          ( member(X,A)
         => member(X,B) ) ),
    file('Axioms/SET006+0.ax',subset) ).

cnf(1,plain,
    ( subset(X0,X1)
    | member(sK1(X0,X1),X0) ),
    inference(cnf,[status(esa)],[subset]) ).

cnf(l3,plain,
    ( subset(sK5,intersection(sK5,sK5))
    | member(sK1(sK5,intersection(sK5,sK5)),sK5) ),
    inference(instantiation,[status(thm)],[1]) ).

fof(intersection,plain,
    ! [X,A,B] :
      ( member(X,intersection(A,B))
    <=> ( member(X,A)
        & member(X,B) ) ),
    file('Axioms/SET006+0.ax',intersection) ).

cnf(10,plain,
    ( ~ member(X0,X1)
    | ~ member(X0,X2)
    | member(X0,intersection(X1,X2)) ),
    inference(cnf,[status(esa)],[intersection]) ).

cnf(l31,plain,
    ( ~ member(sK1(sK5,intersection(sK5,sK5)),sK5)
    | ~ member(sK1(sK5,intersection(sK5,sK5)),sK5)
    | member(sK1(sK5,intersection(sK5,sK5)),intersection(sK5,sK5)) ),
    inference(instantiation,[status(thm)],[10]) ).

cnf(2,plain,
    ( ~ member(sK1(X0,X1),X1)
    | subset(X0,X1) ),
    inference(cnf,[status(esa)],[subset]) ).

cnf(l32,plain,
    ( ~ member(sK1(sK5,intersection(sK5,sK5)),intersection(sK5,sK5))
    | subset(sK5,intersection(sK5,sK5)) ),
    inference(instantiation,[status(thm)],[2]) ).

cnf(l2,plain,
    ( subset(intersection(sK5,sK5),sK5)
    | member(sK1(intersection(sK5,sK5),sK5),intersection(sK5,sK5)) ),
    inference(instantiation,[status(thm)],[1]) ).

cnf(9,plain,
    ( ~ member(X0,intersection(X1,X2))
    | member(X0,X2) ),
    inference(cnf,[status(esa)],[intersection]) ).

cnf(l20,plain,
    ( ~ member(sK1(intersection(sK5,sK5),sK5),intersection(sK5,sK5))
    | member(sK1(intersection(sK5,sK5),sK5),sK5) ),
    inference(instantiation,[status(thm)],[9]) ).

cnf(l21,plain,
    ( ~ member(sK1(intersection(sK5,sK5),sK5),sK5)
    | subset(intersection(sK5,sK5),sK5) ),
    inference(instantiation,[status(thm)],[2]) ).

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l1,l3,l31,l32,l2,l20,l21]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SET148+4 : TPTP v9.0.0. Released v2.2.0.
% 0.11/0.13  % Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.34  % Computer : n027.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Mon Jul 21 20:11:34 EDT 2025
% 0.12/0.34  % CPUTime  : 
% 0.12/0.35  % launching worker at depth: 1
% 0.12/0.35  % launching worker at depth: 8
% 0.12/0.35  % launching worker at depth: 4
% 0.12/0.35  % launching worker at depth: 2
% 0.12/0.35  % launching worker at depth: 5
% 0.12/0.35  % launching worker at depth: 7
% 0.12/0.35  % launching worker at depth: 6
% 0.12/0.35  % launching worker at depth: 3
% 0.12/0.35  % launching worker at depth: 9
% 0.12/0.35  % launching worker at depth: 10
% 0.12/0.35  % launching worker at depth: 11
% 0.19/0.48  % SZS status Theorem for theBenchmark
% 0.19/0.48  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------