TSTP Solution File: SEU429+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU429+1 : 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:42:21 EDT 2022
% Result : Theorem 7.46s 2.35s
% Output : CNFRefutation 7.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 12 ( 9 unt; 2 nHn; 12 RR)
% Number of literals : 19 ( 0 equ; 9 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-4 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_62,plain,
( v1_xboole_0(X1)
| m1_subset_1(a_4_1_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2)))
| ~ m2_relset_1(X4,X1,X2)
| ~ m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(X1))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p3lbn4wg/lgb.p',i_0_62) ).
cnf(i_0_3,negated_conjecture,
m1_subset_1(esk3_0,k1_zfmisc_1(k1_zfmisc_1(esk1_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p3lbn4wg/lgb.p',i_0_3) ).
cnf(i_0_4,negated_conjecture,
~ v1_xboole_0(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p3lbn4wg/lgb.p',i_0_4) ).
cnf(i_0_2,negated_conjecture,
m2_relset_1(esk4_0,esk1_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p3lbn4wg/lgb.p',i_0_2) ).
cnf(i_0_1,negated_conjecture,
~ m1_subset_1(a_4_1_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),k1_zfmisc_1(k1_zfmisc_1(esk2_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p3lbn4wg/lgb.p',i_0_1) ).
cnf(c_0_68,plain,
( v1_xboole_0(X1)
| m1_subset_1(a_4_1_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2)))
| ~ m2_relset_1(X4,X1,X2)
| ~ m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(X1))) ),
i_0_62 ).
cnf(c_0_69,negated_conjecture,
m1_subset_1(esk3_0,k1_zfmisc_1(k1_zfmisc_1(esk1_0))),
i_0_3 ).
cnf(c_0_70,negated_conjecture,
~ v1_xboole_0(esk1_0),
i_0_4 ).
cnf(c_0_71,negated_conjecture,
( m1_subset_1(a_4_1_relset_2(esk1_0,X1,esk3_0,X2),k1_zfmisc_1(k1_zfmisc_1(X1)))
| ~ m2_relset_1(X2,esk1_0,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70]) ).
cnf(c_0_72,negated_conjecture,
m2_relset_1(esk4_0,esk1_0,esk2_0),
i_0_2 ).
cnf(c_0_73,negated_conjecture,
~ m1_subset_1(a_4_1_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),k1_zfmisc_1(k1_zfmisc_1(esk2_0))),
i_0_1 ).
cnf(c_0_74,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_73]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU429+1 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n021.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Mon Jun 20 10:24:50 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.46/2.35 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.46/2.35 # No SInE strategy applied
% 7.46/2.35 # Trying AutoSched0 for 150 seconds
% 7.46/2.35 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S02CA
% 7.46/2.35 # and selection function SelectAntiRROptimalLit.
% 7.46/2.35 #
% 7.46/2.35 # Preprocessing time : 0.023 s
% 7.46/2.35 # Presaturation interreduction done
% 7.46/2.35
% 7.46/2.35 # Proof found!
% 7.46/2.35 # SZS status Theorem
% 7.46/2.35 # SZS output start CNFRefutation
% See solution above
% 7.46/2.35 # Training examples: 0 positive, 0 negative
% 7.46/2.35
% 7.46/2.35 # -------------------------------------------------
% 7.46/2.35 # User time : 0.026 s
% 7.46/2.35 # System time : 0.003 s
% 7.46/2.35 # Total time : 0.029 s
% 7.46/2.35 # Maximum resident set size: 7124 pages
% 7.46/2.35
%------------------------------------------------------------------------------