TSTP Solution File: SWC009+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC009+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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 7.49s 2.34s
% Output : CNFRefutation 7.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 24 ( 17 unt; 0 nHn; 24 RR)
% Number of literals : 42 ( 18 equ; 24 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 : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_196,negated_conjecture,
( app(X1,X2) != esk48_0
| app(app(X1,X3),X2) != esk49_0
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rc6ote30/lgb.p',i_0_196) ).
cnf(i_0_197,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rc6ote30/lgb.p',i_0_197) ).
cnf(i_0_198,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rc6ote30/lgb.p',i_0_198) ).
cnf(i_0_159,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rc6ote30/lgb.p',i_0_159) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rc6ote30/lgb.p',i_0_44) ).
cnf(i_0_200,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rc6ote30/lgb.p',i_0_200) ).
cnf(i_0_194,negated_conjecture,
app(esk50_0,esk52_0) = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rc6ote30/lgb.p',i_0_194) ).
cnf(i_0_195,negated_conjecture,
ssList(esk52_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rc6ote30/lgb.p',i_0_195) ).
cnf(i_0_201,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rc6ote30/lgb.p',i_0_201) ).
cnf(c_0_211,negated_conjecture,
( app(X1,X2) != esk48_0
| app(app(X1,X3),X2) != esk49_0
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
i_0_196 ).
cnf(c_0_212,negated_conjecture,
esk50_0 = esk48_0,
i_0_197 ).
cnf(c_0_213,negated_conjecture,
esk49_0 = esk51_0,
i_0_198 ).
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_211,c_0_212]),c_0_213]) ).
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(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_218,negated_conjecture,
ssList(esk50_0),
i_0_200 ).
cnf(c_0_219,plain,
( app(app(esk50_0,X1),nil) != esk51_0
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_217]),c_0_218])]) ).
cnf(c_0_220,negated_conjecture,
app(esk50_0,esk52_0) = esk51_0,
i_0_194 ).
cnf(c_0_221,negated_conjecture,
ssList(esk52_0),
i_0_195 ).
cnf(c_0_222,negated_conjecture,
ssList(esk49_0),
i_0_201 ).
cnf(c_0_223,negated_conjecture,
app(esk51_0,nil) != esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_219,c_0_220]),c_0_221])]) ).
cnf(c_0_224,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_222,c_0_213]) ).
cnf(c_0_225,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_223,c_0_215]),c_0_224])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC009+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n011.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 07:45:19 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.49/2.34 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.49/2.34 # No SInE strategy applied
% 7.49/2.34 # Trying AutoSched0 for 150 seconds
% 7.49/2.34 # AutoSched0-Mode selected heuristic G_E___006_C18_F1_PI_AE_Q4_CS_SP_S2S
% 7.49/2.34 # and selection function SelectNewComplexAHP.
% 7.49/2.34 #
% 7.49/2.34 # Preprocessing time : 0.023 s
% 7.49/2.34
% 7.49/2.34 # Proof found!
% 7.49/2.34 # SZS status Theorem
% 7.49/2.34 # SZS output start CNFRefutation
% See solution above
% 7.49/2.34 # Training examples: 0 positive, 0 negative
% 7.49/2.34
% 7.49/2.34 # -------------------------------------------------
% 7.49/2.34 # User time : 0.023 s
% 7.49/2.34 # System time : 0.007 s
% 7.49/2.34 # Total time : 0.030 s
% 7.49/2.34 # Maximum resident set size: 7128 pages
% 7.49/2.34
%------------------------------------------------------------------------------