TSTP Solution File: SWV204+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV204+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n022.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:12 EDT 2022
% Result : Theorem 7.61s 2.41s
% Output : CNFRefutation 7.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 23 ( 13 unt; 4 nHn; 23 RR)
% Number of literals : 40 ( 23 equ; 12 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 2 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_6,plain,
( X1 = n0
| X1 = n1
| X1 = n2
| ~ leq(X1,n2)
| ~ leq(n0,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t1wbazgn/lgb.p',i_0_6) ).
cnf(i_0_134,negated_conjecture,
leq(esk21_0,n2),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t1wbazgn/lgb.p',i_0_134) ).
cnf(i_0_135,negated_conjecture,
leq(n0,esk21_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t1wbazgn/lgb.p',i_0_135) ).
cnf(i_0_225,plain,
( a_select2(rho_defuse,n2) = use
| ~ epred2_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t1wbazgn/lgb.p',i_0_225) ).
cnf(i_0_136,negated_conjecture,
epred2_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t1wbazgn/lgb.p',i_0_136) ).
cnf(i_0_133,negated_conjecture,
a_select2(rho_defuse,esk21_0) != use,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t1wbazgn/lgb.p',i_0_133) ).
cnf(i_0_227,plain,
( a_select2(rho_defuse,n0) = use
| ~ epred2_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t1wbazgn/lgb.p',i_0_227) ).
cnf(i_0_226,plain,
( a_select2(rho_defuse,n1) = use
| ~ epred2_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-t1wbazgn/lgb.p',i_0_226) ).
cnf(c_0_236,plain,
( X1 = n0
| X1 = n1
| X1 = n2
| ~ leq(X1,n2)
| ~ leq(n0,X1) ),
i_0_6 ).
cnf(c_0_237,negated_conjecture,
leq(esk21_0,n2),
i_0_134 ).
cnf(c_0_238,negated_conjecture,
leq(n0,esk21_0),
i_0_135 ).
cnf(c_0_239,plain,
( a_select2(rho_defuse,n2) = use
| ~ epred2_0 ),
i_0_225 ).
cnf(c_0_240,negated_conjecture,
epred2_0,
i_0_136 ).
cnf(c_0_241,negated_conjecture,
a_select2(rho_defuse,esk21_0) != use,
i_0_133 ).
cnf(c_0_242,negated_conjecture,
( esk21_0 = n1
| esk21_0 = n2
| esk21_0 = n0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_236,c_0_237]),c_0_238])]) ).
cnf(c_0_243,plain,
a_select2(rho_defuse,n2) = use,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_239,c_0_240])]) ).
cnf(c_0_244,plain,
( a_select2(rho_defuse,n0) = use
| ~ epred2_0 ),
i_0_227 ).
cnf(c_0_245,negated_conjecture,
( esk21_0 = n0
| esk21_0 = n1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_241,c_0_242]),c_0_243])]) ).
cnf(c_0_246,plain,
a_select2(rho_defuse,n0) = use,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_244,c_0_240])]) ).
cnf(c_0_247,plain,
( a_select2(rho_defuse,n1) = use
| ~ epred2_0 ),
i_0_226 ).
cnf(c_0_248,negated_conjecture,
esk21_0 = n1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_241,c_0_245]),c_0_246])]) ).
cnf(c_0_249,plain,
a_select2(rho_defuse,n1) = use,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_247,c_0_240])]) ).
cnf(c_0_250,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_241,c_0_248]),c_0_249])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV204+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n022.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 : Thu Jun 16 04:32:04 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.61/2.41 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.61/2.41 # No SInE strategy applied
% 7.61/2.41 # Trying AutoSched0 for 150 seconds
% 7.61/2.41 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.61/2.41 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.61/2.41 #
% 7.61/2.41 # Preprocessing time : 0.024 s
% 7.61/2.41 # Presaturation interreduction done
% 7.61/2.41
% 7.61/2.41 # Proof found!
% 7.61/2.41 # SZS status Theorem
% 7.61/2.41 # SZS output start CNFRefutation
% See solution above
% 7.61/2.41 # Training examples: 0 positive, 0 negative
% 7.61/2.41
% 7.61/2.41 # -------------------------------------------------
% 7.61/2.41 # User time : 0.034 s
% 7.61/2.41 # System time : 0.009 s
% 7.61/2.41 # Total time : 0.043 s
% 7.61/2.41 # Maximum resident set size: 7128 pages
% 7.61/2.41
%------------------------------------------------------------------------------