%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET889+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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 00:15:02 EDT 2022
% Result : Theorem 7.96s 2.39s
% Output : CNFRefutation 7.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 35 ( 11 unt; 10 nHn; 24 RR)
% Number of literals : 78 ( 35 equ; 33 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 68 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_6,plain,
( subset(X1,X2)
| X3 != powerset(X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-baitolzy/input.p',i_0_6) ).
cnf(i_0_22,negated_conjecture,
unordered_pair(empty_set,singleton(esk6_0)) != powerset(singleton(esk6_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-baitolzy/input.p',i_0_22) ).
cnf(i_0_20,plain,
( X1 = X2
| in(esk5_2(X1,X2),X2)
| in(esk5_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-baitolzy/input.p',i_0_20) ).
cnf(i_0_12,plain,
( X1 = X2
| X1 = X3
| X4 != unordered_pair(X3,X2)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-baitolzy/input.p',i_0_12) ).
cnf(i_0_5,plain,
( in(X1,X2)
| X2 != powerset(X3)
| ~ subset(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-baitolzy/input.p',i_0_5) ).
cnf(i_0_16,plain,
( X1 = empty_set
| X1 = singleton(X2)
| ~ subset(X1,singleton(X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-baitolzy/input.p',i_0_16) ).
cnf(i_0_19,plain,
subset(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-baitolzy/input.p',i_0_19) ).
cnf(i_0_10,plain,
( in(X1,X2)
| X1 != X3
| X2 != unordered_pair(X4,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-baitolzy/input.p',i_0_10) ).
cnf(i_0_15,plain,
( subset(X1,singleton(X2))
| X1 != empty_set ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-baitolzy/input.p',i_0_15) ).
cnf(i_0_21,plain,
( X1 = X2
| ~ in(esk5_2(X1,X2),X2)
| ~ in(esk5_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-baitolzy/input.p',i_0_21) ).
cnf(i_0_11,plain,
( in(X1,X2)
| X1 != X3
| X2 != unordered_pair(X3,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-baitolzy/input.p',i_0_11) ).
cnf(c_0_34,plain,
( subset(X1,X2)
| X3 != powerset(X2)
| ~ in(X1,X3) ),
i_0_6 ).
cnf(c_0_35,negated_conjecture,
unordered_pair(empty_set,singleton(esk6_0)) != powerset(singleton(esk6_0)),
i_0_22 ).
cnf(c_0_36,plain,
( X1 = X2
| in(esk5_2(X1,X2),X2)
| in(esk5_2(X1,X2),X1) ),
i_0_20 ).
cnf(c_0_37,plain,
( subset(X1,X2)
| ~ in(X1,powerset(X2)) ),
inference(er,[status(thm)],[c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( in(esk5_2(unordered_pair(empty_set,singleton(esk6_0)),powerset(singleton(esk6_0))),unordered_pair(empty_set,singleton(esk6_0)))
| in(esk5_2(unordered_pair(empty_set,singleton(esk6_0)),powerset(singleton(esk6_0))),powerset(singleton(esk6_0))) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36])]) ).
cnf(c_0_39,plain,
( X1 = X2
| X1 = X3
| X4 != unordered_pair(X3,X2)
| ~ in(X1,X4) ),
i_0_12 ).
cnf(c_0_40,plain,
( in(X1,X2)
| X2 != powerset(X3)
| ~ subset(X1,X3) ),
i_0_5 ).
cnf(c_0_41,plain,
( X1 = empty_set
| X1 = singleton(X2)
| ~ subset(X1,singleton(X2)) ),
i_0_16 ).
cnf(c_0_42,plain,
( in(esk5_2(unordered_pair(empty_set,singleton(esk6_0)),powerset(singleton(esk6_0))),unordered_pair(empty_set,singleton(esk6_0)))
| subset(esk5_2(unordered_pair(empty_set,singleton(esk6_0)),powerset(singleton(esk6_0))),singleton(esk6_0)) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,plain,
( X1 = X2
| X1 = X3
| ~ in(X1,unordered_pair(X2,X3)) ),
inference(er,[status(thm)],[c_0_39]) ).
cnf(c_0_44,plain,
( in(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(er,[status(thm)],[c_0_40]) ).
cnf(c_0_45,plain,
subset(X1,X1),
i_0_19 ).
cnf(c_0_46,plain,
( in(X1,X2)
| X1 != X3
| X2 != unordered_pair(X4,X3) ),
i_0_10 ).
cnf(c_0_47,plain,
( subset(X1,singleton(X2))
| X1 != empty_set ),
i_0_15 ).
cnf(c_0_48,plain,
( X1 = X2
| ~ in(esk5_2(X1,X2),X2)
| ~ in(esk5_2(X1,X2),X1) ),
i_0_21 ).
cnf(c_0_49,plain,
( esk5_2(unordered_pair(empty_set,singleton(esk6_0)),powerset(singleton(esk6_0))) = singleton(esk6_0)
| esk5_2(unordered_pair(empty_set,singleton(esk6_0)),powerset(singleton(esk6_0))) = empty_set ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_50,plain,
in(X1,powerset(X1)),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_51,plain,
in(X1,unordered_pair(X2,X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_46])]) ).
cnf(c_0_52,plain,
subset(empty_set,singleton(X1)),
inference(er,[status(thm)],[c_0_47]) ).
cnf(c_0_53,plain,
( in(X1,X2)
| X1 != X3
| X2 != unordered_pair(X3,X4) ),
i_0_11 ).
cnf(c_0_54,plain,
esk5_2(unordered_pair(empty_set,singleton(esk6_0)),powerset(singleton(esk6_0))) = empty_set,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_51])]),c_0_35]) ).
cnf(c_0_55,plain,
in(empty_set,powerset(singleton(X1))),
inference(spm,[status(thm)],[c_0_44,c_0_52]) ).
cnf(c_0_56,plain,
in(X1,unordered_pair(X1,X2)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_53])]) ).
cnf(c_0_57,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_54]),c_0_55]),c_0_56])]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET889+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n007.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % 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 Jul 10 03:57:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.96/2.39 # ENIGMATIC: Solved by autoschedule:
% 7.96/2.39 # No SInE strategy applied
% 7.96/2.39 # Trying AutoSched0 for 150 seconds
% 7.96/2.39 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S074A
% 7.96/2.39 # and selection function SelectCQIArEqFirst.
% 7.96/2.39 #
% 7.96/2.39 # Preprocessing time : 0.013 s
% 7.96/2.39 # Presaturation interreduction done
% 7.96/2.39
% 7.96/2.39 # Proof found!
% 7.96/2.39 # SZS status Theorem
% 7.96/2.39 # SZS output start CNFRefutation
% See solution above
% 7.96/2.39 # Training examples: 0 positive, 0 negative
% 7.96/2.39
% 7.96/2.39 # -------------------------------------------------
% 7.96/2.39 # User time : 0.017 s
% 7.96/2.39 # System time : 0.004 s
% 7.96/2.39 # Total time : 0.021 s
% 7.96/2.39 # Maximum resident set size: 7120 pages
% 7.96/2.39
%------------------------------------------------------------------------------