TSTP Solution File: SEU444+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU444+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n008.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:37 EDT 2022
% Result : Theorem 7.78s 2.34s
% Output : CNFRefutation 7.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 5 unt; 0 nHn; 11 RR)
% Number of literals : 17 ( 10 equ; 9 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-4 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_57,plain,
( k10_relset_1(X1,X2,X3,X1) = k2_funct_5(X3)
| ~ m2_relset_1(X3,X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-j2e6lgrs/lgb.p',i_0_57) ).
cnf(i_0_2,negated_conjecture,
m2_relset_1(esk3_0,esk2_0,esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-j2e6lgrs/lgb.p',i_0_2) ).
cnf(i_0_1,negated_conjecture,
( k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),esk1_0) != k1_funct_5(esk3_0)
| k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),k10_relset_1(esk2_0,esk1_0,esk3_0,esk2_0)) != k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),k2_funct_5(esk3_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-j2e6lgrs/lgb.p',i_0_1) ).
cnf(i_0_58,plain,
( k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),X1) = k1_funct_5(X3)
| ~ m2_relset_1(X3,X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-j2e6lgrs/lgb.p',i_0_58) ).
cnf(c_0_63,plain,
( k10_relset_1(X1,X2,X3,X1) = k2_funct_5(X3)
| ~ m2_relset_1(X3,X1,X2) ),
i_0_57 ).
cnf(c_0_64,negated_conjecture,
m2_relset_1(esk3_0,esk2_0,esk1_0),
i_0_2 ).
cnf(c_0_65,negated_conjecture,
( k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),esk1_0) != k1_funct_5(esk3_0)
| k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),k10_relset_1(esk2_0,esk1_0,esk3_0,esk2_0)) != k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),k2_funct_5(esk3_0)) ),
i_0_1 ).
cnf(c_0_66,negated_conjecture,
k2_funct_5(esk3_0) = k10_relset_1(esk2_0,esk1_0,esk3_0,esk2_0),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_67,negated_conjecture,
k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),esk1_0) != k1_funct_5(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66])]) ).
cnf(c_0_68,plain,
( k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),X1) = k1_funct_5(X3)
| ~ m2_relset_1(X3,X2,X1) ),
i_0_58 ).
cnf(c_0_69,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_64])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU444+1 : TPTP v8.1.0. Released v3.4.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n008.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 10:52:24 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 7.78/2.34 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.78/2.34 # No SInE strategy applied
% 7.78/2.34 # Trying AutoSched0 for 150 seconds
% 7.78/2.34 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.78/2.34 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.78/2.34 #
% 7.78/2.34 # Preprocessing time : 0.023 s
% 7.78/2.34 # Presaturation interreduction done
% 7.78/2.34
% 7.78/2.34 # Proof found!
% 7.78/2.34 # SZS status Theorem
% 7.78/2.34 # SZS output start CNFRefutation
% See solution above
% 7.78/2.34 # Training examples: 0 positive, 0 negative
% 7.78/2.34
% 7.78/2.34 # -------------------------------------------------
% 7.78/2.34 # User time : 0.022 s
% 7.78/2.34 # System time : 0.007 s
% 7.78/2.34 # Total time : 0.029 s
% 7.78/2.34 # Maximum resident set size: 7120 pages
% 7.78/2.34
%------------------------------------------------------------------------------