↑ Up

PyRes---1.5.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : PyRes---1.5
% Problem  : SET585+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s

% Computer : n025.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 : Thu May  9 17:39:46 EDT 2024

% Result   : Theorem 0.18s 0.53s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   19 (  14 unt;   0 def)
%            Number of atoms       :   28 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   21 (  12   ~;   7   |;   1   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   42 (   5 sgn  23   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(intersection_is_subset,axiom,
    ! [B,C] : subset(intersection(B,C),B),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_is_subset) ).

fof(c50,plain,
    ! [X35,X36] : subset(intersection(X35,X36),X35),
    inference(variable_rename,[status(thm)],[intersection_is_subset]) ).

cnf(c51,plain,
    subset(intersection(X44,X45),X44),
    inference(split_conjunct,[status(thm)],[c50]) ).

fof(subset_of_union,axiom,
    ! [B,C] : subset(B,union(B,C)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_of_union) ).

fof(c52,plain,
    ! [X37,X38] : subset(X37,union(X37,X38)),
    inference(variable_rename,[status(thm)],[subset_of_union]) ).

cnf(c53,plain,
    subset(X47,union(X47,X46)),
    inference(split_conjunct,[status(thm)],[c52]) ).

fof(transitivity_of_subset,axiom,
    ! [B,C,D] :
      ( ( subset(B,C)
        & subset(C,D) )
     => subset(B,D) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_subset) ).

fof(c54,plain,
    ! [B,C,D] :
      ( ~ subset(B,C)
      | ~ subset(C,D)
      | subset(B,D) ),
    inference(fof_nnf,[status(thm)],[transitivity_of_subset]) ).

fof(c55,plain,
    ! [X39,X40,X41] :
      ( ~ subset(X39,X40)
      | ~ subset(X40,X41)
      | subset(X39,X41) ),
    inference(variable_rename,[status(thm)],[c54]) ).

cnf(c56,plain,
    ( ~ subset(X104,X105)
    | ~ subset(X105,X103)
    | subset(X104,X103) ),
    inference(split_conjunct,[status(thm)],[c55]) ).

cnf(c85,plain,
    ( ~ subset(X114,X115)
    | subset(X114,union(X115,X113)) ),
    inference(resolution,[status(thm)],[c56,c53]) ).

cnf(c91,plain,
    subset(intersection(X121,X123),union(X121,X122)),
    inference(resolution,[status(thm)],[c85,c51]) ).

fof(prove_intersection_subset_of_union,conjecture,
    ! [B,C,D] : subset(intersection(B,C),union(B,D)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_intersection_subset_of_union) ).

fof(c4,negated_conjecture,
    ~ ! [B,C,D] : subset(intersection(B,C),union(B,D)),
    inference(assume_negation,[status(cth)],[prove_intersection_subset_of_union]) ).

fof(c5,negated_conjecture,
    ? [B,C,D] : ~ subset(intersection(B,C),union(B,D)),
    inference(fof_nnf,[status(thm)],[c4]) ).

fof(c6,negated_conjecture,
    ? [X2,X3,X4] : ~ subset(intersection(X2,X3),union(X2,X4)),
    inference(variable_rename,[status(thm)],[c5]) ).

fof(c7,negated_conjecture,
    ~ subset(intersection(skolem0001,skolem0002),union(skolem0001,skolem0003)),
    inference(skolemize,[status(esa)],[c6]) ).

cnf(c8,negated_conjecture,
    ~ subset(intersection(skolem0001,skolem0002),union(skolem0001,skolem0003)),
    inference(split_conjunct,[status(thm)],[c7]) ).

cnf(c103,plain,
    $false,
    inference(resolution,[status(thm)],[c8,c91]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET585+3 : TPTP v8.1.2. Released v2.2.0.
% 0.03/0.12  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.12/0.32  % Computer : n025.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 300
% 0.12/0.32  % DateTime : Wed May  8 18:58:53 EDT 2024
% 0.12/0.32  % CPUTime  : 
% 0.18/0.53  % Version:  1.5
% 0.18/0.53  % SZS status Theorem
% 0.18/0.53  % SZS output start CNFRefutation
% See solution above
% 0.18/0.53  
% 0.18/0.53  % Initial clauses    : 27
% 0.18/0.53  % Processed clauses  : 27
% 0.18/0.53  % Factors computed   : 4
% 0.18/0.53  % Resolvents computed: 44
% 0.18/0.53  % Tautologies deleted: 4
% 0.18/0.53  % Forward subsumed   : 5
% 0.18/0.53  % Backward subsumed  : 0
% 0.18/0.53  % -------- CPU Time ---------
% 0.18/0.53  % User time          : 0.180 s
% 0.18/0.53  % System time        : 0.022 s
% 0.18/0.53  % Total time         : 0.202 s
%------------------------------------------------------------------------------