TSTP Solution File: SEU094+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU094+1 : TPTP v8.1.0. Released v3.2.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:25 EDT 2022
% Result : Theorem 7.89s 2.53s
% Output : CNFRefutation 7.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of clauses : 32 ( 7 unt; 8 nHn; 30 RR)
% Number of literals : 70 ( 0 equ; 34 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-1 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_135,plain,
( finite(X1)
| ~ finite(X2)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-st0cpzrp/lgb.p',i_0_135) ).
cnf(i_0_134,plain,
subset(X1,powerset(union(X1))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-st0cpzrp/lgb.p',i_0_134) ).
cnf(i_0_138,plain,
( finite(powerset(X1))
| ~ finite(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-st0cpzrp/lgb.p',i_0_138) ).
cnf(i_0_140,negated_conjecture,
( finite(esk28_0)
| finite(union(esk28_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-st0cpzrp/lgb.p',i_0_140) ).
cnf(i_0_47,plain,
( finite(union(X1))
| in(esk2_1(X1),X1)
| ~ finite(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-st0cpzrp/lgb.p',i_0_47) ).
cnf(i_0_139,negated_conjecture,
( finite(X1)
| finite(union(esk28_0))
| ~ in(X1,esk28_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-st0cpzrp/lgb.p',i_0_139) ).
cnf(i_0_142,negated_conjecture,
( in(esk29_0,esk28_0)
| ~ finite(esk28_0)
| ~ finite(union(esk28_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-st0cpzrp/lgb.p',i_0_142) ).
cnf(i_0_46,plain,
( finite(union(X1))
| ~ finite(X1)
| ~ finite(esk2_1(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-st0cpzrp/lgb.p',i_0_46) ).
cnf(i_0_141,negated_conjecture,
( ~ finite(esk28_0)
| ~ finite(esk29_0)
| ~ finite(union(esk28_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-st0cpzrp/lgb.p',i_0_141) ).
cnf(i_0_151,plain,
( subset(X1,union(X2))
| ~ in(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-st0cpzrp/lgb.p',i_0_151) ).
cnf(c_0_162,plain,
( finite(X1)
| ~ finite(X2)
| ~ subset(X1,X2) ),
i_0_135 ).
cnf(c_0_163,plain,
subset(X1,powerset(union(X1))),
i_0_134 ).
cnf(c_0_164,plain,
( finite(X1)
| ~ finite(powerset(union(X1))) ),
inference(spm,[status(thm)],[c_0_162,c_0_163]) ).
cnf(c_0_165,plain,
( finite(powerset(X1))
| ~ finite(X1) ),
i_0_138 ).
cnf(c_0_166,plain,
( finite(X1)
| ~ finite(union(X1)) ),
inference(spm,[status(thm)],[c_0_164,c_0_165]) ).
cnf(c_0_167,negated_conjecture,
( finite(esk28_0)
| finite(union(esk28_0)) ),
i_0_140 ).
cnf(c_0_168,plain,
( finite(union(X1))
| in(esk2_1(X1),X1)
| ~ finite(X1) ),
i_0_47 ).
cnf(c_0_169,negated_conjecture,
finite(esk28_0),
inference(spm,[status(thm)],[c_0_166,c_0_167]) ).
cnf(c_0_170,negated_conjecture,
( finite(X1)
| finite(union(esk28_0))
| ~ in(X1,esk28_0) ),
i_0_139 ).
cnf(c_0_171,negated_conjecture,
( finite(union(esk28_0))
| in(esk2_1(esk28_0),esk28_0) ),
inference(spm,[status(thm)],[c_0_168,c_0_169]) ).
cnf(c_0_172,negated_conjecture,
( in(esk29_0,esk28_0)
| ~ finite(esk28_0)
| ~ finite(union(esk28_0)) ),
i_0_142 ).
cnf(c_0_173,plain,
( finite(union(X1))
| ~ finite(X1)
| ~ finite(esk2_1(X1)) ),
i_0_46 ).
cnf(c_0_174,negated_conjecture,
( finite(esk2_1(esk28_0))
| finite(union(esk28_0)) ),
inference(spm,[status(thm)],[c_0_170,c_0_171]) ).
cnf(c_0_175,negated_conjecture,
( ~ finite(esk28_0)
| ~ finite(esk29_0)
| ~ finite(union(esk28_0)) ),
i_0_141 ).
cnf(c_0_176,plain,
( subset(X1,union(X2))
| ~ in(X1,X2) ),
i_0_151 ).
cnf(c_0_177,negated_conjecture,
( in(esk29_0,esk28_0)
| ~ finite(union(esk28_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_172,c_0_169])]) ).
cnf(c_0_178,plain,
finite(union(esk28_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_173,c_0_174]),c_0_169])]) ).
cnf(c_0_179,negated_conjecture,
( ~ finite(union(esk28_0))
| ~ finite(esk29_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_175,c_0_169])]) ).
cnf(c_0_180,plain,
( finite(X1)
| ~ finite(union(X2))
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_162,c_0_176]) ).
cnf(c_0_181,negated_conjecture,
in(esk29_0,esk28_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_177,c_0_178])]) ).
cnf(c_0_182,negated_conjecture,
~ finite(esk29_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_179,c_0_178])]) ).
cnf(c_0_183,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_180,c_0_181]),c_0_178])]),c_0_182]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SEU094+1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n006.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 : Sun Jun 19 22:46:42 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.47 # ENIGMATIC: Selected complete mode:
% 7.89/2.53 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.89/2.53 # No SInE strategy applied
% 7.89/2.53 # Trying AutoSched0 for 150 seconds
% 7.89/2.53 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.89/2.53 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.89/2.53 #
% 7.89/2.53 # Preprocessing time : 0.024 s
% 7.89/2.53 # Presaturation interreduction done
% 7.89/2.53
% 7.89/2.53 # Proof found!
% 7.89/2.53 # SZS status Theorem
% 7.89/2.53 # SZS output start CNFRefutation
% See solution above
% 7.89/2.53 # Training examples: 0 positive, 0 negative
% 7.89/2.53
% 7.89/2.53 # -------------------------------------------------
% 7.89/2.53 # User time : 0.028 s
% 7.89/2.53 # System time : 0.011 s
% 7.89/2.53 # Total time : 0.039 s
% 7.89/2.53 # Maximum resident set size: 7120 pages
% 7.89/2.53
%------------------------------------------------------------------------------