TSTP Solution File: GRP440-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP440-1 : TPTP v8.2.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:01 EDT 2024
% Result : Unsatisfiable 3.16s 0.90s
% Output : CNFRefutation 3.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 2
% Syntax : Number of clauses : 46 ( 46 unt; 0 nHn; 10 RR)
% Number of literals : 46 ( 45 equ; 7 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 14 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 124 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
inverse(multiply(X1,multiply(X2,multiply(multiply(inverse(X2),X3),inverse(multiply(X4,multiply(X1,X3))))))) = X4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_2,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_2) ).
cnf(c_0_2,axiom,
inverse(multiply(X1,multiply(X2,multiply(multiply(inverse(X2),X3),inverse(multiply(X4,multiply(X1,X3))))))) = X4,
single_axiom ).
cnf(c_0_3,plain,
inverse(multiply(X1,multiply(X2,multiply(multiply(inverse(X2),multiply(multiply(inverse(X1),X3),inverse(multiply(X4,multiply(X5,X3))))),X4)))) = X5,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
inverse(multiply(X1,multiply(multiply(X2,multiply(X3,multiply(multiply(inverse(X3),X4),inverse(multiply(X5,multiply(X2,X4)))))),multiply(multiply(X5,X6),inverse(multiply(X7,multiply(X1,X6))))))) = X7,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_5,plain,
inverse(multiply(X1,multiply(X2,multiply(multiply(inverse(X2),multiply(multiply(inverse(X1),multiply(multiply(inverse(X3),X4),inverse(multiply(X5,multiply(X6,X4))))),X5)),X6)))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_6,plain,
inverse(multiply(X1,multiply(X2,multiply(multiply(inverse(X2),multiply(multiply(inverse(X1),multiply(multiply(X3,X4),inverse(multiply(X5,multiply(X6,X4))))),X5)),X6)))) = multiply(X7,multiply(X8,multiply(multiply(inverse(X8),X9),inverse(multiply(X3,multiply(X7,X9)))))),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,plain,
multiply(b2,multiply(b2,multiply(multiply(inverse(b2),b2),inverse(multiply(inverse(X1),multiply(b2,b2)))))) = X1,
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
multiply(X1,multiply(X2,multiply(multiply(inverse(X2),X3),inverse(multiply(X4,multiply(X1,X3)))))) = multiply(X5,multiply(X6,multiply(multiply(inverse(X6),X7),inverse(multiply(X4,multiply(X5,X7)))))),
inference(spm,[status(thm)],[c_0_6,c_0_6]) ).
cnf(c_0_9,plain,
multiply(X1,multiply(X2,multiply(multiply(inverse(X2),X3),inverse(multiply(inverse(X4),multiply(X1,X3)))))) = X4,
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
inverse(multiply(X1,multiply(X2,multiply(X3,inverse(multiply(X4,multiply(X1,multiply(X5,multiply(multiply(inverse(X5),X6),inverse(multiply(inverse(X3),multiply(inverse(X2),X6)))))))))))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_9]) ).
cnf(c_0_11,plain,
inverse(multiply(inverse(X1),multiply(X1,multiply(X2,inverse(multiply(X3,X2)))))) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_8]),c_0_9]) ).
cnf(c_0_12,plain,
multiply(X1,multiply(X2,multiply(multiply(inverse(X2),multiply(X3,inverse(multiply(X4,X3)))),X4))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_11]),c_0_9]) ).
cnf(c_0_13,plain,
inverse(multiply(X1,multiply(X2,multiply(inverse(X2),inverse(multiply(X3,X1)))))) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_12]),c_0_12]) ).
cnf(c_0_14,plain,
multiply(X1,multiply(X2,multiply(inverse(X2),inverse(multiply(inverse(X3),X1))))) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_12]),c_0_12]) ).
cnf(c_0_15,plain,
multiply(X1,multiply(X2,multiply(multiply(inverse(X2),multiply(multiply(X3,multiply(inverse(X3),inverse(multiply(X4,X5)))),X4)),X5))) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
multiply(multiply(X1,multiply(X2,inverse(multiply(X3,X2)))),multiply(X4,multiply(inverse(X4),X3))) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_11]) ).
cnf(c_0_17,plain,
multiply(X1,multiply(X2,multiply(inverse(X2),multiply(multiply(X3,multiply(inverse(X3),inverse(X4))),X4)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_15]),c_0_15]) ).
cnf(c_0_18,plain,
multiply(X1,multiply(X2,inverse(multiply(multiply(multiply(X3,multiply(inverse(X3),inverse(X4))),X4),X2)))) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,plain,
inverse(multiply(inverse(X1),X1)) = multiply(multiply(X2,multiply(inverse(X2),inverse(X3))),X3),
inference(spm,[status(thm)],[c_0_2,c_0_18]) ).
cnf(c_0_20,plain,
inverse(multiply(multiply(X1,multiply(inverse(X1),inverse(multiply(X2,X3)))),multiply(X4,multiply(inverse(X4),X2)))) = X3,
inference(spm,[status(thm)],[c_0_13,c_0_13]) ).
cnf(c_0_21,plain,
multiply(X1,multiply(X2,multiply(inverse(X2),inverse(multiply(inverse(X3),X3))))) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_19]) ).
cnf(c_0_22,plain,
inverse(inverse(multiply(inverse(X1),X1))) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_23,plain,
multiply(X1,multiply(inverse(multiply(inverse(X2),X2)),multiply(inverse(b2),b2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_22]) ).
cnf(c_0_24,plain,
multiply(inverse(X1),X1) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_22,c_0_22]) ).
cnf(c_0_25,plain,
multiply(X1,multiply(inverse(b2),b2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_22]),c_0_22]),c_0_24]) ).
cnf(c_0_26,plain,
inverse(multiply(inverse(b2),b2)) = multiply(inverse(b2),b2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_25]),c_0_22]),c_0_19]) ).
cnf(c_0_27,plain,
multiply(b2,multiply(X1,inverse(X1))) = b2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_26]),c_0_25]) ).
cnf(c_0_28,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
inference(fof_simplification,[status(thm)],[prove_these_axioms_2]) ).
cnf(c_0_29,plain,
inverse(multiply(inverse(X1),X1)) = multiply(b2,inverse(b2)),
inference(spm,[status(thm)],[c_0_19,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
c_0_28 ).
cnf(c_0_31,plain,
multiply(X1,inverse(multiply(inverse(X2),X2))) = X1,
inference(rw,[status(thm)],[c_0_23,c_0_25]) ).
cnf(c_0_32,plain,
multiply(inverse(b2),b2) = multiply(b2,inverse(b2)),
inference(rw,[status(thm)],[c_0_26,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
multiply(multiply(inverse(X1),X1),a2) != a2,
inference(spm,[status(thm)],[c_0_30,c_0_24]) ).
cnf(c_0_34,plain,
multiply(multiply(X1,multiply(X2,inverse(multiply(multiply(inverse(inverse(X3)),inverse(multiply(inverse(X4),X3))),X2)))),X4) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_35,plain,
multiply(X1,multiply(b2,inverse(b2))) = X1,
inference(rw,[status(thm)],[c_0_31,c_0_29]) ).
cnf(c_0_36,plain,
multiply(inverse(X1),X1) = multiply(b2,inverse(b2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_22]),c_0_32]) ).
cnf(c_0_37,negated_conjecture,
inverse(multiply(X1,inverse(multiply(multiply(inverse(inverse(X2)),inverse(multiply(inverse(a2),X2))),X1)))) != a2,
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
inverse(multiply(inverse(X1),multiply(X1,multiply(multiply(X2,multiply(inverse(X2),inverse(multiply(X3,X4)))),X3)))) = X4,
inference(spm,[status(thm)],[c_0_11,c_0_13]) ).
cnf(c_0_39,plain,
multiply(X1,multiply(X2,inverse(X2))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_35]),c_0_35]),c_0_19]),c_0_29]),c_0_35]) ).
cnf(c_0_40,plain,
inverse(multiply(X1,inverse(X1))) = multiply(b2,inverse(b2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_36]),c_0_19]),c_0_29]),c_0_35]) ).
cnf(c_0_41,negated_conjecture,
inverse(multiply(X1,inverse(multiply(multiply(inverse(inverse(a2)),inverse(multiply(inverse(X2),X2))),X1)))) != a2,
inference(spm,[status(thm)],[c_0_37,c_0_24]) ).
cnf(c_0_42,plain,
multiply(b2,inverse(b2)) = multiply(X1,inverse(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_19]),c_0_29]),c_0_39]),c_0_36]),c_0_40]) ).
cnf(c_0_43,negated_conjecture,
inverse(inverse(inverse(inverse(a2)))) != a2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_40]),c_0_36]),c_0_40]),c_0_35]),c_0_35]) ).
cnf(c_0_44,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_42]),c_0_40]),c_0_35]),c_0_39]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44]),c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP440-1 : TPTP v8.2.0. Released v2.6.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n025.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 04:30:38 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 3.16/0.90 # Version: 3.1.0
% 3.16/0.90 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.16/0.90 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.16/0.90 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.16/0.90 # Starting new_bool_3 with 300s (1) cores
% 3.16/0.90 # Starting new_bool_1 with 300s (1) cores
% 3.16/0.90 # Starting sh5l with 300s (1) cores
% 3.16/0.90 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 27061 completed with status 0
% 3.16/0.90 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 3.16/0.90 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.16/0.90 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.16/0.90 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.16/0.90 # No SInE strategy applied
% 3.16/0.90 # Search class: FUUPF-FFSF21-DFFFFFNN
% 3.16/0.90 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 3.16/0.90 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 3.16/0.90 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 3.16/0.90 # Starting new_bool_3 with 136s (1) cores
% 3.16/0.90 # Starting new_bool_1 with 136s (1) cores
% 3.16/0.90 # Starting sh5l with 136s (1) cores
% 3.16/0.90 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 27065 completed with status 0
% 3.16/0.90 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 3.16/0.90 # Preprocessing class: FSSSSMSSSSSNFFN.
% 3.16/0.90 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.16/0.90 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.16/0.90 # No SInE strategy applied
% 3.16/0.90 # Search class: FUUPF-FFSF21-DFFFFFNN
% 3.16/0.90 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 3.16/0.90 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 3.16/0.90 # Preprocessing time : 0.001 s
% 3.16/0.90 # Presaturation interreduction done
% 3.16/0.90
% 3.16/0.90 # Proof found!
% 3.16/0.90 # SZS status Unsatisfiable
% 3.16/0.90 # SZS output start CNFRefutation
% See solution above
% 3.16/0.90 # Parsed axioms : 2
% 3.16/0.90 # Removed by relevancy pruning/SinE : 0
% 3.16/0.90 # Initial clauses : 2
% 3.16/0.90 # Removed in clause preprocessing : 0
% 3.16/0.90 # Initial clauses in saturation : 2
% 3.16/0.90 # Processed clauses : 337
% 3.16/0.90 # ...of these trivial : 57
% 3.16/0.90 # ...subsumed : 166
% 3.16/0.90 # ...remaining for further processing : 114
% 3.16/0.90 # Other redundant clauses eliminated : 0
% 3.16/0.90 # Clauses deleted for lack of memory : 0
% 3.16/0.90 # Backward-subsumed : 7
% 3.16/0.90 # Backward-rewritten : 33
% 3.16/0.90 # Generated clauses : 22699
% 3.16/0.90 # ...of the previous two non-redundant : 22104
% 3.16/0.90 # ...aggressively subsumed : 0
% 3.16/0.90 # Contextual simplify-reflections : 0
% 3.16/0.90 # Paramodulations : 22699
% 3.16/0.90 # Factorizations : 0
% 3.16/0.90 # NegExts : 0
% 3.16/0.90 # Equation resolutions : 0
% 3.16/0.90 # Disequality decompositions : 0
% 3.16/0.90 # Total rewrite steps : 5905
% 3.16/0.90 # ...of those cached : 4769
% 3.16/0.90 # Propositional unsat checks : 0
% 3.16/0.90 # Propositional check models : 0
% 3.16/0.90 # Propositional check unsatisfiable : 0
% 3.16/0.90 # Propositional clauses : 0
% 3.16/0.90 # Propositional clauses after purity: 0
% 3.16/0.90 # Propositional unsat core size : 0
% 3.16/0.90 # Propositional preprocessing time : 0.000
% 3.16/0.90 # Propositional encoding time : 0.000
% 3.16/0.90 # Propositional solver time : 0.000
% 3.16/0.90 # Success case prop preproc time : 0.000
% 3.16/0.90 # Success case prop encoding time : 0.000
% 3.16/0.90 # Success case prop solver time : 0.000
% 3.16/0.90 # Current number of processed clauses : 72
% 3.16/0.90 # Positive orientable unit clauses : 52
% 3.16/0.90 # Positive unorientable unit clauses: 4
% 3.16/0.90 # Negative unit clauses : 16
% 3.16/0.90 # Non-unit-clauses : 0
% 3.16/0.90 # Current number of unprocessed clauses: 21634
% 3.16/0.90 # ...number of literals in the above : 21634
% 3.16/0.90 # Current number of archived formulas : 0
% 3.16/0.90 # Current number of archived clauses : 42
% 3.16/0.90 # Clause-clause subsumption calls (NU) : 0
% 3.16/0.90 # Rec. Clause-clause subsumption calls : 0
% 3.16/0.90 # Non-unit clause-clause subsumptions : 0
% 3.16/0.90 # Unit Clause-clause subsumption calls : 249
% 3.16/0.90 # Rewrite failures with RHS unbound : 0
% 3.16/0.90 # BW rewrite match attempts : 1192
% 3.16/0.90 # BW rewrite match successes : 52
% 3.16/0.90 # Condensation attempts : 0
% 3.16/0.90 # Condensation successes : 0
% 3.16/0.90 # Termbank termtop insertions : 797712
% 3.16/0.90 # Search garbage collected termcells : 2
% 3.16/0.90
% 3.16/0.90 # -------------------------------------------------
% 3.16/0.90 # User time : 0.373 s
% 3.16/0.90 # System time : 0.020 s
% 3.16/0.90 # Total time : 0.393 s
% 3.16/0.90 # Maximum resident set size: 1540 pages
% 3.16/0.90
% 3.16/0.90 # -------------------------------------------------
% 3.16/0.90 # User time : 1.892 s
% 3.16/0.90 # System time : 0.041 s
% 3.16/0.90 # Total time : 1.933 s
% 3.16/0.90 # Maximum resident set size: 1680 pages
% 3.16/0.90 % E---3.1 exiting
% 3.16/0.90 % E exiting
%------------------------------------------------------------------------------