TSTP Solution File: SET881+1 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SET881+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n007.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 00:14:59 EDT 2022

% Result   : Theorem 7.52s 2.37s
% Output   : CNFRefutation 7.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    9 (   5 unt;   0 nHn;   7 RR)
%            Number of literals    :   15 (   9 equ;   8 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   16 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != unordered_pair(X3,X4) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wwqmmnwl/lgb.p',i_0_7) ).

cnf(i_0_10,plain,
    ( set_difference(singleton(X1),X2) = empty_set
    | ~ in(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wwqmmnwl/lgb.p',i_0_10) ).

cnf(i_0_14,negated_conjecture,
    set_difference(singleton(esk4_0),unordered_pair(esk4_0,esk5_0)) != empty_set,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wwqmmnwl/lgb.p',i_0_14) ).

cnf(c_0_18,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != unordered_pair(X3,X4) ),
    i_0_7 ).

cnf(c_0_19,plain,
    ( set_difference(singleton(X1),X2) = empty_set
    | ~ in(X1,X2) ),
    i_0_10 ).

cnf(c_0_20,plain,
    in(X1,unordered_pair(X1,X2)),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_18])]) ).

cnf(c_0_21,negated_conjecture,
    set_difference(singleton(esk4_0),unordered_pair(esk4_0,esk5_0)) != empty_set,
    i_0_14 ).

cnf(c_0_22,plain,
    set_difference(singleton(X1),unordered_pair(X1,X2)) = empty_set,
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_23,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET881+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n007.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun Jul 10 11:37:33 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected complete mode:
% 7.52/2.37  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.52/2.37  # No SInE strategy applied
% 7.52/2.37  # Trying AutoSched0 for 150 seconds
% 7.52/2.37  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S00DA
% 7.52/2.37  # and selection function SelectSmallestOrientable.
% 7.52/2.37  #
% 7.52/2.37  # Preprocessing time       : 0.023 s
% 7.52/2.37  # Presaturation interreduction done
% 7.52/2.37  
% 7.52/2.37  # Proof found!
% 7.52/2.37  # SZS status Theorem
% 7.52/2.37  # SZS output start CNFRefutation
% See solution above
% 7.52/2.37  # Training examples: 0 positive, 0 negative
% 7.52/2.37  
% 7.52/2.37  # -------------------------------------------------
% 7.52/2.37  # User time                : 0.025 s
% 7.52/2.37  # System time              : 0.004 s
% 7.52/2.37  # Total time               : 0.029 s
% 7.52/2.37  # Maximum resident set size: 7124 pages
% 7.52/2.37  
%------------------------------------------------------------------------------