TSTP Solution File: SWC051+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC051+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n008.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:17 EDT 2022
% Result : Theorem 4.53s 2.31s
% Output : CNFRefutation 4.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 23 ( 14 unt; 0 nHn; 23 RR)
% Number of literals : 38 ( 4 equ; 18 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 : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 5 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_201,negated_conjecture,
ssList(esk48_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yq4hajox/lgb.p',i_0_201) ).
cnf(i_0_196,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yq4hajox/lgb.p',i_0_196) ).
cnf(i_0_195,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yq4hajox/lgb.p',i_0_195) ).
cnf(i_0_197,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yq4hajox/lgb.p',i_0_197) ).
cnf(i_0_194,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ rearsegP(esk48_0,X1)
| ~ rearsegP(esk49_0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yq4hajox/lgb.p',i_0_194) ).
cnf(i_0_97,plain,
( rearsegP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yq4hajox/lgb.p',i_0_97) ).
cnf(i_0_191,negated_conjecture,
( rearsegP(esk51_0,esk50_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yq4hajox/lgb.p',i_0_191) ).
cnf(i_0_192,negated_conjecture,
( neq(esk50_0,nil)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yq4hajox/lgb.p',i_0_192) ).
cnf(c_0_210,negated_conjecture,
ssList(esk48_0),
i_0_201 ).
cnf(c_0_211,negated_conjecture,
esk50_0 = esk48_0,
i_0_196 ).
cnf(c_0_212,negated_conjecture,
neq(esk49_0,nil),
i_0_195 ).
cnf(c_0_213,negated_conjecture,
esk49_0 = esk51_0,
i_0_197 ).
cnf(c_0_214,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ rearsegP(esk48_0,X1)
| ~ rearsegP(esk49_0,X1) ),
i_0_194 ).
cnf(c_0_215,plain,
( rearsegP(X1,X1)
| ~ ssList(X1) ),
i_0_97 ).
cnf(c_0_216,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_210,c_0_211]) ).
cnf(c_0_217,negated_conjecture,
( rearsegP(esk51_0,esk50_0)
| ~ neq(esk51_0,nil) ),
i_0_191 ).
cnf(c_0_218,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_212,c_0_213]) ).
cnf(c_0_219,negated_conjecture,
( neq(esk50_0,nil)
| ~ neq(esk51_0,nil) ),
i_0_192 ).
cnf(c_0_220,negated_conjecture,
( ~ rearsegP(esk50_0,X1)
| ~ rearsegP(esk51_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_214,c_0_211]),c_0_213]) ).
cnf(c_0_221,negated_conjecture,
rearsegP(esk50_0,esk50_0),
inference(spm,[status(thm)],[c_0_215,c_0_216]) ).
cnf(c_0_222,negated_conjecture,
rearsegP(esk51_0,esk50_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_217,c_0_218])]) ).
cnf(c_0_223,negated_conjecture,
neq(esk50_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_219,c_0_218])]) ).
cnf(c_0_224,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_220,c_0_221]),c_0_222]),c_0_223]),c_0_216])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SWC051+1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.15 % Command : enigmatic-eprover.py %s %d 1
% 0.15/0.37 % Computer : n008.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 600
% 0.15/0.37 % DateTime : Sat Jun 11 23:39:39 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.22/0.48 # ENIGMATIC: Selected SinE mode:
% 0.22/0.49 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.49 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.22/0.49 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.22/0.49 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 4.53/2.31 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.53/2.31 # No SInE strategy applied
% 4.53/2.31 # Trying AutoSched0 for 150 seconds
% 4.53/2.31 # AutoSched0-Mode selected heuristic G_E___200_C45_F1_AE_CS_SP_PI_S0S
% 4.53/2.31 # and selection function SelectComplexG.
% 4.53/2.31 #
% 4.53/2.31 # Preprocessing time : 0.021 s
% 4.53/2.31
% 4.53/2.31 # Proof found!
% 4.53/2.31 # SZS status Theorem
% 4.53/2.31 # SZS output start CNFRefutation
% See solution above
% 4.53/2.31 # Training examples: 0 positive, 0 negative
% 4.53/2.31
% 4.53/2.31 # -------------------------------------------------
% 4.53/2.31 # User time : 0.020 s
% 4.53/2.31 # System time : 0.009 s
% 4.53/2.31 # Total time : 0.029 s
% 4.53/2.31 # Maximum resident set size: 7120 pages
% 4.53/2.31
%------------------------------------------------------------------------------