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

View Problem - Process Solution

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

% Computer : n008.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 08:38:26 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_30,plain,
    ( finite(set_difference(X1,X2))
    | ~ finite(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vsnht9e9/lgb.p',i_0_30) ).

cnf(i_0_144,negated_conjecture,
    finite(esk28_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vsnht9e9/lgb.p',i_0_144) ).

cnf(i_0_53,plain,
    ( finite(set_union2(X1,X2))
    | ~ finite(X2)
    | ~ finite(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vsnht9e9/lgb.p',i_0_53) ).

cnf(i_0_145,negated_conjecture,
    finite(esk27_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vsnht9e9/lgb.p',i_0_145) ).

cnf(i_0_143,negated_conjecture,
    ~ finite(set_union2(set_difference(esk27_0,esk28_0),set_difference(esk28_0,esk27_0))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vsnht9e9/lgb.p',i_0_143) ).

cnf(c_0_151,plain,
    ( finite(set_difference(X1,X2))
    | ~ finite(X1) ),
    i_0_30 ).

cnf(c_0_152,negated_conjecture,
    finite(esk28_0),
    i_0_144 ).

cnf(c_0_153,plain,
    ( finite(set_union2(X1,X2))
    | ~ finite(X2)
    | ~ finite(X1) ),
    i_0_53 ).

cnf(c_0_154,negated_conjecture,
    finite(set_difference(esk28_0,X1)),
    inference(spm,[status(thm)],[c_0_151,c_0_152]) ).

cnf(c_0_155,negated_conjecture,
    finite(esk27_0),
    i_0_145 ).

cnf(c_0_156,negated_conjecture,
    ( finite(set_union2(X1,set_difference(esk28_0,X2)))
    | ~ finite(X1) ),
    inference(spm,[status(thm)],[c_0_153,c_0_154]) ).

cnf(c_0_157,negated_conjecture,
    finite(set_difference(esk27_0,X1)),
    inference(spm,[status(thm)],[c_0_151,c_0_155]) ).

cnf(c_0_158,negated_conjecture,
    ~ finite(set_union2(set_difference(esk27_0,esk28_0),set_difference(esk28_0,esk27_0))),
    i_0_143 ).

cnf(c_0_159,negated_conjecture,
    finite(set_union2(set_difference(esk27_0,X1),set_difference(esk28_0,X2))),
    inference(spm,[status(thm)],[c_0_156,c_0_157]) ).

cnf(c_0_160,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_158,c_0_159])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SEU097+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n008.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 Jun 18 23:17:39 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.45  # ENIGMATIC: Selected complete mode:
% 10.33/2.70  # ENIGMATIC: Solved by autoschedule-lgb:
% 10.33/2.70  # No SInE strategy applied
% 10.33/2.70  # Trying AutoSched0 for 150 seconds
% 10.33/2.70  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S05DI
% 10.33/2.70  # and selection function SelectDivLits.
% 10.33/2.70  #
% 10.33/2.70  # Preprocessing time       : 0.021 s
% 10.33/2.70  # Presaturation interreduction done
% 10.33/2.70  
% 10.33/2.70  # Proof found!
% 10.33/2.70  # SZS status Theorem
% 10.33/2.70  # SZS output start CNFRefutation
% See solution above
% 10.33/2.70  # Training examples: 0 positive, 0 negative
% 10.33/2.70  
% 10.33/2.70  # -------------------------------------------------
% 10.33/2.70  # User time                : 0.294 s
% 10.33/2.70  # System time              : 0.018 s
% 10.33/2.70  # Total time               : 0.313 s
% 10.33/2.70  # Maximum resident set size: 7124 pages
% 10.33/2.70  
%------------------------------------------------------------------------------