%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU174+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n004.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.67s 2.36s
% Output : CNFRefutation 7.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of clauses : 40 ( 19 unt; 3 nHn; 31 RR)
% Number of literals : 76 ( 12 equ; 41 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 56 ( 15 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_35,plain,
( ~ empty(X1)
| ~ in(X2,X3)
| ~ element(X3,powerset(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hg0axn1m/lgb.p',i_0_35) ).
cnf(i_0_24,plain,
element(esk6_1(X1),powerset(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hg0axn1m/lgb.p',i_0_24) ).
cnf(i_0_36,plain,
( X1 = empty_set
| ~ empty(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hg0axn1m/lgb.p',i_0_36) ).
cnf(i_0_23,plain,
empty(esk6_1(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hg0axn1m/lgb.p',i_0_23) ).
cnf(i_0_9,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-hg0axn1m/lgb.p',i_0_9) ).
cnf(i_0_34,plain,
( element(X1,X2)
| ~ in(X1,X3)
| ~ element(X3,powerset(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hg0axn1m/lgb.p',i_0_34) ).
cnf(i_0_13,plain,
( element(complements_of_subsets(X1,X2),powerset(powerset(X1)))
| ~ element(X2,powerset(powerset(X1))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hg0axn1m/lgb.p',i_0_13) ).
cnf(i_0_19,plain,
( complements_of_subsets(X1,complements_of_subsets(X1,X2)) = X2
| ~ element(X2,powerset(powerset(X1))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hg0axn1m/lgb.p',i_0_19) ).
cnf(i_0_31,negated_conjecture,
complements_of_subsets(esk8_0,esk9_0) = empty_set,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hg0axn1m/lgb.p',i_0_31) ).
cnf(i_0_33,negated_conjecture,
element(esk9_0,powerset(powerset(esk8_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hg0axn1m/lgb.p',i_0_33) ).
cnf(i_0_28,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hg0axn1m/lgb.p',i_0_28) ).
cnf(i_0_15,plain,
element(esk3_1(X1),X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hg0axn1m/lgb.p',i_0_15) ).
cnf(i_0_17,plain,
empty(empty_set),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hg0axn1m/lgb.p',i_0_17) ).
cnf(i_0_32,negated_conjecture,
empty_set != esk9_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hg0axn1m/lgb.p',i_0_32) ).
cnf(c_0_51,plain,
( ~ empty(X1)
| ~ in(X2,X3)
| ~ element(X3,powerset(X1)) ),
i_0_35 ).
cnf(c_0_52,plain,
element(esk6_1(X1),powerset(X1)),
i_0_24 ).
cnf(c_0_53,plain,
( X1 = empty_set
| ~ empty(X1) ),
i_0_36 ).
cnf(c_0_54,plain,
empty(esk6_1(X1)),
i_0_23 ).
cnf(c_0_55,plain,
( ~ in(X1,esk6_1(X2))
| ~ empty(X2) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_56,plain,
esk6_1(X1) = empty_set,
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_57,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_9 ).
cnf(c_0_58,plain,
( element(X1,X2)
| ~ in(X1,X3)
| ~ element(X3,powerset(X2)) ),
i_0_34 ).
cnf(c_0_59,plain,
( element(complements_of_subsets(X1,X2),powerset(powerset(X1)))
| ~ element(X2,powerset(powerset(X1))) ),
i_0_13 ).
cnf(c_0_60,plain,
( ~ in(X1,empty_set)
| ~ empty(X2) ),
inference(rw,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_61,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_57,c_0_58])]),c_0_59]) ).
cnf(c_0_62,plain,
element(empty_set,powerset(X1)),
inference(rw,[status(thm)],[c_0_52,c_0_56]) ).
cnf(c_0_63,plain,
( complements_of_subsets(X1,complements_of_subsets(X1,X2)) = X2
| ~ element(X2,powerset(powerset(X1))) ),
i_0_19 ).
cnf(c_0_64,negated_conjecture,
complements_of_subsets(esk8_0,esk9_0) = empty_set,
i_0_31 ).
cnf(c_0_65,negated_conjecture,
element(esk9_0,powerset(powerset(esk8_0))),
i_0_33 ).
cnf(c_0_66,plain,
( ~ in(X1,complements_of_subsets(X2,empty_set))
| ~ empty(X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62])]) ).
cnf(c_0_67,negated_conjecture,
complements_of_subsets(esk8_0,empty_set) = esk9_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65])]) ).
cnf(c_0_68,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
i_0_28 ).
cnf(c_0_69,plain,
element(esk3_1(X1),X1),
i_0_15 ).
cnf(c_0_70,negated_conjecture,
( ~ in(X1,esk9_0)
| ~ empty(X2) ),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_71,plain,
( in(esk3_1(X1),X1)
| empty(X1) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_72,negated_conjecture,
( empty(esk9_0)
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_73,plain,
empty(empty_set),
i_0_17 ).
cnf(c_0_74,plain,
empty(esk9_0),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_75,negated_conjecture,
empty_set != esk9_0,
i_0_32 ).
cnf(c_0_76,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_74]),c_0_75]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SEU174+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.32 % Computer : n004.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % 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 : Sun Jun 19 03:45:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.67/2.36 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.67/2.36 # No SInE strategy applied
% 7.67/2.36 # Trying AutoSched0 for 150 seconds
% 7.67/2.36 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
% 7.67/2.36 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.67/2.36 #
% 7.67/2.36 # Preprocessing time : 0.024 s
% 7.67/2.36 # Presaturation interreduction done
% 7.67/2.36
% 7.67/2.36 # Proof found!
% 7.67/2.36 # SZS status Theorem
% 7.67/2.36 # SZS output start CNFRefutation
% See solution above
% 7.67/2.36 # Training examples: 0 positive, 0 negative
% 7.67/2.36
% 7.67/2.36 # -------------------------------------------------
% 7.67/2.36 # User time : 0.029 s
% 7.67/2.36 # System time : 0.006 s
% 7.67/2.36 # Total time : 0.035 s
% 7.67/2.36 # Maximum resident set size: 7128 pages
% 7.67/2.36
%------------------------------------------------------------------------------