%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU406+2 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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 : Tue Jul 19 08:41:57 EDT 2022
% Result : Theorem 9.28s 3.76s
% Output : CNFRefutation 9.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 32 ( 7 unt; 7 nHn; 30 RR)
% Number of literals : 72 ( 4 equ; 46 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-2 aty)
% Number of variables : 28 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1955,negated_conjecture,
( ~ r2_hidden(esk357_0,k5_xboole_0(esk359_0,k3_xboole_0(esk359_0,esk360_0)))
| ~ r2_hidden(esk358_0,k5_xboole_0(esk359_0,k3_xboole_0(esk359_0,esk360_0))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-84xpazrh/lgb.p',i_0_1955) ).
cnf(i_0_1972,plain,
( r2_hidden(X1,X2)
| r2_hidden(X1,k5_xboole_0(X3,X2))
| ~ r2_hidden(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-84xpazrh/lgb.p',i_0_1972) ).
cnf(i_0_467,plain,
( r2_hidden(X1,X2)
| X3 != k3_xboole_0(X4,X2)
| ~ r2_hidden(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-84xpazrh/lgb.p',i_0_467) ).
cnf(i_0_1953,negated_conjecture,
( ~ r2_hidden(esk358_0,esk360_0)
| ~ r2_hidden(esk357_0,k5_xboole_0(esk359_0,k3_xboole_0(esk359_0,esk360_0))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-84xpazrh/lgb.p',i_0_1953) ).
cnf(i_0_1954,negated_conjecture,
( ~ r2_hidden(esk357_0,esk360_0)
| ~ r2_hidden(esk358_0,esk360_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-84xpazrh/lgb.p',i_0_1954) ).
cnf(i_0_1952,negated_conjecture,
( ~ r2_hidden(esk357_0,esk360_0)
| ~ r2_hidden(esk358_0,k5_xboole_0(esk359_0,k3_xboole_0(esk359_0,esk360_0))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-84xpazrh/lgb.p',i_0_1952) ).
cnf(i_0_404,plain,
( r2_hidden(X1,X2)
| r2_hidden(X1,X3)
| X4 != k3_tarski(k2_relat_1(k7_finseq_1(k1_tarski(k4_tarski(np__1,X3)),k1_tarski(k4_tarski(np__1,X2)))))
| ~ r2_hidden(X1,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-84xpazrh/lgb.p',i_0_404) ).
cnf(i_0_1956,negated_conjecture,
r2_hidden(esk358_0,k3_tarski(k2_relat_1(k7_finseq_1(k1_tarski(k4_tarski(np__1,esk359_0)),k1_tarski(k4_tarski(np__1,esk360_0)))))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-84xpazrh/lgb.p',i_0_1956) ).
cnf(i_0_1957,negated_conjecture,
r2_hidden(esk357_0,k3_tarski(k2_relat_1(k7_finseq_1(k1_tarski(k4_tarski(np__1,esk359_0)),k1_tarski(k4_tarski(np__1,esk360_0)))))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-84xpazrh/lgb.p',i_0_1957) ).
cnf(c_0_1982,negated_conjecture,
( ~ r2_hidden(esk357_0,k5_xboole_0(esk359_0,k3_xboole_0(esk359_0,esk360_0)))
| ~ r2_hidden(esk358_0,k5_xboole_0(esk359_0,k3_xboole_0(esk359_0,esk360_0))) ),
i_0_1955 ).
cnf(c_0_1983,plain,
( r2_hidden(X1,X2)
| r2_hidden(X1,k5_xboole_0(X3,X2))
| ~ r2_hidden(X1,X3) ),
i_0_1972 ).
cnf(c_0_1984,plain,
( r2_hidden(X1,X2)
| X3 != k3_xboole_0(X4,X2)
| ~ r2_hidden(X1,X3) ),
i_0_467 ).
cnf(c_0_1985,negated_conjecture,
( ~ r2_hidden(esk358_0,esk360_0)
| ~ r2_hidden(esk357_0,k5_xboole_0(esk359_0,k3_xboole_0(esk359_0,esk360_0))) ),
i_0_1953 ).
cnf(c_0_1986,plain,
( r2_hidden(esk358_0,k3_xboole_0(esk359_0,esk360_0))
| ~ r2_hidden(esk357_0,k5_xboole_0(esk359_0,k3_xboole_0(esk359_0,esk360_0)))
| ~ r2_hidden(esk358_0,esk359_0) ),
inference(spm,[status(thm)],[c_0_1982,c_0_1983]) ).
cnf(c_0_1987,plain,
( r2_hidden(X1,X2)
| ~ r2_hidden(X1,k3_xboole_0(X3,X2)) ),
inference(er,[status(thm)],[c_0_1984]) ).
cnf(c_0_1988,negated_conjecture,
( r2_hidden(esk357_0,k3_xboole_0(esk359_0,esk360_0))
| ~ r2_hidden(esk358_0,esk360_0)
| ~ r2_hidden(esk357_0,esk359_0) ),
inference(spm,[status(thm)],[c_0_1985,c_0_1983]) ).
cnf(c_0_1989,negated_conjecture,
( ~ r2_hidden(esk357_0,esk360_0)
| ~ r2_hidden(esk358_0,esk360_0) ),
i_0_1954 ).
cnf(c_0_1990,negated_conjecture,
( ~ r2_hidden(esk357_0,esk360_0)
| ~ r2_hidden(esk358_0,k5_xboole_0(esk359_0,k3_xboole_0(esk359_0,esk360_0))) ),
i_0_1952 ).
cnf(c_0_1991,plain,
( r2_hidden(X1,X2)
| r2_hidden(X1,X3)
| X4 != k3_tarski(k2_relat_1(k7_finseq_1(k1_tarski(k4_tarski(np__1,X3)),k1_tarski(k4_tarski(np__1,X2)))))
| ~ r2_hidden(X1,X4) ),
i_0_404 ).
cnf(c_0_1992,plain,
( r2_hidden(esk357_0,k3_xboole_0(esk359_0,esk360_0))
| r2_hidden(esk358_0,k3_xboole_0(esk359_0,esk360_0))
| ~ r2_hidden(esk358_0,esk359_0)
| ~ r2_hidden(esk357_0,esk359_0) ),
inference(spm,[status(thm)],[c_0_1986,c_0_1983]) ).
cnf(c_0_1993,negated_conjecture,
( ~ r2_hidden(esk358_0,esk360_0)
| ~ r2_hidden(esk357_0,esk359_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_1987,c_0_1988]),c_0_1989]) ).
cnf(c_0_1994,negated_conjecture,
( r2_hidden(esk358_0,k3_xboole_0(esk359_0,esk360_0))
| ~ r2_hidden(esk357_0,esk360_0)
| ~ r2_hidden(esk358_0,esk359_0) ),
inference(spm,[status(thm)],[c_0_1990,c_0_1983]) ).
cnf(c_0_1995,plain,
( r2_hidden(X1,X2)
| r2_hidden(X1,X3)
| ~ r2_hidden(X1,k3_tarski(k2_relat_1(k7_finseq_1(k1_tarski(k4_tarski(np__1,X2)),k1_tarski(k4_tarski(np__1,X3)))))) ),
inference(er,[status(thm)],[c_0_1991]) ).
cnf(c_0_1996,negated_conjecture,
r2_hidden(esk358_0,k3_tarski(k2_relat_1(k7_finseq_1(k1_tarski(k4_tarski(np__1,esk359_0)),k1_tarski(k4_tarski(np__1,esk360_0)))))),
i_0_1956 ).
cnf(c_0_1997,plain,
( r2_hidden(esk357_0,k3_xboole_0(esk359_0,esk360_0))
| ~ r2_hidden(esk358_0,esk359_0)
| ~ r2_hidden(esk357_0,esk359_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_1987,c_0_1992]),c_0_1993]) ).
cnf(c_0_1998,negated_conjecture,
( ~ r2_hidden(esk357_0,esk360_0)
| ~ r2_hidden(esk358_0,esk359_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_1987,c_0_1994]),c_0_1989]) ).
cnf(c_0_1999,negated_conjecture,
( r2_hidden(esk358_0,esk360_0)
| r2_hidden(esk358_0,esk359_0) ),
inference(spm,[status(thm)],[c_0_1995,c_0_1996]) ).
cnf(c_0_2000,plain,
( ~ r2_hidden(esk358_0,esk359_0)
| ~ r2_hidden(esk357_0,esk359_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_1987,c_0_1997]),c_0_1998]) ).
cnf(c_0_2001,negated_conjecture,
r2_hidden(esk357_0,k3_tarski(k2_relat_1(k7_finseq_1(k1_tarski(k4_tarski(np__1,esk359_0)),k1_tarski(k4_tarski(np__1,esk360_0)))))),
i_0_1957 ).
cnf(c_0_2002,negated_conjecture,
~ r2_hidden(esk357_0,esk359_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_1993,c_0_1999]),c_0_2000]) ).
cnf(c_0_2003,negated_conjecture,
~ r2_hidden(esk357_0,esk360_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_1989,c_0_1999]),c_0_1998]) ).
cnf(c_0_2004,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_1995,c_0_2001]),c_0_2002]),c_0_2003]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU406+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 : n021.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 : Sat Jun 18 21:34:19 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 0.37/0.60 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.37/0.60 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.37/0.60 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.37/0.60 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 9.28/3.76 # ENIGMATIC: Solved by autoschedule-lgb:
% 9.28/3.76 # No SInE strategy applied
% 9.28/3.76 # Trying AutoSched0 for 150 seconds
% 9.28/3.76 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 9.28/3.76 # and selection function SelectMaxLComplexAvoidPosPred.
% 9.28/3.76 #
% 9.28/3.76 # Preprocessing time : 0.030 s
% 9.28/3.76
% 9.28/3.76 # Proof found!
% 9.28/3.76 # SZS status Theorem
% 9.28/3.76 # SZS output start CNFRefutation
% See solution above
% 9.28/3.76 # Training examples: 0 positive, 0 negative
% 9.28/3.76
% 9.28/3.76 # -------------------------------------------------
% 9.28/3.76 # User time : 0.083 s
% 9.28/3.76 # System time : 0.011 s
% 9.28/3.76 # Total time : 0.093 s
% 9.28/3.76 # Maximum resident set size: 7124 pages
% 9.28/3.76
%------------------------------------------------------------------------------