TSTP Solution File: SWC094+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC094+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:34 EDT 2022
% Result : Theorem 7.38s 2.51s
% Output : CNFRefutation 7.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 23 ( 14 unt; 0 nHn; 23 RR)
% Number of literals : 43 ( 22 equ; 26 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_192,negated_conjecture,
esk50_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5elva9mu/lgb.p',i_0_192) ).
cnf(i_0_194,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5elva9mu/lgb.p',i_0_194) ).
cnf(i_0_193,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5elva9mu/lgb.p',i_0_193) ).
cnf(i_0_191,negated_conjecture,
( app(X1,X2) != esk49_0
| app(app(X1,X3),X2) != esk48_0
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5elva9mu/lgb.p',i_0_191) ).
cnf(i_0_60,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5elva9mu/lgb.p',i_0_60) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5elva9mu/lgb.p',i_0_44) ).
cnf(i_0_197,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5elva9mu/lgb.p',i_0_197) ).
cnf(i_0_159,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5elva9mu/lgb.p',i_0_159) ).
cnf(c_0_206,negated_conjecture,
esk50_0 = esk51_0,
i_0_192 ).
cnf(c_0_207,negated_conjecture,
esk49_0 = esk51_0,
i_0_194 ).
cnf(c_0_208,negated_conjecture,
esk50_0 = esk48_0,
i_0_193 ).
cnf(c_0_209,negated_conjecture,
esk50_0 = esk49_0,
inference(rw,[status(thm)],[c_0_206,c_0_207]) ).
cnf(c_0_210,negated_conjecture,
( app(X1,X2) != esk49_0
| app(app(X1,X3),X2) != esk48_0
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
i_0_191 ).
cnf(c_0_211,negated_conjecture,
esk48_0 = esk49_0,
inference(rw,[status(thm)],[c_0_208,c_0_209]) ).
cnf(c_0_212,negated_conjecture,
( app(app(X1,X2),X3) != esk49_0
| app(X1,X3) != esk49_0
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_210,c_0_211]) ).
cnf(c_0_213,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
i_0_60 ).
cnf(c_0_214,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_215,plain,
( app(app(nil,X1),X2) != esk49_0
| X2 != esk49_0
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_212,c_0_213]),c_0_214])]) ).
cnf(c_0_216,negated_conjecture,
ssList(esk49_0),
i_0_197 ).
cnf(c_0_217,plain,
( app(app(nil,X1),esk49_0) != esk49_0
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_215]),c_0_216])]) ).
cnf(c_0_218,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
i_0_159 ).
cnf(c_0_219,plain,
app(nil,esk49_0) != esk49_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_217,c_0_218]),c_0_214])]) ).
cnf(c_0_220,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_219,c_0_213]),c_0_216])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC094+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jun 11 21:10:57 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.38/2.51 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.38/2.51 # No SInE strategy applied
% 7.38/2.51 # Trying AutoSched0 for 150 seconds
% 7.38/2.51 # AutoSched0-Mode selected heuristic G_E___006_C18_F1_PI_AE_Q4_CS_SP_S2S
% 7.38/2.51 # and selection function SelectNewComplexAHP.
% 7.38/2.51 #
% 7.38/2.51 # Preprocessing time : 0.023 s
% 7.38/2.51
% 7.38/2.51 # Proof found!
% 7.38/2.51 # SZS status Theorem
% 7.38/2.51 # SZS output start CNFRefutation
% See solution above
% 7.38/2.51 # Training examples: 0 positive, 0 negative
% 7.38/2.51
% 7.38/2.51 # -------------------------------------------------
% 7.38/2.51 # User time : 0.025 s
% 7.38/2.51 # System time : 0.006 s
% 7.38/2.51 # Total time : 0.031 s
% 7.38/2.51 # Maximum resident set size: 7124 pages
% 7.38/2.51
%------------------------------------------------------------------------------