%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET935+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n019.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:23 EDT 2022
% Result : Theorem 4.49s 2.35s
% Output : CNFRefutation 4.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 38 ( 19 unt; 7 nHn; 27 RR)
% Number of literals : 69 ( 14 equ; 26 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 59 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_15,plain,
( in(X1,X2)
| in(X1,X3)
| X4 != set_union2(X3,X2)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4dk1d9ar/input.p',i_0_15) ).
cnf(i_0_8,plain,
( in(X1,X2)
| X2 != powerset(X3)
| ~ subset(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4dk1d9ar/input.p',i_0_8) ).
cnf(i_0_29,negated_conjecture,
powerset(set_union2(esk5_0,esk6_0)) = set_union2(powerset(esk5_0),powerset(esk6_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4dk1d9ar/input.p',i_0_29) ).
cnf(i_0_24,plain,
subset(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4dk1d9ar/input.p',i_0_24) ).
cnf(i_0_9,plain,
( subset(X1,X2)
| X3 != powerset(X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4dk1d9ar/input.p',i_0_9) ).
cnf(i_0_27,plain,
subset(X1,set_union2(X1,X2)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4dk1d9ar/input.p',i_0_27) ).
cnf(i_0_2,plain,
set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4dk1d9ar/input.p',i_0_2) ).
cnf(i_0_17,plain,
( inclusion_comparable(X1,X2)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4dk1d9ar/input.p',i_0_17) ).
cnf(i_0_3,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4dk1d9ar/input.p',i_0_3) ).
cnf(i_0_28,negated_conjecture,
~ inclusion_comparable(esk5_0,esk6_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4dk1d9ar/input.p',i_0_28) ).
cnf(i_0_16,plain,
( inclusion_comparable(X1,X2)
| ~ subset(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4dk1d9ar/input.p',i_0_16) ).
cnf(c_0_41,plain,
( in(X1,X2)
| in(X1,X3)
| X4 != set_union2(X3,X2)
| ~ in(X1,X4) ),
i_0_15 ).
cnf(c_0_42,plain,
( in(X1,X2)
| X2 != powerset(X3)
| ~ subset(X1,X3) ),
i_0_8 ).
cnf(c_0_43,plain,
( in(X1,X2)
| in(X1,X3)
| ~ in(X1,set_union2(X2,X3)) ),
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_44,negated_conjecture,
powerset(set_union2(esk5_0,esk6_0)) = set_union2(powerset(esk5_0),powerset(esk6_0)),
i_0_29 ).
cnf(c_0_45,plain,
( in(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(er,[status(thm)],[c_0_42]) ).
cnf(c_0_46,plain,
subset(X1,X1),
i_0_24 ).
cnf(c_0_47,plain,
( subset(X1,X2)
| X3 != powerset(X2)
| ~ in(X1,X3) ),
i_0_9 ).
cnf(c_0_48,negated_conjecture,
( in(X1,powerset(esk5_0))
| in(X1,powerset(esk6_0))
| ~ in(X1,powerset(set_union2(esk5_0,esk6_0))) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,plain,
in(X1,powerset(X1)),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,plain,
( subset(X1,X2)
| ~ in(X1,powerset(X2)) ),
inference(er,[status(thm)],[c_0_47]) ).
cnf(c_0_51,plain,
( in(set_union2(esk5_0,esk6_0),powerset(esk6_0))
| in(set_union2(esk5_0,esk6_0),powerset(esk5_0)) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_52,plain,
subset(X1,set_union2(X1,X2)),
i_0_27 ).
cnf(c_0_53,plain,
set_union2(X1,X2) = set_union2(X2,X1),
i_0_2 ).
cnf(c_0_54,plain,
( inclusion_comparable(X1,X2)
| ~ subset(X1,X2) ),
i_0_17 ).
cnf(c_0_55,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
i_0_3 ).
cnf(c_0_56,plain,
( in(set_union2(esk5_0,esk6_0),powerset(esk5_0))
| subset(set_union2(esk5_0,esk6_0),esk6_0) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_57,plain,
subset(X1,set_union2(X2,X1)),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_58,plain,
inclusion_comparable(X1,set_union2(X1,X2)),
inference(spm,[status(thm)],[c_0_54,c_0_52]) ).
cnf(c_0_59,plain,
( set_union2(esk5_0,esk6_0) = esk6_0
| in(set_union2(esk5_0,esk6_0),powerset(esk5_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57])]) ).
cnf(c_0_60,negated_conjecture,
~ inclusion_comparable(esk5_0,esk6_0),
i_0_28 ).
cnf(c_0_61,plain,
( inclusion_comparable(X1,X2)
| ~ subset(X2,X1) ),
i_0_16 ).
cnf(c_0_62,plain,
in(set_union2(esk5_0,esk6_0),powerset(esk5_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]) ).
cnf(c_0_63,plain,
inclusion_comparable(set_union2(X1,X2),X1),
inference(spm,[status(thm)],[c_0_61,c_0_52]) ).
cnf(c_0_64,plain,
subset(set_union2(esk5_0,esk6_0),esk5_0),
inference(spm,[status(thm)],[c_0_50,c_0_62]) ).
cnf(c_0_65,plain,
inclusion_comparable(set_union2(X1,X2),X2),
inference(spm,[status(thm)],[c_0_63,c_0_53]) ).
cnf(c_0_66,plain,
set_union2(esk5_0,esk6_0) = esk5_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_64]),c_0_52])]) ).
cnf(c_0_67,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_60]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET935+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n019.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 : Sat Jul 9 23:27:55 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 4.49/2.35 # ENIGMATIC: Solved by autoschedule:
% 4.49/2.35 # No SInE strategy applied
% 4.49/2.35 # Trying AutoSched0 for 150 seconds
% 4.49/2.35 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S006A
% 4.49/2.35 # and selection function SelectLargestNegLit.
% 4.49/2.35 #
% 4.49/2.35 # Preprocessing time : 0.012 s
% 4.49/2.35 # Presaturation interreduction done
% 4.49/2.35
% 4.49/2.35 # Proof found!
% 4.49/2.35 # SZS status Theorem
% 4.49/2.35 # SZS output start CNFRefutation
% See solution above
% 4.49/2.35 # Training examples: 0 positive, 0 negative
% 4.49/2.35
% 4.49/2.35 # -------------------------------------------------
% 4.49/2.35 # User time : 0.025 s
% 4.49/2.35 # System time : 0.000 s
% 4.49/2.35 # Total time : 0.025 s
% 4.49/2.35 # Maximum resident set size: 7116 pages
% 4.49/2.35
%------------------------------------------------------------------------------