%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET944+1 : TPTP v8.1.0. Released v3.2.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 00:15:26 EDT 2022
% Result : Theorem 7.52s 2.40s
% Output : CNFRefutation 7.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 36 ( 11 unt; 2 nHn; 34 RR)
% Number of literals : 79 ( 12 equ; 43 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-3 aty)
% Number of variables : 71 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_16,plain,
( in(esk3_3(X1,X2,X3),X1)
| X2 != union(X1)
| ~ in(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-52ycxrsu/lgb.p',i_0_16) ).
cnf(i_0_22,negated_conjecture,
~ subset(union(set_intersection2(esk8_0,esk9_0)),set_intersection2(union(esk8_0),union(esk9_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-52ycxrsu/lgb.p',i_0_22) ).
cnf(i_0_4,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-52ycxrsu/lgb.p',i_0_4) ).
cnf(i_0_10,plain,
( in(X1,X2)
| X3 != set_intersection2(X4,X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-52ycxrsu/lgb.p',i_0_10) ).
cnf(i_0_15,plain,
( in(X1,X2)
| X2 != union(X3)
| ~ in(X4,X3)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-52ycxrsu/lgb.p',i_0_15) ).
cnf(i_0_17,plain,
( in(X1,esk3_3(X2,X3,X1))
| X3 != union(X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-52ycxrsu/lgb.p',i_0_17) ).
cnf(i_0_11,plain,
( in(X1,X2)
| X3 != set_intersection2(X2,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-52ycxrsu/lgb.p',i_0_11) ).
cnf(i_0_9,plain,
( in(X1,X2)
| X2 != set_intersection2(X3,X4)
| ~ in(X1,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-52ycxrsu/lgb.p',i_0_9) ).
cnf(i_0_3,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-52ycxrsu/lgb.p',i_0_3) ).
cnf(c_0_32,plain,
( in(esk3_3(X1,X2,X3),X1)
| X2 != union(X1)
| ~ in(X3,X2) ),
i_0_16 ).
cnf(c_0_33,negated_conjecture,
~ subset(union(set_intersection2(esk8_0,esk9_0)),set_intersection2(union(esk8_0),union(esk9_0))),
i_0_22 ).
cnf(c_0_34,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
i_0_4 ).
cnf(c_0_35,plain,
( in(X1,X2)
| X3 != set_intersection2(X4,X2)
| ~ in(X1,X3) ),
i_0_10 ).
cnf(c_0_36,plain,
( in(esk3_3(X1,union(X1),X2),X1)
| ~ in(X2,union(X1)) ),
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_37,negated_conjecture,
in(esk1_2(union(set_intersection2(esk8_0,esk9_0)),set_intersection2(union(esk8_0),union(esk9_0))),union(set_intersection2(esk8_0,esk9_0))),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
( in(X1,X2)
| X2 != union(X3)
| ~ in(X4,X3)
| ~ in(X1,X4) ),
i_0_15 ).
cnf(c_0_39,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X3,X2)) ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_40,negated_conjecture,
in(esk3_3(set_intersection2(esk8_0,esk9_0),union(set_intersection2(esk8_0,esk9_0)),esk1_2(union(set_intersection2(esk8_0,esk9_0)),set_intersection2(union(esk8_0),union(esk9_0)))),set_intersection2(esk8_0,esk9_0)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
( in(X1,esk3_3(X2,X3,X1))
| X3 != union(X2)
| ~ in(X1,X3) ),
i_0_17 ).
cnf(c_0_42,plain,
( in(X1,X2)
| X3 != set_intersection2(X2,X4)
| ~ in(X1,X3) ),
i_0_11 ).
cnf(c_0_43,plain,
( in(X1,union(X2))
| ~ in(X3,X2)
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_38]) ).
cnf(c_0_44,plain,
in(esk3_3(set_intersection2(esk8_0,esk9_0),union(set_intersection2(esk8_0,esk9_0)),esk1_2(union(set_intersection2(esk8_0,esk9_0)),set_intersection2(union(esk8_0),union(esk9_0)))),esk9_0),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,plain,
( in(X1,esk3_3(X2,union(X2),X1))
| ~ in(X1,union(X2)) ),
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_46,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X2,X3)) ),
inference(er,[status(thm)],[c_0_42]) ).
cnf(c_0_47,plain,
( in(X1,X2)
| X2 != set_intersection2(X3,X4)
| ~ in(X1,X4)
| ~ in(X1,X3) ),
i_0_9 ).
cnf(c_0_48,plain,
( in(X1,union(esk9_0))
| ~ in(X1,esk3_3(set_intersection2(esk8_0,esk9_0),union(set_intersection2(esk8_0,esk9_0)),esk1_2(union(set_intersection2(esk8_0,esk9_0)),set_intersection2(union(esk8_0),union(esk9_0))))) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,negated_conjecture,
in(esk1_2(union(set_intersection2(esk8_0,esk9_0)),set_intersection2(union(esk8_0),union(esk9_0))),esk3_3(set_intersection2(esk8_0,esk9_0),union(set_intersection2(esk8_0,esk9_0)),esk1_2(union(set_intersection2(esk8_0,esk9_0)),set_intersection2(union(esk8_0),union(esk9_0))))),
inference(spm,[status(thm)],[c_0_45,c_0_37]) ).
cnf(c_0_50,plain,
in(esk3_3(set_intersection2(esk8_0,esk9_0),union(set_intersection2(esk8_0,esk9_0)),esk1_2(union(set_intersection2(esk8_0,esk9_0)),set_intersection2(union(esk8_0),union(esk9_0)))),esk8_0),
inference(spm,[status(thm)],[c_0_46,c_0_40]) ).
cnf(c_0_51,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_47]) ).
cnf(c_0_52,plain,
in(esk1_2(union(set_intersection2(esk8_0,esk9_0)),set_intersection2(union(esk8_0),union(esk9_0))),union(esk9_0)),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,plain,
( in(X1,union(esk8_0))
| ~ in(X1,esk3_3(set_intersection2(esk8_0,esk9_0),union(set_intersection2(esk8_0,esk9_0)),esk1_2(union(set_intersection2(esk8_0,esk9_0)),set_intersection2(union(esk8_0),union(esk9_0))))) ),
inference(spm,[status(thm)],[c_0_43,c_0_50]) ).
cnf(c_0_54,plain,
( in(esk1_2(union(set_intersection2(esk8_0,esk9_0)),set_intersection2(union(esk8_0),union(esk9_0))),set_intersection2(X1,union(esk9_0)))
| ~ in(esk1_2(union(set_intersection2(esk8_0,esk9_0)),set_intersection2(union(esk8_0),union(esk9_0))),X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,plain,
in(esk1_2(union(set_intersection2(esk8_0,esk9_0)),set_intersection2(union(esk8_0),union(esk9_0))),union(esk8_0)),
inference(spm,[status(thm)],[c_0_53,c_0_49]) ).
cnf(c_0_56,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
i_0_3 ).
cnf(c_0_57,plain,
in(esk1_2(union(set_intersection2(esk8_0,esk9_0)),set_intersection2(union(esk8_0),union(esk9_0))),set_intersection2(union(esk8_0),union(esk9_0))),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_58,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SET944+1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n004.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 : Sun Jul 10 04:21:24 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.52/2.40 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.52/2.40 # No SInE strategy applied
% 7.52/2.40 # Trying AutoSched0 for 150 seconds
% 7.52/2.40 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S008A
% 7.52/2.40 # and selection function SelectSmallestNegLit.
% 7.52/2.40 #
% 7.52/2.40 # Preprocessing time : 0.022 s
% 7.52/2.40 # Presaturation interreduction done
% 7.52/2.40
% 7.52/2.40 # Proof found!
% 7.52/2.40 # SZS status Theorem
% 7.52/2.40 # SZS output start CNFRefutation
% See solution above
% 7.52/2.40 # Training examples: 0 positive, 0 negative
% 7.52/2.40
% 7.52/2.40 # -------------------------------------------------
% 7.52/2.40 # User time : 0.082 s
% 7.52/2.40 # System time : 0.010 s
% 7.52/2.40 # Total time : 0.091 s
% 7.52/2.40 # Maximum resident set size: 7128 pages
% 7.52/2.40
%------------------------------------------------------------------------------