TSTP Solution File: GRP710+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GRP710+1 : TPTP v8.1.0. Released v4.0.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:40:23 EDT 2022
% Result : Theorem 6.97s 2.14s
% Output : CNFRefutation 6.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of clauses : 34 ( 29 unt; 0 nHn; 7 RR)
% Number of literals : 39 ( 38 equ; 11 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 55 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
mult(X1,unit) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cbqpv0r9/input.p',i_0_1) ).
cnf(i_0_3,plain,
mult(mult(mult(X1,X2),X2),X3) = mult(X1,mult(X2,mult(X2,X3))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cbqpv0r9/input.p',i_0_3) ).
cnf(i_0_5,plain,
mult(i(X1),X1) = unit,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cbqpv0r9/input.p',i_0_5) ).
cnf(i_0_2,plain,
mult(unit,X1) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cbqpv0r9/input.p',i_0_2) ).
cnf(i_0_4,plain,
mult(X1,i(X1)) = unit,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cbqpv0r9/input.p',i_0_4) ).
cnf(i_0_6,negated_conjecture,
( mult(X1,esk4_0) != esk3_0
| mult(esk1_0,X2) != esk2_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cbqpv0r9/input.p',i_0_6) ).
cnf(c_0_13,plain,
mult(X1,unit) = X1,
i_0_1 ).
cnf(c_0_14,plain,
mult(mult(mult(X1,X2),X2),X3) = mult(X1,mult(X2,mult(X2,X3))),
i_0_3 ).
cnf(c_0_15,plain,
mult(mult(X1,X2),X2) = mult(X1,mult(X2,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_13]) ).
cnf(c_0_16,plain,
mult(i(X1),X1) = unit,
i_0_5 ).
cnf(c_0_17,plain,
mult(unit,X1) = X1,
i_0_2 ).
cnf(c_0_18,plain,
mult(mult(X1,mult(X2,X2)),X3) = mult(X1,mult(X2,mult(X2,X3))),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
mult(i(X1),mult(X1,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_20,plain,
mult(i(X1),mult(X1,mult(X1,X2))) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,plain,
mult(X1,i(X1)) = unit,
i_0_4 ).
cnf(c_0_22,plain,
mult(mult(X1,X1),X2) = mult(X1,mult(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_17]),c_0_17]) ).
cnf(c_0_23,plain,
mult(i(mult(X1,X1)),mult(X1,mult(X1,X2))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_16]),c_0_17]) ).
cnf(c_0_24,plain,
i(i(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_19]),c_0_16]),c_0_13]) ).
cnf(c_0_25,plain,
mult(X1,mult(i(X1),i(X1))) = i(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_21]),c_0_17]) ).
cnf(c_0_26,plain,
mult(X1,mult(X1,i(mult(X1,X1)))) = unit,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
mult(X1,mult(X1,mult(i(mult(X1,X1)),X2))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_23]),c_0_24]),c_0_22]) ).
cnf(c_0_28,plain,
mult(mult(X1,mult(X2,mult(X2,X3))),X3) = mult(X1,mult(X2,mult(X2,mult(X3,X3)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_18]),c_0_18]) ).
cnf(c_0_29,plain,
mult(i(X1),i(X1)) = i(mult(X1,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_25]),c_0_21]),c_0_13]) ).
cnf(c_0_30,plain,
mult(X1,i(mult(X1,X1))) = i(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_26]),c_0_13]) ).
cnf(c_0_31,plain,
mult(i(X1),mult(X1,X2)) = X2,
inference(spm,[status(thm)],[c_0_20,c_0_27]) ).
cnf(c_0_32,plain,
mult(mult(X1,X2),i(X2)) = X1,
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_28,c_0_21]),c_0_13]),c_0_29]),c_0_30]),c_0_21]),c_0_13]) ).
cnf(c_0_33,negated_conjecture,
( mult(X1,esk4_0) != esk3_0
| mult(esk1_0,X2) != esk2_0 ),
i_0_6 ).
cnf(c_0_34,plain,
mult(i(mult(X1,X2)),X1) = i(X2),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
( mult(esk1_0,X1) != esk2_0
| i(X2) != esk3_0 ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_36,plain,
mult(X1,mult(i(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_31,c_0_24]) ).
cnf(c_0_37,plain,
( i(X1) != esk3_0
| X2 != esk2_0 ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_38,plain,
( X1 != esk3_0
| X2 != esk2_0 ),
inference(spm,[status(thm)],[c_0_37,c_0_24]) ).
cnf(c_0_39,plain,
X1 != esk2_0,
inference(er,[status(thm)],[c_0_38]) ).
cnf(c_0_40,plain,
$false,
inference(er,[status(thm)],[c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : GRP710+1 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.10 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Mon Jun 13 20:10:58 EDT 2022
% 0.10/0.29 % CPUTime :
% 0.14/0.36 # ENIGMATIC: Selected complete mode:
% 6.97/2.14 # ENIGMATIC: Solved by autoschedule:
% 6.97/2.14 # No SInE strategy applied
% 6.97/2.14 # Trying AutoSched0 for 150 seconds
% 6.97/2.14 # AutoSched0-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S04AN
% 6.97/2.14 # and selection function SelectComplexExceptUniqMaxHorn.
% 6.97/2.14 #
% 6.97/2.14 # Preprocessing time : 0.013 s
% 6.97/2.14 # Presaturation interreduction done
% 6.97/2.14
% 6.97/2.14 # Proof found!
% 6.97/2.14 # SZS status Theorem
% 6.97/2.14 # SZS output start CNFRefutation
% See solution above
% 6.97/2.14 # Training examples: 0 positive, 0 negative
% 6.97/2.14
% 6.97/2.14 # -------------------------------------------------
% 6.97/2.14 # User time : 0.029 s
% 6.97/2.14 # System time : 0.005 s
% 6.97/2.14 # Total time : 0.033 s
% 6.97/2.14 # Maximum resident set size: 7120 pages
% 6.97/2.14
%------------------------------------------------------------------------------