%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GRP656+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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:02 EDT 2022
% Result : Theorem 8.39s 2.62s
% Output : CNFRefutation 8.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of clauses : 18 ( 16 unt; 0 nHn; 4 RR)
% Number of literals : 20 ( 19 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 : 36 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_203g786/input.p',i_0_4) ).
cnf(i_0_5,plain,
mult(mult(X1,mult(X2,X3)),X1) = mult(mult(X1,X2),mult(X3,X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_203g786/input.p',i_0_5) ).
cnf(i_0_3,plain,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_203g786/input.p',i_0_3) ).
cnf(i_0_2,plain,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_203g786/input.p',i_0_2) ).
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/sandbox/tmp/enigma-theBenchmark.p-_203g786/input.p',i_0_6) ).
cnf(c_0_12,plain,
rd(mult(X1,X2),X2) = X1,
i_0_4 ).
cnf(c_0_13,plain,
mult(mult(X1,mult(X2,X3)),X1) = mult(mult(X1,X2),mult(X3,X1)),
i_0_5 ).
cnf(c_0_14,plain,
rd(mult(mult(X1,X2),mult(X3,X1)),X1) = mult(X1,mult(X2,X3)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
mult(rd(X1,X2),X2) = X1,
i_0_3 ).
cnf(c_0_16,plain,
ld(X1,mult(X1,X2)) = X2,
i_0_2 ).
cnf(c_0_17,plain,
mult(X1,mult(X2,rd(X3,X1))) = rd(mult(mult(X1,X2),X3),X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
ld(X1,rd(mult(mult(X1,X2),X3),X1)) = mult(X2,rd(X3,X1)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,plain,
mult(X1,rd(X2,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_12]),c_0_16]) ).
cnf(c_0_20,plain,
ld(X1,X1) = rd(X2,X2),
inference(spm,[status(thm)],[c_0_16,c_0_19]) ).
cnf(c_0_21,negated_conjecture,
( mult(X1,esk2_1(X1)) != esk2_1(X1)
| mult(esk1_1(X1),X1) != esk1_1(X1) ),
i_0_6 ).
cnf(c_0_22,plain,
mult(ld(X1,X1),X2) = X2,
inference(spm,[status(thm)],[c_0_15,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
mult(esk1_1(ld(X1,X1)),ld(X1,X1)) != esk1_1(ld(X1,X1)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_20]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP656+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.36 % Computer : n021.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Tue Jun 14 08:43:59 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.22/0.48 # ENIGMATIC: Selected complete mode:
% 8.39/2.62 # ENIGMATIC: Solved by autoschedule:
% 8.39/2.62 # No SInE strategy applied
% 8.39/2.62 # Trying AutoSched0 for 150 seconds
% 8.39/2.62 # AutoSched0-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_RG_S04AN
% 8.39/2.62 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.39/2.62 #
% 8.39/2.62 # Preprocessing time : 0.013 s
% 8.39/2.62 # Presaturation interreduction done
% 8.39/2.62
% 8.39/2.62 # Proof found!
% 8.39/2.62 # SZS status Theorem
% 8.39/2.62 # SZS output start CNFRefutation
% See solution above
% 8.39/2.62 # Training examples: 0 positive, 0 negative
% 8.39/2.62
% 8.39/2.62 # -------------------------------------------------
% 8.39/2.62 # User time : 0.017 s
% 8.39/2.62 # System time : 0.005 s
% 8.39/2.62 # Total time : 0.022 s
% 8.39/2.62 # Maximum resident set size: 7124 pages
% 8.39/2.62
%------------------------------------------------------------------------------