TSTP Solution File: SEU406+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU406+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n022.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 4.44s 2.28s
% Output : CNFRefutation 4.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 25 ( 13 unt; 4 nHn; 21 RR)
% Number of literals : 43 ( 6 equ; 24 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_14,plain,
( r2_hidden(X1,X2)
| r2_hidden(X1,X3)
| X4 != k2_xboole_0(X3,X2)
| ~ r2_hidden(X1,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g0jjfv_8/input.p',i_0_14) ).
cnf(i_0_29,plain,
k2_xboole_0(X1,k4_xboole_0(X2,X1)) = k2_xboole_0(X1,X2),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g0jjfv_8/input.p',i_0_29) ).
cnf(i_0_5,negated_conjecture,
r2_hidden(esk2_0,k2_xboole_0(esk3_0,esk4_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g0jjfv_8/input.p',i_0_5) ).
cnf(i_0_8,plain,
k2_xboole_0(X1,X2) = k2_xboole_0(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g0jjfv_8/input.p',i_0_8) ).
cnf(i_0_4,negated_conjecture,
( ~ r2_hidden(esk1_0,k4_xboole_0(esk3_0,esk4_0))
| ~ r2_hidden(esk2_0,k4_xboole_0(esk3_0,esk4_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g0jjfv_8/input.p',i_0_4) ).
cnf(i_0_2,negated_conjecture,
( ~ r2_hidden(esk2_0,esk4_0)
| ~ r2_hidden(esk1_0,k4_xboole_0(esk3_0,esk4_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g0jjfv_8/input.p',i_0_2) ).
cnf(i_0_6,negated_conjecture,
r2_hidden(esk1_0,k2_xboole_0(esk3_0,esk4_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g0jjfv_8/input.p',i_0_6) ).
cnf(i_0_1,negated_conjecture,
( ~ r2_hidden(esk1_0,esk4_0)
| ~ r2_hidden(esk2_0,k4_xboole_0(esk3_0,esk4_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g0jjfv_8/input.p',i_0_1) ).
cnf(i_0_3,negated_conjecture,
( ~ r2_hidden(esk1_0,esk4_0)
| ~ r2_hidden(esk2_0,esk4_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-g0jjfv_8/input.p',i_0_3) ).
cnf(c_0_39,plain,
( r2_hidden(X1,X2)
| r2_hidden(X1,X3)
| X4 != k2_xboole_0(X3,X2)
| ~ r2_hidden(X1,X4) ),
i_0_14 ).
cnf(c_0_40,plain,
( r2_hidden(X1,X2)
| r2_hidden(X1,X3)
| ~ r2_hidden(X1,k2_xboole_0(X2,X3)) ),
inference(er,[status(thm)],[c_0_39]) ).
cnf(c_0_41,plain,
k2_xboole_0(X1,k4_xboole_0(X2,X1)) = k2_xboole_0(X1,X2),
i_0_29 ).
cnf(c_0_42,negated_conjecture,
r2_hidden(esk2_0,k2_xboole_0(esk3_0,esk4_0)),
i_0_5 ).
cnf(c_0_43,plain,
k2_xboole_0(X1,X2) = k2_xboole_0(X2,X1),
i_0_8 ).
cnf(c_0_44,negated_conjecture,
( ~ r2_hidden(esk1_0,k4_xboole_0(esk3_0,esk4_0))
| ~ r2_hidden(esk2_0,k4_xboole_0(esk3_0,esk4_0)) ),
i_0_4 ).
cnf(c_0_45,plain,
( r2_hidden(X1,k4_xboole_0(X2,X3))
| r2_hidden(X1,X3)
| ~ r2_hidden(X1,k2_xboole_0(X3,X2)) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,negated_conjecture,
r2_hidden(esk2_0,k2_xboole_0(esk4_0,esk3_0)),
inference(rw,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,negated_conjecture,
( ~ r2_hidden(esk2_0,esk4_0)
| ~ r2_hidden(esk1_0,k4_xboole_0(esk3_0,esk4_0)) ),
i_0_2 ).
cnf(c_0_48,negated_conjecture,
r2_hidden(esk1_0,k2_xboole_0(esk3_0,esk4_0)),
i_0_6 ).
cnf(c_0_49,negated_conjecture,
( ~ r2_hidden(esk1_0,esk4_0)
| ~ r2_hidden(esk2_0,k4_xboole_0(esk3_0,esk4_0)) ),
i_0_1 ).
cnf(c_0_50,negated_conjecture,
( ~ r2_hidden(esk1_0,esk4_0)
| ~ r2_hidden(esk2_0,esk4_0) ),
i_0_3 ).
cnf(c_0_51,negated_conjecture,
~ r2_hidden(esk1_0,k4_xboole_0(esk3_0,esk4_0)),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46])]),c_0_47]) ).
cnf(c_0_52,negated_conjecture,
r2_hidden(esk1_0,k2_xboole_0(esk4_0,esk3_0)),
inference(rw,[status(thm)],[c_0_48,c_0_43]) ).
cnf(c_0_53,negated_conjecture,
~ r2_hidden(esk1_0,esk4_0),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_45]),c_0_46])]),c_0_50]) ).
cnf(c_0_54,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_45]),c_0_52])]),c_0_53]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU406+1 : TPTP v8.1.0. Released v3.4.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n022.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 19 16:46:33 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 4.44/2.28 # ENIGMATIC: Solved by autoschedule:
% 4.44/2.28 # No SInE strategy applied
% 4.44/2.28 # Trying AutoSched0 for 150 seconds
% 4.44/2.28 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y
% 4.44/2.28 # and selection function SelectMaxLComplexAvoidPosPred.
% 4.44/2.28 #
% 4.44/2.28 # Preprocessing time : 0.012 s
% 4.44/2.28 # Presaturation interreduction done
% 4.44/2.28
% 4.44/2.28 # Proof found!
% 4.44/2.28 # SZS status Theorem
% 4.44/2.28 # SZS output start CNFRefutation
% See solution above
% 4.44/2.28 # Training examples: 0 positive, 0 negative
% 4.44/2.28
% 4.44/2.28 # -------------------------------------------------
% 4.44/2.28 # User time : 0.014 s
% 4.44/2.28 # System time : 0.008 s
% 4.44/2.28 # Total time : 0.022 s
% 4.44/2.28 # Maximum resident set size: 7116 pages
% 4.44/2.28
%------------------------------------------------------------------------------