%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU326+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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:40:50 EDT 2022
% Result : Theorem 7.74s 2.37s
% Output : CNFRefutation 7.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 27 ( 14 unt; 2 nHn; 18 RR)
% Number of literals : 42 ( 22 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 24 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_77,plain,
( X1 = empty_set
| ~ empty(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4_pukvtu/lgb.p',i_0_77) ).
cnf(i_0_62,plain,
empty(esk4_1(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4_pukvtu/lgb.p',i_0_62) ).
cnf(i_0_63,plain,
element(esk4_1(X1),powerset(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4_pukvtu/lgb.p',i_0_63) ).
cnf(i_0_53,plain,
( complements_of_subsets(X1,complements_of_subsets(X1,X2)) = X2
| ~ element(X2,powerset(powerset(X1))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4_pukvtu/lgb.p',i_0_53) ).
cnf(i_0_74,plain,
( X1 = empty_set
| complements_of_subsets(X2,X1) != empty_set
| ~ element(X1,powerset(powerset(X2))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4_pukvtu/lgb.p',i_0_74) ).
cnf(i_0_65,negated_conjecture,
( esk6_0 = empty_set
| complements_of_subsets(esk5_0,esk6_0) = empty_set ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4_pukvtu/lgb.p',i_0_65) ).
cnf(i_0_69,negated_conjecture,
element(esk6_0,powerset(powerset(esk5_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4_pukvtu/lgb.p',i_0_69) ).
cnf(i_0_43,plain,
( element(complements_of_subsets(X1,X2),powerset(powerset(X1)))
| ~ element(X2,powerset(powerset(X1))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4_pukvtu/lgb.p',i_0_43) ).
cnf(i_0_68,negated_conjecture,
( esk6_0 != empty_set
| complements_of_subsets(esk5_0,esk6_0) != empty_set ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4_pukvtu/lgb.p',i_0_68) ).
cnf(c_0_87,plain,
( X1 = empty_set
| ~ empty(X1) ),
i_0_77 ).
cnf(c_0_88,plain,
empty(esk4_1(X1)),
i_0_62 ).
cnf(c_0_89,plain,
element(esk4_1(X1),powerset(X1)),
i_0_63 ).
cnf(c_0_90,plain,
esk4_1(X1) = empty_set,
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_91,plain,
( complements_of_subsets(X1,complements_of_subsets(X1,X2)) = X2
| ~ element(X2,powerset(powerset(X1))) ),
i_0_53 ).
cnf(c_0_92,plain,
element(empty_set,powerset(X1)),
inference(rw,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_93,plain,
( X1 = empty_set
| complements_of_subsets(X2,X1) != empty_set
| ~ element(X1,powerset(powerset(X2))) ),
i_0_74 ).
cnf(c_0_94,negated_conjecture,
( esk6_0 = empty_set
| complements_of_subsets(esk5_0,esk6_0) = empty_set ),
i_0_65 ).
cnf(c_0_95,negated_conjecture,
element(esk6_0,powerset(powerset(esk5_0))),
i_0_69 ).
cnf(c_0_96,plain,
complements_of_subsets(X1,complements_of_subsets(X1,empty_set)) = empty_set,
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_97,plain,
( element(complements_of_subsets(X1,X2),powerset(powerset(X1)))
| ~ element(X2,powerset(powerset(X1))) ),
i_0_43 ).
cnf(c_0_98,negated_conjecture,
( esk6_0 != empty_set
| complements_of_subsets(esk5_0,esk6_0) != empty_set ),
i_0_68 ).
cnf(c_0_99,negated_conjecture,
esk6_0 = empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_95])]) ).
cnf(c_0_100,plain,
( complements_of_subsets(X1,empty_set) = empty_set
| ~ element(complements_of_subsets(X1,empty_set),powerset(powerset(X1))) ),
inference(spm,[status(thm)],[c_0_93,c_0_96]) ).
cnf(c_0_101,plain,
element(complements_of_subsets(X1,empty_set),powerset(powerset(X1))),
inference(spm,[status(thm)],[c_0_97,c_0_92]) ).
cnf(c_0_102,negated_conjecture,
complements_of_subsets(esk5_0,empty_set) != empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_99]),c_0_99])]) ).
cnf(c_0_103,plain,
complements_of_subsets(X1,empty_set) = empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_100,c_0_101])]) ).
cnf(c_0_104,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_102,c_0_103])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU326+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 19 19:10:19 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 7.74/2.37 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.74/2.37 # No SInE strategy applied
% 7.74/2.37 # Trying AutoSched0 for 150 seconds
% 7.74/2.37 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S079N
% 7.74/2.37 # and selection function SelectGrCQArEqFirst.
% 7.74/2.37 #
% 7.74/2.37 # Preprocessing time : 0.023 s
% 7.74/2.37 # Presaturation interreduction done
% 7.74/2.37
% 7.74/2.37 # Proof found!
% 7.74/2.37 # SZS status Theorem
% 7.74/2.37 # SZS output start CNFRefutation
% See solution above
% 7.74/2.37 # Training examples: 0 positive, 0 negative
% 7.74/2.37
% 7.74/2.37 # -------------------------------------------------
% 7.74/2.37 # User time : 0.025 s
% 7.74/2.37 # System time : 0.007 s
% 7.74/2.37 # Total time : 0.032 s
% 7.74/2.37 # Maximum resident set size: 7120 pages
% 7.74/2.37
%------------------------------------------------------------------------------