TSTP Solution File: GRP012+5 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GRP012+5 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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:37:13 EDT 2022
% Result : Theorem 7.76s 2.26s
% Output : CNFRefutation 7.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 28 ( 17 unt; 0 nHn; 20 RR)
% Number of literals : 50 ( 0 equ; 25 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 50 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_8,negated_conjecture,
( product(X1,X2,X3)
| ~ product(X4,X2,X5)
| ~ product(X6,X5,X3)
| ~ product(X6,X4,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bf4i_wct/input.p',i_0_8) ).
cnf(i_0_4,negated_conjecture,
product(inverse(X1),X1,esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bf4i_wct/input.p',i_0_4) ).
cnf(i_0_9,negated_conjecture,
( product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X5,X2)
| ~ product(X1,X6,X4) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bf4i_wct/input.p',i_0_9) ).
cnf(i_0_2,negated_conjecture,
product(esk4_0,esk3_0,esk6_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bf4i_wct/input.p',i_0_2) ).
cnf(i_0_3,negated_conjecture,
product(inverse(esk3_0),inverse(esk4_0),esk5_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bf4i_wct/input.p',i_0_3) ).
cnf(i_0_6,negated_conjecture,
product(esk1_0,X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bf4i_wct/input.p',i_0_6) ).
cnf(i_0_7,negated_conjecture,
product(X1,esk1_0,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bf4i_wct/input.p',i_0_7) ).
cnf(i_0_5,negated_conjecture,
product(X1,inverse(X1),esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bf4i_wct/input.p',i_0_5) ).
cnf(i_0_1,negated_conjecture,
~ product(inverse(esk5_0),inverse(esk6_0),esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bf4i_wct/input.p',i_0_1) ).
cnf(c_0_19,negated_conjecture,
( product(X1,X2,X3)
| ~ product(X4,X2,X5)
| ~ product(X6,X5,X3)
| ~ product(X6,X4,X1) ),
i_0_8 ).
cnf(c_0_20,negated_conjecture,
product(inverse(X1),X1,esk1_0),
i_0_4 ).
cnf(c_0_21,negated_conjecture,
( product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X5,X2)
| ~ product(X1,X6,X4) ),
i_0_9 ).
cnf(c_0_22,negated_conjecture,
product(esk4_0,esk3_0,esk6_0),
i_0_2 ).
cnf(c_0_23,negated_conjecture,
( product(X1,X2,esk1_0)
| ~ product(inverse(X3),X4,X1)
| ~ product(X4,X2,X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
product(inverse(esk3_0),inverse(esk4_0),esk5_0),
i_0_3 ).
cnf(c_0_25,negated_conjecture,
( product(X1,esk6_0,X2)
| ~ product(X3,esk3_0,X2)
| ~ product(X1,esk4_0,X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
product(esk1_0,X1,X1),
i_0_6 ).
cnf(c_0_27,negated_conjecture,
product(X1,esk1_0,X1),
i_0_7 ).
cnf(c_0_28,negated_conjecture,
( product(esk5_0,X1,esk1_0)
| ~ product(inverse(esk4_0),X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,negated_conjecture,
( product(X1,esk6_0,esk3_0)
| ~ product(X1,esk4_0,esk1_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( product(X1,X2,X3)
| ~ product(X4,X2,esk1_0)
| ~ product(X3,X4,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
product(X1,inverse(X1),esk1_0),
i_0_5 ).
cnf(c_0_32,negated_conjecture,
product(esk5_0,esk6_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_20])]) ).
cnf(c_0_33,negated_conjecture,
~ product(inverse(esk5_0),inverse(esk6_0),esk1_0),
i_0_1 ).
cnf(c_0_34,negated_conjecture,
( product(X1,inverse(X2),X3)
| ~ product(X3,X2,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
( product(X1,esk6_0,X2)
| ~ product(X2,esk5_0,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
~ product(esk1_0,esk6_0,inverse(esk5_0)),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_20]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10 % Problem : GRP012+5 : TPTP v8.1.0. Released v3.1.0.
% 0.10/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.32 % Computer : n013.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 600
% 0.10/0.32 % DateTime : Tue Jun 14 13:42:01 EDT 2022
% 0.10/0.32 % CPUTime :
% 0.18/0.43 # ENIGMATIC: Selected complete mode:
% 7.76/2.26 # ENIGMATIC: Solved by autoschedule:
% 7.76/2.26 # No SInE strategy applied
% 7.76/2.26 # Trying AutoSched0 for 150 seconds
% 7.76/2.26 # AutoSched0-Mode selected heuristic G_E___103_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 7.76/2.26 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.76/2.26 #
% 7.76/2.26 # Preprocessing time : 0.023 s
% 7.76/2.26
% 7.76/2.26 # Proof found!
% 7.76/2.26 # SZS status Theorem
% 7.76/2.26 # SZS output start CNFRefutation
% See solution above
% 7.76/2.26 # Training examples: 0 positive, 0 negative
% 7.76/2.26
% 7.76/2.26 # -------------------------------------------------
% 7.76/2.26 # User time : 0.030 s
% 7.76/2.26 # System time : 0.005 s
% 7.76/2.26 # Total time : 0.035 s
% 7.76/2.26 # Maximum resident set size: 7120 pages
% 7.76/2.26
%------------------------------------------------------------------------------