TSTP Solution File: SEU160+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU160+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n008.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:00 EDT 2022
% Result : Theorem 4.37s 2.19s
% Output : CNFRefutation 4.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 18 ( 7 unt; 5 nHn; 12 RR)
% Number of literals : 33 ( 17 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 12 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_10,plain,
( X1 = empty_set
| X1 = singleton(X2)
| ~ subset(X1,singleton(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rif2pjh3/lgb.p',i_0_10) ).
cnf(i_0_5,negated_conjecture,
( empty_set = esk3_0
| singleton(esk4_0) = esk3_0
| subset(esk3_0,singleton(esk4_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rif2pjh3/lgb.p',i_0_5) ).
cnf(i_0_6,negated_conjecture,
( singleton(esk4_0) != esk3_0
| ~ subset(esk3_0,singleton(esk4_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rif2pjh3/lgb.p',i_0_6) ).
cnf(i_0_1,plain,
subset(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rif2pjh3/lgb.p',i_0_1) ).
cnf(i_0_9,plain,
( subset(X1,singleton(X2))
| X1 != empty_set ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rif2pjh3/lgb.p',i_0_9) ).
cnf(i_0_7,negated_conjecture,
( empty_set != esk3_0
| ~ subset(esk3_0,singleton(esk4_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rif2pjh3/lgb.p',i_0_7) ).
cnf(c_0_17,plain,
( X1 = empty_set
| X1 = singleton(X2)
| ~ subset(X1,singleton(X2)) ),
i_0_10 ).
cnf(c_0_18,negated_conjecture,
( empty_set = esk3_0
| singleton(esk4_0) = esk3_0
| subset(esk3_0,singleton(esk4_0)) ),
i_0_5 ).
cnf(c_0_19,negated_conjecture,
( singleton(esk4_0) != esk3_0
| ~ subset(esk3_0,singleton(esk4_0)) ),
i_0_6 ).
cnf(c_0_20,negated_conjecture,
( singleton(esk4_0) = esk3_0
| empty_set = esk3_0 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
subset(X1,X1),
i_0_1 ).
cnf(c_0_22,plain,
( subset(X1,singleton(X2))
| X1 != empty_set ),
i_0_9 ).
cnf(c_0_23,negated_conjecture,
( empty_set != esk3_0
| ~ subset(esk3_0,singleton(esk4_0)) ),
i_0_7 ).
cnf(c_0_24,negated_conjecture,
empty_set = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_25,plain,
subset(empty_set,singleton(X1)),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_26,negated_conjecture,
~ subset(esk3_0,singleton(esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_27,plain,
subset(esk3_0,singleton(X1)),
inference(rw,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU160+3 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n008.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 07:56:09 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 4.37/2.19 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.37/2.19 # No SInE strategy applied
% 4.37/2.19 # Trying AutoSched0 for 150 seconds
% 4.37/2.19 # AutoSched0-Mode selected heuristic G_____0026_C18_F1_SE_CS_SP_S4S
% 4.37/2.19 # and selection function SelectNewComplexAHPNS.
% 4.37/2.19 #
% 4.37/2.19 # Preprocessing time : 0.012 s
% 4.37/2.19
% 4.37/2.19 # Proof found!
% 4.37/2.19 # SZS status Theorem
% 4.37/2.19 # SZS output start CNFRefutation
% See solution above
% 4.37/2.19 # Training examples: 0 positive, 0 negative
% 4.37/2.19
% 4.37/2.19 # -------------------------------------------------
% 4.37/2.19 # User time : 0.010 s
% 4.37/2.19 # System time : 0.006 s
% 4.37/2.19 # Total time : 0.016 s
% 4.37/2.19 # Maximum resident set size: 7124 pages
% 4.37/2.19
%------------------------------------------------------------------------------