TSTP Solution File: GRP202-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP202-1 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:39:17 EDT 2023
% Result : Unsatisfiable 3.78s 0.98s
% Output : CNFRefutation 3.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of clauses : 50 ( 50 unt; 0 nHn; 4 RR)
% Number of literals : 50 ( 49 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 86 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(right_identity,axiom,
multiply(X1,identity) = X1,
file('/export/starexec/sandbox/tmp/tmp.KBB4X3OIu4/E---3.1_30918.p',right_identity) ).
cnf(moufang3,axiom,
multiply(multiply(multiply(X1,X2),X1),X3) = multiply(X1,multiply(X2,multiply(X1,X3))),
file('/export/starexec/sandbox/tmp/tmp.KBB4X3OIu4/E---3.1_30918.p',moufang3) ).
cnf(left_inverse,axiom,
multiply(left_inverse(X1),X1) = identity,
file('/export/starexec/sandbox/tmp/tmp.KBB4X3OIu4/E---3.1_30918.p',left_inverse) ).
cnf(right_inverse,axiom,
multiply(X1,right_inverse(X1)) = identity,
file('/export/starexec/sandbox/tmp/tmp.KBB4X3OIu4/E---3.1_30918.p',right_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.KBB4X3OIu4/E---3.1_30918.p',left_identity) ).
cnf(left_division_multiply,axiom,
left_division(X1,multiply(X1,X2)) = X2,
file('/export/starexec/sandbox/tmp/tmp.KBB4X3OIu4/E---3.1_30918.p',left_division_multiply) ).
cnf(multiply_left_division,axiom,
multiply(X1,left_division(X1,X2)) = X2,
file('/export/starexec/sandbox/tmp/tmp.KBB4X3OIu4/E---3.1_30918.p',multiply_left_division) ).
cnf(right_division_multiply,axiom,
right_division(multiply(X1,X2),X2) = X1,
file('/export/starexec/sandbox/tmp/tmp.KBB4X3OIu4/E---3.1_30918.p',right_division_multiply) ).
cnf(multiply_right_division,axiom,
multiply(right_division(X1,X2),X2) = X1,
file('/export/starexec/sandbox/tmp/tmp.KBB4X3OIu4/E---3.1_30918.p',multiply_right_division) ).
cnf(prove_moufang1,negated_conjecture,
multiply(multiply(a,multiply(b,c)),a) != multiply(multiply(a,b),multiply(c,a)),
file('/export/starexec/sandbox/tmp/tmp.KBB4X3OIu4/E---3.1_30918.p',prove_moufang1) ).
cnf(c_0_10,axiom,
multiply(X1,identity) = X1,
right_identity ).
cnf(c_0_11,axiom,
multiply(multiply(multiply(X1,X2),X1),X3) = multiply(X1,multiply(X2,multiply(X1,X3))),
moufang3 ).
cnf(c_0_12,plain,
multiply(multiply(X1,X2),X1) = multiply(X1,multiply(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_10]) ).
cnf(c_0_13,plain,
multiply(multiply(X1,multiply(X2,X1)),X3) = multiply(X1,multiply(X2,multiply(X1,X3))),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,axiom,
multiply(left_inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_15,axiom,
multiply(X1,right_inverse(X1)) = identity,
right_inverse ).
cnf(c_0_16,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_17,axiom,
left_division(X1,multiply(X1,X2)) = X2,
left_division_multiply ).
cnf(c_0_18,axiom,
multiply(X1,left_division(X1,X2)) = X2,
multiply_left_division ).
cnf(c_0_19,plain,
multiply(X1,multiply(left_inverse(X1),multiply(X1,X2))) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_10]) ).
cnf(c_0_20,plain,
multiply(X1,multiply(right_inverse(X1),X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_15]),c_0_16]) ).
cnf(c_0_21,plain,
left_division(X1,X1) = identity,
inference(spm,[status(thm)],[c_0_17,c_0_10]) ).
cnf(c_0_22,axiom,
right_division(multiply(X1,X2),X2) = X1,
right_division_multiply ).
cnf(c_0_23,plain,
multiply(X1,multiply(left_division(X1,X2),X1)) = multiply(X2,X1),
inference(spm,[status(thm)],[c_0_12,c_0_18]) ).
cnf(c_0_24,plain,
multiply(left_inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_19]),c_0_17]) ).
cnf(c_0_25,plain,
multiply(right_inverse(X1),X1) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_20]),c_0_21]) ).
cnf(c_0_26,plain,
right_division(identity,X1) = left_inverse(X1),
inference(spm,[status(thm)],[c_0_22,c_0_14]) ).
cnf(c_0_27,plain,
multiply(left_division(X1,X2),X1) = left_division(X1,multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_17,c_0_23]) ).
cnf(c_0_28,plain,
left_division(left_inverse(X1),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_24]) ).
cnf(c_0_29,plain,
right_inverse(X1) = left_inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_25]),c_0_26]) ).
cnf(c_0_30,plain,
multiply(multiply(X1,X2),left_inverse(X1)) = multiply(X1,multiply(X2,left_inverse(X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_28]) ).
cnf(c_0_31,plain,
multiply(X1,left_inverse(X1)) = identity,
inference(rw,[status(thm)],[c_0_15,c_0_29]) ).
cnf(c_0_32,plain,
right_division(X1,left_division(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_22,c_0_18]) ).
cnf(c_0_33,plain,
multiply(X1,multiply(multiply(X2,X1),left_inverse(X1))) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_30]),c_0_31]),c_0_10]) ).
cnf(c_0_34,plain,
right_division(X1,multiply(X2,X1)) = left_inverse(X2),
inference(spm,[status(thm)],[c_0_32,c_0_28]) ).
cnf(c_0_35,axiom,
multiply(right_division(X1,X2),X2) = X1,
multiply_right_division ).
cnf(c_0_36,plain,
multiply(multiply(X1,X2),left_inverse(X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_33]),c_0_17]) ).
cnf(c_0_37,plain,
left_inverse(right_division(X1,X2)) = right_division(X2,X1),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
right_division(X1,left_inverse(X2)) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_22,c_0_36]) ).
cnf(c_0_39,plain,
right_division(left_inverse(X1),X2) = left_inverse(multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_40,plain,
multiply(left_inverse(X1),X2) = left_division(X1,X2),
inference(spm,[status(thm)],[c_0_24,c_0_18]) ).
cnf(c_0_41,plain,
left_inverse(left_division(X1,X2)) = left_division(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_40]) ).
cnf(c_0_42,plain,
right_division(multiply(X1,multiply(X2,multiply(X1,X3))),X3) = multiply(X1,multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_22,c_0_13]) ).
cnf(c_0_43,plain,
right_division(X1,left_division(X2,X3)) = multiply(X1,left_division(X3,X2)),
inference(spm,[status(thm)],[c_0_38,c_0_41]) ).
cnf(c_0_44,plain,
multiply(multiply(X1,multiply(X2,X3)),left_division(X3,X1)) = multiply(X1,multiply(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_18]),c_0_43]) ).
cnf(c_0_45,negated_conjecture,
multiply(multiply(a,multiply(b,c)),a) != multiply(multiply(a,b),multiply(c,a)),
prove_moufang1 ).
cnf(c_0_46,plain,
multiply(multiply(X1,X2),left_division(X3,X1)) = multiply(X1,multiply(right_division(X2,X3),X1)),
inference(spm,[status(thm)],[c_0_44,c_0_35]) ).
cnf(c_0_47,negated_conjecture,
multiply(multiply(a,b),multiply(c,a)) != multiply(a,multiply(multiply(b,c),a)),
inference(rw,[status(thm)],[c_0_45,c_0_12]) ).
cnf(c_0_48,plain,
multiply(multiply(X1,X2),multiply(X3,X1)) = multiply(X1,multiply(multiply(X2,X3),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_28]),c_0_38]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : GRP202-1 : TPTP v8.1.2. Released v2.2.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.13/0.36 % Computer : n002.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 2400
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Tue Oct 3 03:20:59 EDT 2023
% 0.13/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.KBB4X3OIu4/E---3.1_30918.p
% 3.78/0.98 # Version: 3.1pre001
% 3.78/0.98 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.78/0.98 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.78/0.98 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.78/0.98 # Starting new_bool_3 with 300s (1) cores
% 3.78/0.98 # Starting new_bool_1 with 300s (1) cores
% 3.78/0.98 # Starting sh5l with 300s (1) cores
% 3.78/0.98 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 31043 completed with status 0
% 3.78/0.98 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 3.78/0.98 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.78/0.98 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.78/0.98 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.78/0.98 # No SInE strategy applied
% 3.78/0.98 # Search class: FUUPM-FFSF21-MFFFFFNN
% 3.78/0.98 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.78/0.98 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 3.78/0.98 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 3.78/0.98 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 3.78/0.98 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 3.78/0.98 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 3.78/0.98 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 31047 completed with status 0
% 3.78/0.98 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 3.78/0.98 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.78/0.98 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.78/0.98 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.78/0.98 # No SInE strategy applied
% 3.78/0.98 # Search class: FUUPM-FFSF21-MFFFFFNN
% 3.78/0.98 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.78/0.98 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 3.78/0.98 # Preprocessing time : 0.001 s
% 3.78/0.98 # Presaturation interreduction done
% 3.78/0.98
% 3.78/0.98 # Proof found!
% 3.78/0.98 # SZS status Unsatisfiable
% 3.78/0.98 # SZS output start CNFRefutation
% See solution above
% 3.78/0.98 # Parsed axioms : 10
% 3.78/0.98 # Removed by relevancy pruning/SinE : 0
% 3.78/0.98 # Initial clauses : 10
% 3.78/0.98 # Removed in clause preprocessing : 0
% 3.78/0.98 # Initial clauses in saturation : 10
% 3.78/0.98 # Processed clauses : 1053
% 3.78/0.98 # ...of these trivial : 672
% 3.78/0.98 # ...subsumed : 0
% 3.78/0.98 # ...remaining for further processing : 381
% 3.78/0.98 # Other redundant clauses eliminated : 0
% 3.78/0.98 # Clauses deleted for lack of memory : 0
% 3.78/0.98 # Backward-subsumed : 0
% 3.78/0.98 # Backward-rewritten : 139
% 3.78/0.98 # Generated clauses : 40236
% 3.78/0.98 # ...of the previous two non-redundant : 30335
% 3.78/0.98 # ...aggressively subsumed : 0
% 3.78/0.98 # Contextual simplify-reflections : 0
% 3.78/0.98 # Paramodulations : 40236
% 3.78/0.98 # Factorizations : 0
% 3.78/0.98 # NegExts : 0
% 3.78/0.98 # Equation resolutions : 0
% 3.78/0.98 # Total rewrite steps : 104455
% 3.78/0.98 # Propositional unsat checks : 0
% 3.78/0.98 # Propositional check models : 0
% 3.78/0.98 # Propositional check unsatisfiable : 0
% 3.78/0.98 # Propositional clauses : 0
% 3.78/0.98 # Propositional clauses after purity: 0
% 3.78/0.98 # Propositional unsat core size : 0
% 3.78/0.98 # Propositional preprocessing time : 0.000
% 3.78/0.98 # Propositional encoding time : 0.000
% 3.78/0.98 # Propositional solver time : 0.000
% 3.78/0.98 # Success case prop preproc time : 0.000
% 3.78/0.98 # Success case prop encoding time : 0.000
% 3.78/0.98 # Success case prop solver time : 0.000
% 3.78/0.98 # Current number of processed clauses : 232
% 3.78/0.98 # Positive orientable unit clauses : 232
% 3.78/0.98 # Positive unorientable unit clauses: 0
% 3.78/0.98 # Negative unit clauses : 0
% 3.78/0.98 # Non-unit-clauses : 0
% 3.78/0.98 # Current number of unprocessed clauses: 28764
% 3.78/0.98 # ...number of literals in the above : 28764
% 3.78/0.98 # Current number of archived formulas : 0
% 3.78/0.98 # Current number of archived clauses : 149
% 3.78/0.98 # Clause-clause subsumption calls (NU) : 0
% 3.78/0.98 # Rec. Clause-clause subsumption calls : 0
% 3.78/0.98 # Non-unit clause-clause subsumptions : 0
% 3.78/0.98 # Unit Clause-clause subsumption calls : 0
% 3.78/0.98 # Rewrite failures with RHS unbound : 0
% 3.78/0.98 # BW rewrite match attempts : 606
% 3.78/0.98 # BW rewrite match successes : 133
% 3.78/0.98 # Condensation attempts : 0
% 3.78/0.98 # Condensation successes : 0
% 3.78/0.98 # Termbank termtop insertions : 592129
% 3.78/0.98
% 3.78/0.98 # -------------------------------------------------
% 3.78/0.98 # User time : 0.339 s
% 3.78/0.98 # System time : 0.024 s
% 3.78/0.98 # Total time : 0.363 s
% 3.78/0.98 # Maximum resident set size: 1516 pages
% 3.78/0.98
% 3.78/0.98 # -------------------------------------------------
% 3.78/0.98 # User time : 2.096 s
% 3.78/0.98 # System time : 0.098 s
% 3.78/0.98 # Total time : 2.194 s
% 3.78/0.98 # Maximum resident set size: 1672 pages
% 3.78/0.98 % E---3.1 exiting
% 3.78/0.98 % E---3.1 exiting
%------------------------------------------------------------------------------