TSTP Solution File: SEU141+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU141+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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:47 EDT 2022
% Result : Theorem 7.32s 2.35s
% Output : CNFRefutation 7.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 29 ( 11 unt; 7 nHn; 20 RR)
% Number of literals : 56 ( 23 equ; 24 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 : 5 ( 5 usr; 3 con; 0-3 aty)
% Number of variables : 34 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_85,negated_conjecture,
( set_difference(esk11_0,esk12_0) != esk11_0
| ~ disjoint(esk11_0,esk12_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xlmxz7hw/input.p',i_0_85) ).
cnf(i_0_31,plain,
( disjoint(X1,X2)
| set_difference(X1,set_difference(X1,X2)) != empty_set ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xlmxz7hw/input.p',i_0_31) ).
cnf(i_0_59,plain,
set_difference(X1,set_difference(X1,empty_set)) = empty_set,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xlmxz7hw/input.p',i_0_59) ).
cnf(i_0_68,plain,
set_difference(X1,empty_set) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xlmxz7hw/input.p',i_0_68) ).
cnf(i_0_26,plain,
( X1 = set_difference(X2,X3)
| in(esk5_3(X2,X3,X1),X1)
| in(esk5_3(X2,X3,X1),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xlmxz7hw/input.p',i_0_26) ).
cnf(i_0_27,plain,
( X1 = set_difference(X2,X3)
| in(esk5_3(X2,X3,X1),X3)
| ~ in(esk5_3(X2,X3,X1),X1)
| ~ in(esk5_3(X2,X3,X1),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xlmxz7hw/input.p',i_0_27) ).
cnf(i_0_69,lemma,
( ~ in(X1,X2)
| ~ in(X1,X3)
| ~ disjoint(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xlmxz7hw/input.p',i_0_69) ).
cnf(i_0_84,negated_conjecture,
( set_difference(esk11_0,esk12_0) = esk11_0
| disjoint(esk11_0,esk12_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xlmxz7hw/input.p',i_0_84) ).
cnf(i_0_46,lemma,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xlmxz7hw/input.p',i_0_46) ).
cnf(i_0_50,plain,
subset(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xlmxz7hw/input.p',i_0_50) ).
cnf(c_0_96,negated_conjecture,
( set_difference(esk11_0,esk12_0) != esk11_0
| ~ disjoint(esk11_0,esk12_0) ),
i_0_85 ).
cnf(c_0_97,plain,
( disjoint(X1,X2)
| set_difference(X1,set_difference(X1,X2)) != empty_set ),
i_0_31 ).
cnf(c_0_98,plain,
set_difference(X1,set_difference(X1,empty_set)) = empty_set,
i_0_59 ).
cnf(c_0_99,plain,
set_difference(X1,empty_set) = X1,
i_0_68 ).
cnf(c_0_100,negated_conjecture,
( set_difference(esk11_0,set_difference(esk11_0,esk12_0)) != empty_set
| set_difference(esk11_0,esk12_0) != esk11_0 ),
inference(spm,[status(thm)],[c_0_96,c_0_97]) ).
cnf(c_0_101,plain,
( X1 = set_difference(X2,X3)
| in(esk5_3(X2,X3,X1),X1)
| in(esk5_3(X2,X3,X1),X2) ),
i_0_26 ).
cnf(c_0_102,plain,
set_difference(X1,X1) = empty_set,
inference(rw,[status(thm)],[c_0_98,c_0_99]) ).
cnf(c_0_103,plain,
( X1 = set_difference(X2,X3)
| in(esk5_3(X2,X3,X1),X3)
| ~ in(esk5_3(X2,X3,X1),X1)
| ~ in(esk5_3(X2,X3,X1),X2) ),
i_0_27 ).
cnf(c_0_104,plain,
in(esk5_3(esk11_0,esk12_0,esk11_0),esk11_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101])]),c_0_102])]) ).
cnf(c_0_105,lemma,
( ~ in(X1,X2)
| ~ in(X1,X3)
| ~ disjoint(X3,X2) ),
i_0_69 ).
cnf(c_0_106,negated_conjecture,
( set_difference(esk11_0,esk12_0) = esk11_0
| disjoint(esk11_0,esk12_0) ),
i_0_84 ).
cnf(c_0_107,plain,
( set_difference(esk11_0,esk12_0) = esk11_0
| in(esk5_3(esk11_0,esk12_0,esk11_0),esk12_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_104]),c_0_104])]) ).
cnf(c_0_108,lemma,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
i_0_46 ).
cnf(c_0_109,negated_conjecture,
( set_difference(esk11_0,esk12_0) = esk11_0
| ~ in(X1,esk11_0)
| ~ in(X1,esk12_0) ),
inference(spm,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_110,negated_conjecture,
in(esk5_3(esk11_0,esk12_0,esk11_0),esk12_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_107]),c_0_102])]) ).
cnf(c_0_111,lemma,
( set_difference(esk11_0,esk12_0) != esk11_0
| ~ subset(esk11_0,set_difference(esk11_0,esk12_0)) ),
inference(spm,[status(thm)],[c_0_100,c_0_108]) ).
cnf(c_0_112,negated_conjecture,
set_difference(esk11_0,esk12_0) = esk11_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_104])]) ).
cnf(c_0_113,plain,
subset(X1,X1),
i_0_50 ).
cnf(c_0_114,lemma,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_111,c_0_112]),c_0_112]),c_0_113])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU141+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n005.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 Jun 19 01:55:10 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.32/2.35 # ENIGMATIC: Solved by autoschedule:
% 7.32/2.35 # No SInE strategy applied
% 7.32/2.35 # Trying AutoSched0 for 150 seconds
% 7.32/2.35 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y
% 7.32/2.35 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.32/2.35 #
% 7.32/2.35 # Preprocessing time : 0.013 s
% 7.32/2.35 # Presaturation interreduction done
% 7.32/2.35
% 7.32/2.35 # Proof found!
% 7.32/2.35 # SZS status Theorem
% 7.32/2.35 # SZS output start CNFRefutation
% See solution above
% 7.32/2.35 # Training examples: 0 positive, 0 negative
% 7.32/2.35
% 7.32/2.35 # -------------------------------------------------
% 7.32/2.35 # User time : 0.032 s
% 7.32/2.35 # System time : 0.003 s
% 7.32/2.35 # Total time : 0.035 s
% 7.32/2.35 # Maximum resident set size: 7120 pages
% 7.32/2.35
%------------------------------------------------------------------------------