TSTP Solution File: SWC008+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC008+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:01 EDT 2022
% Result : Theorem 10.80s 3.27s
% Output : CNFRefutation 10.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of clauses : 27 ( 17 unt; 0 nHn; 27 RR)
% Number of literals : 56 ( 18 equ; 34 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_192,negated_conjecture,
( app(X1,X2) != esk48_0
| app(app(X1,X3),X2) != esk49_0
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hq42e2qr/lgb.p',i_0_192) ).
cnf(i_0_195,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hq42e2qr/lgb.p',i_0_195) ).
cnf(i_0_196,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hq42e2qr/lgb.p',i_0_196) ).
cnf(i_0_199,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hq42e2qr/lgb.p',i_0_199) ).
cnf(i_0_159,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hq42e2qr/lgb.p',i_0_159) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hq42e2qr/lgb.p',i_0_44) ).
cnf(i_0_114,plain,
( app(X1,esk32_2(X2,X1)) = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hq42e2qr/lgb.p',i_0_114) ).
cnf(i_0_194,negated_conjecture,
frontsegP(esk51_0,esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hq42e2qr/lgb.p',i_0_194) ).
cnf(i_0_198,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hq42e2qr/lgb.p',i_0_198) ).
cnf(i_0_115,plain,
( ssList(esk32_2(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hq42e2qr/lgb.p',i_0_115) ).
cnf(c_0_210,negated_conjecture,
( app(X1,X2) != esk48_0
| app(app(X1,X3),X2) != esk49_0
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
i_0_192 ).
cnf(c_0_211,negated_conjecture,
esk50_0 = esk48_0,
i_0_195 ).
cnf(c_0_212,negated_conjecture,
esk49_0 = esk51_0,
i_0_196 ).
cnf(c_0_213,negated_conjecture,
ssList(esk49_0),
i_0_199 ).
cnf(c_0_214,negated_conjecture,
( app(app(X1,X2),X3) != esk51_0
| app(X1,X3) != esk50_0
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_210,c_0_211]),c_0_212]) ).
cnf(c_0_215,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
i_0_159 ).
cnf(c_0_216,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_217,plain,
( app(X1,esk32_2(X2,X1)) = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X2,X1) ),
i_0_114 ).
cnf(c_0_218,negated_conjecture,
frontsegP(esk51_0,esk50_0),
i_0_194 ).
cnf(c_0_219,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_213,c_0_212]) ).
cnf(c_0_220,negated_conjecture,
ssList(esk50_0),
i_0_198 ).
cnf(c_0_221,plain,
( ssList(esk32_2(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X1,X2) ),
i_0_115 ).
cnf(c_0_222,plain,
( app(app(X1,X2),nil) != esk51_0
| X1 != esk50_0
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_214,c_0_215]),c_0_216])]) ).
cnf(c_0_223,negated_conjecture,
app(esk50_0,esk32_2(esk51_0,esk50_0)) = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_217,c_0_218]),c_0_219]),c_0_220])]) ).
cnf(c_0_224,negated_conjecture,
ssList(esk32_2(esk51_0,esk50_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_221,c_0_218]),c_0_220]),c_0_219])]) ).
cnf(c_0_225,negated_conjecture,
app(esk51_0,nil) != esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_222,c_0_223]),c_0_224]),c_0_220])]) ).
cnf(c_0_226,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_225,c_0_215]),c_0_219])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWC008+1 : TPTP v8.1.0. Released v2.4.0.
% 0.00/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n029.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sun Jun 12 07:39:41 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.16/0.42 # ENIGMATIC: Selected SinE mode:
% 0.16/0.43 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.43 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.16/0.43 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.16/0.43 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 10.80/3.27 # ENIGMATIC: Solved by autoschedule-lgb:
% 10.80/3.27 # No SInE strategy applied
% 10.80/3.27 # Trying AutoSched0 for 150 seconds
% 10.80/3.27 # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4d
% 10.80/3.27 # and selection function SelectCQIPrecWNTNp.
% 10.80/3.27 #
% 10.80/3.27 # Preprocessing time : 0.021 s
% 10.80/3.27
% 10.80/3.27 # Proof found!
% 10.80/3.27 # SZS status Theorem
% 10.80/3.27 # SZS output start CNFRefutation
% See solution above
% 10.80/3.27 # Training examples: 0 positive, 0 negative
% 10.80/3.27
% 10.80/3.27 # -------------------------------------------------
% 10.80/3.27 # User time : 0.026 s
% 10.80/3.27 # System time : 0.003 s
% 10.80/3.27 # Total time : 0.029 s
% 10.80/3.27 # Maximum resident set size: 7120 pages
% 10.80/3.27
%------------------------------------------------------------------------------