TSTP Solution File: SWC102+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWC102+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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:38 EDT 2022
% Result : Theorem 7.49s 2.46s
% Output : CNFRefutation 7.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 17 ( 13 unt; 0 nHn; 17 RR)
% Number of literals : 21 ( 7 equ; 7 neg)
% Maximal clause size : 2 ( 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 : 2 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_193,negated_conjecture,
esk50_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6uie_v25/lgb.p',i_0_193) ).
cnf(i_0_194,negated_conjecture,
esk50_0 = esk48_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6uie_v25/lgb.p',i_0_194) ).
cnf(i_0_195,negated_conjecture,
esk49_0 = esk51_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6uie_v25/lgb.p',i_0_195) ).
cnf(i_0_191,negated_conjecture,
( ~ neq(esk48_0,nil)
| ~ frontsegP(esk49_0,esk48_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6uie_v25/lgb.p',i_0_191) ).
cnf(i_0_192,negated_conjecture,
neq(esk49_0,nil),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6uie_v25/lgb.p',i_0_192) ).
cnf(i_0_87,plain,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6uie_v25/lgb.p',i_0_87) ).
cnf(i_0_198,negated_conjecture,
ssList(esk49_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6uie_v25/lgb.p',i_0_198) ).
cnf(c_0_206,negated_conjecture,
esk50_0 = esk51_0,
i_0_193 ).
cnf(c_0_207,negated_conjecture,
esk50_0 = esk48_0,
i_0_194 ).
cnf(c_0_208,negated_conjecture,
esk49_0 = esk51_0,
i_0_195 ).
cnf(c_0_209,negated_conjecture,
( ~ neq(esk48_0,nil)
| ~ frontsegP(esk49_0,esk48_0) ),
i_0_191 ).
cnf(c_0_210,negated_conjecture,
esk48_0 = esk49_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_206,c_0_207]),c_0_208]) ).
cnf(c_0_211,negated_conjecture,
neq(esk49_0,nil),
i_0_192 ).
cnf(c_0_212,negated_conjecture,
~ frontsegP(esk49_0,esk49_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_209,c_0_210]),c_0_211]),c_0_210])]) ).
cnf(c_0_213,plain,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
i_0_87 ).
cnf(c_0_214,negated_conjecture,
ssList(esk49_0),
i_0_198 ).
cnf(c_0_215,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_212,c_0_213]),c_0_214])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC102+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n010.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 09:20:12 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox2/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
% 7.49/2.46 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.49/2.46 # No SInE strategy applied
% 7.49/2.46 # Trying AutoSched0 for 150 seconds
% 7.49/2.46 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 7.49/2.46 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.49/2.46 #
% 7.49/2.46 # Preprocessing time : 0.022 s
% 7.49/2.46 # Presaturation interreduction done
% 7.49/2.46
% 7.49/2.46 # Proof found!
% 7.49/2.46 # SZS status Theorem
% 7.49/2.46 # SZS output start CNFRefutation
% See solution above
% 7.49/2.46 # Training examples: 0 positive, 0 negative
% 7.49/2.46
% 7.49/2.46 # -------------------------------------------------
% 7.49/2.46 # User time : 0.022 s
% 7.49/2.46 # System time : 0.007 s
% 7.49/2.46 # Total time : 0.029 s
% 7.49/2.46 # Maximum resident set size: 7120 pages
% 7.49/2.46
%------------------------------------------------------------------------------