TSTP Solution File: SEU158+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU158+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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:58 EDT 2022
% Result : Theorem 7.81s 2.46s
% Output : CNFRefutation 7.81s
% 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; 8 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_4,negated_conjecture,
( in(esk1_0,esk2_0)
| subset(singleton(esk1_0),esk2_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n58mqb6_/lgb.p',i_0_4) ).
cnf(i_0_6,plain,
( subset(singleton(X1),X2)
| ~ in(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n58mqb6_/lgb.p',i_0_6) ).
cnf(i_0_7,plain,
( in(X1,X2)
| ~ subset(singleton(X1),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n58mqb6_/lgb.p',i_0_7) ).
cnf(i_0_5,negated_conjecture,
( ~ in(esk1_0,esk2_0)
| ~ subset(singleton(esk1_0),esk2_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n58mqb6_/lgb.p',i_0_5) ).
cnf(c_0_12,negated_conjecture,
( in(esk1_0,esk2_0)
| subset(singleton(esk1_0),esk2_0) ),
i_0_4 ).
cnf(c_0_13,plain,
( subset(singleton(X1),X2)
| ~ in(X1,X2) ),
i_0_6 ).
cnf(c_0_14,plain,
( in(X1,X2)
| ~ subset(singleton(X1),X2) ),
i_0_7 ).
cnf(c_0_15,negated_conjecture,
subset(singleton(esk1_0),esk2_0),
inference(csr,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
( ~ in(esk1_0,esk2_0)
| ~ subset(singleton(esk1_0),esk2_0) ),
i_0_5 ).
cnf(c_0_17,plain,
in(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU158+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n010.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 19 09:09:24 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.46 # ENIGMATIC: Selected complete mode:
% 7.81/2.46 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.81/2.46 # No SInE strategy applied
% 7.81/2.46 # Trying AutoSched0 for 150 seconds
% 7.81/2.46 # AutoSched0-Mode selected heuristic G_____0003_C18_F1_SE_CS_SP_S0Y
% 7.81/2.46 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.81/2.46 #
% 7.81/2.46 # Preprocessing time : 0.023 s
% 7.81/2.46
% 7.81/2.46 # Proof found!
% 7.81/2.46 # SZS status Theorem
% 7.81/2.46 # SZS output start CNFRefutation
% See solution above
% 7.81/2.46 # Training examples: 0 positive, 0 negative
% 7.81/2.46
% 7.81/2.46 # -------------------------------------------------
% 7.81/2.46 # User time : 0.023 s
% 7.81/2.46 # System time : 0.007 s
% 7.81/2.46 # Total time : 0.030 s
% 7.81/2.46 # Maximum resident set size: 7124 pages
% 7.81/2.46
%------------------------------------------------------------------------------