TSTP Solution File: SWC044+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC044+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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:15 EDT 2022
% Result : Theorem 7.46s 2.35s
% Output : CNFRefutation 7.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 17 unt; 0 nHn; 19 RR)
% Number of literals : 23 ( 12 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 2 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_194,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b2446_ii/lgb.p',i_0_194) ).
cnf(i_0_195,negated_conjecture,
esk49_0 = nil,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b2446_ii/lgb.p',i_0_195) ).
cnf(i_0_192,negated_conjecture,
rearsegP(esk51_0,esk50_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b2446_ii/lgb.p',i_0_192) ).
cnf(i_0_199,negated_conjecture,
ssList(esk48_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b2446_ii/lgb.p',i_0_199) ).
cnf(i_0_193,negated_conjecture,
esk48_0 = esk50_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b2446_ii/lgb.p',i_0_193) ).
cnf(i_0_191,negated_conjecture,
esk48_0 != nil,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b2446_ii/lgb.p',i_0_191) ).
cnf(i_0_104,plain,
( nil = X1
| ~ ssList(X1)
| ~ rearsegP(nil,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b2446_ii/lgb.p',i_0_104) ).
cnf(c_0_207,negated_conjecture,
esk49_0 = esk51_0,
i_0_194 ).
cnf(c_0_208,negated_conjecture,
esk49_0 = nil,
i_0_195 ).
cnf(c_0_209,negated_conjecture,
rearsegP(esk51_0,esk50_0),
i_0_192 ).
cnf(c_0_210,negated_conjecture,
esk51_0 = nil,
inference(rw,[status(thm)],[c_0_207,c_0_208]) ).
cnf(c_0_211,negated_conjecture,
ssList(esk48_0),
i_0_199 ).
cnf(c_0_212,negated_conjecture,
esk48_0 = esk50_0,
i_0_193 ).
cnf(c_0_213,negated_conjecture,
esk48_0 != nil,
i_0_191 ).
cnf(c_0_214,plain,
( nil = X1
| ~ ssList(X1)
| ~ rearsegP(nil,X1) ),
i_0_104 ).
cnf(c_0_215,negated_conjecture,
rearsegP(nil,esk50_0),
inference(rw,[status(thm)],[c_0_209,c_0_210]) ).
cnf(c_0_216,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_211,c_0_212]) ).
cnf(c_0_217,negated_conjecture,
esk50_0 != nil,
inference(rw,[status(thm)],[c_0_213,c_0_212]) ).
cnf(c_0_218,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_214,c_0_215]),c_0_216])]),c_0_217]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC044+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n018.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 12 05:11:27 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.46/2.35 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.46/2.35 # No SInE strategy applied
% 7.46/2.35 # Trying AutoSched0 for 150 seconds
% 7.46/2.35 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 7.46/2.35 # and selection function SelectNewComplexAHP.
% 7.46/2.35 #
% 7.46/2.35 # Preprocessing time : 0.023 s
% 7.46/2.35 # Presaturation interreduction done
% 7.46/2.35
% 7.46/2.35 # Proof found!
% 7.46/2.35 # SZS status Theorem
% 7.46/2.35 # SZS output start CNFRefutation
% See solution above
% 7.46/2.35 # Training examples: 0 positive, 0 negative
% 7.46/2.35
% 7.46/2.35 # -------------------------------------------------
% 7.46/2.35 # User time : 0.027 s
% 7.46/2.35 # System time : 0.007 s
% 7.46/2.35 # Total time : 0.034 s
% 7.46/2.35 # Maximum resident set size: 7128 pages
% 7.46/2.35
%------------------------------------------------------------------------------