TSTP Solution File: GRP702+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GRP702+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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:20 EDT 2022
% Result : Theorem 7.68s 2.42s
% Output : CNFRefutation 7.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 21 ( 18 unt; 0 nHn; 5 RR)
% Number of literals : 27 ( 26 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 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 : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_6,plain,
mult(unit,X1) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3sqyg8fr/lgb.p',i_0_6) ).
cnf(i_0_1,plain,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3sqyg8fr/lgb.p',i_0_1) ).
cnf(i_0_11,plain,
ld(X1,mult(op_c,X1)) = op_d,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3sqyg8fr/lgb.p',i_0_11) ).
cnf(i_0_5,plain,
mult(X1,unit) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3sqyg8fr/lgb.p',i_0_5) ).
cnf(i_0_14,negated_conjecture,
( mult(mult(op_d,esk1_0),esk2_0) != mult(op_d,mult(esk1_0,esk2_0))
| mult(mult(esk1_0,op_d),esk2_0) != mult(esk1_0,mult(op_d,esk2_0))
| mult(mult(esk1_0,esk2_0),op_d) != mult(esk1_0,mult(esk2_0,op_d)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3sqyg8fr/lgb.p',i_0_14) ).
cnf(i_0_10,plain,
mult(mult(X1,op_c),X2) = mult(X1,mult(op_c,X2)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3sqyg8fr/lgb.p',i_0_10) ).
cnf(i_0_8,plain,
mult(mult(op_c,X1),X2) = mult(op_c,mult(X1,X2)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3sqyg8fr/lgb.p',i_0_8) ).
cnf(c_0_22,plain,
mult(unit,X1) = X1,
i_0_6 ).
cnf(c_0_23,plain,
mult(X1,ld(X1,X2)) = X2,
i_0_1 ).
cnf(c_0_24,plain,
ld(unit,X1) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,plain,
ld(X1,mult(op_c,X1)) = op_d,
i_0_11 ).
cnf(c_0_26,plain,
mult(X1,unit) = X1,
i_0_5 ).
cnf(c_0_27,plain,
op_d = op_c,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_28,plain,
ld(X1,mult(op_c,X1)) = op_c,
inference(rw,[status(thm)],[c_0_25,c_0_27]) ).
cnf(c_0_29,negated_conjecture,
( mult(mult(op_d,esk1_0),esk2_0) != mult(op_d,mult(esk1_0,esk2_0))
| mult(mult(esk1_0,op_d),esk2_0) != mult(esk1_0,mult(op_d,esk2_0))
| mult(mult(esk1_0,esk2_0),op_d) != mult(esk1_0,mult(esk2_0,op_d)) ),
i_0_14 ).
cnf(c_0_30,plain,
mult(mult(X1,op_c),X2) = mult(X1,mult(op_c,X2)),
i_0_10 ).
cnf(c_0_31,plain,
mult(X1,op_c) = mult(op_c,X1),
inference(spm,[status(thm)],[c_0_23,c_0_28]) ).
cnf(c_0_32,plain,
mult(mult(op_c,X1),X2) = mult(op_c,mult(X1,X2)),
i_0_8 ).
cnf(c_0_33,negated_conjecture,
( mult(mult(op_c,esk1_0),esk2_0) != mult(op_c,mult(esk1_0,esk2_0))
| mult(mult(esk1_0,op_c),esk2_0) != mult(esk1_0,mult(op_c,esk2_0))
| mult(mult(esk1_0,esk2_0),op_c) != mult(esk1_0,mult(esk2_0,op_c)) ),
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_29,c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]),c_0_27]) ).
cnf(c_0_34,plain,
mult(op_c,mult(X1,X2)) = mult(X1,mult(op_c,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_35,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)],[c_0_33,c_0_31]),c_0_31]),c_0_31]),c_0_32]),c_0_32]),c_0_34]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP702+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n024.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 : Mon Jun 13 12:30:05 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.68/2.42 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.68/2.42 # No SInE strategy applied
% 7.68/2.42 # Trying AutoSched0 for 150 seconds
% 7.68/2.42 # AutoSched0-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S04AN
% 7.68/2.42 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.68/2.42 #
% 7.68/2.42 # Preprocessing time : 0.023 s
% 7.68/2.42 # Presaturation interreduction done
% 7.68/2.42
% 7.68/2.42 # Proof found!
% 7.68/2.42 # SZS status Theorem
% 7.68/2.42 # SZS output start CNFRefutation
% See solution above
% 7.68/2.42 # Training examples: 0 positive, 0 negative
% 7.68/2.42
% 7.68/2.42 # -------------------------------------------------
% 7.68/2.42 # User time : 0.028 s
% 7.68/2.42 # System time : 0.004 s
% 7.68/2.42 # Total time : 0.032 s
% 7.68/2.42 # Maximum resident set size: 7124 pages
% 7.68/2.42
%------------------------------------------------------------------------------