TSTP Solution File: GRP444-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP444-1 : TPTP v8.2.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 : 300s
% DateTime : Mon May 20 20:49:03 EDT 2024
% Result : Unsatisfiable 2.50s 0.84s
% Output : CNFRefutation 2.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 2
% Syntax : Number of clauses : 46 ( 46 unt; 0 nHn; 4 RR)
% Number of literals : 46 ( 45 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 12 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 141 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
inverse(multiply(X1,multiply(X2,multiply(multiply(X3,inverse(X3)),inverse(multiply(X4,multiply(X1,X2))))))) = X4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(c_0_2,axiom,
inverse(multiply(X1,multiply(X2,multiply(multiply(X3,inverse(X3)),inverse(multiply(X4,multiply(X1,X2))))))) = X4,
single_axiom ).
cnf(c_0_3,plain,
inverse(multiply(X1,multiply(multiply(multiply(X2,inverse(X2)),inverse(multiply(X3,multiply(X4,X1)))),multiply(multiply(X5,inverse(X5)),X3)))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
inverse(multiply(multiply(multiply(X1,inverse(X1)),inverse(multiply(X2,multiply(X3,X4)))),multiply(multiply(multiply(X5,inverse(X5)),X2),multiply(multiply(X6,inverse(X6)),X3)))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_5,plain,
inverse(multiply(multiply(multiply(X1,inverse(X1)),X2),multiply(multiply(multiply(X3,inverse(X3)),X4),multiply(multiply(X5,inverse(X5)),X6)))) = multiply(multiply(X7,inverse(X7)),inverse(multiply(X2,multiply(X4,X6)))),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_6,plain,
multiply(multiply(a3,inverse(a3)),inverse(multiply(inverse(multiply(X1,multiply(X2,X3))),multiply(X1,X2)))) = X3,
inference(rw,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
multiply(multiply(a3,inverse(a3)),X1) = multiply(multiply(X2,inverse(X2)),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_3]),c_0_2]) ).
cnf(c_0_8,plain,
multiply(a3,inverse(a3)) = multiply(X1,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_7]),c_0_2]) ).
cnf(c_0_9,plain,
multiply(X1,inverse(X1)) = multiply(X2,inverse(X2)),
inference(spm,[status(thm)],[c_0_8,c_0_8]) ).
cnf(c_0_10,plain,
inverse(multiply(X1,multiply(inverse(X1),multiply(multiply(X2,inverse(X2)),inverse(multiply(X3,multiply(X4,inverse(X4)))))))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_9]) ).
cnf(c_0_11,plain,
multiply(multiply(X1,inverse(X1)),inverse(multiply(inverse(multiply(X2,multiply(X3,X4))),multiply(X2,X3)))) = X4,
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_12,plain,
inverse(multiply(X1,multiply(inverse(X1),X2))) = inverse(multiply(X3,multiply(inverse(X3),X2))),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,plain,
inverse(multiply(inverse(X1),multiply(X2,multiply(multiply(X3,inverse(X3)),inverse(multiply(X4,multiply(inverse(X4),X2))))))) = X1,
inference(spm,[status(thm)],[c_0_2,c_0_12]) ).
cnf(c_0_14,plain,
multiply(multiply(X1,inverse(X1)),inverse(multiply(inverse(multiply(X2,multiply(inverse(X2),X3))),multiply(X4,inverse(X4))))) = X3,
inference(spm,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_15,plain,
multiply(X1,multiply(inverse(X1),X2)) = multiply(X3,multiply(inverse(X3),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_12]),c_0_13]) ).
cnf(c_0_16,plain,
multiply(X1,inverse(X1)) = multiply(multiply(X2,multiply(inverse(X2),X3)),inverse(multiply(X4,multiply(inverse(X4),X3)))),
inference(spm,[status(thm)],[c_0_9,c_0_12]) ).
cnf(c_0_17,plain,
inverse(multiply(inverse(X1),multiply(inverse(inverse(inverse(multiply(X2,multiply(inverse(X2),X3))))),X3))) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
multiply(X1,multiply(X2,multiply(inverse(X2),X3))) = multiply(X4,multiply(inverse(X4),multiply(inverse(inverse(X1)),X3))),
inference(spm,[status(thm)],[c_0_15,c_0_15]) ).
cnf(c_0_19,plain,
multiply(multiply(inverse(X1),multiply(inverse(inverse(inverse(multiply(X2,multiply(inverse(X2),X3))))),X3)),X1) = multiply(a3,inverse(a3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_16]) ).
cnf(c_0_20,plain,
multiply(X1,multiply(inverse(X1),multiply(inverse(multiply(X2,multiply(inverse(X2),X3))),X3))) = multiply(a3,inverse(a3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_17]) ).
cnf(c_0_21,plain,
multiply(multiply(X1,inverse(X1)),inverse(multiply(inverse(multiply(X2,multiply(X3,inverse(X3)))),multiply(X2,X4)))) = inverse(X4),
inference(spm,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_22,plain,
inverse(multiply(X1,multiply(X2,multiply(multiply(multiply(X3,multiply(X4,multiply(multiply(X5,inverse(X5)),inverse(multiply(X6,multiply(X3,X4)))))),X6),inverse(multiply(X7,multiply(X1,X2))))))) = X7,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_23,plain,
multiply(inverse(X1),multiply(inverse(multiply(X2,multiply(inverse(X2),X3))),X3)) = inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_20]),c_0_21]) ).
cnf(c_0_24,plain,
inverse(multiply(multiply(multiply(multiply(X1,multiply(X2,multiply(multiply(X3,inverse(X3)),inverse(multiply(X4,multiply(X1,X2)))))),X4),inverse(multiply(X5,multiply(X6,X7)))),multiply(multiply(multiply(X8,inverse(X8)),X5),multiply(multiply(X9,inverse(X9)),X6)))) = X7,
inference(spm,[status(thm)],[c_0_3,c_0_22]) ).
cnf(c_0_25,plain,
multiply(inverse(X1),inverse(multiply(X2,inverse(X2)))) = inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_23]),c_0_23]) ).
cnf(c_0_26,plain,
multiply(X1,multiply(inverse(multiply(X2,multiply(inverse(X2),X3))),X3)) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
multiply(X1,inverse(multiply(X2,inverse(X2)))) = X1,
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_28,plain,
multiply(X1,multiply(inverse(multiply(X2,multiply(X3,multiply(inverse(X3),X4)))),multiply(inverse(inverse(X2)),X4))) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_15]) ).
cnf(c_0_29,plain,
inverse(multiply(inverse(X1),multiply(inverse(multiply(X2,inverse(X2))),multiply(X3,inverse(X3))))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_27]),c_0_27]) ).
cnf(c_0_30,plain,
multiply(X1,multiply(X2,multiply(inverse(inverse(inverse(X2))),inverse(inverse(inverse(multiply(X3,inverse(X3)))))))) = X1,
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,plain,
multiply(X1,multiply(inverse(X1),inverse(inverse(X2)))) = multiply(X2,multiply(a3,inverse(a3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_16]) ).
cnf(c_0_32,plain,
multiply(inverse(inverse(X1)),multiply(inverse(multiply(X2,inverse(X2))),multiply(a3,inverse(a3)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_30]),c_0_31]) ).
cnf(c_0_33,plain,
multiply(X1,multiply(inverse(multiply(X2,multiply(inverse(X3),X3))),X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_32]),c_0_32]) ).
cnf(c_0_34,plain,
multiply(X1,multiply(X2,inverse(X2))) = X1,
inference(spm,[status(thm)],[c_0_33,c_0_29]) ).
cnf(c_0_35,plain,
multiply(multiply(X1,inverse(X1)),inverse(multiply(inverse(multiply(X2,multiply(a3,inverse(a3)))),multiply(X3,inverse(X3))))) = inverse(inverse(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_16]),c_0_16]) ).
cnf(c_0_36,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_34]),c_0_27]) ).
cnf(c_0_37,plain,
multiply(multiply(X1,inverse(X1)),X2) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_34]),c_0_34]),c_0_36]),c_0_36]) ).
cnf(c_0_38,plain,
inverse(multiply(inverse(multiply(X1,X2)),X1)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_37]),c_0_34]),c_0_37]),c_0_37]) ).
cnf(c_0_39,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_34]),c_0_36]) ).
cnf(c_0_40,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(fof_simplification,[status(thm)],[prove_these_axioms_3]) ).
cnf(c_0_41,plain,
multiply(X1,multiply(X2,multiply(multiply(X3,inverse(X3)),inverse(multiply(inverse(X4),multiply(X1,X2)))))) = X4,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_29]),c_0_27]) ).
cnf(c_0_42,plain,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_38]),c_0_39]),c_0_37]),c_0_34]) ).
cnf(c_0_43,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
c_0_40 ).
cnf(c_0_44,plain,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_36]),c_0_37]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP444-1 : TPTP v8.2.0. Released v2.6.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n029.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 : 300
% 0.12/0.33 % DateTime : Sun May 19 05:33:37 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.20/0.46 Running first-order theorem proving
% 0.20/0.46 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/benchmark/theBenchmark.p
% 2.50/0.84 # Version: 3.1.0
% 2.50/0.84 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.50/0.84 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.50/0.84 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.50/0.84 # Starting new_bool_3 with 300s (1) cores
% 2.50/0.84 # Starting new_bool_1 with 300s (1) cores
% 2.50/0.84 # Starting sh5l with 300s (1) cores
% 2.50/0.84 # new_bool_1 with pid 16537 completed with status 8
% 2.50/0.84 # new_bool_3 with pid 16536 completed with status 8
% 2.50/0.84 # sh5l with pid 16538 completed with status 0
% 2.50/0.84 # Result found by sh5l
% 2.50/0.84 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.50/0.84 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.50/0.84 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.50/0.84 # Starting new_bool_3 with 300s (1) cores
% 2.50/0.84 # Starting new_bool_1 with 300s (1) cores
% 2.50/0.84 # Starting sh5l with 300s (1) cores
% 2.50/0.84 # SinE strategy is gf500_gu_R04_F100_L20000
% 2.50/0.84 # Search class: FUUPF-FFSF21-DFFFFFNN
% 2.50/0.84 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.50/0.84 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 2.50/0.84 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 16545 completed with status 0
% 2.50/0.84 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.50/0.84 # Preprocessing class: FSSSSMSSSSSNFFN.
% 2.50/0.84 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.50/0.84 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.50/0.84 # Starting new_bool_3 with 300s (1) cores
% 2.50/0.84 # Starting new_bool_1 with 300s (1) cores
% 2.50/0.84 # Starting sh5l with 300s (1) cores
% 2.50/0.84 # SinE strategy is gf500_gu_R04_F100_L20000
% 2.50/0.84 # Search class: FUUPF-FFSF21-DFFFFFNN
% 2.50/0.84 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.50/0.84 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 2.50/0.84 # Preprocessing time : 0.001 s
% 2.50/0.84 # Presaturation interreduction done
% 2.50/0.84
% 2.50/0.84 # Proof found!
% 2.50/0.84 # SZS status Unsatisfiable
% 2.50/0.84 # SZS output start CNFRefutation
% See solution above
% 2.50/0.84 # Parsed axioms : 2
% 2.50/0.84 # Removed by relevancy pruning/SinE : 0
% 2.50/0.84 # Initial clauses : 2
% 2.50/0.84 # Removed in clause preprocessing : 0
% 2.50/0.84 # Initial clauses in saturation : 2
% 2.50/0.84 # Processed clauses : 528
% 2.50/0.84 # ...of these trivial : 97
% 2.50/0.84 # ...subsumed : 332
% 2.50/0.84 # ...remaining for further processing : 99
% 2.50/0.84 # Other redundant clauses eliminated : 0
% 2.50/0.84 # Clauses deleted for lack of memory : 0
% 2.50/0.84 # Backward-subsumed : 4
% 2.50/0.84 # Backward-rewritten : 48
% 2.50/0.84 # Generated clauses : 22857
% 2.50/0.84 # ...of the previous two non-redundant : 20595
% 2.50/0.84 # ...aggressively subsumed : 0
% 2.50/0.84 # Contextual simplify-reflections : 0
% 2.50/0.84 # Paramodulations : 22857
% 2.50/0.84 # Factorizations : 0
% 2.50/0.84 # NegExts : 0
% 2.50/0.84 # Equation resolutions : 0
% 2.50/0.84 # Disequality decompositions : 0
% 2.50/0.84 # Total rewrite steps : 12185
% 2.50/0.84 # ...of those cached : 9592
% 2.50/0.84 # Propositional unsat checks : 0
% 2.50/0.84 # Propositional check models : 0
% 2.50/0.84 # Propositional check unsatisfiable : 0
% 2.50/0.84 # Propositional clauses : 0
% 2.50/0.84 # Propositional clauses after purity: 0
% 2.50/0.84 # Propositional unsat core size : 0
% 2.50/0.84 # Propositional preprocessing time : 0.000
% 2.50/0.84 # Propositional encoding time : 0.000
% 2.50/0.84 # Propositional solver time : 0.000
% 2.50/0.84 # Success case prop preproc time : 0.000
% 2.50/0.84 # Success case prop encoding time : 0.000
% 2.50/0.84 # Success case prop solver time : 0.000
% 2.50/0.84 # Current number of processed clauses : 45
% 2.50/0.84 # Positive orientable unit clauses : 44
% 2.50/0.84 # Positive unorientable unit clauses: 1
% 2.50/0.84 # Negative unit clauses : 0
% 2.50/0.84 # Non-unit-clauses : 0
% 2.50/0.84 # Current number of unprocessed clauses: 19891
% 2.50/0.84 # ...number of literals in the above : 19891
% 2.50/0.84 # Current number of archived formulas : 0
% 2.50/0.84 # Current number of archived clauses : 54
% 2.50/0.84 # Clause-clause subsumption calls (NU) : 0
% 2.50/0.84 # Rec. Clause-clause subsumption calls : 0
% 2.50/0.84 # Non-unit clause-clause subsumptions : 0
% 2.50/0.84 # Unit Clause-clause subsumption calls : 114
% 2.50/0.84 # Rewrite failures with RHS unbound : 0
% 2.50/0.84 # BW rewrite match attempts : 984
% 2.50/0.84 # BW rewrite match successes : 105
% 2.50/0.84 # Condensation attempts : 0
% 2.50/0.84 # Condensation successes : 0
% 2.50/0.84 # Termbank termtop insertions : 713114
% 2.50/0.84 # Search garbage collected termcells : 2
% 2.50/0.84
% 2.50/0.84 # -------------------------------------------------
% 2.50/0.84 # User time : 0.347 s
% 2.50/0.84 # System time : 0.023 s
% 2.50/0.84 # Total time : 0.370 s
% 2.50/0.84 # Maximum resident set size: 1612 pages
% 2.50/0.84
% 2.50/0.84 # -------------------------------------------------
% 2.50/0.84 # User time : 0.376 s
% 2.50/0.84 # System time : 0.041 s
% 2.50/0.84 # Total time : 0.417 s
% 2.50/0.84 # Maximum resident set size: 1684 pages
% 2.50/0.84 % E---3.1 exiting
% 2.50/0.85 % E exiting
%------------------------------------------------------------------------------