%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : ALG227+4 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n019.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:11 EDT 2022
% Result : Theorem 14.73s 7.94s
% Output : CNFRefutation 14.73s
% 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_1018,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/sandbox/tmp/enigma-theBenchmark.p-qh2j_yrb/lgb.p',i_0_1018) ).
cnf(i_0_3940,plain,
np__0 = k1_xboole_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qh2j_yrb/lgb.p',i_0_3940) ).
cnf(i_0_369,plain,
( X1 = k1_closure3(X2,X3)
| v1_xboole_0(X2)
| X1 != a_2_0_closure3(X2,X3)
| ~ m1_pboole(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qh2j_yrb/lgb.p',i_0_369) ).
cnf(i_0_4890,negated_conjecture,
m1_subset_1(esk704_0,esk702_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qh2j_yrb/lgb.p',i_0_4890) ).
cnf(i_0_4892,negated_conjecture,
~ v1_xboole_0(esk702_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qh2j_yrb/lgb.p',i_0_4892) ).
cnf(i_0_4891,negated_conjecture,
m1_pboole(esk703_0,esk702_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qh2j_yrb/lgb.p',i_0_4891) ).
cnf(i_0_4888,negated_conjecture,
k1_funct_1(esk703_0,esk704_0) != k1_xboole_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qh2j_yrb/lgb.p',i_0_4888) ).
cnf(i_0_4889,negated_conjecture,
~ r2_hidden(esk704_0,k1_closure3(esk702_0,esk703_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qh2j_yrb/lgb.p',i_0_4889) ).
cnf(c_0_4901,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_1018 ).
cnf(c_0_4902,plain,
np__0 = k1_xboole_0,
i_0_3940 ).
cnf(c_0_4903,plain,
( X1 = k1_closure3(X2,X3)
| v1_xboole_0(X2)
| X1 != a_2_0_closure3(X2,X3)
| ~ m1_pboole(X3,X2) ),
i_0_369 ).
cnf(c_0_4904,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_4901,c_0_4902])]) ).
cnf(c_0_4905,negated_conjecture,
m1_subset_1(esk704_0,esk702_0),
i_0_4890 ).
cnf(c_0_4906,negated_conjecture,
~ v1_xboole_0(esk702_0),
i_0_4892 ).
cnf(c_0_4907,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_4903]) ).
cnf(c_0_4908,negated_conjecture,
m1_pboole(esk703_0,esk702_0),
i_0_4891 ).
cnf(c_0_4909,negated_conjecture,
k1_funct_1(esk703_0,esk704_0) != k1_xboole_0,
i_0_4888 ).
cnf(c_0_4910,negated_conjecture,
( k1_funct_1(X1,esk704_0) = np__0
| r2_hidden(esk704_0,a_2_0_closure3(esk702_0,X1))
| ~ m1_pboole(X1,esk702_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_4904,c_0_4905]),c_0_4906]) ).
cnf(c_0_4911,negated_conjecture,
a_2_0_closure3(esk702_0,esk703_0) = k1_closure3(esk702_0,esk703_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_4907,c_0_4908]),c_0_4906]) ).
cnf(c_0_4912,negated_conjecture,
k1_funct_1(esk703_0,esk704_0) != np__0,
inference(rw,[status(thm)],[c_0_4909,c_0_4902]) ).
cnf(c_0_4913,negated_conjecture,
~ r2_hidden(esk704_0,k1_closure3(esk702_0,esk703_0)),
i_0_4889 ).
cnf(c_0_4914,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4910,c_0_4908]),c_0_4911]),c_0_4912]),c_0_4913]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.10 % Problem : ALG227+4 : TPTP v8.1.0. Released v3.4.0.
% 0.04/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.06/0.30 % Computer : n019.cluster.edu
% 0.06/0.30 % Model : x86_64 x86_64
% 0.06/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.30 % Memory : 8042.1875MB
% 0.06/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.31 % CPULimit : 300
% 0.06/0.31 % WCLimit : 600
% 0.06/0.31 % DateTime : Thu Jun 9 04:10:47 EDT 2022
% 0.06/0.31 % CPUTime :
% 0.11/0.37 # ENIGMATIC: Selected SinE mode:
% 1.83/2.07 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.83/2.07 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 1.83/2.07 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 1.83/2.07 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 14.73/7.94 # ENIGMATIC: Solved by autoschedule-lgb:
% 14.73/7.94 # No SInE strategy applied
% 14.73/7.94 # Trying AutoSched0 for 148 seconds
% 14.73/7.94 # AutoSched0-Mode selected heuristic G_E___200_B02_F1_SE_CS_SP_PI_S0S
% 14.73/7.94 # and selection function SelectComplexG.
% 14.73/7.94 #
% 14.73/7.94 # Preprocessing time : 0.014 s
% 14.73/7.94
% 14.73/7.94 # Proof found!
% 14.73/7.94 # SZS status Theorem
% 14.73/7.94 # SZS output start CNFRefutation
% See solution above
% 14.73/7.94 # Training examples: 0 positive, 0 negative
% 14.73/7.94
% 14.73/7.94 # -------------------------------------------------
% 14.73/7.94 # User time : 0.020 s
% 14.73/7.94 # System time : 0.005 s
% 14.73/7.94 # Total time : 0.025 s
% 14.73/7.94 # Maximum resident set size: 7124 pages
% 14.73/7.94
%------------------------------------------------------------------------------