TSTP Solution File: SEU174+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU174+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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:39:12 EDT 2022
% Result : Theorem 7.85s 2.53s
% Output : CNFRefutation 7.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 27 ( 12 unt; 4 nHn; 21 RR)
% Number of literals : 53 ( 14 equ; 28 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 40 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_14,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ow73pk8x/lgb.p',i_0_14) ).
cnf(i_0_72,plain,
( in(subset_complement(X1,X2),X3)
| X4 != complements_of_subsets(X1,X3)
| ~ in(X2,X4)
| ~ element(X2,powerset(X1))
| ~ element(X3,powerset(powerset(X1)))
| ~ element(X4,powerset(powerset(X1))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ow73pk8x/lgb.p',i_0_72) ).
cnf(i_0_184,plain,
( element(X1,X2)
| ~ in(X1,X3)
| ~ element(X3,powerset(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ow73pk8x/lgb.p',i_0_184) ).
cnf(i_0_87,plain,
( element(complements_of_subsets(X1,X2),powerset(powerset(X1)))
| ~ element(X2,powerset(powerset(X1))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ow73pk8x/lgb.p',i_0_87) ).
cnf(i_0_118,lemma,
( element(X1,powerset(X2))
| in(esk19_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ow73pk8x/lgb.p',i_0_118) ).
cnf(i_0_98,plain,
( complements_of_subsets(X1,complements_of_subsets(X1,X2)) = X2
| ~ element(X2,powerset(powerset(X1))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ow73pk8x/lgb.p',i_0_98) ).
cnf(i_0_178,negated_conjecture,
complements_of_subsets(esk27_0,esk28_0) = empty_set,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ow73pk8x/lgb.p',i_0_178) ).
cnf(i_0_180,negated_conjecture,
element(esk28_0,powerset(powerset(esk27_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ow73pk8x/lgb.p',i_0_180) ).
cnf(i_0_13,plain,
( X1 = empty_set
| in(esk2_1(X1),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ow73pk8x/lgb.p',i_0_13) ).
cnf(i_0_179,negated_conjecture,
esk28_0 != empty_set,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ow73pk8x/lgb.p',i_0_179) ).
cnf(c_0_195,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
i_0_14 ).
cnf(c_0_196,plain,
( in(subset_complement(X1,X2),X3)
| X4 != complements_of_subsets(X1,X3)
| ~ in(X2,X4)
| ~ element(X2,powerset(X1))
| ~ element(X3,powerset(powerset(X1)))
| ~ element(X4,powerset(powerset(X1))) ),
i_0_72 ).
cnf(c_0_197,plain,
( element(X1,X2)
| ~ in(X1,X3)
| ~ element(X3,powerset(X2)) ),
i_0_184 ).
cnf(c_0_198,plain,
( element(complements_of_subsets(X1,X2),powerset(powerset(X1)))
| ~ element(X2,powerset(powerset(X1))) ),
i_0_87 ).
cnf(c_0_199,plain,
~ in(X1,empty_set),
inference(er,[status(thm)],[c_0_195]) ).
cnf(c_0_200,lemma,
( element(X1,powerset(X2))
| in(esk19_2(X1,X2),X1) ),
i_0_118 ).
cnf(c_0_201,plain,
( in(subset_complement(X1,X2),X3)
| ~ in(X2,complements_of_subsets(X1,X3))
| ~ element(X3,powerset(powerset(X1))) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(csr,[status(thm)],[c_0_196,c_0_197])]),c_0_198]) ).
cnf(c_0_202,plain,
element(empty_set,powerset(X1)),
inference(spm,[status(thm)],[c_0_199,c_0_200]) ).
cnf(c_0_203,plain,
( complements_of_subsets(X1,complements_of_subsets(X1,X2)) = X2
| ~ element(X2,powerset(powerset(X1))) ),
i_0_98 ).
cnf(c_0_204,negated_conjecture,
complements_of_subsets(esk27_0,esk28_0) = empty_set,
i_0_178 ).
cnf(c_0_205,negated_conjecture,
element(esk28_0,powerset(powerset(esk27_0))),
i_0_180 ).
cnf(c_0_206,plain,
~ in(X1,complements_of_subsets(X2,empty_set)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_199,c_0_201]),c_0_202])]) ).
cnf(c_0_207,plain,
( X1 = empty_set
| in(esk2_1(X1),X1) ),
i_0_13 ).
cnf(c_0_208,negated_conjecture,
complements_of_subsets(esk27_0,empty_set) = esk28_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_203,c_0_204]),c_0_205])]) ).
cnf(c_0_209,plain,
complements_of_subsets(X1,empty_set) = empty_set,
inference(spm,[status(thm)],[c_0_206,c_0_207]) ).
cnf(c_0_210,negated_conjecture,
esk28_0 != empty_set,
i_0_179 ).
cnf(c_0_211,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_208,c_0_209]),c_0_210]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU174+2 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n010.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 : Mon Jun 20 00:42:09 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.19/0.46 # ENIGMATIC: Selected complete mode:
% 7.85/2.53 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.85/2.53 # No SInE strategy applied
% 7.85/2.53 # Trying AutoSched0 for 150 seconds
% 7.85/2.53 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
% 7.85/2.53 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.85/2.53 #
% 7.85/2.53 # Preprocessing time : 0.025 s
% 7.85/2.53 # Presaturation interreduction done
% 7.85/2.53
% 7.85/2.53 # Proof found!
% 7.85/2.53 # SZS status Theorem
% 7.85/2.53 # SZS output start CNFRefutation
% See solution above
% 7.85/2.53 # Training examples: 0 positive, 0 negative
% 7.85/2.53
% 7.85/2.53 # -------------------------------------------------
% 7.85/2.53 # User time : 0.049 s
% 7.85/2.53 # System time : 0.007 s
% 7.85/2.53 # Total time : 0.056 s
% 7.85/2.53 # Maximum resident set size: 7124 pages
% 7.85/2.53
%------------------------------------------------------------------------------