TSTP Solution File: SWC050+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC050+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n014.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 6.61s 2.33s
% Output : CNFRefutation 6.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 23 ( 12 unt; 0 nHn; 23 RR)
% Number of literals : 42 ( 4 equ; 22 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 3 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_202,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_7kbe399/lgb.p',i_0_202) ).
cnf(i_0_204,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_7kbe399/lgb.p',i_0_204) ).
cnf(i_0_199,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ rearsegP(esk48_0,X1)
| ~ rearsegP(esk49_0,X1)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_7kbe399/lgb.p',i_0_199) ).
cnf(i_0_193,negated_conjecture,
( rearsegP(esk51_0,esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_7kbe399/lgb.p',i_0_193) ).
cnf(i_0_191,negated_conjecture,
( rearsegP(esk50_0,esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_7kbe399/lgb.p',i_0_191) ).
cnf(i_0_203,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_7kbe399/lgb.p',i_0_203) ).
cnf(i_0_195,negated_conjecture,
( neq(esk52_0,nil)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_7kbe399/lgb.p',i_0_195) ).
cnf(i_0_197,negated_conjecture,
( ssList(esk52_0)
| ~ neq(esk51_0,nil) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_7kbe399/lgb.p',i_0_197) ).
cnf(c_0_213,negated_conjecture,
neq(esk49_0,nil),
i_0_202 ).
cnf(c_0_214,negated_conjecture,
esk49_0 = esk51_0,
i_0_204 ).
cnf(c_0_215,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ rearsegP(esk48_0,X1)
| ~ rearsegP(esk49_0,X1)
| ~ neq(esk51_0,nil) ),
i_0_199 ).
cnf(c_0_216,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_213,c_0_214]) ).
cnf(c_0_217,negated_conjecture,
( rearsegP(esk51_0,esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_193 ).
cnf(c_0_218,negated_conjecture,
( rearsegP(esk50_0,esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_191 ).
cnf(c_0_219,negated_conjecture,
esk50_0 = esk48_0,
i_0_203 ).
cnf(c_0_220,negated_conjecture,
( neq(esk52_0,nil)
| ~ neq(esk51_0,nil) ),
i_0_195 ).
cnf(c_0_221,negated_conjecture,
( ssList(esk52_0)
| ~ neq(esk51_0,nil) ),
i_0_197 ).
cnf(c_0_222,negated_conjecture,
( ~ rearsegP(esk51_0,X1)
| ~ rearsegP(esk48_0,X1)
| ~ neq(X1,nil)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_215,c_0_214]),c_0_216])]) ).
cnf(c_0_223,negated_conjecture,
rearsegP(esk51_0,esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_217,c_0_216])]) ).
cnf(c_0_224,negated_conjecture,
rearsegP(esk48_0,esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_218,c_0_219]),c_0_216])]) ).
cnf(c_0_225,negated_conjecture,
neq(esk52_0,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_220,c_0_216])]) ).
cnf(c_0_226,negated_conjecture,
ssList(esk52_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_221,c_0_216])]) ).
cnf(c_0_227,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_222,c_0_223]),c_0_224]),c_0_225]),c_0_226])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC050+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n014.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 12 15:57:24 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 6.61/2.33 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.61/2.33 # No SInE strategy applied
% 6.61/2.33 # Trying AutoSched0 for 150 seconds
% 6.61/2.33 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S01BI
% 6.61/2.33 # and selection function PSelectMinOptimalNoXTypePred.
% 6.61/2.33 #
% 6.61/2.33 # Preprocessing time : 0.012 s
% 6.61/2.33 # Presaturation interreduction done
% 6.61/2.33
% 6.61/2.33 # Proof found!
% 6.61/2.33 # SZS status Theorem
% 6.61/2.33 # SZS output start CNFRefutation
% See solution above
% 6.61/2.33 # Training examples: 0 positive, 0 negative
% 6.61/2.33
% 6.61/2.33 # -------------------------------------------------
% 6.61/2.33 # User time : 0.013 s
% 6.61/2.33 # System time : 0.003 s
% 6.61/2.33 # Total time : 0.016 s
% 6.61/2.33 # Maximum resident set size: 7128 pages
% 6.61/2.33
%------------------------------------------------------------------------------