%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU115+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n032.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:32 EDT 2022
% Result : Theorem 6.39s 2.03s
% Output : CNFRefutation 6.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 16 ( 12 unt; 0 nHn; 11 RR)
% Number of literals : 20 ( 10 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 9 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_61,plain,
( X1 = empty_set
| ~ empty(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ygp8078i/lgb.p',i_0_61) ).
cnf(i_0_44,plain,
empty(esk4_1(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ygp8078i/lgb.p',i_0_44) ).
cnf(i_0_62,negated_conjecture,
singleton(empty_set) != finite_subsets(empty_set),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ygp8078i/lgb.p',i_0_62) ).
cnf(i_0_64,plain,
singleton(empty_set) = powerset(empty_set),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ygp8078i/lgb.p',i_0_64) ).
cnf(i_0_36,plain,
finite(esk4_1(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ygp8078i/lgb.p',i_0_36) ).
cnf(i_0_63,plain,
( finite_subsets(X1) = powerset(X1)
| ~ finite(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ygp8078i/lgb.p',i_0_63) ).
cnf(c_0_71,plain,
( X1 = empty_set
| ~ empty(X1) ),
i_0_61 ).
cnf(c_0_72,plain,
empty(esk4_1(X1)),
i_0_44 ).
cnf(c_0_73,negated_conjecture,
singleton(empty_set) != finite_subsets(empty_set),
i_0_62 ).
cnf(c_0_74,plain,
singleton(empty_set) = powerset(empty_set),
i_0_64 ).
cnf(c_0_75,plain,
finite(esk4_1(X1)),
i_0_36 ).
cnf(c_0_76,plain,
esk4_1(X1) = empty_set,
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_77,negated_conjecture,
finite_subsets(empty_set) != powerset(empty_set),
inference(rw,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_78,plain,
( finite_subsets(X1) = powerset(X1)
| ~ finite(X1) ),
i_0_63 ).
cnf(c_0_79,plain,
finite(empty_set),
inference(rw,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_80,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_79])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : SEU115+1 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.10 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Sun Jun 19 08:56:49 EDT 2022
% 0.09/0.29 % CPUTime :
% 0.13/0.37 # ENIGMATIC: Selected complete mode:
% 6.39/2.03 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.39/2.03 # No SInE strategy applied
% 6.39/2.03 # Trying AutoSched0 for 150 seconds
% 6.39/2.03 # AutoSched0-Mode selected heuristic G_E___300_C18_F1_SE_CS_SP_S0Y
% 6.39/2.03 # and selection function SelectMaxLComplexAvoidPosPred.
% 6.39/2.03 #
% 6.39/2.03 # Preprocessing time : 0.015 s
% 6.39/2.03
% 6.39/2.03 # Proof found!
% 6.39/2.03 # SZS status Theorem
% 6.39/2.03 # SZS output start CNFRefutation
% See solution above
% 6.39/2.03 # Training examples: 0 positive, 0 negative
% 6.39/2.03
% 6.39/2.03 # -------------------------------------------------
% 6.39/2.03 # User time : 0.016 s
% 6.39/2.03 # System time : 0.004 s
% 6.39/2.03 # Total time : 0.020 s
% 6.39/2.03 # Maximum resident set size: 7120 pages
% 6.39/2.03
%------------------------------------------------------------------------------