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

% Computer : n029.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  : 600s
% DateTime : Tue Jul 19 04:33:57 EDT 2022

% Result   : Theorem 0.40s 0.57s
% Output   : Refutation 0.40s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named input)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_idempotency_of_union,conjecture,
    ! [B] : union(B,B) = B,
    input ).

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),
    input ).

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

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

fof(subset_union,axiom,
    ! [B,C] :
      ( subset(B,C)
     => union(B,C) = C ),
    input ).

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

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

cnf(c49,axiom,
    ( ~ subset(X74,X75)
    | union(X74,X75) = X75 ),
    inference(split_conjunct,status(thm),[c48]) ).

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

cnf(c73,plain,
    $false,
    inference(resolution,status(thm),[c68,c7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET002+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.12/0.33  % Computer : n029.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sat Jul  9 19:45:00 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.40/0.57  # Version:  1.3
% 0.40/0.57  # SZS status Theorem
% 0.40/0.57  # SZS output start CNFRefutation
% See solution above
% 0.40/0.57  
% 0.40/0.57  # Initial clauses    : 23
% 0.40/0.57  # Processed clauses  : 18
% 0.40/0.57  # Factors computed   : 0
% 0.40/0.57  # Resolvents computed: 26
% 0.40/0.57  # Tautologies deleted: 1
% 0.40/0.57  # Forward subsumed   : 6
% 0.40/0.57  # Backward subsumed  : 0
% 0.40/0.57  # -------- CPU Time ---------
% 0.40/0.57  # User time          : 0.208 s
% 0.40/0.57  # System time        : 0.021 s
% 0.40/0.57  # Total time         : 0.229 s
%------------------------------------------------------------------------------