TSTP Solution File: GRP642+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GRP642+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n032.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 : Sat Jul 16 08:39:48 EDT 2022
% Result : Theorem 4.44s 2.11s
% Output : CNFRefutation 4.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 16
% Syntax : Number of clauses : 38 ( 21 unt; 11 nHn; 38 RR)
% Number of literals : 110 ( 8 equ; 64 neg)
% Maximal clause size : 11 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_23,plain,
( k1_funct_1(X1,X2) = u1_struct_0(X2)
| v3_struct_0(X3)
| X1 != k1_latsubgr(X3)
| ~ v3_group_1(X3)
| ~ v4_group_1(X3)
| ~ l1_group_1(X3)
| ~ v1_group_1(X2)
| ~ v1_funct_1(X1)
| ~ m1_group_2(X2,X3)
| ~ v1_funct_2(X1,k1_group_3(X3),k1_zfmisc_1(u1_struct_0(X3)))
| ~ m2_relset_1(X1,k1_group_3(X3),k1_zfmisc_1(u1_struct_0(X3))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q8sttllv/input.p',i_0_23) ).
cnf(i_0_30,plain,
( v3_struct_0(X1)
| v1_funct_1(k1_latsubgr(X1))
| ~ v3_group_1(X1)
| ~ v4_group_1(X1)
| ~ l1_group_1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q8sttllv/input.p',i_0_30) ).
cnf(i_0_29,plain,
( v3_struct_0(X1)
| v1_funct_2(k1_latsubgr(X1),k1_group_3(X1),k1_zfmisc_1(u1_struct_0(X1)))
| ~ v3_group_1(X1)
| ~ v4_group_1(X1)
| ~ l1_group_1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q8sttllv/input.p',i_0_29) ).
cnf(i_0_28,plain,
( v3_struct_0(X1)
| m2_relset_1(k1_latsubgr(X1),k1_group_3(X1),k1_zfmisc_1(u1_struct_0(X1)))
| ~ v3_group_1(X1)
| ~ v4_group_1(X1)
| ~ l1_group_1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q8sttllv/input.p',i_0_28) ).
cnf(i_0_36,plain,
( v3_struct_0(X1)
| l1_group_1(X2)
| ~ v3_group_1(X1)
| ~ l1_group_1(X1)
| ~ m1_group_2(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q8sttllv/input.p',i_0_36) ).
cnf(i_0_2,negated_conjecture,
m1_group_2(esk2_0,esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q8sttllv/input.p',i_0_2) ).
cnf(i_0_4,negated_conjecture,
l1_group_1(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q8sttllv/input.p',i_0_4) ).
cnf(i_0_6,negated_conjecture,
v3_group_1(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q8sttllv/input.p',i_0_6) ).
cnf(i_0_7,negated_conjecture,
~ v3_struct_0(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q8sttllv/input.p',i_0_7) ).
cnf(i_0_1,negated_conjecture,
k1_funct_1(k1_latsubgr(esk1_0),esk2_0) = k1_xboole_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q8sttllv/input.p',i_0_1) ).
cnf(i_0_3,negated_conjecture,
v1_group_1(esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q8sttllv/input.p',i_0_3) ).
cnf(i_0_5,negated_conjecture,
v4_group_1(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q8sttllv/input.p',i_0_5) ).
cnf(i_0_34,plain,
( l1_struct_0(X1)
| ~ l1_group_1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q8sttllv/input.p',i_0_34) ).
cnf(i_0_38,plain,
( v3_struct_0(X1)
| ~ v3_struct_0(X2)
| ~ v3_group_1(X1)
| ~ l1_group_1(X1)
| ~ m1_group_2(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q8sttllv/input.p',i_0_38) ).
cnf(i_0_53,plain,
( v3_struct_0(X1)
| ~ l1_struct_0(X1)
| ~ v1_xboole_0(u1_struct_0(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q8sttllv/input.p',i_0_53) ).
cnf(i_0_55,plain,
v1_xboole_0(k1_xboole_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-q8sttllv/input.p',i_0_55) ).
cnf(c_0_72,plain,
( k1_funct_1(X1,X2) = u1_struct_0(X2)
| v3_struct_0(X3)
| X1 != k1_latsubgr(X3)
| ~ v3_group_1(X3)
| ~ v4_group_1(X3)
| ~ l1_group_1(X3)
| ~ v1_group_1(X2)
| ~ v1_funct_1(X1)
| ~ m1_group_2(X2,X3)
| ~ v1_funct_2(X1,k1_group_3(X3),k1_zfmisc_1(u1_struct_0(X3)))
| ~ m2_relset_1(X1,k1_group_3(X3),k1_zfmisc_1(u1_struct_0(X3))) ),
i_0_23 ).
cnf(c_0_73,plain,
( v3_struct_0(X1)
| v1_funct_1(k1_latsubgr(X1))
| ~ v3_group_1(X1)
| ~ v4_group_1(X1)
| ~ l1_group_1(X1) ),
i_0_30 ).
cnf(c_0_74,plain,
( v3_struct_0(X1)
| v1_funct_2(k1_latsubgr(X1),k1_group_3(X1),k1_zfmisc_1(u1_struct_0(X1)))
| ~ v3_group_1(X1)
| ~ v4_group_1(X1)
| ~ l1_group_1(X1) ),
i_0_29 ).
cnf(c_0_75,plain,
( v3_struct_0(X1)
| m2_relset_1(k1_latsubgr(X1),k1_group_3(X1),k1_zfmisc_1(u1_struct_0(X1)))
| ~ v3_group_1(X1)
| ~ v4_group_1(X1)
| ~ l1_group_1(X1) ),
i_0_28 ).
cnf(c_0_76,plain,
( v3_struct_0(X1)
| l1_group_1(X2)
| ~ v3_group_1(X1)
| ~ l1_group_1(X1)
| ~ m1_group_2(X2,X1) ),
i_0_36 ).
cnf(c_0_77,negated_conjecture,
m1_group_2(esk2_0,esk1_0),
i_0_2 ).
cnf(c_0_78,negated_conjecture,
l1_group_1(esk1_0),
i_0_4 ).
cnf(c_0_79,negated_conjecture,
v3_group_1(esk1_0),
i_0_6 ).
cnf(c_0_80,negated_conjecture,
~ v3_struct_0(esk1_0),
i_0_7 ).
cnf(c_0_81,plain,
( k1_funct_1(k1_latsubgr(X1),X2) = u1_struct_0(X2)
| v3_struct_0(X1)
| ~ m1_group_2(X2,X1)
| ~ v1_group_1(X2)
| ~ l1_group_1(X1)
| ~ v4_group_1(X1)
| ~ v3_group_1(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_72]),c_0_73]),c_0_74]),c_0_75]) ).
cnf(c_0_82,negated_conjecture,
k1_funct_1(k1_latsubgr(esk1_0),esk2_0) = k1_xboole_0,
i_0_1 ).
cnf(c_0_83,negated_conjecture,
v1_group_1(esk2_0),
i_0_3 ).
cnf(c_0_84,negated_conjecture,
v4_group_1(esk1_0),
i_0_5 ).
cnf(c_0_85,plain,
( l1_struct_0(X1)
| ~ l1_group_1(X1) ),
i_0_34 ).
cnf(c_0_86,negated_conjecture,
l1_group_1(esk2_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_78]),c_0_79])]),c_0_80]) ).
cnf(c_0_87,plain,
( v3_struct_0(X1)
| ~ v3_struct_0(X2)
| ~ v3_group_1(X1)
| ~ l1_group_1(X1)
| ~ m1_group_2(X2,X1) ),
i_0_38 ).
cnf(c_0_88,plain,
( v3_struct_0(X1)
| ~ l1_struct_0(X1)
| ~ v1_xboole_0(u1_struct_0(X1)) ),
i_0_53 ).
cnf(c_0_89,negated_conjecture,
u1_struct_0(esk2_0) = k1_xboole_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_77]),c_0_82]),c_0_83]),c_0_78]),c_0_84]),c_0_79])]),c_0_80]) ).
cnf(c_0_90,plain,
l1_struct_0(esk2_0),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_91,plain,
v1_xboole_0(k1_xboole_0),
i_0_55 ).
cnf(c_0_92,negated_conjecture,
~ v3_struct_0(esk2_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_77]),c_0_78]),c_0_79])]),c_0_80]) ).
cnf(c_0_93,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_90]),c_0_91])]),c_0_92]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : GRP642+1 : TPTP v8.1.0. Released v3.4.0.
% 0.00/0.10 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Mon Jun 13 16:20:28 EDT 2022
% 0.09/0.29 % CPUTime :
% 0.14/0.38 # ENIGMATIC: Selected complete mode:
% 4.44/2.11 # ENIGMATIC: Solved by autoschedule:
% 4.44/2.11 # No SInE strategy applied
% 4.44/2.11 # Trying AutoSched0 for 150 seconds
% 4.44/2.11 # AutoSched0-Mode selected heuristic G_E___200_B02_F1_SE_CS_SP_PI_S0S
% 4.44/2.11 # and selection function SelectComplexG.
% 4.44/2.11 #
% 4.44/2.11 # Preprocessing time : 0.014 s
% 4.44/2.11
% 4.44/2.11 # Proof found!
% 4.44/2.11 # SZS status Theorem
% 4.44/2.11 # SZS output start CNFRefutation
% See solution above
% 4.44/2.11 # Training examples: 0 positive, 0 negative
% 4.44/2.11
% 4.44/2.11 # -------------------------------------------------
% 4.44/2.11 # User time : 0.018 s
% 4.44/2.11 # System time : 0.005 s
% 4.44/2.11 # Total time : 0.023 s
% 4.44/2.11 # Maximum resident set size: 7120 pages
% 4.44/2.11
%------------------------------------------------------------------------------