TSTP Solution File: SEU327+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU327+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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 8.78s 2.53s
% Output : CNFRefutation 8.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of clauses : 35 ( 10 unt; 6 nHn; 33 RR)
% Number of literals : 72 ( 30 equ; 41 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 3 con; 0-3 aty)
% Number of variables : 48 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_91,plain,
( meet_of_subsets(X1,X2) = set_meet(X2)
| ~ element(X2,powerset(powerset(X1))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7lvnowdq/lgb.p',i_0_91) ).
cnf(i_0_92,plain,
( subset_difference(X1,X2,X3) = set_difference(X2,X3)
| ~ element(X3,powerset(X1))
| ~ element(X2,powerset(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7lvnowdq/lgb.p',i_0_92) ).
cnf(i_0_102,plain,
( X1 = empty_set
| subset_difference(X2,X2,union_of_subsets(X2,X1)) = meet_of_subsets(X2,complements_of_subsets(X2,X1))
| ~ element(X1,powerset(powerset(X2))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7lvnowdq/lgb.p',i_0_102) ).
cnf(i_0_46,plain,
element(X1,powerset(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7lvnowdq/lgb.p',i_0_46) ).
cnf(i_0_50,plain,
( element(union_of_subsets(X1,X2),powerset(X1))
| ~ element(X2,powerset(powerset(X1))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7lvnowdq/lgb.p',i_0_50) ).
cnf(i_0_94,negated_conjecture,
meet_of_subsets(esk5_0,complements_of_subsets(esk5_0,esk6_0)) != subset_complement(esk5_0,union_of_subsets(esk5_0,esk6_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7lvnowdq/lgb.p',i_0_94) ).
cnf(i_0_90,plain,
( union_of_subsets(X1,X2) = union(X2)
| ~ element(X2,powerset(powerset(X1))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7lvnowdq/lgb.p',i_0_90) ).
cnf(i_0_53,plain,
( element(complements_of_subsets(X1,X2),powerset(powerset(X1)))
| ~ element(X2,powerset(powerset(X1))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7lvnowdq/lgb.p',i_0_53) ).
cnf(i_0_96,negated_conjecture,
element(esk6_0,powerset(powerset(esk5_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7lvnowdq/lgb.p',i_0_96) ).
cnf(i_0_42,plain,
( subset_complement(X1,X2) = set_difference(X1,X2)
| ~ element(X2,powerset(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7lvnowdq/lgb.p',i_0_42) ).
cnf(i_0_95,negated_conjecture,
esk6_0 != empty_set,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7lvnowdq/lgb.p',i_0_95) ).
cnf(c_0_114,plain,
( meet_of_subsets(X1,X2) = set_meet(X2)
| ~ element(X2,powerset(powerset(X1))) ),
i_0_91 ).
cnf(c_0_115,plain,
( subset_difference(X1,X2,X3) = set_difference(X2,X3)
| ~ element(X3,powerset(X1))
| ~ element(X2,powerset(X1)) ),
i_0_92 ).
cnf(c_0_116,plain,
( X1 = empty_set
| subset_difference(X2,X2,union_of_subsets(X2,X1)) = meet_of_subsets(X2,complements_of_subsets(X2,X1))
| ~ element(X1,powerset(powerset(X2))) ),
i_0_102 ).
cnf(c_0_117,plain,
element(X1,powerset(X1)),
i_0_46 ).
cnf(c_0_118,plain,
( element(union_of_subsets(X1,X2),powerset(X1))
| ~ element(X2,powerset(powerset(X1))) ),
i_0_50 ).
cnf(c_0_119,negated_conjecture,
meet_of_subsets(esk5_0,complements_of_subsets(esk5_0,esk6_0)) != subset_complement(esk5_0,union_of_subsets(esk5_0,esk6_0)),
i_0_94 ).
cnf(c_0_120,plain,
( meet_of_subsets(X1,X2) = meet_of_subsets(X3,X2)
| ~ element(X2,powerset(powerset(X1)))
| ~ element(X2,powerset(powerset(X3))) ),
inference(spm,[status(thm)],[c_0_114,c_0_114]) ).
cnf(c_0_121,plain,
( set_difference(X1,union_of_subsets(X1,X2)) = meet_of_subsets(X1,complements_of_subsets(X1,X2))
| X2 = empty_set
| ~ element(X2,powerset(powerset(X1))) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_116]),c_0_117])]),c_0_118]) ).
cnf(c_0_122,plain,
( union_of_subsets(X1,X2) = union(X2)
| ~ element(X2,powerset(powerset(X1))) ),
i_0_90 ).
cnf(c_0_123,negated_conjecture,
( meet_of_subsets(X1,complements_of_subsets(esk5_0,esk6_0)) != subset_complement(esk5_0,union_of_subsets(esk5_0,esk6_0))
| ~ element(complements_of_subsets(esk5_0,esk6_0),powerset(powerset(esk5_0)))
| ~ element(complements_of_subsets(esk5_0,esk6_0),powerset(powerset(X1))) ),
inference(spm,[status(thm)],[c_0_119,c_0_120]) ).
cnf(c_0_124,plain,
( set_difference(X1,union(X2)) = meet_of_subsets(X1,complements_of_subsets(X1,X2))
| X2 = empty_set
| ~ element(X2,powerset(powerset(X1))) ),
inference(spm,[status(thm)],[c_0_121,c_0_122]) ).
cnf(c_0_125,plain,
( element(complements_of_subsets(X1,X2),powerset(powerset(X1)))
| ~ element(X2,powerset(powerset(X1))) ),
i_0_53 ).
cnf(c_0_126,plain,
( set_meet(complements_of_subsets(esk5_0,esk6_0)) != subset_complement(esk5_0,union_of_subsets(esk5_0,esk6_0))
| ~ element(complements_of_subsets(esk5_0,esk6_0),powerset(powerset(esk5_0)))
| ~ element(complements_of_subsets(esk5_0,esk6_0),powerset(powerset(X1))) ),
inference(spm,[status(thm)],[c_0_123,c_0_114]) ).
cnf(c_0_127,negated_conjecture,
element(esk6_0,powerset(powerset(esk5_0))),
i_0_96 ).
cnf(c_0_128,plain,
( subset_complement(X1,X2) = set_difference(X1,X2)
| ~ element(X2,powerset(X1)) ),
i_0_42 ).
cnf(c_0_129,plain,
( set_difference(X1,union(X2)) = set_meet(complements_of_subsets(X1,X2))
| X2 = empty_set
| ~ element(X2,powerset(powerset(X1))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_124]),c_0_125]) ).
cnf(c_0_130,plain,
( element(union(X1),powerset(X2))
| ~ element(X1,powerset(powerset(X2))) ),
inference(spm,[status(thm)],[c_0_118,c_0_122]) ).
cnf(c_0_131,plain,
( set_meet(complements_of_subsets(esk5_0,esk6_0)) != subset_complement(esk5_0,union_of_subsets(esk5_0,esk6_0))
| ~ element(complements_of_subsets(esk5_0,esk6_0),powerset(powerset(esk5_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_125]),c_0_127])]) ).
cnf(c_0_132,plain,
( set_meet(complements_of_subsets(X1,X2)) = subset_complement(X1,union(X2))
| X2 = empty_set
| ~ element(X2,powerset(powerset(X1))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_129]),c_0_130]) ).
cnf(c_0_133,negated_conjecture,
esk6_0 != empty_set,
i_0_95 ).
cnf(c_0_134,plain,
( subset_complement(esk5_0,union(esk6_0)) != subset_complement(esk5_0,union_of_subsets(esk5_0,esk6_0))
| ~ element(complements_of_subsets(esk5_0,esk6_0),powerset(powerset(esk5_0))) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_132]),c_0_127])]),c_0_133]) ).
cnf(c_0_135,plain,
( subset_complement(esk5_0,union_of_subsets(X1,esk6_0)) != subset_complement(esk5_0,union_of_subsets(esk5_0,esk6_0))
| ~ element(complements_of_subsets(esk5_0,esk6_0),powerset(powerset(esk5_0)))
| ~ element(esk6_0,powerset(powerset(X1))) ),
inference(spm,[status(thm)],[c_0_134,c_0_122]) ).
cnf(c_0_136,plain,
~ element(complements_of_subsets(esk5_0,esk6_0),powerset(powerset(esk5_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_135]),c_0_127])]) ).
cnf(c_0_137,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_136,c_0_125]),c_0_127])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU327+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n013.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 Jun 19 10:40:45 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.46 # ENIGMATIC: Selected complete mode:
% 8.78/2.53 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.78/2.53 # No SInE strategy applied
% 8.78/2.53 # Trying AutoSched0 for 150 seconds
% 8.78/2.53 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S05BN
% 8.78/2.53 # and selection function SelectUnlessUniqMaxSmallestOrientable.
% 8.78/2.53 #
% 8.78/2.53 # Preprocessing time : 0.013 s
% 8.78/2.53 # Presaturation interreduction done
% 8.78/2.53
% 8.78/2.53 # Proof found!
% 8.78/2.53 # SZS status Theorem
% 8.78/2.53 # SZS output start CNFRefutation
% See solution above
% 8.78/2.53 # Training examples: 0 positive, 0 negative
% 8.78/2.53
% 8.78/2.53 # -------------------------------------------------
% 8.78/2.53 # User time : 0.017 s
% 8.78/2.53 # System time : 0.005 s
% 8.78/2.53 # Total time : 0.022 s
% 8.78/2.53 # Maximum resident set size: 7128 pages
% 8.78/2.53
%------------------------------------------------------------------------------