TSTP Solution File: SEU140+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU140+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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:46 EDT 2022
% Result : Theorem 7.18s 2.30s
% Output : CNFRefutation 7.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of clauses : 30 ( 13 unt; 7 nHn; 25 RR)
% Number of literals : 54 ( 7 equ; 26 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 40 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_80,negated_conjecture,
~ disjoint(esk11_0,esk13_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kn5pdczj/input.p',i_0_80) ).
cnf(i_0_70,lemma,
( disjoint(X1,X2)
| in(esk9_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kn5pdczj/input.p',i_0_70) ).
cnf(i_0_69,lemma,
( ~ in(X1,X2)
| ~ in(X1,X3)
| ~ disjoint(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kn5pdczj/input.p',i_0_69) ).
cnf(i_0_51,plain,
( disjoint(X1,X2)
| ~ disjoint(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kn5pdczj/input.p',i_0_51) ).
cnf(i_0_81,negated_conjecture,
disjoint(esk12_0,esk13_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kn5pdczj/input.p',i_0_81) ).
cnf(i_0_28,plain,
( in(X1,X2)
| in(X1,X3)
| X2 != set_difference(X4,X3)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kn5pdczj/input.p',i_0_28) ).
cnf(i_0_46,lemma,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kn5pdczj/input.p',i_0_46) ).
cnf(i_0_82,negated_conjecture,
subset(esk11_0,esk12_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kn5pdczj/input.p',i_0_82) ).
cnf(i_0_9,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kn5pdczj/input.p',i_0_9) ).
cnf(i_0_71,lemma,
( disjoint(X1,X2)
| in(esk9_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kn5pdczj/input.p',i_0_71) ).
cnf(c_0_93,negated_conjecture,
~ disjoint(esk11_0,esk13_0),
i_0_80 ).
cnf(c_0_94,lemma,
( disjoint(X1,X2)
| in(esk9_2(X1,X2),X2) ),
i_0_70 ).
cnf(c_0_95,lemma,
( ~ in(X1,X2)
| ~ in(X1,X3)
| ~ disjoint(X3,X2) ),
i_0_69 ).
cnf(c_0_96,negated_conjecture,
in(esk9_2(esk11_0,esk13_0),esk13_0),
inference(spm,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_97,plain,
( disjoint(X1,X2)
| ~ disjoint(X2,X1) ),
i_0_51 ).
cnf(c_0_98,negated_conjecture,
disjoint(esk12_0,esk13_0),
i_0_81 ).
cnf(c_0_99,plain,
( in(X1,X2)
| in(X1,X3)
| X2 != set_difference(X4,X3)
| ~ in(X1,X4) ),
i_0_28 ).
cnf(c_0_100,lemma,
( set_difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
i_0_46 ).
cnf(c_0_101,negated_conjecture,
subset(esk11_0,esk12_0),
i_0_82 ).
cnf(c_0_102,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
i_0_9 ).
cnf(c_0_103,lemma,
( ~ in(esk9_2(esk11_0,esk13_0),X1)
| ~ disjoint(esk13_0,X1) ),
inference(spm,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_104,negated_conjecture,
disjoint(esk13_0,esk12_0),
inference(spm,[status(thm)],[c_0_97,c_0_98]) ).
cnf(c_0_105,plain,
( in(X1,set_difference(X2,X3))
| in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_99]) ).
cnf(c_0_106,negated_conjecture,
set_difference(esk11_0,esk12_0) = empty_set,
inference(spm,[status(thm)],[c_0_100,c_0_101]) ).
cnf(c_0_107,plain,
~ in(X1,empty_set),
inference(er,[status(thm)],[c_0_102]) ).
cnf(c_0_108,lemma,
( disjoint(X1,X2)
| in(esk9_2(X1,X2),X1) ),
i_0_71 ).
cnf(c_0_109,negated_conjecture,
~ in(esk9_2(esk11_0,esk13_0),esk12_0),
inference(spm,[status(thm)],[c_0_103,c_0_104]) ).
cnf(c_0_110,plain,
( in(X1,esk12_0)
| ~ in(X1,esk11_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_106]),c_0_107]) ).
cnf(c_0_111,negated_conjecture,
in(esk9_2(esk11_0,esk13_0),esk11_0),
inference(spm,[status(thm)],[c_0_93,c_0_108]) ).
cnf(c_0_112,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_111])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SEU140+2 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n011.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 09:44:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.18/2.30 # ENIGMATIC: Solved by autoschedule:
% 7.18/2.30 # No SInE strategy applied
% 7.18/2.30 # Trying AutoSched0 for 150 seconds
% 7.18/2.30 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y
% 7.18/2.30 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.18/2.30 #
% 7.18/2.30 # Preprocessing time : 0.024 s
% 7.18/2.30 # Presaturation interreduction done
% 7.18/2.30
% 7.18/2.30 # Proof found!
% 7.18/2.30 # SZS status Theorem
% 7.18/2.30 # SZS output start CNFRefutation
% See solution above
% 7.18/2.30 # Training examples: 0 positive, 0 negative
% 7.18/2.30
% 7.18/2.30 # -------------------------------------------------
% 7.18/2.30 # User time : 0.046 s
% 7.18/2.30 # System time : 0.004 s
% 7.18/2.30 # Total time : 0.051 s
% 7.18/2.30 # Maximum resident set size: 7124 pages
% 7.18/2.30
%------------------------------------------------------------------------------