%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GRP658+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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:03 EDT 2022
% Result : Theorem 8.66s 2.51s
% Output : CNFRefutation 8.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 6
% Syntax : Number of clauses : 36 ( 34 unt; 0 nHn; 4 RR)
% Number of literals : 38 ( 37 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; 0 con; 1-2 aty)
% Number of variables : 85 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2mz0cg4t/input.p',i_0_4) ).
cnf(i_0_5,plain,
mult(mult(X1,mult(X2,X2)),X3) = mult(mult(X1,X2),mult(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2mz0cg4t/input.p',i_0_5) ).
cnf(i_0_1,plain,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2mz0cg4t/input.p',i_0_1) ).
cnf(i_0_2,plain,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2mz0cg4t/input.p',i_0_2) ).
cnf(i_0_3,plain,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2mz0cg4t/input.p',i_0_3) ).
cnf(i_0_6,negated_conjecture,
( mult(X1,esk2_1(X1)) != esk2_1(X1)
| mult(esk1_1(X1),X1) != esk1_1(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2mz0cg4t/input.p',i_0_6) ).
cnf(c_0_13,plain,
rd(mult(X1,X2),X2) = X1,
i_0_4 ).
cnf(c_0_14,plain,
mult(mult(X1,mult(X2,X2)),X3) = mult(mult(X1,X2),mult(X2,X3)),
i_0_5 ).
cnf(c_0_15,plain,
rd(mult(mult(X1,X2),mult(X2,X3)),X3) = mult(X1,mult(X2,X2)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
mult(X1,ld(X1,X2)) = X2,
i_0_1 ).
cnf(c_0_17,plain,
ld(X1,mult(X1,X2)) = X2,
i_0_2 ).
cnf(c_0_18,plain,
mult(rd(X1,X2),X2) = X1,
i_0_3 ).
cnf(c_0_19,plain,
rd(mult(mult(X1,X2),X3),ld(X2,X3)) = mult(X1,mult(X2,X2)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
ld(rd(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
rd(X1,ld(X2,ld(mult(X3,X2),X1))) = mult(X3,mult(X2,X2)),
inference(spm,[status(thm)],[c_0_19,c_0_16]) ).
cnf(c_0_22,plain,
ld(X1,ld(mult(X2,X1),X3)) = ld(mult(X2,mult(X1,X1)),X3),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
ld(mult(rd(X1,X2),mult(X2,X2)),X3) = ld(X2,ld(X1,X3)),
inference(spm,[status(thm)],[c_0_22,c_0_18]) ).
cnf(c_0_24,plain,
mult(X1,mult(rd(X2,X3),rd(X2,X3))) = rd(mult(mult(X1,rd(X2,X3)),X2),X3),
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_25,plain,
ld(rd(X1,X2),ld(X3,X4)) = ld(rd(mult(X3,X1),X2),X4),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_18]) ).
cnf(c_0_26,plain,
ld(rd(mult(rd(X1,X2),X3),X4),X1) = ld(rd(X3,X4),X2),
inference(spm,[status(thm)],[c_0_25,c_0_20]) ).
cnf(c_0_27,plain,
ld(rd(X1,X1),X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_13]),c_0_20]) ).
cnf(c_0_28,plain,
rd(X1,ld(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_13,c_0_16]) ).
cnf(c_0_29,plain,
ld(rd(X1,mult(rd(X2,X3),X1)),X3) = X2,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
rd(X1,mult(rd(X2,X3),X1)) = rd(X3,X2),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,plain,
mult(X1,ld(mult(X2,mult(X1,X1)),X3)) = ld(mult(X2,X1),X3),
inference(spm,[status(thm)],[c_0_16,c_0_22]) ).
cnf(c_0_32,plain,
ld(rd(X1,X2),X3) = mult(rd(X2,X1),X3),
inference(spm,[status(thm)],[c_0_20,c_0_30]) ).
cnf(c_0_33,plain,
ld(mult(rd(X1,mult(X2,X2)),X2),X3) = mult(X2,ld(X1,X3)),
inference(spm,[status(thm)],[c_0_31,c_0_18]) ).
cnf(c_0_34,plain,
mult(rd(X1,mult(X2,X1)),X3) = ld(X2,X3),
inference(spm,[status(thm)],[c_0_32,c_0_13]) ).
cnf(c_0_35,plain,
mult(rd(X1,X1),X2) = X2,
inference(spm,[status(thm)],[c_0_17,c_0_27]) ).
cnf(c_0_36,plain,
ld(ld(X1,X1),X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_16]) ).
cnf(c_0_37,negated_conjecture,
( mult(X1,esk2_1(X1)) != esk2_1(X1)
| mult(esk1_1(X1),X1) != esk1_1(X1) ),
i_0_6 ).
cnf(c_0_38,plain,
mult(X1,ld(mult(X1,X1),X2)) = ld(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_35]),c_0_35]) ).
cnf(c_0_39,plain,
rd(X1,X1) = ld(X2,X2),
inference(spm,[status(thm)],[c_0_28,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
mult(esk1_1(rd(X1,X1)),rd(X1,X1)) != esk1_1(rd(X1,X1)),
inference(spm,[status(thm)],[c_0_37,c_0_35]) ).
cnf(c_0_41,plain,
mult(X1,rd(X2,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_17]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP658+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.15/0.35 % Computer : n005.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Tue Jun 14 01:28:25 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.22/0.47 # ENIGMATIC: Selected complete mode:
% 8.66/2.51 # ENIGMATIC: Solved by autoschedule:
% 8.66/2.51 # No SInE strategy applied
% 8.66/2.51 # Trying AutoSched0 for 150 seconds
% 8.66/2.51 # AutoSched0-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S04AN
% 8.66/2.51 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.66/2.51 #
% 8.66/2.51 # Preprocessing time : 0.023 s
% 8.66/2.51 # Presaturation interreduction done
% 8.66/2.51
% 8.66/2.51 # Proof found!
% 8.66/2.51 # SZS status Theorem
% 8.66/2.51 # SZS output start CNFRefutation
% See solution above
% 8.66/2.51 # Training examples: 0 positive, 0 negative
% 8.66/2.51
% 8.66/2.51 # -------------------------------------------------
% 8.66/2.51 # User time : 0.037 s
% 8.66/2.51 # System time : 0.007 s
% 8.66/2.51 # Total time : 0.044 s
% 8.66/2.51 # Maximum resident set size: 7120 pages
% 8.66/2.51
%------------------------------------------------------------------------------