TSTP Solution File: SWC275+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC275+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n032.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:41 EDT 2022
% Result : Theorem 5.48s 1.90s
% Output : CNFRefutation 5.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 29 ( 17 unt; 4 nHn; 29 RR)
% Number of literals : 45 ( 17 equ; 15 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 6 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_200,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-95_fhswk/lgb.p',i_0_200) ).
cnf(i_0_197,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-95_fhswk/lgb.p',i_0_197) ).
cnf(i_0_192,negated_conjecture,
( cons(esk52_0,nil) = esk50_0
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-95_fhswk/lgb.p',i_0_192) ).
cnf(i_0_41,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-95_fhswk/lgb.p',i_0_41) ).
cnf(i_0_44,plain,
ssList(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-95_fhswk/lgb.p',i_0_44) ).
cnf(i_0_195,negated_conjecture,
~ totalorderedP(esk48_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-95_fhswk/lgb.p',i_0_195) ).
cnf(i_0_196,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-95_fhswk/lgb.p',i_0_196) ).
cnf(i_0_193,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-95_fhswk/lgb.p',i_0_193) ).
cnf(i_0_121,plain,
( totalorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-95_fhswk/lgb.p',i_0_121) ).
cnf(i_0_194,negated_conjecture,
( esk50_0 = nil
| nil != esk51_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-95_fhswk/lgb.p',i_0_194) ).
cnf(i_0_122,plain,
totalorderedP(nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-95_fhswk/lgb.p',i_0_122) ).
cnf(c_0_212,negated_conjecture,
ssList(esk49_0),
i_0_200 ).
cnf(c_0_213,negated_conjecture,
esk49_0 = esk51_0,
i_0_197 ).
cnf(c_0_214,negated_conjecture,
( cons(esk52_0,nil) = esk50_0
| ~ neq(esk51_0,nil) ),
i_0_192 ).
cnf(c_0_215,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
i_0_41 ).
cnf(c_0_216,plain,
ssList(nil),
i_0_44 ).
cnf(c_0_217,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_212,c_0_213]) ).
cnf(c_0_218,negated_conjecture,
~ totalorderedP(esk48_0),
i_0_195 ).
cnf(c_0_219,negated_conjecture,
esk50_0 = esk48_0,
i_0_196 ).
cnf(c_0_220,negated_conjecture,
( ssItem(esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_193 ).
cnf(c_0_221,plain,
( totalorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
i_0_121 ).
cnf(c_0_222,negated_conjecture,
( cons(esk52_0,nil) = esk50_0
| esk51_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_214,c_0_215]),c_0_216]),c_0_217])]) ).
cnf(c_0_223,negated_conjecture,
~ totalorderedP(esk50_0),
inference(rw,[status(thm)],[c_0_218,c_0_219]) ).
cnf(c_0_224,negated_conjecture,
( esk51_0 = nil
| ssItem(esk52_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_220,c_0_215]),c_0_216]),c_0_217])]) ).
cnf(c_0_225,negated_conjecture,
( esk50_0 = nil
| nil != esk51_0 ),
i_0_194 ).
cnf(c_0_226,plain,
esk51_0 = nil,
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_221,c_0_222]),c_0_223]),c_0_224]) ).
cnf(c_0_227,negated_conjecture,
esk50_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_225,c_0_226])]) ).
cnf(c_0_228,plain,
totalorderedP(nil),
i_0_122 ).
cnf(c_0_229,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_223,c_0_227]),c_0_228])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.08 % Problem : SWC275+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.08 % Command : enigmatic-eprover.py %s %d 1
% 0.07/0.26 % Computer : n032.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 600
% 0.07/0.26 % DateTime : Sun Jun 12 01:00:42 EDT 2022
% 0.07/0.26 % CPUTime :
% 0.10/0.32 # ENIGMATIC: Selected SinE mode:
% 0.10/0.33 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.33 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.10/0.33 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.10/0.33 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 5.48/1.90 # ENIGMATIC: Solved by autoschedule-lgb:
% 5.48/1.90 # No SInE strategy applied
% 5.48/1.90 # Trying AutoSched0 for 150 seconds
% 5.48/1.90 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 5.48/1.90 # and selection function SelectNewComplexAHP.
% 5.48/1.90 #
% 5.48/1.90 # Preprocessing time : 0.012 s
% 5.48/1.90 # Presaturation interreduction done
% 5.48/1.90
% 5.48/1.90 # Proof found!
% 5.48/1.90 # SZS status Theorem
% 5.48/1.90 # SZS output start CNFRefutation
% See solution above
% 5.48/1.90 # Training examples: 0 positive, 0 negative
% 5.48/1.90
% 5.48/1.90 # -------------------------------------------------
% 5.48/1.90 # User time : 0.014 s
% 5.48/1.90 # System time : 0.004 s
% 5.48/1.90 # Total time : 0.018 s
% 5.48/1.90 # Maximum resident set size: 7124 pages
% 5.48/1.90
%------------------------------------------------------------------------------