TSTP Solution File: SEU158+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU158+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n014.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:59 EDT 2022
% Result : Theorem 4.35s 2.12s
% Output : CNFRefutation 4.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 3 unt; 2 nHn; 11 RR)
% Number of literals : 19 ( 0 equ; 9 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_5,negated_conjecture,
( in(esk3_0,esk4_0)
| subset(singleton(esk3_0),esk4_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-46xh287s/input.p',i_0_5) ).
cnf(i_0_8,plain,
( in(X1,X2)
| ~ subset(singleton(X1),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-46xh287s/input.p',i_0_8) ).
cnf(i_0_6,negated_conjecture,
( ~ in(esk3_0,esk4_0)
| ~ subset(singleton(esk3_0),esk4_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-46xh287s/input.p',i_0_6) ).
cnf(i_0_7,plain,
( subset(singleton(X1),X2)
| ~ in(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-46xh287s/input.p',i_0_7) ).
cnf(c_0_13,negated_conjecture,
( in(esk3_0,esk4_0)
| subset(singleton(esk3_0),esk4_0) ),
i_0_5 ).
cnf(c_0_14,plain,
( in(X1,X2)
| ~ subset(singleton(X1),X2) ),
i_0_8 ).
cnf(c_0_15,negated_conjecture,
( ~ in(esk3_0,esk4_0)
| ~ subset(singleton(esk3_0),esk4_0) ),
i_0_6 ).
cnf(c_0_16,negated_conjecture,
in(esk3_0,esk4_0),
inference(csr,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
~ subset(singleton(esk3_0),esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]) ).
cnf(c_0_18,plain,
( subset(singleton(X1),X2)
| ~ in(X1,X2) ),
i_0_7 ).
cnf(c_0_19,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU158+3 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n014.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 : Sun Jun 19 04:50:50 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 4.35/2.12 # ENIGMATIC: Solved by autoschedule:
% 4.35/2.12 # No SInE strategy applied
% 4.35/2.12 # Trying AutoSched0 for 150 seconds
% 4.35/2.12 # AutoSched0-Mode selected heuristic G_____0003_C18_F1_SE_CS_SP_S0Y
% 4.35/2.12 # and selection function SelectMaxLComplexAvoidPosPred.
% 4.35/2.12 #
% 4.35/2.12 # Preprocessing time : 0.012 s
% 4.35/2.12
% 4.35/2.12 # Proof found!
% 4.35/2.12 # SZS status Theorem
% 4.35/2.12 # SZS output start CNFRefutation
% See solution above
% 4.35/2.12 # Training examples: 0 positive, 0 negative
% 4.35/2.12
% 4.35/2.12 # -------------------------------------------------
% 4.35/2.12 # User time : 0.014 s
% 4.35/2.12 # System time : 0.003 s
% 4.35/2.12 # Total time : 0.017 s
% 4.35/2.12 # Maximum resident set size: 7120 pages
% 4.35/2.12
%------------------------------------------------------------------------------