TSTP Solution File: SWV197+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV197+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n004.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:46:10 EDT 2022
% Result : Theorem 8.19s 2.56s
% Output : CNFRefutation 8.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 7
% Syntax : Number of clauses : 16 ( 13 unt; 0 nHn; 16 RR)
% Number of literals : 30 ( 5 equ; 16 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-3 aty)
% Number of variables : 6 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_204,plain,
( a_select3(z_defuse,X1,X2) = use
| ~ epred2_0
| ~ leq(X1,n2)
| ~ leq(n0,X2)
| ~ leq(n0,X1)
| ~ leq(X2,minus(pv5,n1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-c6q8mi4c/lgb.p',i_0_204) ).
cnf(i_0_141,negated_conjecture,
epred2_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-c6q8mi4c/lgb.p',i_0_141) ).
cnf(i_0_133,negated_conjecture,
a_select3(z_defuse,esk21_0,esk22_0) != use,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-c6q8mi4c/lgb.p',i_0_133) ).
cnf(i_0_137,negated_conjecture,
leq(esk22_0,minus(pv5,n1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-c6q8mi4c/lgb.p',i_0_137) ).
cnf(i_0_138,negated_conjecture,
leq(esk21_0,n2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-c6q8mi4c/lgb.p',i_0_138) ).
cnf(i_0_139,negated_conjecture,
leq(n0,esk22_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-c6q8mi4c/lgb.p',i_0_139) ).
cnf(i_0_140,negated_conjecture,
leq(n0,esk21_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-c6q8mi4c/lgb.p',i_0_140) ).
cnf(c_0_212,plain,
( a_select3(z_defuse,X1,X2) = use
| ~ epred2_0
| ~ leq(X1,n2)
| ~ leq(n0,X2)
| ~ leq(n0,X1)
| ~ leq(X2,minus(pv5,n1)) ),
i_0_204 ).
cnf(c_0_213,negated_conjecture,
epred2_0,
i_0_141 ).
cnf(c_0_214,negated_conjecture,
a_select3(z_defuse,esk21_0,esk22_0) != use,
i_0_133 ).
cnf(c_0_215,plain,
( a_select3(z_defuse,X1,X2) = use
| ~ leq(X2,minus(pv5,n1))
| ~ leq(X1,n2)
| ~ leq(n0,X2)
| ~ leq(n0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_212,c_0_213])]) ).
cnf(c_0_216,negated_conjecture,
leq(esk22_0,minus(pv5,n1)),
i_0_137 ).
cnf(c_0_217,negated_conjecture,
leq(esk21_0,n2),
i_0_138 ).
cnf(c_0_218,negated_conjecture,
leq(n0,esk22_0),
i_0_139 ).
cnf(c_0_219,negated_conjecture,
leq(n0,esk21_0),
i_0_140 ).
cnf(c_0_220,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[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]),c_0_218]),c_0_219])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV197+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.07/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 16 01:32:10 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.48 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.48 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.48 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.48 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.19/2.56 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.19/2.56 # No SInE strategy applied
% 8.19/2.56 # Trying AutoSched0 for 150 seconds
% 8.19/2.56 # AutoSched0-Mode selected heuristic G_E___300_C18_F1_URBAN_S0Y
% 8.19/2.56 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.19/2.56 #
% 8.19/2.56 # Preprocessing time : 0.024 s
% 8.19/2.56
% 8.19/2.56 # Proof found!
% 8.19/2.56 # SZS status Theorem
% 8.19/2.56 # SZS output start CNFRefutation
% See solution above
% 8.19/2.56 # Training examples: 0 positive, 0 negative
% 8.19/2.56
% 8.19/2.56 # -------------------------------------------------
% 8.19/2.56 # User time : 0.024 s
% 8.19/2.56 # System time : 0.009 s
% 8.19/2.56 # Total time : 0.034 s
% 8.19/2.56 # Maximum resident set size: 7128 pages
% 8.19/2.56
%------------------------------------------------------------------------------