TSTP Solution File: ALG227+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : ALG227+3 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n032.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 : Thu Jul 14 15:33:10 EDT 2022
% Result : Theorem 10.05s 4.61s
% Output : CNFRefutation 10.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 22 ( 15 unt; 7 nHn; 22 RR)
% Number of literals : 46 ( 17 equ; 21 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1340,plain,
( k1_funct_1(X1,X2) = k1_xboole_0
| v1_xboole_0(X3)
| r2_hidden(X4,a_2_0_closure3(X3,X1))
| X2 != X4
| ~ m1_subset_1(X2,X3)
| ~ m1_pboole(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p7h2rq13/lgb.p',i_0_1340) ).
cnf(i_0_4258,plain,
np__0 = k1_xboole_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p7h2rq13/lgb.p',i_0_4258) ).
cnf(i_0_508,plain,
( X1 = k1_closure3(X2,X3)
| v1_xboole_0(X2)
| X1 != a_2_0_closure3(X2,X3)
| ~ m1_pboole(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p7h2rq13/lgb.p',i_0_508) ).
cnf(i_0_5233,negated_conjecture,
m1_subset_1(esk756_0,esk754_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p7h2rq13/lgb.p',i_0_5233) ).
cnf(i_0_5235,negated_conjecture,
~ v1_xboole_0(esk754_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p7h2rq13/lgb.p',i_0_5235) ).
cnf(i_0_5234,negated_conjecture,
m1_pboole(esk755_0,esk754_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p7h2rq13/lgb.p',i_0_5234) ).
cnf(i_0_5231,negated_conjecture,
k1_funct_1(esk755_0,esk756_0) != k1_xboole_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p7h2rq13/lgb.p',i_0_5231) ).
cnf(i_0_5232,negated_conjecture,
~ r2_hidden(esk756_0,k1_closure3(esk754_0,esk755_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p7h2rq13/lgb.p',i_0_5232) ).
cnf(c_0_5244,plain,
( k1_funct_1(X1,X2) = k1_xboole_0
| v1_xboole_0(X3)
| r2_hidden(X4,a_2_0_closure3(X3,X1))
| X2 != X4
| ~ m1_subset_1(X2,X3)
| ~ m1_pboole(X1,X3) ),
i_0_1340 ).
cnf(c_0_5245,plain,
np__0 = k1_xboole_0,
i_0_4258 ).
cnf(c_0_5246,plain,
( X1 = k1_closure3(X2,X3)
| v1_xboole_0(X2)
| X1 != a_2_0_closure3(X2,X3)
| ~ m1_pboole(X3,X2) ),
i_0_508 ).
cnf(c_0_5247,plain,
( k1_funct_1(X1,X2) = np__0
| v1_xboole_0(X3)
| r2_hidden(X2,a_2_0_closure3(X3,X1))
| ~ m1_subset_1(X2,X3)
| ~ m1_pboole(X1,X3) ),
inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_5244,c_0_5245])]) ).
cnf(c_0_5248,negated_conjecture,
m1_subset_1(esk756_0,esk754_0),
i_0_5233 ).
cnf(c_0_5249,negated_conjecture,
~ v1_xboole_0(esk754_0),
i_0_5235 ).
cnf(c_0_5250,plain,
( a_2_0_closure3(X1,X2) = k1_closure3(X1,X2)
| v1_xboole_0(X1)
| ~ m1_pboole(X2,X1) ),
inference(er,[status(thm)],[c_0_5246]) ).
cnf(c_0_5251,negated_conjecture,
m1_pboole(esk755_0,esk754_0),
i_0_5234 ).
cnf(c_0_5252,negated_conjecture,
k1_funct_1(esk755_0,esk756_0) != k1_xboole_0,
i_0_5231 ).
cnf(c_0_5253,negated_conjecture,
( k1_funct_1(X1,esk756_0) = np__0
| r2_hidden(esk756_0,a_2_0_closure3(esk754_0,X1))
| ~ m1_pboole(X1,esk754_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_5247,c_0_5248]),c_0_5249]) ).
cnf(c_0_5254,negated_conjecture,
a_2_0_closure3(esk754_0,esk755_0) = k1_closure3(esk754_0,esk755_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_5250,c_0_5251]),c_0_5249]) ).
cnf(c_0_5255,negated_conjecture,
k1_funct_1(esk755_0,esk756_0) != np__0,
inference(rw,[status(thm)],[c_0_5252,c_0_5245]) ).
cnf(c_0_5256,negated_conjecture,
~ r2_hidden(esk756_0,k1_closure3(esk754_0,esk755_0)),
i_0_5232 ).
cnf(c_0_5257,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5253,c_0_5251]),c_0_5254]),c_0_5255]),c_0_5256]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : ALG227+3 : TPTP v8.1.0. Released v3.4.0.
% 0.02/0.10 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 600
% 0.09/0.28 % DateTime : Wed Jun 8 10:07:40 EDT 2022
% 0.09/0.29 % CPUTime :
% 0.13/0.37 # ENIGMATIC: Selected SinE mode:
% 0.75/0.93 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.75/0.93 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.75/0.93 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.75/0.93 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 10.05/4.61 # ENIGMATIC: Solved by autoschedule-lgb:
% 10.05/4.61 # No SInE strategy applied
% 10.05/4.61 # Trying AutoSched0 for 149 seconds
% 10.05/4.61 # AutoSched0-Mode selected heuristic G_E___200_B02_F1_SE_CS_SP_PI_S0S
% 10.05/4.61 # and selection function SelectComplexG.
% 10.05/4.61 #
% 10.05/4.61 # Preprocessing time : 0.014 s
% 10.05/4.61
% 10.05/4.61 # Proof found!
% 10.05/4.61 # SZS status Theorem
% 10.05/4.61 # SZS output start CNFRefutation
% See solution above
% 10.05/4.61 # Training examples: 0 positive, 0 negative
% 10.05/4.61
% 10.05/4.61 # -------------------------------------------------
% 10.05/4.61 # User time : 0.018 s
% 10.05/4.61 # System time : 0.005 s
% 10.05/4.61 # Total time : 0.023 s
% 10.05/4.61 # Maximum resident set size: 7120 pages
% 10.05/4.61
%------------------------------------------------------------------------------