TSTP Solution File: SWC210+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC210+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:14:18 EDT 2022
% Result : Theorem 7.76s 2.37s
% Output : CNFRefutation 7.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 11
% Syntax : Number of clauses : 29 ( 17 unt; 2 nHn; 29 RR)
% Number of literals : 51 ( 12 equ; 26 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_193,negated_conjecture,
( singletonP(esk50_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4qbkhkta/lgb.p',i_0_193) ).
cnf(i_0_197,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4qbkhkta/lgb.p',i_0_197) ).
cnf(i_0_198,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4qbkhkta/lgb.p',i_0_198) ).
cnf(i_0_196,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4qbkhkta/lgb.p',i_0_196) ).
cnf(i_0_200,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4qbkhkta/lgb.p',i_0_200) ).
cnf(i_0_99,plain,
( cons(esk31_1(X1),nil) = X1
| ~ ssList(X1)
| ~ singletonP(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4qbkhkta/lgb.p',i_0_99) ).
cnf(i_0_100,plain,
( ssItem(esk31_1(X1))
| ~ ssList(X1)
| ~ singletonP(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4qbkhkta/lgb.p',i_0_100) ).
cnf(i_0_191,negated_conjecture,
( ~ neq(esk48_0,nil)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4qbkhkta/lgb.p',i_0_191) ).
cnf(i_0_45,plain,
( cons(X1,X2) != X2
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4qbkhkta/lgb.p',i_0_45) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4qbkhkta/lgb.p',i_0_44) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4qbkhkta/lgb.p',i_0_41) ).
cnf(c_0_212,negated_conjecture,
( singletonP(esk50_0)
| ~ neq(esk51_0,nil) ),
i_0_193 ).
cnf(c_0_213,negated_conjecture,
esk50_0 = esk48_0,
i_0_197 ).
cnf(c_0_214,negated_conjecture,
esk49_0 = esk51_0,
i_0_198 ).
cnf(c_0_215,negated_conjecture,
neq(esk49_0,nil),
i_0_196 ).
cnf(c_0_216,negated_conjecture,
ssList(esk50_0),
i_0_200 ).
cnf(c_0_217,plain,
( cons(esk31_1(X1),nil) = X1
| ~ ssList(X1)
| ~ singletonP(X1) ),
i_0_99 ).
cnf(c_0_218,negated_conjecture,
singletonP(esk48_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_212,c_0_213]),c_0_214]),c_0_215])]) ).
cnf(c_0_219,negated_conjecture,
ssList(esk48_0),
inference(rw,[status(thm)],[c_0_216,c_0_213]) ).
cnf(c_0_220,plain,
( ssItem(esk31_1(X1))
| ~ ssList(X1)
| ~ singletonP(X1) ),
i_0_100 ).
cnf(c_0_221,negated_conjecture,
( ~ neq(esk48_0,nil)
| ~ neq(esk51_0,nil) ),
i_0_191 ).
cnf(c_0_222,plain,
( cons(X1,X2) != X2
| ~ ssList(X2)
| ~ ssItem(X1) ),
i_0_45 ).
cnf(c_0_223,negated_conjecture,
cons(esk31_1(esk48_0),nil) = esk48_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_217,c_0_218]),c_0_219])]) ).
cnf(c_0_224,negated_conjecture,
ssItem(esk31_1(esk48_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_220,c_0_218]),c_0_219])]) ).
cnf(c_0_225,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_226,negated_conjecture,
~ neq(esk48_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_221,c_0_214]),c_0_215])]) ).
cnf(c_0_227,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_228,plain,
esk48_0 != nil,
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_225])]) ).
cnf(c_0_229,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_226,c_0_227]),c_0_225]),c_0_219])]),c_0_228]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC210+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n018.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 12 11:05:28 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.47 # ENIGMATIC: Selected SinE mode:
% 0.20/0.49 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.49 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.49 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.49 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.76/2.37 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.76/2.37 # No SInE strategy applied
% 7.76/2.37 # Trying AutoSched0 for 150 seconds
% 7.76/2.37 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S01BI
% 7.76/2.37 # and selection function PSelectMinOptimalNoXTypePred.
% 7.76/2.37 #
% 7.76/2.37 # Preprocessing time : 0.023 s
% 7.76/2.37 # Presaturation interreduction done
% 7.76/2.37
% 7.76/2.37 # Proof found!
% 7.76/2.37 # SZS status Theorem
% 7.76/2.37 # SZS output start CNFRefutation
% See solution above
% 7.76/2.37 # Training examples: 0 positive, 0 negative
% 7.76/2.37
% 7.76/2.37 # -------------------------------------------------
% 7.76/2.37 # User time : 0.025 s
% 7.76/2.37 # System time : 0.006 s
% 7.76/2.37 # Total time : 0.031 s
% 7.76/2.37 # Maximum resident set size: 7124 pages
% 7.76/2.37
%------------------------------------------------------------------------------