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