TSTP Solution File: GRP774+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GRP774+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n014.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:36 EDT 2022
% Result : Theorem 8.10s 2.41s
% Output : CNFRefutation 8.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 42 ( 35 unt; 0 nHn; 20 RR)
% Number of literals : 51 ( 38 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 56 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
product(product(X1,X2),X3) = product(X1,product(X2,X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9v5vhoba/input.p',i_0_1) ).
cnf(i_0_2,plain,
product(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9v5vhoba/input.p',i_0_2) ).
cnf(i_0_5,plain,
( product(X1,product(X2,X1)) = X1
| ~ d(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9v5vhoba/input.p',i_0_5) ).
cnf(i_0_8,negated_conjecture,
d(esk1_0,esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9v5vhoba/input.p',i_0_8) ).
cnf(i_0_7,negated_conjecture,
d(esk3_0,esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9v5vhoba/input.p',i_0_7) ).
cnf(i_0_4,plain,
( product(X1,product(X2,X1)) = X1
| ~ d(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9v5vhoba/input.p',i_0_4) ).
cnf(i_0_6,negated_conjecture,
~ d(product(esk1_0,esk3_0),product(esk2_0,esk4_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9v5vhoba/input.p',i_0_6) ).
cnf(i_0_3,plain,
( d(X1,X2)
| product(X2,product(X1,X2)) != X2
| product(X1,product(X2,X1)) != X1 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9v5vhoba/input.p',i_0_3) ).
cnf(c_0_17,plain,
product(product(X1,X2),X3) = product(X1,product(X2,X3)),
i_0_1 ).
cnf(c_0_18,plain,
product(X1,X1) = X1,
i_0_2 ).
cnf(c_0_19,plain,
product(X1,product(X1,X2)) = product(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,plain,
( product(X1,product(X2,X1)) = X1
| ~ d(X1,X2) ),
i_0_5 ).
cnf(c_0_21,negated_conjecture,
d(esk1_0,esk2_0),
i_0_8 ).
cnf(c_0_22,negated_conjecture,
d(esk3_0,esk4_0),
i_0_7 ).
cnf(c_0_23,plain,
product(X1,product(X2,product(X1,product(X2,X3)))) = product(X1,product(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_19]),c_0_17]),c_0_17]) ).
cnf(c_0_24,negated_conjecture,
product(esk1_0,product(esk2_0,esk1_0)) = esk1_0,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
product(X1,product(X2,product(X1,X2))) = product(X1,X2),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_26,plain,
( product(X1,product(X2,X1)) = X1
| ~ d(X2,X1) ),
i_0_4 ).
cnf(c_0_27,negated_conjecture,
product(esk3_0,product(esk4_0,esk3_0)) = esk3_0,
inference(spm,[status(thm)],[c_0_20,c_0_22]) ).
cnf(c_0_28,plain,
product(X1,product(X2,product(X3,product(X1,product(X2,product(X3,X4)))))) = product(X1,product(X2,product(X3,X4))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_23]),c_0_17]),c_0_17]) ).
cnf(c_0_29,plain,
product(esk1_0,product(esk2_0,product(esk1_0,X1))) = product(esk1_0,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_24]),c_0_17]) ).
cnf(c_0_30,plain,
product(X1,product(X2,product(X3,product(X1,product(X2,X3))))) = product(X1,product(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_25]),c_0_17]),c_0_17]) ).
cnf(c_0_31,negated_conjecture,
product(esk2_0,product(esk1_0,esk2_0)) = esk2_0,
inference(spm,[status(thm)],[c_0_26,c_0_21]) ).
cnf(c_0_32,plain,
product(esk3_0,product(esk4_0,product(esk3_0,X1))) = product(esk3_0,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_27]),c_0_17]) ).
cnf(c_0_33,plain,
product(X1,product(esk1_0,product(esk2_0,product(X1,product(esk1_0,X2))))) = product(X1,product(esk1_0,X2)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,plain,
product(X1,product(X2,product(X3,product(X4,product(X1,product(X2,product(X3,X4))))))) = product(X1,product(X2,product(X3,X4))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_30]),c_0_17]),c_0_17]) ).
cnf(c_0_35,negated_conjecture,
product(esk4_0,product(esk3_0,esk4_0)) = esk4_0,
inference(spm,[status(thm)],[c_0_26,c_0_22]) ).
cnf(c_0_36,plain,
product(esk2_0,product(esk1_0,product(esk2_0,X1))) = product(esk2_0,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_31]),c_0_17]) ).
cnf(c_0_37,negated_conjecture,
~ d(product(esk1_0,esk3_0),product(esk2_0,esk4_0)),
i_0_6 ).
cnf(c_0_38,plain,
( d(X1,X2)
| product(X2,product(X1,X2)) != X2
| product(X1,product(X2,X1)) != X1 ),
i_0_3 ).
cnf(c_0_39,plain,
product(X1,product(esk3_0,product(esk4_0,product(X1,product(esk3_0,X2))))) = product(X1,product(esk3_0,X2)),
inference(spm,[status(thm)],[c_0_28,c_0_32]) ).
cnf(c_0_40,plain,
product(X1,product(esk1_0,product(X2,product(esk2_0,product(X1,product(esk1_0,X2)))))) = product(X1,product(esk1_0,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_33]) ).
cnf(c_0_41,negated_conjecture,
product(X1,product(esk3_0,product(esk4_0,product(X1,esk3_0)))) = product(X1,esk3_0),
inference(spm,[status(thm)],[c_0_28,c_0_27]) ).
cnf(c_0_42,plain,
product(esk4_0,product(esk3_0,product(esk4_0,X1))) = product(esk4_0,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_35]),c_0_17]) ).
cnf(c_0_43,plain,
product(X1,product(esk2_0,product(esk1_0,product(X1,product(esk2_0,X2))))) = product(X1,product(esk2_0,X2)),
inference(spm,[status(thm)],[c_0_28,c_0_36]) ).
cnf(c_0_44,negated_conjecture,
( product(esk2_0,product(esk4_0,product(esk1_0,product(esk3_0,product(esk2_0,esk4_0))))) != product(esk2_0,esk4_0)
| product(esk1_0,product(esk3_0,product(esk2_0,product(esk4_0,product(esk1_0,esk3_0))))) != product(esk1_0,esk3_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_17]),c_0_17]),c_0_17]),c_0_17]) ).
cnf(c_0_45,plain,
product(esk1_0,product(esk3_0,product(esk2_0,product(esk4_0,product(esk1_0,esk3_0))))) = product(esk1_0,esk3_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_46,plain,
product(X1,product(esk4_0,product(esk3_0,product(X1,product(esk4_0,X2))))) = product(X1,product(esk4_0,X2)),
inference(spm,[status(thm)],[c_0_28,c_0_42]) ).
cnf(c_0_47,plain,
product(X1,product(esk2_0,product(X2,product(esk1_0,product(X1,product(esk2_0,X2)))))) = product(X1,product(esk2_0,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_34]),c_0_43]) ).
cnf(c_0_48,negated_conjecture,
product(X1,product(esk4_0,product(esk3_0,product(X1,esk4_0)))) = product(X1,esk4_0),
inference(spm,[status(thm)],[c_0_28,c_0_35]) ).
cnf(c_0_49,negated_conjecture,
product(esk2_0,product(esk4_0,product(esk1_0,product(esk3_0,product(esk2_0,esk4_0))))) != product(esk2_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]) ).
cnf(c_0_50,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),c_0_49]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP774+1 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n014.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 13 04:25:39 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected complete mode:
% 8.10/2.41 # ENIGMATIC: Solved by autoschedule:
% 8.10/2.41 # No SInE strategy applied
% 8.10/2.41 # Trying AutoSched0 for 150 seconds
% 8.10/2.41 # AutoSched0-Mode selected heuristic G_E___200_B07_F1_AE_CS_SP_PI_S0Y
% 8.10/2.41 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.10/2.41 #
% 8.10/2.41 # Preprocessing time : 0.012 s
% 8.10/2.41
% 8.10/2.41 # Proof found!
% 8.10/2.41 # SZS status Theorem
% 8.10/2.41 # SZS output start CNFRefutation
% See solution above
% 8.10/2.41 # Training examples: 0 positive, 0 negative
% 8.10/2.41
% 8.10/2.41 # -------------------------------------------------
% 8.10/2.41 # User time : 0.075 s
% 8.10/2.41 # System time : 0.007 s
% 8.10/2.41 # Total time : 0.083 s
% 8.10/2.41 # Maximum resident set size: 7120 pages
% 8.10/2.41
%------------------------------------------------------------------------------