TSTP Solution File: SEU119+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU119+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n006.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:38:34 EDT 2022
% Result : Theorem 4.56s 2.17s
% Output : CNFRefutation 4.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 43 ( 5 unt; 12 nHn; 33 RR)
% Number of literals : 100 ( 27 equ; 45 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 75 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-15ade0w2/input.p',i_0_4) ).
cnf(i_0_5,plain,
( X1 = set_intersection2(X2,X3)
| in(esk2_3(X2,X3,X1),X1)
| in(esk2_3(X2,X3,X1),X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-15ade0w2/input.p',i_0_5) ).
cnf(i_0_9,plain,
( in(X1,X2)
| X3 != set_intersection2(X4,X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-15ade0w2/input.p',i_0_9) ).
cnf(i_0_20,negated_conjecture,
( disjoint(esk5_0,esk6_0)
| ~ in(X1,esk5_0)
| ~ in(X1,esk6_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-15ade0w2/input.p',i_0_20) ).
cnf(i_0_6,plain,
( X1 = set_intersection2(X2,X3)
| in(esk2_3(X2,X3,X1),X1)
| in(esk2_3(X2,X3,X1),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-15ade0w2/input.p',i_0_6) ).
cnf(i_0_3,plain,
( X1 = empty_set
| in(esk1_1(X1),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-15ade0w2/input.p',i_0_3) ).
cnf(i_0_10,plain,
( in(X1,X2)
| X3 != set_intersection2(X2,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-15ade0w2/input.p',i_0_10) ).
cnf(i_0_8,plain,
( in(X1,X2)
| X2 != set_intersection2(X3,X4)
| ~ in(X1,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-15ade0w2/input.p',i_0_8) ).
cnf(i_0_12,plain,
( set_intersection2(X1,X2) = empty_set
| ~ disjoint(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-15ade0w2/input.p',i_0_12) ).
cnf(i_0_24,negated_conjecture,
( in(esk7_0,esk6_0)
| ~ disjoint(esk5_0,esk6_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-15ade0w2/input.p',i_0_24) ).
cnf(i_0_11,plain,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-15ade0w2/input.p',i_0_11) ).
cnf(i_0_22,negated_conjecture,
( in(esk7_0,esk5_0)
| ~ in(X1,esk5_0)
| ~ in(X1,esk6_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-15ade0w2/input.p',i_0_22) ).
cnf(i_0_25,negated_conjecture,
( in(esk7_0,esk5_0)
| ~ disjoint(esk5_0,esk6_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-15ade0w2/input.p',i_0_25) ).
cnf(c_0_39,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
i_0_4 ).
cnf(c_0_40,plain,
~ in(X1,empty_set),
inference(er,[status(thm)],[c_0_39]) ).
cnf(c_0_41,plain,
( X1 = set_intersection2(X2,X3)
| in(esk2_3(X2,X3,X1),X1)
| in(esk2_3(X2,X3,X1),X3) ),
i_0_5 ).
cnf(c_0_42,plain,
( in(X1,X2)
| X3 != set_intersection2(X4,X2)
| ~ in(X1,X3) ),
i_0_9 ).
cnf(c_0_43,negated_conjecture,
( disjoint(esk5_0,esk6_0)
| ~ in(X1,esk5_0)
| ~ in(X1,esk6_0) ),
i_0_20 ).
cnf(c_0_44,plain,
( set_intersection2(X1,X2) = empty_set
| in(esk2_3(X1,X2,empty_set),X2) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,plain,
( X1 = set_intersection2(X2,X3)
| in(esk2_3(X2,X3,X1),X1)
| in(esk2_3(X2,X3,X1),X2) ),
i_0_6 ).
cnf(c_0_46,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X3,X2)) ),
inference(er,[status(thm)],[c_0_42]) ).
cnf(c_0_47,plain,
( X1 = empty_set
| in(esk1_1(X1),X1) ),
i_0_3 ).
cnf(c_0_48,plain,
( in(X1,X2)
| X3 != set_intersection2(X2,X4)
| ~ in(X1,X3) ),
i_0_10 ).
cnf(c_0_49,plain,
( in(X1,X2)
| X2 != set_intersection2(X3,X4)
| ~ in(X1,X4)
| ~ in(X1,X3) ),
i_0_8 ).
cnf(c_0_50,negated_conjecture,
( set_intersection2(X1,esk6_0) = empty_set
| disjoint(esk5_0,esk6_0)
| ~ in(esk2_3(X1,esk6_0,empty_set),esk5_0) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_51,plain,
( set_intersection2(X1,X2) = empty_set
| in(esk2_3(X1,X2,empty_set),X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_45]) ).
cnf(c_0_52,plain,
( set_intersection2(X1,X2) = empty_set
| ~ disjoint(X1,X2) ),
i_0_12 ).
cnf(c_0_53,negated_conjecture,
( in(esk7_0,esk6_0)
| ~ disjoint(esk5_0,esk6_0) ),
i_0_24 ).
cnf(c_0_54,plain,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
i_0_11 ).
cnf(c_0_55,negated_conjecture,
( in(esk7_0,esk5_0)
| ~ in(X1,esk5_0)
| ~ in(X1,esk6_0) ),
i_0_22 ).
cnf(c_0_56,plain,
( set_intersection2(X1,X2) = empty_set
| in(esk1_1(set_intersection2(X1,X2)),X2) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_57,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X2,X3)) ),
inference(er,[status(thm)],[c_0_48]) ).
cnf(c_0_58,negated_conjecture,
( in(esk7_0,esk5_0)
| ~ disjoint(esk5_0,esk6_0) ),
i_0_25 ).
cnf(c_0_59,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_49]) ).
cnf(c_0_60,negated_conjecture,
set_intersection2(esk5_0,esk6_0) = empty_set,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]) ).
cnf(c_0_61,negated_conjecture,
( in(esk7_0,esk6_0)
| set_intersection2(esk5_0,esk6_0) != empty_set ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_62,negated_conjecture,
( set_intersection2(X1,esk6_0) = empty_set
| in(esk7_0,esk5_0)
| ~ in(esk1_1(set_intersection2(X1,esk6_0)),esk5_0) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_63,plain,
( set_intersection2(X1,X2) = empty_set
| in(esk1_1(set_intersection2(X1,X2)),X1) ),
inference(spm,[status(thm)],[c_0_57,c_0_47]) ).
cnf(c_0_64,negated_conjecture,
( in(esk7_0,esk5_0)
| set_intersection2(esk5_0,esk6_0) != empty_set ),
inference(spm,[status(thm)],[c_0_58,c_0_54]) ).
cnf(c_0_65,plain,
( ~ in(X1,esk6_0)
| ~ in(X1,esk5_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_40]) ).
cnf(c_0_66,negated_conjecture,
in(esk7_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_60])]) ).
cnf(c_0_67,negated_conjecture,
in(esk7_0,esk5_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]) ).
cnf(c_0_68,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU119+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n006.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 : Mon Jun 20 12:19:27 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 4.56/2.17 # ENIGMATIC: Solved by autoschedule:
% 4.56/2.17 # No SInE strategy applied
% 4.56/2.17 # Trying AutoSched0 for 150 seconds
% 4.56/2.17 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 4.56/2.17 # and selection function SelectMaxLComplexAvoidPosPred.
% 4.56/2.17 #
% 4.56/2.17 # Preprocessing time : 0.021 s
% 4.56/2.17 # Presaturation interreduction done
% 4.56/2.17
% 4.56/2.17 # Proof found!
% 4.56/2.17 # SZS status Theorem
% 4.56/2.17 # SZS output start CNFRefutation
% See solution above
% 4.56/2.17 # Training examples: 0 positive, 0 negative
% 4.56/2.17
% 4.56/2.17 # -------------------------------------------------
% 4.56/2.17 # User time : 0.024 s
% 4.56/2.17 # System time : 0.005 s
% 4.56/2.17 # Total time : 0.030 s
% 4.56/2.17 # Maximum resident set size: 7120 pages
% 4.56/2.17
%------------------------------------------------------------------------------