TSTP Solution File: SEU430+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU430+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:42:22 EDT 2022
% Result : Theorem 7.37s 2.34s
% Output : CNFRefutation 7.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 38 ( 11 unt; 6 nHn; 36 RR)
% Number of literals : 77 ( 29 equ; 44 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 49 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_14,plain,
( r2_hidden(X1,esk5_3(X2,X3,X1))
| X3 != k3_tarski(X2)
| ~ r2_hidden(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1c2h2djo/lgb.p',i_0_14) ).
cnf(i_0_13,plain,
( r2_hidden(esk5_3(X1,X2,X3),X1)
| X2 != k3_tarski(X1)
| ~ r2_hidden(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1c2h2djo/lgb.p',i_0_13) ).
cnf(i_0_37,plain,
( k5_setfam_1(X1,X2) = k3_tarski(X2)
| ~ m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1c2h2djo/lgb.p',i_0_37) ).
cnf(i_0_4,negated_conjecture,
m1_subset_1(esk2_0,k1_zfmisc_1(k1_zfmisc_1(esk1_0))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1c2h2djo/lgb.p',i_0_4) ).
cnf(i_0_46,plain,
( ~ v1_xboole_0(X1)
| ~ r2_hidden(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1c2h2djo/lgb.p',i_0_46) ).
cnf(i_0_1,negated_conjecture,
( X1 = k1_xboole_0
| k5_setfam_1(esk1_0,esk2_0) = k1_xboole_0
| ~ r2_hidden(X1,esk2_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1c2h2djo/lgb.p',i_0_1) ).
cnf(i_0_7,plain,
( X1 = k1_xboole_0
| r2_hidden(esk4_1(X1),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1c2h2djo/lgb.p',i_0_7) ).
cnf(i_0_26,plain,
v1_xboole_0(k1_xboole_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1c2h2djo/lgb.p',i_0_26) ).
cnf(i_0_12,plain,
( r2_hidden(X1,X2)
| X2 != k3_tarski(X3)
| ~ r2_hidden(X4,X3)
| ~ r2_hidden(X1,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1c2h2djo/lgb.p',i_0_12) ).
cnf(i_0_3,negated_conjecture,
( r2_hidden(esk3_0,esk2_0)
| k5_setfam_1(esk1_0,esk2_0) != k1_xboole_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1c2h2djo/lgb.p',i_0_3) ).
cnf(i_0_8,plain,
( X1 != k1_xboole_0
| ~ r2_hidden(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1c2h2djo/lgb.p',i_0_8) ).
cnf(i_0_2,negated_conjecture,
( esk3_0 != k1_xboole_0
| k5_setfam_1(esk1_0,esk2_0) != k1_xboole_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1c2h2djo/lgb.p',i_0_2) ).
cnf(c_0_59,plain,
( r2_hidden(X1,esk5_3(X2,X3,X1))
| X3 != k3_tarski(X2)
| ~ r2_hidden(X1,X3) ),
i_0_14 ).
cnf(c_0_60,plain,
( r2_hidden(esk5_3(X1,X2,X3),X1)
| X2 != k3_tarski(X1)
| ~ r2_hidden(X3,X2) ),
i_0_13 ).
cnf(c_0_61,plain,
( k5_setfam_1(X1,X2) = k3_tarski(X2)
| ~ m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1))) ),
i_0_37 ).
cnf(c_0_62,negated_conjecture,
m1_subset_1(esk2_0,k1_zfmisc_1(k1_zfmisc_1(esk1_0))),
i_0_4 ).
cnf(c_0_63,plain,
( ~ v1_xboole_0(X1)
| ~ r2_hidden(X2,X1) ),
i_0_46 ).
cnf(c_0_64,plain,
( r2_hidden(X1,esk5_3(X2,k3_tarski(X2),X1))
| ~ r2_hidden(X1,k3_tarski(X2)) ),
inference(er,[status(thm)],[c_0_59]) ).
cnf(c_0_65,negated_conjecture,
( X1 = k1_xboole_0
| k5_setfam_1(esk1_0,esk2_0) = k1_xboole_0
| ~ r2_hidden(X1,esk2_0) ),
i_0_1 ).
cnf(c_0_66,plain,
( r2_hidden(esk5_3(X1,k3_tarski(X1),X2),X1)
| ~ r2_hidden(X2,k3_tarski(X1)) ),
inference(er,[status(thm)],[c_0_60]) ).
cnf(c_0_67,negated_conjecture,
k3_tarski(esk2_0) = k5_setfam_1(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_68,plain,
( ~ v1_xboole_0(esk5_3(X1,k3_tarski(X1),X2))
| ~ r2_hidden(X2,k3_tarski(X1)) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_69,negated_conjecture,
( esk5_3(esk2_0,k5_setfam_1(esk1_0,esk2_0),X1) = k1_xboole_0
| k5_setfam_1(esk1_0,esk2_0) = k1_xboole_0
| ~ r2_hidden(X1,k5_setfam_1(esk1_0,esk2_0)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]),c_0_67]) ).
cnf(c_0_70,plain,
( X1 = k1_xboole_0
| r2_hidden(esk4_1(X1),X1) ),
i_0_7 ).
cnf(c_0_71,negated_conjecture,
( ~ v1_xboole_0(esk5_3(esk2_0,k5_setfam_1(esk1_0,esk2_0),X1))
| ~ r2_hidden(X1,k5_setfam_1(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_68,c_0_67]) ).
cnf(c_0_72,plain,
( esk5_3(esk2_0,k5_setfam_1(esk1_0,esk2_0),esk4_1(k5_setfam_1(esk1_0,esk2_0))) = k1_xboole_0
| k5_setfam_1(esk1_0,esk2_0) = k1_xboole_0 ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_73,plain,
v1_xboole_0(k1_xboole_0),
i_0_26 ).
cnf(c_0_74,plain,
( r2_hidden(X1,X2)
| X2 != k3_tarski(X3)
| ~ r2_hidden(X4,X3)
| ~ r2_hidden(X1,X4) ),
i_0_12 ).
cnf(c_0_75,negated_conjecture,
( r2_hidden(esk3_0,esk2_0)
| k5_setfam_1(esk1_0,esk2_0) != k1_xboole_0 ),
i_0_3 ).
cnf(c_0_76,negated_conjecture,
k5_setfam_1(esk1_0,esk2_0) = k1_xboole_0,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_73])]),c_0_70]) ).
cnf(c_0_77,plain,
( X1 != k1_xboole_0
| ~ r2_hidden(X2,X1) ),
i_0_8 ).
cnf(c_0_78,plain,
( r2_hidden(X1,k3_tarski(X2))
| ~ r2_hidden(X3,X2)
| ~ r2_hidden(X1,X3) ),
inference(er,[status(thm)],[c_0_74]) ).
cnf(c_0_79,negated_conjecture,
r2_hidden(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_76])]) ).
cnf(c_0_80,plain,
~ r2_hidden(X1,k1_xboole_0),
inference(er,[status(thm)],[c_0_77]) ).
cnf(c_0_81,negated_conjecture,
( esk3_0 != k1_xboole_0
| k5_setfam_1(esk1_0,esk2_0) != k1_xboole_0 ),
i_0_2 ).
cnf(c_0_82,plain,
~ r2_hidden(X1,esk3_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_67]),c_0_76]),c_0_80]) ).
cnf(c_0_83,negated_conjecture,
esk3_0 != k1_xboole_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_76])]) ).
cnf(c_0_84,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_70]),c_0_83]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU430+1 : TPTP v8.1.0. Released v3.4.0.
% 0.06/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n022.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 20 12:52:33 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.37/2.34 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.37/2.34 # No SInE strategy applied
% 7.37/2.34 # Trying AutoSched0 for 150 seconds
% 7.37/2.34 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
% 7.37/2.34 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.37/2.34 #
% 7.37/2.34 # Preprocessing time : 0.023 s
% 7.37/2.34 # Presaturation interreduction done
% 7.37/2.34
% 7.37/2.34 # Proof found!
% 7.37/2.34 # SZS status Theorem
% 7.37/2.34 # SZS output start CNFRefutation
% See solution above
% 7.37/2.34 # Training examples: 0 positive, 0 negative
% 7.37/2.34
% 7.37/2.34 # -------------------------------------------------
% 7.37/2.34 # User time : 0.044 s
% 7.37/2.34 # System time : 0.007 s
% 7.37/2.34 # Total time : 0.051 s
% 7.37/2.34 # Maximum resident set size: 7124 pages
% 7.37/2.34
%------------------------------------------------------------------------------