TSTP Solution File: SET938+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET938+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n008.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:24 EDT 2022
% Result : Theorem 9.08s 2.65s
% Output : CNFRefutation 9.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of clauses : 39 ( 11 unt; 10 nHn; 27 RR)
% Number of literals : 83 ( 10 equ; 37 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 5 ( 2 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 : 85 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
( subset(X1,X2)
| X3 != powerset(X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ihalt_bd/input.p',i_0_7) ).
cnf(i_0_6,plain,
( in(X1,X2)
| X2 != powerset(X3)
| ~ subset(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ihalt_bd/input.p',i_0_6) ).
cnf(i_0_16,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ihalt_bd/input.p',i_0_16) ).
cnf(i_0_15,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ihalt_bd/input.p',i_0_15) ).
cnf(i_0_14,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ihalt_bd/input.p',i_0_14) ).
cnf(i_0_11,plain,
( in(X1,X2)
| X2 != set_union2(X3,X4)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ihalt_bd/input.p',i_0_11) ).
cnf(i_0_13,plain,
( in(X1,X2)
| in(X1,X3)
| X4 != set_union2(X3,X2)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ihalt_bd/input.p',i_0_13) ).
cnf(i_0_24,negated_conjecture,
~ subset(set_union2(powerset(set_difference(esk6_0,esk7_0)),powerset(set_difference(esk7_0,esk6_0))),powerset(set_union2(set_difference(esk6_0,esk7_0),set_difference(esk7_0,esk6_0)))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ihalt_bd/input.p',i_0_24) ).
cnf(i_0_2,plain,
set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ihalt_bd/input.p',i_0_2) ).
cnf(c_0_34,plain,
( subset(X1,X2)
| X3 != powerset(X2)
| ~ in(X1,X3) ),
i_0_7 ).
cnf(c_0_35,plain,
( in(X1,X2)
| X2 != powerset(X3)
| ~ subset(X1,X3) ),
i_0_6 ).
cnf(c_0_36,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
i_0_16 ).
cnf(c_0_37,plain,
( subset(X1,X2)
| ~ in(X1,powerset(X2)) ),
inference(er,[status(thm)],[c_0_34]) ).
cnf(c_0_38,plain,
( in(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_39,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
i_0_15 ).
cnf(c_0_40,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
i_0_14 ).
cnf(c_0_41,plain,
( in(X1,X2)
| X2 != set_union2(X3,X4)
| ~ in(X1,X4) ),
i_0_11 ).
cnf(c_0_42,plain,
( in(X1,X2)
| ~ in(X3,powerset(X2))
| ~ in(X1,X3) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,plain,
( in(esk3_2(X1,X2),X1)
| in(X1,powerset(X2)) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,plain,
( in(X1,powerset(X2))
| ~ in(esk3_2(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_40]) ).
cnf(c_0_45,plain,
( in(X1,set_union2(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_46,plain,
( in(powerset(X1),powerset(X2))
| in(X3,X1)
| ~ in(X3,esk3_2(powerset(X1),X2)) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,plain,
( in(X1,powerset(set_union2(X2,X3)))
| ~ in(esk3_2(X1,set_union2(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,plain,
( in(esk3_2(esk3_2(powerset(X1),X2),X3),X1)
| in(esk3_2(powerset(X1),X2),powerset(X3))
| in(powerset(X1),powerset(X2)) ),
inference(spm,[status(thm)],[c_0_46,c_0_43]) ).
cnf(c_0_49,plain,
( in(esk3_2(powerset(X1),X2),powerset(set_union2(X3,X1)))
| in(powerset(X1),powerset(X2)) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_50,plain,
( in(X1,X2)
| in(X1,X3)
| X4 != set_union2(X3,X2)
| ~ in(X1,X4) ),
i_0_13 ).
cnf(c_0_51,negated_conjecture,
~ subset(set_union2(powerset(set_difference(esk6_0,esk7_0)),powerset(set_difference(esk7_0,esk6_0))),powerset(set_union2(set_difference(esk6_0,esk7_0),set_difference(esk7_0,esk6_0)))),
i_0_24 ).
cnf(c_0_52,plain,
in(powerset(X1),powerset(powerset(set_union2(X2,X1)))),
inference(spm,[status(thm)],[c_0_44,c_0_49]) ).
cnf(c_0_53,plain,
set_union2(X1,X2) = set_union2(X2,X1),
i_0_2 ).
cnf(c_0_54,plain,
( in(X1,X2)
| in(X1,X3)
| ~ in(X1,set_union2(X2,X3)) ),
inference(er,[status(thm)],[c_0_50]) ).
cnf(c_0_55,negated_conjecture,
in(esk3_2(set_union2(powerset(set_difference(esk6_0,esk7_0)),powerset(set_difference(esk7_0,esk6_0))),powerset(set_union2(set_difference(esk6_0,esk7_0),set_difference(esk7_0,esk6_0)))),set_union2(powerset(set_difference(esk6_0,esk7_0)),powerset(set_difference(esk7_0,esk6_0)))),
inference(spm,[status(thm)],[c_0_51,c_0_39]) ).
cnf(c_0_56,negated_conjecture,
~ in(esk3_2(set_union2(powerset(set_difference(esk6_0,esk7_0)),powerset(set_difference(esk7_0,esk6_0))),powerset(set_union2(set_difference(esk6_0,esk7_0),set_difference(esk7_0,esk6_0)))),powerset(set_union2(set_difference(esk6_0,esk7_0),set_difference(esk7_0,esk6_0)))),
inference(spm,[status(thm)],[c_0_51,c_0_40]) ).
cnf(c_0_57,plain,
( in(X1,powerset(set_union2(X2,X3)))
| ~ in(X1,powerset(X3)) ),
inference(spm,[status(thm)],[c_0_42,c_0_52]) ).
cnf(c_0_58,plain,
in(powerset(X1),powerset(powerset(set_union2(X1,X2)))),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_59,plain,
( in(esk3_2(set_union2(powerset(set_difference(esk6_0,esk7_0)),powerset(set_difference(esk7_0,esk6_0))),powerset(set_union2(set_difference(esk6_0,esk7_0),set_difference(esk7_0,esk6_0)))),powerset(set_difference(esk6_0,esk7_0)))
| in(esk3_2(set_union2(powerset(set_difference(esk6_0,esk7_0)),powerset(set_difference(esk7_0,esk6_0))),powerset(set_union2(set_difference(esk6_0,esk7_0),set_difference(esk7_0,esk6_0)))),powerset(set_difference(esk7_0,esk6_0))) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_60,negated_conjecture,
~ in(esk3_2(set_union2(powerset(set_difference(esk6_0,esk7_0)),powerset(set_difference(esk7_0,esk6_0))),powerset(set_union2(set_difference(esk6_0,esk7_0),set_difference(esk7_0,esk6_0)))),powerset(set_difference(esk7_0,esk6_0))),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_61,plain,
( in(X1,powerset(set_union2(X2,X3)))
| ~ in(X1,powerset(X2)) ),
inference(spm,[status(thm)],[c_0_42,c_0_58]) ).
cnf(c_0_62,plain,
in(esk3_2(set_union2(powerset(set_difference(esk6_0,esk7_0)),powerset(set_difference(esk7_0,esk6_0))),powerset(set_union2(set_difference(esk6_0,esk7_0),set_difference(esk7_0,esk6_0)))),powerset(set_difference(esk6_0,esk7_0))),
inference(sr,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_63,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_61]),c_0_62])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET938+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n008.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jul 9 17:42:40 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected complete mode:
% 9.08/2.65 # ENIGMATIC: Solved by autoschedule:
% 9.08/2.65 # No SInE strategy applied
% 9.08/2.65 # Trying AutoSched0 for 150 seconds
% 9.08/2.65 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S032I
% 9.08/2.65 # and selection function SelectUnlessUniqMax.
% 9.08/2.65 #
% 9.08/2.65 # Preprocessing time : 0.024 s
% 9.08/2.65 # Presaturation interreduction done
% 9.08/2.65
% 9.08/2.65 # Proof found!
% 9.08/2.65 # SZS status Theorem
% 9.08/2.65 # SZS output start CNFRefutation
% See solution above
% 9.08/2.65 # Training examples: 0 positive, 0 negative
% 9.08/2.65
% 9.08/2.65 # -------------------------------------------------
% 9.08/2.65 # User time : 0.174 s
% 9.08/2.65 # System time : 0.009 s
% 9.08/2.65 # Total time : 0.183 s
% 9.08/2.65 # Maximum resident set size: 7120 pages
% 9.08/2.65
%------------------------------------------------------------------------------