TSTP Solution File: SEU406+4 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU406+4 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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:58 EDT 2022
% Result : Theorem 17.28s 7.58s
% Output : CNFRefutation 17.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of clauses : 27 ( 10 unt; 8 nHn; 26 RR)
% Number of literals : 54 ( 4 equ; 30 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_381,plain,
( r2_hidden(X1,X2)
| r2_hidden(X1,X3)
| X4 != k3_tarski(k1_enumset1(X3,X3,X2))
| ~ r2_hidden(X1,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3cukqlpr/lgb.p',i_0_381) ).
cnf(i_0_2841,negated_conjecture,
r2_hidden(esk390_0,k3_tarski(k1_enumset1(esk392_0,esk392_0,esk393_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3cukqlpr/lgb.p',i_0_2841) ).
cnf(i_0_495,plain,
( r2_hidden(X1,X2)
| r2_hidden(X1,X3)
| X2 != k5_xboole_0(X4,k1_setfam_1(k1_enumset1(X4,X4,X3)))
| ~ r2_hidden(X1,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3cukqlpr/lgb.p',i_0_495) ).
cnf(i_0_2838,negated_conjecture,
( ~ r2_hidden(esk390_0,esk393_0)
| ~ r2_hidden(esk391_0,esk393_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3cukqlpr/lgb.p',i_0_2838) ).
cnf(i_0_2840,negated_conjecture,
r2_hidden(esk391_0,k3_tarski(k1_enumset1(esk392_0,esk392_0,esk393_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3cukqlpr/lgb.p',i_0_2840) ).
cnf(i_0_2837,negated_conjecture,
( ~ r2_hidden(esk391_0,esk393_0)
| ~ r2_hidden(esk390_0,k5_xboole_0(esk392_0,k1_setfam_1(k1_enumset1(esk392_0,esk392_0,esk393_0)))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3cukqlpr/lgb.p',i_0_2837) ).
cnf(i_0_2836,negated_conjecture,
( ~ r2_hidden(esk390_0,esk393_0)
| ~ r2_hidden(esk391_0,k5_xboole_0(esk392_0,k1_setfam_1(k1_enumset1(esk392_0,esk392_0,esk393_0)))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3cukqlpr/lgb.p',i_0_2836) ).
cnf(i_0_2839,negated_conjecture,
( ~ r2_hidden(esk390_0,k5_xboole_0(esk392_0,k1_setfam_1(k1_enumset1(esk392_0,esk392_0,esk393_0))))
| ~ r2_hidden(esk391_0,k5_xboole_0(esk392_0,k1_setfam_1(k1_enumset1(esk392_0,esk392_0,esk393_0)))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3cukqlpr/lgb.p',i_0_2839) ).
cnf(c_0_2850,plain,
( r2_hidden(X1,X2)
| r2_hidden(X1,X3)
| X4 != k3_tarski(k1_enumset1(X3,X3,X2))
| ~ r2_hidden(X1,X4) ),
i_0_381 ).
cnf(c_0_2851,plain,
( r2_hidden(X1,X2)
| r2_hidden(X1,X3)
| ~ r2_hidden(X1,k3_tarski(k1_enumset1(X2,X2,X3))) ),
inference(er,[status(thm)],[c_0_2850]) ).
cnf(c_0_2852,negated_conjecture,
r2_hidden(esk390_0,k3_tarski(k1_enumset1(esk392_0,esk392_0,esk393_0))),
i_0_2841 ).
cnf(c_0_2853,plain,
( r2_hidden(X1,X2)
| r2_hidden(X1,X3)
| X2 != k5_xboole_0(X4,k1_setfam_1(k1_enumset1(X4,X4,X3)))
| ~ r2_hidden(X1,X4) ),
i_0_495 ).
cnf(c_0_2854,negated_conjecture,
( ~ r2_hidden(esk390_0,esk393_0)
| ~ r2_hidden(esk391_0,esk393_0) ),
i_0_2838 ).
cnf(c_0_2855,negated_conjecture,
( r2_hidden(esk390_0,esk393_0)
| r2_hidden(esk390_0,esk392_0) ),
inference(spm,[status(thm)],[c_0_2851,c_0_2852]) ).
cnf(c_0_2856,negated_conjecture,
r2_hidden(esk391_0,k3_tarski(k1_enumset1(esk392_0,esk392_0,esk393_0))),
i_0_2840 ).
cnf(c_0_2857,negated_conjecture,
( ~ r2_hidden(esk391_0,esk393_0)
| ~ r2_hidden(esk390_0,k5_xboole_0(esk392_0,k1_setfam_1(k1_enumset1(esk392_0,esk392_0,esk393_0)))) ),
i_0_2837 ).
cnf(c_0_2858,plain,
( r2_hidden(X1,k5_xboole_0(X2,k1_setfam_1(k1_enumset1(X2,X2,X3))))
| r2_hidden(X1,X3)
| ~ r2_hidden(X1,X2) ),
inference(er,[status(thm)],[c_0_2853]) ).
cnf(c_0_2859,negated_conjecture,
( r2_hidden(esk390_0,esk392_0)
| ~ r2_hidden(esk391_0,esk393_0) ),
inference(spm,[status(thm)],[c_0_2854,c_0_2855]) ).
cnf(c_0_2860,negated_conjecture,
( r2_hidden(esk391_0,esk393_0)
| r2_hidden(esk391_0,esk392_0) ),
inference(spm,[status(thm)],[c_0_2851,c_0_2856]) ).
cnf(c_0_2861,negated_conjecture,
~ r2_hidden(esk391_0,esk393_0),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_2857,c_0_2858]),c_0_2859]),c_0_2854]) ).
cnf(c_0_2862,negated_conjecture,
( ~ r2_hidden(esk390_0,esk393_0)
| ~ r2_hidden(esk391_0,k5_xboole_0(esk392_0,k1_setfam_1(k1_enumset1(esk392_0,esk392_0,esk393_0)))) ),
i_0_2836 ).
cnf(c_0_2863,negated_conjecture,
r2_hidden(esk391_0,esk392_0),
inference(sr,[status(thm)],[c_0_2860,c_0_2861]) ).
cnf(c_0_2864,negated_conjecture,
~ r2_hidden(esk390_0,esk393_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2862,c_0_2858]),c_0_2863])]),c_0_2861]) ).
cnf(c_0_2865,negated_conjecture,
( ~ r2_hidden(esk390_0,k5_xboole_0(esk392_0,k1_setfam_1(k1_enumset1(esk392_0,esk392_0,esk393_0))))
| ~ r2_hidden(esk391_0,k5_xboole_0(esk392_0,k1_setfam_1(k1_enumset1(esk392_0,esk392_0,esk393_0)))) ),
i_0_2839 ).
cnf(c_0_2866,negated_conjecture,
r2_hidden(esk390_0,esk392_0),
inference(sr,[status(thm)],[c_0_2855,c_0_2864]) ).
cnf(c_0_2867,negated_conjecture,
~ r2_hidden(esk391_0,k5_xboole_0(esk392_0,k1_setfam_1(k1_enumset1(esk392_0,esk392_0,esk393_0)))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2865,c_0_2858]),c_0_2866])]),c_0_2864]) ).
cnf(c_0_2868,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2867,c_0_2858]),c_0_2863])]),c_0_2861]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU406+4 : TPTP v8.1.0. Released v3.4.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n005.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 : Mon Jun 20 06:01:50 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected SinE mode:
% 2.74/2.96 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.74/2.96 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 2.74/2.96 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 2.74/2.96 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 17.28/7.58 # ENIGMATIC: Solved by autoschedule-lgb:
% 17.28/7.58 # No SInE strategy applied
% 17.28/7.58 # Trying AutoSched0 for 148 seconds
% 17.28/7.58 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_S0Y
% 17.28/7.58 # and selection function SelectMaxLComplexAvoidPosPred.
% 17.28/7.58 #
% 17.28/7.58 # Preprocessing time : 0.051 s
% 17.28/7.58
% 17.28/7.58 # Proof found!
% 17.28/7.58 # SZS status Theorem
% 17.28/7.58 # SZS output start CNFRefutation
% See solution above
% 17.28/7.58 # Training examples: 0 positive, 0 negative
% 17.28/7.58
% 17.28/7.58 # -------------------------------------------------
% 17.28/7.58 # User time : 0.698 s
% 17.28/7.58 # System time : 0.037 s
% 17.28/7.58 # Total time : 0.735 s
% 17.28/7.58 # Maximum resident set size: 7128 pages
% 17.28/7.58
%------------------------------------------------------------------------------