TSTP Solution File: SWC037+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC037+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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:12 EDT 2022
% Result : Theorem 7.29s 2.44s
% Output : CNFRefutation 7.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 30 ( 19 unt; 6 nHn; 30 RR)
% Number of literals : 47 ( 21 equ; 17 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 7 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_202,negated_conjecture,
esk49_0 = nil,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8rpudxsv/lgb.p',i_0_202) ).
cnf(i_0_201,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8rpudxsv/lgb.p',i_0_201) ).
cnf(i_0_199,negated_conjecture,
esk48_0 != nil,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8rpudxsv/lgb.p',i_0_199) ).
cnf(i_0_200,negated_conjecture,
esk48_0 = esk50_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8rpudxsv/lgb.p',i_0_200) ).
cnf(i_0_193,negated_conjecture,
( esk50_0 = nil
| segmentP(esk51_0,esk52_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8rpudxsv/lgb.p',i_0_193) ).
cnf(i_0_197,negated_conjecture,
( esk50_0 = nil
| ssList(esk52_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8rpudxsv/lgb.p',i_0_197) ).
cnf(i_0_195,negated_conjecture,
( esk50_0 = nil
| neq(esk52_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8rpudxsv/lgb.p',i_0_195) ).
cnf(i_0_111,plain,
( nil = X1
| ~ ssList(X1)
| ~ segmentP(nil,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8rpudxsv/lgb.p',i_0_111) ).
cnf(i_0_42,plain,
( X1 != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8rpudxsv/lgb.p',i_0_42) ).
cnf(i_0_205,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8rpudxsv/lgb.p',i_0_205) ).
cnf(c_0_216,negated_conjecture,
esk49_0 = nil,
i_0_202 ).
cnf(c_0_217,negated_conjecture,
esk49_0 = esk51_0,
i_0_201 ).
cnf(c_0_218,negated_conjecture,
esk48_0 != nil,
i_0_199 ).
cnf(c_0_219,negated_conjecture,
esk48_0 = esk50_0,
i_0_200 ).
cnf(c_0_220,negated_conjecture,
( esk50_0 = nil
| segmentP(esk51_0,esk52_0) ),
i_0_193 ).
cnf(c_0_221,negated_conjecture,
esk51_0 = nil,
inference(rw,[status(thm)],[c_0_216,c_0_217]) ).
cnf(c_0_222,negated_conjecture,
esk50_0 != nil,
inference(rw,[status(thm)],[c_0_218,c_0_219]) ).
cnf(c_0_223,negated_conjecture,
( esk50_0 = nil
| ssList(esk52_0) ),
i_0_197 ).
cnf(c_0_224,negated_conjecture,
( esk50_0 = nil
| neq(esk52_0,nil) ),
i_0_195 ).
cnf(c_0_225,plain,
( nil = X1
| ~ ssList(X1)
| ~ segmentP(nil,X1) ),
i_0_111 ).
cnf(c_0_226,negated_conjecture,
segmentP(nil,esk52_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_220,c_0_221]),c_0_222]) ).
cnf(c_0_227,negated_conjecture,
ssList(esk52_0),
inference(sr,[status(thm)],[c_0_223,c_0_222]) ).
cnf(c_0_228,plain,
( X1 != X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(X1,X2) ),
i_0_42 ).
cnf(c_0_229,negated_conjecture,
neq(esk52_0,nil),
inference(sr,[status(thm)],[c_0_224,c_0_222]) ).
cnf(c_0_230,negated_conjecture,
esk52_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_225,c_0_226]),c_0_227])]) ).
cnf(c_0_231,negated_conjecture,
ssList(esk49_0),
i_0_205 ).
cnf(c_0_232,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_228]) ).
cnf(c_0_233,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_229,c_0_230]) ).
cnf(c_0_234,negated_conjecture,
ssList(nil),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_231,c_0_217]),c_0_221]) ).
cnf(c_0_235,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_232,c_0_233]),c_0_234])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC037+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 11 21:35:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.29/2.44 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.29/2.44 # No SInE strategy applied
% 7.29/2.44 # Trying AutoSched0 for 150 seconds
% 7.29/2.44 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S068N
% 7.29/2.44 # and selection function PSelectNewComplexAHP.
% 7.29/2.44 #
% 7.29/2.44 # Preprocessing time : 0.023 s
% 7.29/2.44 # Presaturation interreduction done
% 7.29/2.44
% 7.29/2.44 # Proof found!
% 7.29/2.44 # SZS status Theorem
% 7.29/2.44 # SZS output start CNFRefutation
% See solution above
% 7.29/2.44 # Training examples: 0 positive, 0 negative
% 7.29/2.44
% 7.29/2.44 # -------------------------------------------------
% 7.29/2.44 # User time : 0.024 s
% 7.29/2.44 # System time : 0.006 s
% 7.29/2.44 # Total time : 0.030 s
% 7.29/2.44 # Maximum resident set size: 7120 pages
% 7.29/2.44
%------------------------------------------------------------------------------