TSTP Solution File: GRP194+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : GRP194+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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:38:15 EDT 2022
% Result : Theorem 4.41s 2.35s
% Output : CNFRefutation 4.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 36 ( 9 unt; 2 nHn; 36 RR)
% Number of literals : 80 ( 17 equ; 45 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 52 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_6,plain,
( multiply(X1,X2,X3) = X2
| ~ group_member(X3,X1)
| ~ left_zero(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rsa8rbvj/input.p',i_0_6) ).
cnf(i_0_8,hypothesis,
left_zero(f,f_left_zero),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rsa8rbvj/input.p',i_0_8) ).
cnf(i_0_7,plain,
( group_member(X1,X2)
| ~ left_zero(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rsa8rbvj/input.p',i_0_7) ).
cnf(i_0_1,plain,
( multiply(X1,multiply(X1,X2,X3),X4) = multiply(X1,X2,multiply(X1,X3,X4))
| ~ group_member(X4,X1)
| ~ group_member(X3,X1)
| ~ group_member(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rsa8rbvj/input.p',i_0_1) ).
cnf(i_0_3,plain,
( phi(multiply(f,X1,X2)) = multiply(h,phi(X1),phi(X2))
| ~ group_member(X2,f)
| ~ group_member(X1,f) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rsa8rbvj/input.p',i_0_3) ).
cnf(i_0_10,plain,
( phi(esk2_1(X1)) = X1
| ~ group_member(X1,h) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rsa8rbvj/input.p',i_0_10) ).
cnf(i_0_11,plain,
( group_member(esk2_1(X1),f)
| ~ group_member(X1,h) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rsa8rbvj/input.p',i_0_11) ).
cnf(i_0_12,plain,
( group_member(multiply(X1,X2,X3),X1)
| ~ group_member(X3,X1)
| ~ group_member(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rsa8rbvj/input.p',i_0_12) ).
cnf(i_0_2,plain,
( group_member(phi(X1),h)
| ~ group_member(X1,f) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rsa8rbvj/input.p',i_0_2) ).
cnf(i_0_4,plain,
( left_zero(X1,X2)
| multiply(X1,X2,esk1_2(X1,X2)) != X2
| ~ group_member(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rsa8rbvj/input.p',i_0_4) ).
cnf(i_0_9,negated_conjecture,
~ left_zero(h,phi(f_left_zero)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rsa8rbvj/input.p',i_0_9) ).
cnf(i_0_5,plain,
( left_zero(X1,X2)
| group_member(esk1_2(X1,X2),X1)
| ~ group_member(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rsa8rbvj/input.p',i_0_5) ).
cnf(c_0_25,plain,
( multiply(X1,X2,X3) = X2
| ~ group_member(X3,X1)
| ~ left_zero(X1,X2) ),
i_0_6 ).
cnf(c_0_26,hypothesis,
left_zero(f,f_left_zero),
i_0_8 ).
cnf(c_0_27,plain,
( group_member(X1,X2)
| ~ left_zero(X2,X1) ),
i_0_7 ).
cnf(c_0_28,plain,
( multiply(X1,multiply(X1,X2,X3),X4) = multiply(X1,X2,multiply(X1,X3,X4))
| ~ group_member(X4,X1)
| ~ group_member(X3,X1)
| ~ group_member(X2,X1) ),
i_0_1 ).
cnf(c_0_29,hypothesis,
( multiply(f,f_left_zero,X1) = f_left_zero
| ~ group_member(X1,f) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,hypothesis,
group_member(f_left_zero,f),
inference(spm,[status(thm)],[c_0_27,c_0_26]) ).
cnf(c_0_31,plain,
( multiply(f,f_left_zero,multiply(f,X1,X2)) = multiply(f,f_left_zero,X2)
| ~ group_member(X2,f)
| ~ group_member(X1,f) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_32,hypothesis,
( multiply(f,f_left_zero,f_left_zero) = multiply(f,f_left_zero,X1)
| ~ group_member(X1,f) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_29]),c_0_30])]) ).
cnf(c_0_33,plain,
( phi(multiply(f,X1,X2)) = multiply(h,phi(X1),phi(X2))
| ~ group_member(X2,f)
| ~ group_member(X1,f) ),
i_0_3 ).
cnf(c_0_34,plain,
( phi(esk2_1(X1)) = X1
| ~ group_member(X1,h) ),
i_0_10 ).
cnf(c_0_35,plain,
( group_member(esk2_1(X1),f)
| ~ group_member(X1,h) ),
i_0_11 ).
cnf(c_0_36,plain,
( group_member(multiply(X1,X2,X3),X1)
| ~ group_member(X3,X1)
| ~ group_member(X2,X1) ),
i_0_12 ).
cnf(c_0_37,plain,
( group_member(phi(X1),h)
| ~ group_member(X1,f) ),
i_0_2 ).
cnf(c_0_38,hypothesis,
( multiply(f,f_left_zero,f_left_zero) = f_left_zero
| ~ group_member(X1,f) ),
inference(spm,[status(thm)],[c_0_29,c_0_32]) ).
cnf(c_0_39,plain,
( phi(multiply(f,X1,esk2_1(X2))) = multiply(h,phi(X1),X2)
| ~ group_member(X1,f)
| ~ group_member(X2,h) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_40,plain,
( group_member(phi(multiply(f,X1,X2)),h)
| ~ group_member(X2,f)
| ~ group_member(X1,f) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_33]),c_0_37]),c_0_37]) ).
cnf(c_0_41,hypothesis,
multiply(f,f_left_zero,f_left_zero) = f_left_zero,
inference(spm,[status(thm)],[c_0_38,c_0_30]) ).
cnf(c_0_42,plain,
( left_zero(X1,X2)
| multiply(X1,X2,esk1_2(X1,X2)) != X2
| ~ group_member(X2,X1) ),
i_0_4 ).
cnf(c_0_43,hypothesis,
( multiply(h,phi(f_left_zero),X1) = phi(f_left_zero)
| ~ group_member(X1,h) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_29]),c_0_30])]),c_0_35]) ).
cnf(c_0_44,hypothesis,
group_member(phi(f_left_zero),h),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_30])]) ).
cnf(c_0_45,negated_conjecture,
~ left_zero(h,phi(f_left_zero)),
i_0_9 ).
cnf(c_0_46,plain,
~ group_member(esk1_2(h,phi(f_left_zero)),h),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]),c_0_45]) ).
cnf(c_0_47,plain,
( left_zero(X1,X2)
| group_member(esk1_2(X1,X2),X1)
| ~ group_member(X2,X1) ),
i_0_5 ).
cnf(c_0_48,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_44])]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP194+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n013.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:04:15 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected SinE mode:
% 0.18/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.18/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.18/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 4.41/2.35 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_S0Y:
% 4.41/2.35 # Version: 2.1pre011
% 4.41/2.35 # Preprocessing time : 0.018 s
% 4.41/2.35
% 4.41/2.35 # Proof found!
% 4.41/2.35 # SZS status Theorem
% 4.41/2.35 # SZS output start CNFRefutation
% See solution above
% 4.41/2.35 # Proof object total steps : 36
% 4.41/2.35 # Proof object clause steps : 24
% 4.41/2.35 # Proof object formula steps : 12
% 4.41/2.35 # Proof object conjectures : 2
% 4.41/2.35 # Proof object clause conjectures : 1
% 4.41/2.35 # Proof object formula conjectures : 1
% 4.41/2.35 # Proof object initial clauses used : 12
% 4.41/2.35 # Proof object initial formulas used : 12
% 4.41/2.35 # Proof object generating inferences : 12
% 4.41/2.35 # Proof object simplifying inferences : 18
% 4.41/2.35 # Training examples: 0 positive, 0 negative
% 4.41/2.35 # Parsed axioms : 12
% 4.41/2.35 # Removed by relevancy pruning/SinE : 0
% 4.41/2.35 # Initial clauses : 12
% 4.41/2.35 # Removed in clause preprocessing : 0
% 4.41/2.35 # Initial clauses in saturation : 12
% 4.41/2.35 # Processed clauses : 34
% 4.41/2.35 # ...of these trivial : 1
% 4.41/2.35 # ...subsumed : 4
% 4.41/2.35 # ...remaining for further processing : 29
% 4.41/2.35 # Other redundant clauses eliminated : 0
% 4.41/2.35 # Clauses deleted for lack of memory : 0
% 4.41/2.35 # Backward-subsumed : 0
% 4.41/2.35 # Backward-rewritten : 2
% 4.41/2.35 # Generated clauses : 100
% 4.41/2.35 # ...of the previous two non-trivial : 81
% 4.41/2.35 # Contextual simplify-reflections : 12
% 4.41/2.35 # Paramodulations : 100
% 4.41/2.35 # Factorizations : 0
% 4.41/2.35 # Equation resolutions : 0
% 4.41/2.35 # Propositional unsat checks : 0
% 4.41/2.35 # Propositional unsat check successes : 0
% 4.41/2.35 # Current number of processed clauses : 27
% 4.41/2.35 # Positive orientable unit clauses : 4
% 4.41/2.35 # Positive unorientable unit clauses: 0
% 4.41/2.35 # Negative unit clauses : 2
% 4.41/2.35 # Non-unit-clauses : 21
% 4.41/2.35 # Current number of unprocessed clauses: 45
% 4.41/2.35 # ...number of literals in the above : 203
% 4.41/2.35 # Current number of archived formulas : 0
% 4.41/2.35 # Current number of archived clauses : 2
% 4.41/2.35 # Clause-clause subsumption calls (NU) : 91
% 4.41/2.35 # Rec. Clause-clause subsumption calls : 77
% 4.41/2.35 # Non-unit clause-clause subsumptions : 16
% 4.41/2.35 # Unit Clause-clause subsumption calls : 0
% 4.41/2.35 # Rewrite failures with RHS unbound : 0
% 4.41/2.35 # BW rewrite match attempts : 4
% 4.41/2.35 # BW rewrite match successes : 1
% 4.41/2.35 # Condensation attempts : 0
% 4.41/2.35 # Condensation successes : 0
% 4.41/2.35 # Termbank termtop insertions : 2316
% 4.41/2.35
% 4.41/2.35 # -------------------------------------------------
% 4.41/2.35 # User time : 0.016 s
% 4.41/2.35 # System time : 0.005 s
% 4.41/2.35 # Total time : 0.021 s
% 4.41/2.35 # ...preprocessing : 0.018 s
% 4.41/2.35 # ...main loop : 0.003 s
% 4.41/2.35 # Maximum resident set size: 7124 pages
% 4.41/2.35
%------------------------------------------------------------------------------