TSTP Solution File: GRP059-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP059-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:53:12 EDT 2024
% Result : Unsatisfiable 1.78s 0.70s
% Output : CNFRefutation 1.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 2
% Syntax : Number of clauses : 50 ( 47 unt; 0 nHn; 7 RR)
% Number of literals : 56 ( 55 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 110 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
inverse(multiply(multiply(multiply(inverse(multiply(multiply(X1,X2),X3)),X1),X2),multiply(X4,inverse(X4)))) = X3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms,negated_conjecture,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms) ).
cnf(c_0_2,axiom,
inverse(multiply(multiply(multiply(inverse(multiply(multiply(X1,X2),X3)),X1),X2),multiply(X4,inverse(X4)))) = X3,
single_axiom ).
cnf(c_0_3,plain,
inverse(multiply(multiply(multiply(X1,multiply(inverse(multiply(multiply(X2,X3),X1)),X2)),X3),multiply(X4,inverse(X4)))) = multiply(X5,inverse(X5)),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(X1,inverse(X1)) = multiply(X2,inverse(X2)),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
inverse(multiply(multiply(multiply(inverse(multiply(X1,inverse(X1))),X2),X3),multiply(X4,inverse(X4)))) = inverse(multiply(X2,X3)),
inference(spm,[status(thm)],[c_0_2,c_0_4]) ).
cnf(c_0_6,plain,
inverse(multiply(multiply(multiply(inverse(multiply(X1,X2)),multiply(inverse(multiply(a1,inverse(a1))),X1)),X2),multiply(X3,inverse(X3)))) = multiply(X4,inverse(X4)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_3]),c_0_3]) ).
cnf(c_0_7,plain,
multiply(X1,inverse(X1)) = inverse(multiply(multiply(inverse(multiply(a1,inverse(a1))),X2),inverse(X2))),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
multiply(X1,inverse(X1)) = inverse(multiply(multiply(inverse(multiply(X2,inverse(X2))),X3),inverse(X3))),
inference(spm,[status(thm)],[c_0_7,c_0_4]) ).
cnf(c_0_9,plain,
multiply(multiply(multiply(multiply(inverse(multiply(multiply(X1,X2),X3)),X1),X2),multiply(X4,inverse(X4))),X3) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_2]),c_0_3]) ).
cnf(c_0_10,plain,
multiply(multiply(multiply(inverse(multiply(X1,inverse(X1))),X2),inverse(X2)),multiply(X3,inverse(X3))) = multiply(X4,inverse(X4)),
inference(spm,[status(thm)],[c_0_4,c_0_8]) ).
cnf(c_0_11,plain,
multiply(multiply(X1,inverse(X1)),inverse(multiply(X2,inverse(X2)))) = multiply(a1,inverse(a1)),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
inverse(multiply(multiply(multiply(X1,inverse(X1)),X2),multiply(X3,inverse(X3)))) = inverse(multiply(inverse(inverse(multiply(X4,inverse(X4)))),X2)),
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
cnf(c_0_13,plain,
inverse(multiply(multiply(multiply(inverse(multiply(X1,X2)),multiply(inverse(multiply(X3,inverse(X3))),X1)),X2),multiply(X4,inverse(X4)))) = multiply(X5,inverse(X5)),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_14,plain,
inverse(multiply(multiply(multiply(inverse(multiply(multiply(X1,inverse(X1)),X2)),X3),inverse(X3)),multiply(X4,inverse(X4)))) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_4]) ).
cnf(c_0_15,plain,
inverse(multiply(multiply(X1,inverse(X1)),multiply(X2,inverse(X2)))) = inverse(multiply(X3,inverse(multiply(inverse(multiply(X4,inverse(X4))),X3)))),
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
cnf(c_0_16,plain,
inverse(multiply(inverse(inverse(multiply(a1,inverse(a1)))),X1)) = inverse(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_8]),c_0_11]),c_0_12]) ).
cnf(c_0_17,plain,
inverse(multiply(inverse(multiply(X1,inverse(X1))),multiply(X2,inverse(X2)))) = multiply(X3,inverse(X3)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
inverse(multiply(multiply(X1,inverse(X1)),multiply(X2,inverse(X2)))) = inverse(multiply(multiply(a1,inverse(a1)),multiply(a1,inverse(a1)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_4]),c_0_15]) ).
cnf(c_0_19,plain,
inverse(inverse(inverse(inverse(multiply(a1,inverse(a1)))))) = inverse(multiply(a1,inverse(a1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_17]) ).
cnf(c_0_20,plain,
inverse(multiply(inverse(inverse(multiply(X1,inverse(X1)))),inverse(multiply(X2,inverse(X2))))) = inverse(multiply(multiply(a1,inverse(a1)),multiply(a1,inverse(a1)))),
inference(spm,[status(thm)],[c_0_12,c_0_18]) ).
cnf(c_0_21,plain,
inverse(multiply(inverse(inverse(multiply(X1,inverse(X1)))),X2)) = inverse(X2),
inference(spm,[status(thm)],[c_0_16,c_0_4]) ).
cnf(c_0_22,plain,
inverse(multiply(multiply(multiply(inverse(multiply(multiply(X1,X2),X3)),X1),X2),multiply(multiply(multiply(multiply(inverse(multiply(multiply(X4,X5),X6)),X4),X5),multiply(X7,inverse(X7))),X6))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_23,plain,
multiply(inverse(inverse(inverse(multiply(a1,inverse(a1))))),inverse(multiply(a1,inverse(a1)))) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_19]),c_0_3]) ).
cnf(c_0_24,plain,
inverse(inverse(multiply(X1,inverse(X1)))) = inverse(multiply(multiply(a1,inverse(a1)),multiply(a1,inverse(a1)))),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
inverse(multiply(multiply(multiply(inverse(multiply(multiply(a1,inverse(a1)),X1)),inverse(inverse(inverse(multiply(a1,inverse(a1)))))),inverse(multiply(a1,inverse(a1)))),multiply(a1,inverse(a1)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_9]) ).
cnf(c_0_26,plain,
inverse(multiply(multiply(X1,inverse(X1)),multiply(X2,inverse(X2)))) = inverse(inverse(multiply(a1,inverse(a1)))),
inference(rw,[status(thm)],[c_0_18,c_0_24]) ).
cnf(c_0_27,plain,
inverse(inverse(multiply(a1,inverse(a1)))) = multiply(X1,inverse(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_11]),c_0_26]) ).
cnf(c_0_28,plain,
inverse(multiply(multiply(X1,inverse(X1)),X2)) = inverse(X2),
inference(spm,[status(thm)],[c_0_21,c_0_27]) ).
cnf(c_0_29,plain,
inverse(multiply(X1,inverse(X1))) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_28]),c_0_15]),c_0_26]),c_0_27]) ).
cnf(c_0_30,plain,
inverse(multiply(multiply(multiply(multiply(a1,inverse(a1)),X1),X2),multiply(a1,inverse(a1)))) = inverse(multiply(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_2]),c_0_29]),c_0_9]) ).
cnf(c_0_31,plain,
multiply(multiply(X1,inverse(X1)),multiply(a1,inverse(a1))) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[c_0_11,c_0_29]) ).
cnf(c_0_32,plain,
inverse(multiply(multiply(multiply(inverse(X1),multiply(a1,inverse(a1))),multiply(a1,inverse(a1))),multiply(a1,inverse(a1)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_29]),c_0_28]),c_0_27]) ).
cnf(c_0_33,plain,
inverse(multiply(multiply(multiply(a1,inverse(a1)),X1),multiply(a1,inverse(a1)))) = inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_28]) ).
cnf(c_0_34,plain,
multiply(multiply(X1,inverse(X1)),X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_28]),c_0_32]) ).
cnf(c_0_35,plain,
inverse(multiply(X1,multiply(a1,inverse(a1)))) = inverse(X1),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_36,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_35]),c_0_35]),c_0_35]) ).
cnf(c_0_37,plain,
multiply(X1,multiply(a1,inverse(a1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_35]),c_0_36]) ).
cnf(c_0_38,plain,
multiply(X1,multiply(X2,inverse(X2))) = X1,
inference(spm,[status(thm)],[c_0_37,c_0_4]) ).
cnf(c_0_39,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_22,c_0_38]),c_0_34]),c_0_9]),c_0_38]) ).
cnf(c_0_40,plain,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(spm,[status(thm)],[c_0_36,c_0_39]) ).
cnf(c_0_41,negated_conjecture,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
inference(fof_simplification,[status(thm)],[prove_these_axioms]) ).
cnf(c_0_42,plain,
multiply(multiply(multiply(multiply(inverse(multiply(X1,inverse(X1))),X2),X3),multiply(X4,inverse(X4))),inverse(multiply(X2,X3))) = multiply(X5,inverse(X5)),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_43,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_40]),c_0_36]) ).
cnf(c_0_44,negated_conjecture,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
c_0_41 ).
cnf(c_0_45,plain,
multiply(inverse(X1),X1) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_36]),c_0_42]) ).
cnf(c_0_46,plain,
inverse(multiply(multiply(X1,X2),X3)) = inverse(multiply(X1,multiply(X2,X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_43]),c_0_36]),c_0_9]),c_0_38]) ).
cnf(c_0_47,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45]),c_0_45]),c_0_45]),c_0_34])]) ).
cnf(c_0_48,plain,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_46]),c_0_36]) ).
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.03/0.12 % Problem : GRP059-1 : TPTP v8.2.0. Released v1.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n021.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 04:34:38 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.78/0.70 # Version: 3.1.0
% 1.78/0.70 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.78/0.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.78/0.70 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.78/0.70 # Starting new_bool_3 with 300s (1) cores
% 1.78/0.70 # Starting new_bool_1 with 300s (1) cores
% 1.78/0.70 # Starting sh5l with 300s (1) cores
% 1.78/0.70 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 12164 completed with status 0
% 1.78/0.70 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.78/0.70 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.78/0.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.78/0.70 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.78/0.70 # No SInE strategy applied
% 1.78/0.70 # Search class: FUHPF-FFSF21-DFFFFFNN
% 1.78/0.70 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.78/0.70 # Starting G-E--_208_C18_F2_SE_CS_SP_PS_S5PRR_RG_S04A with 811s (1) cores
% 1.78/0.70 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.78/0.70 # Starting new_bool_3 with 136s (1) cores
% 1.78/0.70 # Starting new_bool_1 with 136s (1) cores
% 1.78/0.70 # Starting sh5l with 136s (1) cores
% 1.78/0.70 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 12170 completed with status 0
% 1.78/0.70 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.78/0.70 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.78/0.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.78/0.70 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.78/0.70 # No SInE strategy applied
% 1.78/0.70 # Search class: FUHPF-FFSF21-DFFFFFNN
% 1.78/0.70 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.78/0.70 # Starting G-E--_208_C18_F2_SE_CS_SP_PS_S5PRR_RG_S04A with 811s (1) cores
% 1.78/0.70 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.78/0.70 # Preprocessing time : 0.001 s
% 1.78/0.70
% 1.78/0.70 # Proof found!
% 1.78/0.70 # SZS status Unsatisfiable
% 1.78/0.70 # SZS output start CNFRefutation
% See solution above
% 1.78/0.70 # Parsed axioms : 2
% 1.78/0.70 # Removed by relevancy pruning/SinE : 0
% 1.78/0.70 # Initial clauses : 2
% 1.78/0.70 # Removed in clause preprocessing : 0
% 1.78/0.70 # Initial clauses in saturation : 2
% 1.78/0.70 # Processed clauses : 501
% 1.78/0.70 # ...of these trivial : 119
% 1.78/0.70 # ...subsumed : 288
% 1.78/0.70 # ...remaining for further processing : 94
% 1.78/0.70 # Other redundant clauses eliminated : 0
% 1.78/0.70 # Clauses deleted for lack of memory : 0
% 1.78/0.70 # Backward-subsumed : 0
% 1.78/0.70 # Backward-rewritten : 82
% 1.78/0.70 # Generated clauses : 13215
% 1.78/0.70 # ...of the previous two non-redundant : 12093
% 1.78/0.70 # ...aggressively subsumed : 0
% 1.78/0.70 # Contextual simplify-reflections : 0
% 1.78/0.70 # Paramodulations : 13215
% 1.78/0.70 # Factorizations : 0
% 1.78/0.70 # NegExts : 0
% 1.78/0.70 # Equation resolutions : 0
% 1.78/0.70 # Disequality decompositions : 0
% 1.78/0.70 # Total rewrite steps : 12247
% 1.78/0.70 # ...of those cached : 10275
% 1.78/0.70 # Propositional unsat checks : 0
% 1.78/0.70 # Propositional check models : 0
% 1.78/0.70 # Propositional check unsatisfiable : 0
% 1.78/0.70 # Propositional clauses : 0
% 1.78/0.70 # Propositional clauses after purity: 0
% 1.78/0.70 # Propositional unsat core size : 0
% 1.78/0.70 # Propositional preprocessing time : 0.000
% 1.78/0.70 # Propositional encoding time : 0.000
% 1.78/0.70 # Propositional solver time : 0.000
% 1.78/0.70 # Success case prop preproc time : 0.000
% 1.78/0.70 # Success case prop encoding time : 0.000
% 1.78/0.70 # Success case prop solver time : 0.000
% 1.78/0.70 # Current number of processed clauses : 12
% 1.78/0.70 # Positive orientable unit clauses : 11
% 1.78/0.70 # Positive unorientable unit clauses: 1
% 1.78/0.70 # Negative unit clauses : 0
% 1.78/0.70 # Non-unit-clauses : 0
% 1.78/0.70 # Current number of unprocessed clauses: 10304
% 1.78/0.70 # ...number of literals in the above : 10304
% 1.78/0.70 # Current number of archived formulas : 0
% 1.78/0.70 # Current number of archived clauses : 82
% 1.78/0.70 # Clause-clause subsumption calls (NU) : 0
% 1.78/0.70 # Rec. Clause-clause subsumption calls : 0
% 1.78/0.70 # Non-unit clause-clause subsumptions : 0
% 1.78/0.70 # Unit Clause-clause subsumption calls : 189
% 1.78/0.70 # Rewrite failures with RHS unbound : 0
% 1.78/0.70 # BW rewrite match attempts : 881
% 1.78/0.70 # BW rewrite match successes : 232
% 1.78/0.70 # Condensation attempts : 0
% 1.78/0.70 # Condensation successes : 0
% 1.78/0.70 # Termbank termtop insertions : 335272
% 1.78/0.70 # Search garbage collected termcells : 8
% 1.78/0.70
% 1.78/0.70 # -------------------------------------------------
% 1.78/0.70 # User time : 0.202 s
% 1.78/0.70 # System time : 0.015 s
% 1.78/0.70 # Total time : 0.217 s
% 1.78/0.70 # Maximum resident set size: 1556 pages
% 1.78/0.70
% 1.78/0.70 # -------------------------------------------------
% 1.78/0.70 # User time : 1.055 s
% 1.78/0.70 # System time : 0.029 s
% 1.78/0.70 # Total time : 1.084 s
% 1.78/0.70 # Maximum resident set size: 1692 pages
% 1.78/0.70 % E---3.1 exiting
%------------------------------------------------------------------------------