TSTP Solution File: GRP704+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GRP704+1 : TPTP v8.1.0. Released v4.0.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:40:22 EDT 2022
% Result : Theorem 7.91s 2.44s
% Output : CNFRefutation 7.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 23 ( 21 unt; 0 nHn; 5 RR)
% Number of literals : 27 ( 26 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_6,plain,
mult(unit,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sjfy_utx/input.p',i_0_6) ).
cnf(i_0_1,plain,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sjfy_utx/input.p',i_0_1) ).
cnf(i_0_11,plain,
ld(X1,mult(op_c,X1)) = op_d,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sjfy_utx/input.p',i_0_11) ).
cnf(i_0_5,plain,
mult(X1,unit) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sjfy_utx/input.p',i_0_5) ).
cnf(i_0_13,plain,
mult(X1,mult(X2,ld(mult(X1,X2),op_c))) = op_f,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sjfy_utx/input.p',i_0_13) ).
cnf(i_0_10,plain,
mult(mult(X1,op_c),X2) = mult(X1,mult(op_c,X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sjfy_utx/input.p',i_0_10) ).
cnf(i_0_8,plain,
mult(mult(op_c,X1),X2) = mult(op_c,mult(X1,X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sjfy_utx/input.p',i_0_8) ).
cnf(i_0_14,negated_conjecture,
( mult(mult(op_f,esk1_0),esk2_0) != mult(op_f,mult(esk1_0,esk2_0))
| mult(mult(esk1_0,op_f),esk2_0) != mult(esk1_0,mult(op_f,esk2_0))
| mult(mult(esk1_0,esk2_0),op_f) != mult(esk1_0,mult(esk2_0,op_f)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-sjfy_utx/input.p',i_0_14) ).
cnf(c_0_23,plain,
mult(unit,X1) = X1,
i_0_6 ).
cnf(c_0_24,plain,
mult(X1,ld(X1,X2)) = X2,
i_0_1 ).
cnf(c_0_25,plain,
ld(unit,X1) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,plain,
ld(X1,mult(op_c,X1)) = op_d,
i_0_11 ).
cnf(c_0_27,plain,
mult(X1,unit) = X1,
i_0_5 ).
cnf(c_0_28,plain,
op_d = op_c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_29,plain,
ld(X1,mult(op_c,X1)) = op_c,
inference(rw,[status(thm)],[c_0_26,c_0_28]) ).
cnf(c_0_30,plain,
mult(X1,mult(X2,ld(mult(X1,X2),op_c))) = op_f,
i_0_13 ).
cnf(c_0_31,plain,
mult(mult(X1,op_c),X2) = mult(X1,mult(op_c,X2)),
i_0_10 ).
cnf(c_0_32,plain,
mult(X1,op_c) = mult(op_c,X1),
inference(spm,[status(thm)],[c_0_24,c_0_29]) ).
cnf(c_0_33,plain,
mult(mult(op_c,X1),X2) = mult(op_c,mult(X1,X2)),
i_0_8 ).
cnf(c_0_34,negated_conjecture,
( mult(mult(op_f,esk1_0),esk2_0) != mult(op_f,mult(esk1_0,esk2_0))
| mult(mult(esk1_0,op_f),esk2_0) != mult(esk1_0,mult(op_f,esk2_0))
| mult(mult(esk1_0,esk2_0),op_f) != mult(esk1_0,mult(esk2_0,op_f)) ),
i_0_14 ).
cnf(c_0_35,plain,
op_f = op_c,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_30]),c_0_23]),c_0_24]) ).
cnf(c_0_36,plain,
mult(op_c,mult(X1,X2)) = mult(X1,mult(op_c,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_37,negated_conjecture,
$false,
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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35]),c_0_33]),c_0_35]),c_0_35]),c_0_32]),c_0_33]),c_0_35]),c_0_36]),c_0_35]),c_0_32]),c_0_35]),c_0_32]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP704+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n013.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 : Tue Jun 14 12:25:00 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.91/2.44 # ENIGMATIC: Solved by autoschedule:
% 7.91/2.44 # No SInE strategy applied
% 7.91/2.44 # Trying AutoSched0 for 150 seconds
% 7.91/2.44 # AutoSched0-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S04AN
% 7.91/2.44 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.91/2.44 #
% 7.91/2.44 # Preprocessing time : 0.022 s
% 7.91/2.44 # Presaturation interreduction done
% 7.91/2.44
% 7.91/2.44 # Proof found!
% 7.91/2.44 # SZS status Theorem
% 7.91/2.44 # SZS output start CNFRefutation
% See solution above
% 7.91/2.44 # Training examples: 0 positive, 0 negative
% 7.91/2.44
% 7.91/2.44 # -------------------------------------------------
% 7.91/2.44 # User time : 0.026 s
% 7.91/2.44 # System time : 0.005 s
% 7.91/2.44 # Total time : 0.030 s
% 7.91/2.44 # Maximum resident set size: 7120 pages
% 7.91/2.44
%------------------------------------------------------------------------------