TSTP Solution File: SWC026+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC026+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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 20:13:08 EDT 2022
% Result : Theorem 6.83s 2.33s
% Output : CNFRefutation 6.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 16 ( 7 unt; 3 nHn; 16 RR)
% Number of literals : 25 ( 24 equ; 8 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_194,negated_conjecture,
( nil = esk48_0
| nil = esk49_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oii097t6/lgb.p',i_0_194) ).
cnf(i_0_197,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oii097t6/lgb.p',i_0_197) ).
cnf(i_0_196,negated_conjecture,
( nil = esk51_0
| esk50_0 != nil ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oii097t6/lgb.p',i_0_196) ).
cnf(i_0_198,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oii097t6/lgb.p',i_0_198) ).
cnf(i_0_195,negated_conjecture,
( esk50_0 = nil
| nil != esk51_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oii097t6/lgb.p',i_0_195) ).
cnf(i_0_191,negated_conjecture,
( nil != esk48_0
| nil != esk49_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oii097t6/lgb.p',i_0_191) ).
cnf(c_0_205,negated_conjecture,
( nil = esk48_0
| nil = esk49_0 ),
i_0_194 ).
cnf(c_0_206,negated_conjecture,
esk50_0 = esk48_0,
i_0_197 ).
cnf(c_0_207,negated_conjecture,
( nil = esk51_0
| esk50_0 != nil ),
i_0_196 ).
cnf(c_0_208,negated_conjecture,
esk49_0 = esk51_0,
i_0_198 ).
cnf(c_0_209,negated_conjecture,
( esk49_0 = nil
| esk50_0 = nil ),
inference(rw,[status(thm)],[c_0_205,c_0_206]) ).
cnf(c_0_210,negated_conjecture,
( esk50_0 = nil
| nil != esk51_0 ),
i_0_195 ).
cnf(c_0_211,negated_conjecture,
esk49_0 = nil,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_207,c_0_208]),c_0_209]) ).
cnf(c_0_212,negated_conjecture,
( nil != esk48_0
| nil != esk49_0 ),
i_0_191 ).
cnf(c_0_213,negated_conjecture,
esk50_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_210,c_0_208]),c_0_211])]) ).
cnf(c_0_214,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_212,c_0_206]),c_0_213]),c_0_211])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWC026+1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n029.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 : Sat Jun 11 23:49:40 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.47 # ENIGMATIC: Selected SinE mode:
% 0.20/0.48 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 6.83/2.33 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.83/2.33 # No SInE strategy applied
% 6.83/2.33 # Trying AutoSched0 for 150 seconds
% 6.83/2.33 # AutoSched0-Mode selected heuristic G_____0017_C18_F1_SE_CS_SP_S4Y
% 6.83/2.33 # and selection function SelectMaxLComplexAPPNTNp.
% 6.83/2.33 #
% 6.83/2.33 # Preprocessing time : 0.013 s
% 6.83/2.33
% 6.83/2.33 # Proof found!
% 6.83/2.33 # SZS status Theorem
% 6.83/2.33 # SZS output start CNFRefutation
% See solution above
% 6.83/2.33 # Training examples: 0 positive, 0 negative
% 6.83/2.33
% 6.83/2.33 # -------------------------------------------------
% 6.83/2.33 # User time : 0.013 s
% 6.83/2.33 # System time : 0.004 s
% 6.83/2.33 # Total time : 0.017 s
% 6.83/2.33 # Maximum resident set size: 7124 pages
% 6.83/2.33
%------------------------------------------------------------------------------