TSTP Solution File: SEU449+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU449+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:43 EDT 2022
% Result : Theorem 7.86s 2.29s
% Output : CNFRefutation 7.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 31 ( 10 unt; 0 nHn; 29 RR)
% Number of literals : 68 ( 0 equ; 46 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-4 aty)
% Number of variables : 52 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_75,plain,
( r1_tarski(X1,k8_relset_2(X2,X3,X4,X5))
| ~ m2_relset_1(X5,X2,X3)
| ~ m1_subset_1(X1,k1_zfmisc_1(X3))
| ~ m1_subset_1(X4,k1_zfmisc_1(X2))
| ~ r1_tarski(X4,k8_relset_2(X3,X2,X1,k6_relset_1(X2,X3,X5))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mya_n5zr/input.p',i_0_75) ).
cnf(i_0_59,plain,
r1_tarski(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mya_n5zr/input.p',i_0_59) ).
cnf(i_0_1,negated_conjecture,
( ~ r1_tarski(esk3_0,k8_relset_2(esk2_0,esk1_0,k8_relset_2(esk1_0,esk2_0,esk3_0,esk5_0),k6_relset_1(esk1_0,esk2_0,esk5_0)))
| ~ r1_tarski(esk4_0,k8_relset_2(esk1_0,esk2_0,k8_relset_2(esk2_0,esk1_0,esk4_0,k6_relset_1(esk1_0,esk2_0,esk5_0)),esk5_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mya_n5zr/input.p',i_0_1) ).
cnf(i_0_2,negated_conjecture,
m2_relset_1(esk5_0,esk1_0,esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mya_n5zr/input.p',i_0_2) ).
cnf(i_0_3,negated_conjecture,
m1_subset_1(esk4_0,k1_zfmisc_1(esk2_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mya_n5zr/input.p',i_0_3) ).
cnf(i_0_74,plain,
( r1_tarski(X1,k8_relset_2(X2,X3,X4,k6_relset_1(X3,X2,X5)))
| ~ m2_relset_1(X5,X3,X2)
| ~ m1_subset_1(X1,k1_zfmisc_1(X3))
| ~ m1_subset_1(X4,k1_zfmisc_1(X2))
| ~ r1_tarski(X4,k8_relset_2(X3,X2,X1,X5)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mya_n5zr/input.p',i_0_74) ).
cnf(i_0_4,negated_conjecture,
m1_subset_1(esk3_0,k1_zfmisc_1(esk1_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mya_n5zr/input.p',i_0_4) ).
cnf(i_0_68,plain,
( m1_subset_1(k8_relset_2(X1,X2,X3,X4),k1_zfmisc_1(X2))
| ~ m1_subset_1(X3,k1_zfmisc_1(X1))
| ~ m1_subset_1(X4,k1_zfmisc_1(k2_zfmisc_1(X1,X2))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mya_n5zr/input.p',i_0_68) ).
cnf(i_0_70,plain,
( m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3)))
| ~ m2_relset_1(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mya_n5zr/input.p',i_0_70) ).
cnf(i_0_67,plain,
( m2_relset_1(k6_relset_1(X1,X2,X3),X2,X1)
| ~ m1_relset_1(X3,X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mya_n5zr/input.p',i_0_67) ).
cnf(i_0_65,plain,
( m1_relset_1(X1,X2,X3)
| ~ m2_relset_1(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mya_n5zr/input.p',i_0_65) ).
cnf(c_0_87,plain,
( r1_tarski(X1,k8_relset_2(X2,X3,X4,X5))
| ~ m2_relset_1(X5,X2,X3)
| ~ m1_subset_1(X1,k1_zfmisc_1(X3))
| ~ m1_subset_1(X4,k1_zfmisc_1(X2))
| ~ r1_tarski(X4,k8_relset_2(X3,X2,X1,k6_relset_1(X2,X3,X5))) ),
i_0_75 ).
cnf(c_0_88,plain,
r1_tarski(X1,X1),
i_0_59 ).
cnf(c_0_89,negated_conjecture,
( ~ r1_tarski(esk3_0,k8_relset_2(esk2_0,esk1_0,k8_relset_2(esk1_0,esk2_0,esk3_0,esk5_0),k6_relset_1(esk1_0,esk2_0,esk5_0)))
| ~ r1_tarski(esk4_0,k8_relset_2(esk1_0,esk2_0,k8_relset_2(esk2_0,esk1_0,esk4_0,k6_relset_1(esk1_0,esk2_0,esk5_0)),esk5_0)) ),
i_0_1 ).
cnf(c_0_90,plain,
( r1_tarski(X1,k8_relset_2(X2,X3,k8_relset_2(X3,X2,X1,k6_relset_1(X2,X3,X4)),X4))
| ~ m2_relset_1(X4,X2,X3)
| ~ m1_subset_1(k8_relset_2(X3,X2,X1,k6_relset_1(X2,X3,X4)),k1_zfmisc_1(X2))
| ~ m1_subset_1(X1,k1_zfmisc_1(X3)) ),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_91,negated_conjecture,
m2_relset_1(esk5_0,esk1_0,esk2_0),
i_0_2 ).
cnf(c_0_92,negated_conjecture,
m1_subset_1(esk4_0,k1_zfmisc_1(esk2_0)),
i_0_3 ).
cnf(c_0_93,negated_conjecture,
( ~ m1_subset_1(k8_relset_2(esk2_0,esk1_0,esk4_0,k6_relset_1(esk1_0,esk2_0,esk5_0)),k1_zfmisc_1(esk1_0))
| ~ r1_tarski(esk3_0,k8_relset_2(esk2_0,esk1_0,k8_relset_2(esk1_0,esk2_0,esk3_0,esk5_0),k6_relset_1(esk1_0,esk2_0,esk5_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_91]),c_0_92])]) ).
cnf(c_0_94,plain,
( r1_tarski(X1,k8_relset_2(X2,X3,X4,k6_relset_1(X3,X2,X5)))
| ~ m2_relset_1(X5,X3,X2)
| ~ m1_subset_1(X1,k1_zfmisc_1(X3))
| ~ m1_subset_1(X4,k1_zfmisc_1(X2))
| ~ r1_tarski(X4,k8_relset_2(X3,X2,X1,X5)) ),
i_0_74 ).
cnf(c_0_95,negated_conjecture,
m1_subset_1(esk3_0,k1_zfmisc_1(esk1_0)),
i_0_4 ).
cnf(c_0_96,plain,
( ~ m1_subset_1(k8_relset_2(esk2_0,esk1_0,esk4_0,k6_relset_1(esk1_0,esk2_0,esk5_0)),k1_zfmisc_1(esk1_0))
| ~ m1_subset_1(k8_relset_2(esk1_0,esk2_0,esk3_0,esk5_0),k1_zfmisc_1(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_91]),c_0_95]),c_0_88])]) ).
cnf(c_0_97,plain,
( m1_subset_1(k8_relset_2(X1,X2,X3,X4),k1_zfmisc_1(X2))
| ~ m1_subset_1(X3,k1_zfmisc_1(X1))
| ~ m1_subset_1(X4,k1_zfmisc_1(k2_zfmisc_1(X1,X2))) ),
i_0_68 ).
cnf(c_0_98,plain,
( ~ m1_subset_1(k6_relset_1(esk1_0,esk2_0,esk5_0),k1_zfmisc_1(k2_zfmisc_1(esk2_0,esk1_0)))
| ~ m1_subset_1(k8_relset_2(esk1_0,esk2_0,esk3_0,esk5_0),k1_zfmisc_1(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_92])]) ).
cnf(c_0_99,plain,
( m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3)))
| ~ m2_relset_1(X1,X2,X3) ),
i_0_70 ).
cnf(c_0_100,plain,
( ~ m2_relset_1(k6_relset_1(esk1_0,esk2_0,esk5_0),esk2_0,esk1_0)
| ~ m1_subset_1(k8_relset_2(esk1_0,esk2_0,esk3_0,esk5_0),k1_zfmisc_1(esk2_0)) ),
inference(spm,[status(thm)],[c_0_98,c_0_99]) ).
cnf(c_0_101,plain,
( m2_relset_1(k6_relset_1(X1,X2,X3),X2,X1)
| ~ m1_relset_1(X3,X1,X2) ),
i_0_67 ).
cnf(c_0_102,plain,
( ~ m1_relset_1(esk5_0,esk1_0,esk2_0)
| ~ m1_subset_1(k8_relset_2(esk1_0,esk2_0,esk3_0,esk5_0),k1_zfmisc_1(esk2_0)) ),
inference(spm,[status(thm)],[c_0_100,c_0_101]) ).
cnf(c_0_103,plain,
( ~ m1_relset_1(esk5_0,esk1_0,esk2_0)
| ~ m1_subset_1(esk5_0,k1_zfmisc_1(k2_zfmisc_1(esk1_0,esk2_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_97]),c_0_95])]) ).
cnf(c_0_104,plain,
( m1_relset_1(X1,X2,X3)
| ~ m2_relset_1(X1,X2,X3) ),
i_0_65 ).
cnf(c_0_105,plain,
~ m1_subset_1(esk5_0,k1_zfmisc_1(k2_zfmisc_1(esk1_0,esk2_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_104]),c_0_91])]) ).
cnf(c_0_106,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_99]),c_0_91])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU449+1 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n007.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 20 03:45:31 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 7.86/2.29 # ENIGMATIC: Solved by autoschedule:
% 7.86/2.29 # No SInE strategy applied
% 7.86/2.29 # Trying AutoSched0 for 150 seconds
% 7.86/2.29 # AutoSched0-Mode selected heuristic G_E___300_C18_F1_URBAN_S0Y
% 7.86/2.29 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.86/2.29 #
% 7.86/2.29 # Preprocessing time : 0.049 s
% 7.86/2.29
% 7.86/2.29 # Proof found!
% 7.86/2.29 # SZS status Theorem
% 7.86/2.29 # SZS output start CNFRefutation
% See solution above
% 7.86/2.29 # Training examples: 0 positive, 0 negative
% 7.86/2.29
% 7.86/2.29 # -------------------------------------------------
% 7.86/2.29 # User time : 0.057 s
% 7.86/2.29 # System time : 0.008 s
% 7.86/2.29 # Total time : 0.065 s
% 7.86/2.29 # Maximum resident set size: 7124 pages
% 7.86/2.29
%------------------------------------------------------------------------------