TSTP Solution File: GRP700+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GRP700+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:19 EDT 2022
% Result : Theorem 8.74s 2.51s
% Output : CNFRefutation 8.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 20 ( 17 unt; 0 nHn; 4 RR)
% Number of literals : 23 ( 22 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
mult(mult(mult(X1,X2),X1),mult(X1,X3)) = mult(X1,mult(mult(mult(X2,X1),X1),X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hoiol41h/lgb.p',i_0_7) ).
cnf(i_0_5,plain,
mult(X1,unit) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hoiol41h/lgb.p',i_0_5) ).
cnf(i_0_4,plain,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hoiol41h/lgb.p',i_0_4) ).
cnf(i_0_3,plain,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hoiol41h/lgb.p',i_0_3) ).
cnf(i_0_6,plain,
mult(unit,X1) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hoiol41h/lgb.p',i_0_6) ).
cnf(i_0_9,negated_conjecture,
( mult(X1,esk1_0) != unit
| mult(esk1_0,X1) != unit ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hoiol41h/lgb.p',i_0_9) ).
cnf(c_0_16,plain,
mult(mult(mult(X1,X2),X1),mult(X1,X3)) = mult(X1,mult(mult(mult(X2,X1),X1),X3)),
i_0_7 ).
cnf(c_0_17,plain,
mult(X1,unit) = X1,
i_0_5 ).
cnf(c_0_18,plain,
rd(mult(X1,X2),X2) = X1,
i_0_4 ).
cnf(c_0_19,plain,
mult(mult(mult(X1,X2),X1),X1) = mult(X1,mult(mult(X2,X1),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_17]) ).
cnf(c_0_20,plain,
rd(mult(X1,mult(mult(X2,X1),X1)),X1) = mult(mult(X1,X2),X1),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,plain,
mult(rd(X1,X2),X2) = X1,
i_0_3 ).
cnf(c_0_22,plain,
mult(mult(X1,rd(X2,X1)),X1) = rd(mult(X1,mult(X2,X1)),X1),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
mult(unit,X1) = X1,
i_0_6 ).
cnf(c_0_24,negated_conjecture,
( mult(X1,esk1_0) != unit
| mult(esk1_0,X1) != unit ),
i_0_9 ).
cnf(c_0_25,plain,
rd(rd(mult(X1,mult(X2,X1)),X1),X1) = mult(X1,rd(X2,X1)),
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_26,plain,
rd(X1,X1) = unit,
inference(spm,[status(thm)],[c_0_18,c_0_23]) ).
cnf(c_0_27,plain,
( mult(esk1_0,rd(X1,esk1_0)) != unit
| X1 != unit ),
inference(spm,[status(thm)],[c_0_24,c_0_21]) ).
cnf(c_0_28,plain,
mult(X1,rd(unit,X1)) = unit,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_23]),c_0_18]),c_0_26]) ).
cnf(c_0_29,plain,
$false,
inference(spm,[status(thm)],[c_0_27,c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP700+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 14 03:47:51 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected complete mode:
% 8.74/2.51 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.74/2.51 # No SInE strategy applied
% 8.74/2.51 # Trying AutoSched0 for 150 seconds
% 8.74/2.51 # AutoSched0-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S04AN
% 8.74/2.51 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.74/2.51 #
% 8.74/2.51 # Preprocessing time : 0.014 s
% 8.74/2.51 # Presaturation interreduction done
% 8.74/2.51
% 8.74/2.51 # Proof found!
% 8.74/2.51 # SZS status Theorem
% 8.74/2.51 # SZS output start CNFRefutation
% See solution above
% 8.74/2.51 # Training examples: 0 positive, 0 negative
% 8.74/2.51
% 8.74/2.51 # -------------------------------------------------
% 8.74/2.51 # User time : 0.020 s
% 8.74/2.51 # System time : 0.007 s
% 8.74/2.51 # Total time : 0.027 s
% 8.74/2.51 # Maximum resident set size: 7120 pages
% 8.74/2.51
%------------------------------------------------------------------------------