TSTP Solution File: SWV131+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV131+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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 : Wed Jul 20 17:45:57 EDT 2022
% Result : Theorem 8.23s 2.67s
% Output : CNFRefutation 8.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 6 unt; 2 nHn; 10 RR)
% Number of literals : 16 ( 0 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_176,plain,
( ~ epred1_0
| ~ leq(tptp_float_0_001,pv1341) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b5schegd/lgb.p',i_0_176) ).
cnf(i_0_10,negated_conjecture,
epred1_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b5schegd/lgb.p',i_0_10) ).
cnf(i_0_175,plain,
( leq(n0,s_best7)
| leq(tptp_float_0_001,pv1341)
| ~ epred1_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b5schegd/lgb.p',i_0_175) ).
cnf(i_0_9,negated_conjecture,
~ leq(n0,s_best7),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b5schegd/lgb.p',i_0_9) ).
cnf(c_0_181,plain,
( ~ epred1_0
| ~ leq(tptp_float_0_001,pv1341) ),
i_0_176 ).
cnf(c_0_182,negated_conjecture,
epred1_0,
i_0_10 ).
cnf(c_0_183,plain,
( leq(n0,s_best7)
| leq(tptp_float_0_001,pv1341)
| ~ epred1_0 ),
i_0_175 ).
cnf(c_0_184,negated_conjecture,
~ leq(n0,s_best7),
i_0_9 ).
cnf(c_0_185,plain,
~ leq(tptp_float_0_001,pv1341),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_181,c_0_182])]) ).
cnf(c_0_186,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_183,c_0_182])]),c_0_184]),c_0_185]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV131+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n023.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.35 % DateTime : Wed Jun 15 18:37:52 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.46 # ENIGMATIC: Selected SinE mode:
% 0.21/0.47 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.47 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.21/0.47 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.21/0.47 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.23/2.67 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.23/2.67 # No SInE strategy applied
% 8.23/2.67 # Trying AutoSched0 for 150 seconds
% 8.23/2.67 # AutoSched0-Mode selected heuristic G_E___300_C18_F1_URBAN_S0Y
% 8.23/2.67 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.23/2.67 #
% 8.23/2.67 # Preprocessing time : 0.013 s
% 8.23/2.67
% 8.23/2.67 # Proof found!
% 8.23/2.67 # SZS status Theorem
% 8.23/2.67 # SZS output start CNFRefutation
% See solution above
% 8.23/2.67 # Training examples: 0 positive, 0 negative
% 8.23/2.67
% 8.23/2.67 # -------------------------------------------------
% 8.23/2.67 # User time : 0.012 s
% 8.23/2.67 # System time : 0.007 s
% 8.23/2.67 # Total time : 0.019 s
% 8.23/2.67 # Maximum resident set size: 7120 pages
% 8.23/2.67
%------------------------------------------------------------------------------