TSTP Solution File: ALG227+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : ALG227+2 : TPTP v8.1.0. Released v3.4.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 : Thu Jul 14 15:33:10 EDT 2022
% Result : Theorem 9.35s 3.65s
% Output : CNFRefutation 9.35s
% 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_1172,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-3qdbrkdy/lgb.p',i_0_1172) ).
cnf(i_0_3139,plain,
k1_xboole_0 = np__0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3qdbrkdy/lgb.p',i_0_3139) ).
cnf(i_0_412,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-3qdbrkdy/lgb.p',i_0_412) ).
cnf(i_0_3844,negated_conjecture,
m1_subset_1(esk522_0,esk520_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3qdbrkdy/lgb.p',i_0_3844) ).
cnf(i_0_3846,negated_conjecture,
~ v1_xboole_0(esk520_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3qdbrkdy/lgb.p',i_0_3846) ).
cnf(i_0_3845,negated_conjecture,
m1_pboole(esk521_0,esk520_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3qdbrkdy/lgb.p',i_0_3845) ).
cnf(i_0_3842,negated_conjecture,
k1_funct_1(esk521_0,esk522_0) != k1_xboole_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3qdbrkdy/lgb.p',i_0_3842) ).
cnf(i_0_3843,negated_conjecture,
~ r2_hidden(esk522_0,k1_closure3(esk520_0,esk521_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3qdbrkdy/lgb.p',i_0_3843) ).
cnf(c_0_3855,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_1172 ).
cnf(c_0_3856,plain,
k1_xboole_0 = np__0,
i_0_3139 ).
cnf(c_0_3857,plain,
( X1 = k1_closure3(X2,X3)
| v1_xboole_0(X2)
| X1 != a_2_0_closure3(X2,X3)
| ~ m1_pboole(X3,X2) ),
i_0_412 ).
cnf(c_0_3858,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_3855,c_0_3856])]) ).
cnf(c_0_3859,negated_conjecture,
m1_subset_1(esk522_0,esk520_0),
i_0_3844 ).
cnf(c_0_3860,negated_conjecture,
~ v1_xboole_0(esk520_0),
i_0_3846 ).
cnf(c_0_3861,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_3857]) ).
cnf(c_0_3862,negated_conjecture,
m1_pboole(esk521_0,esk520_0),
i_0_3845 ).
cnf(c_0_3863,negated_conjecture,
k1_funct_1(esk521_0,esk522_0) != k1_xboole_0,
i_0_3842 ).
cnf(c_0_3864,negated_conjecture,
( k1_funct_1(X1,esk522_0) = np__0
| r2_hidden(esk522_0,a_2_0_closure3(esk520_0,X1))
| ~ m1_pboole(X1,esk520_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_3858,c_0_3859]),c_0_3860]) ).
cnf(c_0_3865,negated_conjecture,
a_2_0_closure3(esk520_0,esk521_0) = k1_closure3(esk520_0,esk521_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_3861,c_0_3862]),c_0_3860]) ).
cnf(c_0_3866,negated_conjecture,
k1_funct_1(esk521_0,esk522_0) != np__0,
inference(rw,[status(thm)],[c_0_3863,c_0_3856]) ).
cnf(c_0_3867,negated_conjecture,
~ r2_hidden(esk522_0,k1_closure3(esk520_0,esk521_0)),
i_0_3843 ).
cnf(c_0_3868,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3864,c_0_3862]),c_0_3865]),c_0_3866]),c_0_3867]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : ALG227+2 : TPTP v8.1.0. Released v3.4.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n023.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 : Wed Jun 8 02:21:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.44/0.62 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.44/0.62 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.44/0.62 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.44/0.62 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.35/3.65 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.35/3.65 # No SInE strategy applied
% 9.35/3.65 # Trying AutoSched0 for 150 seconds
% 9.35/3.65 # AutoSched0-Mode selected heuristic G_E___200_B02_F1_SE_CS_SP_PI_S0S
% 9.35/3.65 # and selection function SelectComplexG.
% 9.35/3.65 #
% 9.35/3.65 # Preprocessing time : 0.024 s
% 9.35/3.65
% 9.35/3.65 # Proof found!
% 9.35/3.65 # SZS status Theorem
% 9.35/3.65 # SZS output start CNFRefutation
% See solution above
% 9.35/3.65 # Training examples: 0 positive, 0 negative
% 9.35/3.65
% 9.35/3.65 # -------------------------------------------------
% 9.35/3.65 # User time : 0.030 s
% 9.35/3.65 # System time : 0.007 s
% 9.35/3.65 # Total time : 0.037 s
% 9.35/3.65 # Maximum resident set size: 7124 pages
% 9.35/3.65
%------------------------------------------------------------------------------