TSTP Solution File: SWC277+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC277+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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:42 EDT 2022
% Result : Theorem 7.47s 2.36s
% Output : CNFRefutation 7.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of clauses : 39 ( 20 unt; 3 nHn; 39 RR)
% Number of literals : 73 ( 12 equ; 33 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_191,negated_conjecture,
( singletonP(esk50_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mijzm_oa/lgb.p',i_0_191) ).
cnf(i_0_194,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mijzm_oa/lgb.p',i_0_194) ).
cnf(i_0_121,plain,
( totalorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mijzm_oa/lgb.p',i_0_121) ).
cnf(i_0_99,plain,
( cons(esk31_1(X1),nil) = X1
| ~ ssList(X1)
| ~ singletonP(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mijzm_oa/lgb.p',i_0_99) ).
cnf(i_0_100,plain,
( ssItem(esk31_1(X1))
| ~ ssList(X1)
| ~ singletonP(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mijzm_oa/lgb.p',i_0_100) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mijzm_oa/lgb.p',i_0_41) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mijzm_oa/lgb.p',i_0_44) ).
cnf(i_0_196,negated_conjecture,
ssList(esk51_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mijzm_oa/lgb.p',i_0_196) ).
cnf(i_0_197,negated_conjecture,
ssList(esk50_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mijzm_oa/lgb.p',i_0_197) ).
cnf(i_0_193,negated_conjecture,
segmentP(esk51_0,esk50_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mijzm_oa/lgb.p',i_0_193) ).
cnf(i_0_192,negated_conjecture,
~ totalorderedP(esk48_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mijzm_oa/lgb.p',i_0_192) ).
cnf(i_0_106,plain,
( X1 = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(X2,X1)
| ~ segmentP(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mijzm_oa/lgb.p',i_0_106) ).
cnf(i_0_109,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mijzm_oa/lgb.p',i_0_109) ).
cnf(i_0_122,plain,
totalorderedP(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mijzm_oa/lgb.p',i_0_122) ).
cnf(c_0_212,negated_conjecture,
( singletonP(esk50_0)
| ~ neq(esk51_0,nil) ),
i_0_191 ).
cnf(c_0_213,negated_conjecture,
esk50_0 = esk48_0,
i_0_194 ).
cnf(c_0_214,plain,
( totalorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
i_0_121 ).
cnf(c_0_215,plain,
( cons(esk31_1(X1),nil) = X1
| ~ ssList(X1)
| ~ singletonP(X1) ),
i_0_99 ).
cnf(c_0_216,plain,
( ssItem(esk31_1(X1))
| ~ ssList(X1)
| ~ singletonP(X1) ),
i_0_100 ).
cnf(c_0_217,negated_conjecture,
( singletonP(esk48_0)
| ~ neq(esk51_0,nil) ),
inference(rw,[status(thm)],[c_0_212,c_0_213]) ).
cnf(c_0_218,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_219,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_220,negated_conjecture,
ssList(esk51_0),
i_0_196 ).
cnf(c_0_221,negated_conjecture,
ssList(esk50_0),
i_0_197 ).
cnf(c_0_222,negated_conjecture,
segmentP(esk51_0,esk50_0),
i_0_193 ).
cnf(c_0_223,plain,
( totalorderedP(X1)
| ~ ssList(X1)
| ~ singletonP(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_214,c_0_215]),c_0_216]) ).
cnf(c_0_224,negated_conjecture,
( nil = esk51_0
| singletonP(esk48_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_217,c_0_218]),c_0_219]),c_0_220])]) ).
cnf(c_0_225,negated_conjecture,
ssList(esk48_0),
inference(rw,[status(thm)],[c_0_221,c_0_213]) ).
cnf(c_0_226,negated_conjecture,
~ totalorderedP(esk48_0),
i_0_192 ).
cnf(c_0_227,plain,
( X1 = X2
| ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(X2,X1)
| ~ segmentP(X1,X2) ),
i_0_106 ).
cnf(c_0_228,negated_conjecture,
segmentP(esk51_0,esk48_0),
inference(rw,[status(thm)],[c_0_222,c_0_213]) ).
cnf(c_0_229,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
i_0_109 ).
cnf(c_0_230,negated_conjecture,
nil = esk51_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_223,c_0_224]),c_0_225])]),c_0_226]) ).
cnf(c_0_231,negated_conjecture,
( esk48_0 = esk51_0
| ~ segmentP(esk48_0,esk51_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_227,c_0_228]),c_0_220]),c_0_225])]) ).
cnf(c_0_232,plain,
( segmentP(X1,esk51_0)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[c_0_229,c_0_230]) ).
cnf(c_0_233,plain,
totalorderedP(nil),
i_0_122 ).
cnf(c_0_234,negated_conjecture,
esk48_0 = esk51_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_231,c_0_232]),c_0_225])]) ).
cnf(c_0_235,plain,
totalorderedP(esk51_0),
inference(rw,[status(thm)],[c_0_233,c_0_230]) ).
cnf(c_0_236,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_226,c_0_234]),c_0_235])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC277+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n017.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 12 15:47:54 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.44 # ENIGMATIC: Selected SinE mode:
% 0.20/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.47/2.36 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.47/2.36 # No SInE strategy applied
% 7.47/2.36 # Trying AutoSched0 for 150 seconds
% 7.47/2.36 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 7.47/2.36 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.47/2.36 #
% 7.47/2.36 # Preprocessing time : 0.023 s
% 7.47/2.36
% 7.47/2.36 # Proof found!
% 7.47/2.36 # SZS status Theorem
% 7.47/2.36 # SZS output start CNFRefutation
% See solution above
% 7.47/2.36 # Training examples: 0 positive, 0 negative
% 7.47/2.36
% 7.47/2.36 # -------------------------------------------------
% 7.47/2.36 # User time : 0.027 s
% 7.47/2.36 # System time : 0.005 s
% 7.47/2.36 # Total time : 0.032 s
% 7.47/2.36 # Maximum resident set size: 7124 pages
% 7.47/2.36
%------------------------------------------------------------------------------