TSTP Solution File: GRP715+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GRP715+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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:24 EDT 2022
% Result : Theorem 8.78s 2.48s
% Output : CNFRefutation 8.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 25 ( 23 unt; 0 nHn; 10 RR)
% Number of literals : 27 ( 26 equ; 5 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 25 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
mult(mult(X1,X2),X2) = mult(X1,mult(X2,X2)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v8ed9m9l/lgb.p',i_0_7) ).
cnf(i_0_6,plain,
mult(mult(mult(X1,X2),X3),X2) = mult(X1,mult(mult(X2,X3),X2)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v8ed9m9l/lgb.p',i_0_6) ).
cnf(i_0_11,plain,
mult(op_b,op_a) = unit,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v8ed9m9l/lgb.p',i_0_11) ).
cnf(i_0_9,plain,
mult(unit,X1) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v8ed9m9l/lgb.p',i_0_9) ).
cnf(i_0_10,plain,
mult(op_a,op_b) = unit,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v8ed9m9l/lgb.p',i_0_10) ).
cnf(i_0_8,plain,
mult(X1,unit) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v8ed9m9l/lgb.p',i_0_8) ).
cnf(i_0_12,negated_conjecture,
( mult(mult(esk1_0,op_a),op_b) != esk1_0
| mult(mult(esk1_0,op_b),op_a) != esk1_0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v8ed9m9l/lgb.p',i_0_12) ).
cnf(c_0_20,plain,
mult(mult(X1,X2),X2) = mult(X1,mult(X2,X2)),
i_0_7 ).
cnf(c_0_21,plain,
mult(mult(mult(X1,X2),X3),X2) = mult(X1,mult(mult(X2,X3),X2)),
i_0_6 ).
cnf(c_0_22,plain,
mult(mult(X1,mult(mult(X2,X3),X2)),X2) = mult(mult(mult(X1,X2),X3),mult(X2,X2)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
mult(op_b,op_a) = unit,
i_0_11 ).
cnf(c_0_24,plain,
mult(unit,X1) = X1,
i_0_9 ).
cnf(c_0_25,plain,
mult(op_a,op_b) = unit,
i_0_10 ).
cnf(c_0_26,plain,
mult(mult(mult(X1,op_b),op_a),mult(op_b,op_b)) = mult(X1,mult(op_b,op_b)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_20]) ).
cnf(c_0_27,plain,
mult(op_a,mult(op_b,op_b)) = op_b,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_25]),c_0_24]) ).
cnf(c_0_28,plain,
mult(X1,unit) = X1,
i_0_8 ).
cnf(c_0_29,plain,
mult(mult(X1,mult(op_b,op_b)),op_a) = mult(X1,op_b),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_26]),c_0_27]),c_0_23]),c_0_28]) ).
cnf(c_0_30,plain,
mult(mult(mult(X1,mult(X2,X2)),X3),X2) = mult(mult(X1,X2),mult(mult(X2,X3),X2)),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_31,negated_conjecture,
( mult(mult(esk1_0,op_a),op_b) != esk1_0
| mult(mult(esk1_0,op_b),op_a) != esk1_0 ),
i_0_12 ).
cnf(c_0_32,plain,
mult(mult(X1,op_a),op_b) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_29]),c_0_27]),c_0_23]),c_0_28]) ).
cnf(c_0_33,plain,
mult(mult(X1,mult(op_a,op_a)),op_b) = mult(X1,op_a),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_29]),c_0_27]),c_0_23]),c_0_28]) ).
cnf(c_0_34,plain,
mult(op_b,mult(op_a,op_a)) = op_a,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_23]),c_0_24]) ).
cnf(c_0_35,negated_conjecture,
mult(mult(esk1_0,op_b),op_a) != esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
cnf(c_0_36,plain,
mult(mult(X1,op_b),op_a) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_33]),c_0_34]),c_0_25]),c_0_28]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP715+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n017.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 : Mon Jun 13 10:24:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 8.78/2.48 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.78/2.48 # No SInE strategy applied
% 8.78/2.48 # Trying AutoSched0 for 150 seconds
% 8.78/2.48 # AutoSched0-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S04AN
% 8.78/2.48 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.78/2.48 #
% 8.78/2.48 # Preprocessing time : 0.023 s
% 8.78/2.48 # Presaturation interreduction done
% 8.78/2.48
% 8.78/2.48 # Proof found!
% 8.78/2.48 # SZS status Theorem
% 8.78/2.48 # SZS output start CNFRefutation
% See solution above
% 8.78/2.48 # Training examples: 0 positive, 0 negative
% 8.78/2.48
% 8.78/2.48 # -------------------------------------------------
% 8.78/2.48 # User time : 0.260 s
% 8.78/2.48 # System time : 0.020 s
% 8.78/2.48 # Total time : 0.280 s
% 8.78/2.48 # Maximum resident set size: 7124 pages
% 8.78/2.48
%------------------------------------------------------------------------------