TSTP Solution File: GRP418-1 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : GRP418-1 : TPTP v8.2.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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 Jun 24 06:45:54 EDT 2024
% Result : Unsatisfiable 0.11s 0.59s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 2
% Syntax : Number of clauses : 25 ( 25 unt; 0 nHn; 4 RR)
% Number of literals : 25 ( 24 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 19 ( 4 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 : 71 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))))),multiply(X1,X3))) = X2,
file('/export/starexec/sandbox/tmp/tmp.jjSR7bhfjm/E---3.1_7902.p',single_axiom) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/tmp/tmp.jjSR7bhfjm/E---3.1_7902.p',prove_these_axioms_1) ).
cnf(c_0_2,axiom,
inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))))),multiply(X1,X3))) = X2,
single_axiom ).
cnf(c_0_3,plain,
inverse(multiply(inverse(multiply(X1,inverse(multiply(X2,inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))))),multiply(X1,X3))) = multiply(inverse(multiply(X4,inverse(multiply(inverse(X2),inverse(multiply(X5,inverse(multiply(inverse(X5),X5)))))))),multiply(X4,X5)),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
inverse(inverse(multiply(inverse(multiply(a1,inverse(multiply(X1,inverse(multiply(a1,inverse(multiply(inverse(a1),a1)))))))),multiply(a1,a1)))) = X1,
inference(rw,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_5,plain,
inverse(multiply(inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(X2),inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))))),inverse(multiply(X4,inverse(multiply(multiply(X1,X3),inverse(multiply(inverse(multiply(X1,X3)),multiply(X1,X3))))))))),inverse(multiply(inverse(multiply(X5,inverse(multiply(X2,inverse(multiply(X6,inverse(multiply(inverse(X6),X6)))))))),multiply(X5,X6))))) = inverse(multiply(inverse(multiply(a1,inverse(multiply(X4,inverse(multiply(a1,inverse(multiply(inverse(a1),a1)))))))),multiply(a1,a1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_3]),c_0_3]) ).
cnf(c_0_6,plain,
inverse(inverse(multiply(inverse(multiply(X1,inverse(multiply(X2,inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))))),multiply(X1,X3)))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_3]),c_0_3]),c_0_3]),c_0_4]) ).
cnf(c_0_7,plain,
inverse(multiply(inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(inverse(X2)),inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))))),inverse(multiply(X4,inverse(multiply(multiply(X1,X3),inverse(multiply(inverse(multiply(X1,X3)),multiply(X1,X3))))))))),X2)) = inverse(multiply(inverse(multiply(a1,inverse(multiply(X4,inverse(multiply(a1,inverse(multiply(inverse(a1),a1)))))))),multiply(a1,a1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_3]),c_0_6]) ).
cnf(c_0_8,plain,
inverse(inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(multiply(a1,inverse(multiply(X2,inverse(multiply(a1,inverse(multiply(inverse(a1),a1)))))))),multiply(a1,a1))))),multiply(X1,X3)))) = inverse(multiply(inverse(multiply(X4,inverse(multiply(inverse(inverse(inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))),inverse(multiply(X5,inverse(multiply(inverse(X5),X5)))))))),inverse(multiply(X2,inverse(multiply(multiply(X4,X5),inverse(multiply(inverse(multiply(X4,X5)),multiply(X4,X5))))))))),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
inverse(inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(multiply(a1,inverse(multiply(X2,inverse(multiply(a1,inverse(multiply(inverse(a1),a1)))))))),multiply(a1,a1))))),multiply(X1,X3)))) = inverse(inverse(multiply(inverse(multiply(X4,inverse(multiply(inverse(multiply(a1,inverse(multiply(X2,inverse(multiply(a1,inverse(multiply(inverse(a1),a1)))))))),multiply(a1,a1))))),multiply(X4,X3)))),
inference(spm,[status(thm)],[c_0_8,c_0_8]) ).
cnf(c_0_10,plain,
inverse(inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,X3)))) = inverse(inverse(multiply(inverse(multiply(X4,X2)),multiply(X4,X3)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_3]),c_0_6]),c_0_6]) ).
cnf(c_0_11,plain,
inverse(inverse(multiply(inverse(multiply(X1,multiply(X2,X3))),multiply(X1,X4)))) = inverse(inverse(multiply(X5,multiply(inverse(multiply(X2,inverse(multiply(inverse(X5),inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))))),X4)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_3]),c_0_6]) ).
cnf(c_0_12,plain,
multiply(inverse(multiply(X1,inverse(multiply(X2,inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))))),multiply(X1,X3)) = multiply(inverse(multiply(X4,inverse(multiply(X2,inverse(multiply(X5,inverse(multiply(inverse(X5),X5)))))))),multiply(X4,X5)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_6]),c_0_3]),c_0_6]) ).
cnf(c_0_13,plain,
inverse(inverse(multiply(inverse(multiply(X1,multiply(X2,X3))),multiply(X1,multiply(X2,X3))))) = inverse(inverse(multiply(X4,inverse(multiply(inverse(multiply(a1,inverse(multiply(X4,inverse(multiply(a1,inverse(multiply(inverse(a1),a1)))))))),multiply(a1,a1)))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_3]) ).
cnf(c_0_14,plain,
inverse(inverse(multiply(inverse(multiply(X1,multiply(X2,X3))),multiply(X1,multiply(X2,X3))))) = inverse(inverse(multiply(inverse(X4),X4))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_3]),c_0_6]) ).
cnf(c_0_15,plain,
inverse(multiply(inverse(inverse(multiply(inverse(multiply(X1,inverse(multiply(inverse(multiply(a1,inverse(multiply(X2,inverse(multiply(a1,inverse(multiply(inverse(a1),a1)))))))),multiply(a1,a1))))),multiply(X1,X3)))),inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))) = inverse(multiply(inverse(multiply(a1,inverse(multiply(X2,inverse(multiply(a1,inverse(multiply(inverse(a1),a1)))))))),multiply(a1,a1))),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_16,plain,
inverse(inverse(multiply(inverse(a1),a1))) = inverse(inverse(multiply(inverse(X1),X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_14]),c_0_14]) ).
cnf(c_0_17,plain,
inverse(multiply(inverse(inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,X3)))),inverse(multiply(X3,inverse(multiply(inverse(X3),X3)))))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_3]),c_0_6]),c_0_6]) ).
cnf(c_0_18,plain,
inverse(inverse(multiply(inverse(X1),X1))) = inverse(inverse(multiply(inverse(X2),X2))),
inference(spm,[status(thm)],[c_0_16,c_0_16]) ).
cnf(c_0_19,plain,
inverse(multiply(inverse(inverse(multiply(inverse(X1),X1))),inverse(multiply(X2,inverse(multiply(inverse(X2),X2)))))) = X2,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
inference(fof_simplification,[status(thm)],[prove_these_axioms_1]) ).
cnf(c_0_21,plain,
multiply(inverse(X1),X1) = multiply(inverse(multiply(X2,X3)),multiply(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_19]),c_0_3]),c_0_6]) ).
cnf(c_0_22,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
c_0_20 ).
cnf(c_0_23,plain,
multiply(inverse(X1),X1) = multiply(inverse(a1),a1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_21]),c_0_21]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_22,c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : GRP418-1 : TPTP v8.2.0. Released v2.6.0.
% 0.00/0.07 % Command : run_E %s %d THM
% 0.06/0.25 % Computer : n024.cluster.edu
% 0.06/0.25 % Model : x86_64 x86_64
% 0.06/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25 % Memory : 8042.1875MB
% 0.06/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25 % CPULimit : 300
% 0.06/0.25 % WCLimit : 300
% 0.06/0.25 % DateTime : Thu Jun 20 12:26:53 EDT 2024
% 0.06/0.25 % CPUTime :
% 0.11/0.35 Running first-order theorem proving
% 0.11/0.35 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.jjSR7bhfjm/E---3.1_7902.p
% 0.11/0.59 # Version: 3.2.0
% 0.11/0.59 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.59 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.11/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.11/0.59 # Starting sh5l with 300s (1) cores
% 0.11/0.59 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 8060 completed with status 0
% 0.11/0.59 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.11/0.59 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.59 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.59 # No SInE strategy applied
% 0.11/0.59 # Search class: FUUPF-FFSF21-DFFFFFNN
% 0.11/0.59 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.59 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.11/0.59 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.11/0.59 # Starting new_bool_3 with 136s (1) cores
% 0.11/0.59 # Starting new_bool_1 with 136s (1) cores
% 0.11/0.59 # Starting sh5l with 136s (1) cores
% 0.11/0.59 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 8066 completed with status 0
% 0.11/0.59 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.11/0.59 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.59 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.59 # No SInE strategy applied
% 0.11/0.59 # Search class: FUUPF-FFSF21-DFFFFFNN
% 0.11/0.59 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.59 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.11/0.59 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.11/0.59 # Preprocessing time : 0.001 s
% 0.11/0.59
% 0.11/0.59 # Proof found!
% 0.11/0.59 # SZS status Unsatisfiable
% 0.11/0.59 # SZS output start CNFRefutation
% See solution above
% 0.11/0.59 # Parsed axioms : 2
% 0.11/0.59 # Removed by relevancy pruning/SinE : 0
% 0.11/0.59 # Initial clauses : 2
% 0.11/0.59 # Removed in clause preprocessing : 0
% 0.11/0.59 # Initial clauses in saturation : 2
% 0.11/0.59 # Processed clauses : 277
% 0.11/0.59 # ...of these trivial : 44
% 0.11/0.59 # ...subsumed : 133
% 0.11/0.59 # ...remaining for further processing : 100
% 0.11/0.59 # Other redundant clauses eliminated : 0
% 0.11/0.59 # Clauses deleted for lack of memory : 0
% 0.11/0.59 # Backward-subsumed : 7
% 0.11/0.59 # Backward-rewritten : 21
% 0.11/0.59 # Generated clauses : 11234
% 0.11/0.59 # ...of the previous two non-redundant : 10240
% 0.11/0.59 # ...aggressively subsumed : 0
% 0.11/0.59 # Contextual simplify-reflections : 0
% 0.11/0.59 # Paramodulations : 11233
% 0.11/0.59 # Factorizations : 0
% 0.11/0.59 # NegExts : 0
% 0.11/0.59 # Equation resolutions : 0
% 0.11/0.59 # Disequality decompositions : 0
% 0.11/0.59 # Total rewrite steps : 6869
% 0.11/0.59 # ...of those cached : 6363
% 0.11/0.59 # Propositional unsat checks : 0
% 0.11/0.59 # Propositional check models : 0
% 0.11/0.59 # Propositional check unsatisfiable : 0
% 0.11/0.59 # Propositional clauses : 0
% 0.11/0.59 # Propositional clauses after purity: 0
% 0.11/0.59 # Propositional unsat core size : 0
% 0.11/0.59 # Propositional preprocessing time : 0.000
% 0.11/0.59 # Propositional encoding time : 0.000
% 0.11/0.59 # Propositional solver time : 0.000
% 0.11/0.59 # Success case prop preproc time : 0.000
% 0.11/0.59 # Success case prop encoding time : 0.000
% 0.11/0.59 # Success case prop solver time : 0.000
% 0.11/0.59 # Current number of processed clauses : 71
% 0.11/0.59 # Positive orientable unit clauses : 57
% 0.11/0.59 # Positive unorientable unit clauses: 14
% 0.11/0.59 # Negative unit clauses : 0
% 0.11/0.59 # Non-unit-clauses : 0
% 0.11/0.59 # Current number of unprocessed clauses: 9818
% 0.11/0.59 # ...number of literals in the above : 9818
% 0.11/0.59 # Current number of archived formulas : 0
% 0.11/0.59 # Current number of archived clauses : 29
% 0.11/0.59 # Clause-clause subsumption calls (NU) : 0
% 0.11/0.59 # Rec. Clause-clause subsumption calls : 0
% 0.11/0.59 # Non-unit clause-clause subsumptions : 0
% 0.11/0.59 # Unit Clause-clause subsumption calls : 616
% 0.11/0.59 # Rewrite failures with RHS unbound : 0
% 0.11/0.59 # BW rewrite match attempts : 3151
% 0.11/0.59 # BW rewrite match successes : 120
% 0.11/0.59 # Condensation attempts : 0
% 0.11/0.59 # Condensation successes : 0
% 0.11/0.59 # Termbank termtop insertions : 1064693
% 0.11/0.59 # Search garbage collected termcells : 2
% 0.11/0.59
% 0.11/0.59 # -------------------------------------------------
% 0.11/0.59 # User time : 0.215 s
% 0.11/0.59 # System time : 0.013 s
% 0.11/0.59 # Total time : 0.228 s
% 0.11/0.59 # Maximum resident set size: 1544 pages
% 0.11/0.59
% 0.11/0.59 # -------------------------------------------------
% 0.11/0.59 # User time : 1.117 s
% 0.11/0.59 # System time : 0.025 s
% 0.11/0.59 # Total time : 1.142 s
% 0.11/0.59 # Maximum resident set size: 1688 pages
% 0.11/0.59 % E---3.1 exiting
% 0.11/0.59 % E exiting
%------------------------------------------------------------------------------