TSTP Solution File: SEU173+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU173+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:39:11 EDT 2022
% Result : Theorem 8.97s 2.36s
% Output : CNFRefutation 8.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 5 unt; 5 nHn; 17 RR)
% Number of literals : 39 ( 2 equ; 20 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 29 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_21,plain,
( empty(X1)
| element(X2,X1)
| ~ in(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z2eh12hg/input.p',i_0_21) ).
cnf(i_0_181,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z2eh12hg/input.p',i_0_181) ).
cnf(i_0_110,negated_conjecture,
~ element(esk18_0,powerset(esk19_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z2eh12hg/input.p',i_0_110) ).
cnf(i_0_17,plain,
( in(X1,X2)
| X2 != powerset(X3)
| ~ subset(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z2eh12hg/input.p',i_0_17) ).
cnf(i_0_111,negated_conjecture,
( in(X1,esk19_0)
| ~ in(X1,esk18_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z2eh12hg/input.p',i_0_111) ).
cnf(i_0_44,plain,
( subset(X1,X2)
| in(esk11_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z2eh12hg/input.p',i_0_44) ).
cnf(i_0_43,plain,
( subset(X1,X2)
| ~ in(esk11_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z2eh12hg/input.p',i_0_43) ).
cnf(c_0_189,plain,
( empty(X1)
| element(X2,X1)
| ~ in(X2,X1) ),
i_0_21 ).
cnf(c_0_190,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
i_0_181 ).
cnf(c_0_191,negated_conjecture,
~ element(esk18_0,powerset(esk19_0)),
i_0_110 ).
cnf(c_0_192,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
inference(csr,[status(thm)],[c_0_189,c_0_190]) ).
cnf(c_0_193,plain,
( in(X1,X2)
| X2 != powerset(X3)
| ~ subset(X1,X3) ),
i_0_17 ).
cnf(c_0_194,negated_conjecture,
( in(X1,esk19_0)
| ~ in(X1,esk18_0) ),
i_0_111 ).
cnf(c_0_195,plain,
( subset(X1,X2)
| in(esk11_2(X1,X2),X1) ),
i_0_44 ).
cnf(c_0_196,negated_conjecture,
~ in(esk18_0,powerset(esk19_0)),
inference(spm,[status(thm)],[c_0_191,c_0_192]) ).
cnf(c_0_197,plain,
( in(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(er,[status(thm)],[c_0_193]) ).
cnf(c_0_198,plain,
( subset(X1,X2)
| ~ in(esk11_2(X1,X2),X2) ),
i_0_43 ).
cnf(c_0_199,negated_conjecture,
( in(esk11_2(esk18_0,X1),esk19_0)
| subset(esk18_0,X1) ),
inference(spm,[status(thm)],[c_0_194,c_0_195]) ).
cnf(c_0_200,negated_conjecture,
~ subset(esk18_0,esk19_0),
inference(spm,[status(thm)],[c_0_196,c_0_197]) ).
cnf(c_0_201,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_198,c_0_199]),c_0_200]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU173+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n007.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jun 19 22:49:16 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.22/0.46 # ENIGMATIC: Selected complete mode:
% 8.97/2.36 # ENIGMATIC: Solved by autoschedule:
% 8.97/2.36 # No SInE strategy applied
% 8.97/2.36 # Trying AutoSched0 for 150 seconds
% 8.97/2.36 # AutoSched0-Mode selected heuristic G_E___200_C45_F1_SE_CS_SP_PI_CO_S5PRR_S0V
% 8.97/2.36 # and selection function PSelectComplexExceptRRHorn.
% 8.97/2.36 #
% 8.97/2.36 # Preprocessing time : 0.027 s
% 8.97/2.36
% 8.97/2.36 # Proof found!
% 8.97/2.36 # SZS status Theorem
% 8.97/2.36 # SZS output start CNFRefutation
% See solution above
% 8.97/2.36 # Training examples: 0 positive, 0 negative
% 8.97/2.36
% 8.97/2.36 # -------------------------------------------------
% 8.97/2.36 # User time : 0.122 s
% 8.97/2.36 # System time : 0.009 s
% 8.97/2.36 # Total time : 0.131 s
% 8.97/2.36 # Maximum resident set size: 7120 pages
% 8.97/2.36
%------------------------------------------------------------------------------