%------------------------------------------------------------------------------
% File     : PyRes---1.5
% Problem  : SET002+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s

% Computer : n020.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:38:47 EDT 2024

% Result   : Theorem 0.41s 0.56s
% Output   : Refutation 0.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   15 (  11 unt;   0 def)
%            Number of atoms       :   19 (  11 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   12 (   8   ~;   3   |;   0   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-2 aty)
%            Number of variables   :   16 (   0 sgn  10   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_idempotency_of_union,conjecture,
    ! [B] : union(B,B) = B,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_idempotency_of_union) ).

fof(c3,negated_conjecture,
    ~ ! [B] : union(B,B) = B,
    inference(assume_negation,[status(cth)],[prove_idempotency_of_union]) ).

fof(c4,negated_conjecture,
    ? [B] : union(B,B) != B,
    inference(fof_nnf,[status(thm)],[c3]) ).

fof(c5,negated_conjecture,
    ? [X2] : union(X2,X2) != X2,
    inference(variable_rename,[status(thm)],[c4]) ).

fof(c6,negated_conjecture,
    union(skolem0001,skolem0001) != skolem0001,
    inference(skolemize,[status(esa)],[c5]) ).

cnf(c7,negated_conjecture,
    union(skolem0001,skolem0001) != skolem0001,
    inference(split_conjunct,[status(thm)],[c6]) ).

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

fof(c18,plain,
    ! [X10] : subset(X10,X10),
    inference(variable_rename,[status(thm)],[reflexivity_of_subset]) ).

cnf(c19,plain,
    subset(X32,X32),
    inference(split_conjunct,[status(thm)],[c18]) ).

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

fof(c47,plain,
    ! [B,C] :
      ( ~ subset(B,C)
      | union(B,C) = C ),
    inference(fof_nnf,[status(thm)],[subset_union]) ).

fof(c48,plain,
    ! [X29,X30] :
      ( ~ subset(X29,X30)
      | union(X29,X30) = X30 ),
    inference(variable_rename,[status(thm)],[c47]) ).

cnf(c49,plain,
    ( ~ subset(X80,X79)
    | union(X80,X79) = X79 ),
    inference(split_conjunct,[status(thm)],[c48]) ).

cnf(c71,plain,
    union(X81,X81) = X81,
    inference(resolution,[status(thm)],[c49,c19]) ).

cnf(c76,plain,
    $false,
    inference(resolution,[status(thm)],[c71,c7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14  % Problem  : SET002+3 : TPTP v8.1.2. Released v2.2.0.
% 0.13/0.15  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.16/0.36  % Computer : n020.cluster.edu
% 0.16/0.36  % Model    : x86_64 x86_64
% 0.16/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36  % Memory   : 8042.1875MB
% 0.16/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36  % CPULimit : 300
% 0.16/0.36  % WCLimit  : 300
% 0.16/0.36  % DateTime : Wed May  8 18:21:08 EDT 2024
% 0.16/0.37  % CPUTime  : 
% 0.41/0.56  % Version:  1.5
% 0.41/0.56  % SZS status Theorem
% 0.41/0.56  % SZS output start CNFRefutation
% See solution above
% 0.41/0.56  
% 0.41/0.56  % Initial clauses    : 23
% 0.41/0.56  % Processed clauses  : 18
% 0.41/0.56  % Factors computed   : 2
% 0.41/0.56  % Resolvents computed: 26
% 0.41/0.56  % Tautologies deleted: 2
% 0.41/0.56  % Forward subsumed   : 6
% 0.41/0.56  % Backward subsumed  : 0
% 0.41/0.56  % -------- CPU Time ---------
% 0.41/0.56  % User time          : 0.176 s
% 0.41/0.56  % System time        : 0.012 s
% 0.41/0.56  % Total time         : 0.188 s
%------------------------------------------------------------------------------