TSTP Solution File: GRP404-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP404-1 : TPTP v8.2.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:47:52 EDT 2024
% Result : Unsatisfiable 7.67s 1.41s
% Output : CNFRefutation 7.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 2
% Syntax : Number of clauses : 45 ( 45 unt; 0 nHn; 8 RR)
% Number of literals : 45 ( 44 equ; 6 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 10 ( 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 : 135 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X1,X2)),X3)),inverse(multiply(X2,multiply(inverse(X2),X2)))))) = X3,
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,
multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X1,X2)),X3)),inverse(multiply(X2,multiply(inverse(X2),X2)))))) = X3,
single_axiom ).
cnf(c_0_3,plain,
multiply(X1,inverse(multiply(inverse(X2),inverse(multiply(X3,multiply(inverse(X3),X3)))))) = inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X1,X3)),X4)),X2)),inverse(multiply(X4,multiply(inverse(X4),X4))))),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X1,X2)),X3)),multiply(inverse(multiply(X1,X2)),X4))),inverse(multiply(X3,multiply(inverse(X3),X3))))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_5,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,inverse(multiply(inverse(X3),inverse(multiply(X2,multiply(inverse(X2),X2))))))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_6,plain,
inverse(multiply(inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,X3))),inverse(multiply(X2,multiply(inverse(X2),X2))))) = X3,
inference(spm,[status(thm)],[c_0_4,c_0_4]) ).
cnf(c_0_7,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,X3)) = multiply(inverse(multiply(X4,X2)),multiply(X4,X3)),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,multiply(X3,inverse(multiply(inverse(X4),inverse(multiply(X5,multiply(inverse(X5),X5)))))))) = multiply(inverse(multiply(inverse(multiply(X3,X5)),X2)),X4),
inference(spm,[status(thm)],[c_0_5,c_0_3]) ).
cnf(c_0_9,plain,
multiply(inverse(multiply(X1,X2)),inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X3,X2)),multiply(X3,X4))),X5)),inverse(multiply(multiply(X1,X4),multiply(inverse(multiply(X1,X4)),multiply(X1,X4))))))) = X5,
inference(spm,[status(thm)],[c_0_2,c_0_7]) ).
cnf(c_0_10,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,inverse(multiply(X3,inverse(multiply(X2,multiply(inverse(X2),X2))))))) = multiply(inverse(multiply(inverse(multiply(X4,X5)),multiply(X4,X3))),inverse(multiply(X5,multiply(inverse(X5),X5)))),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_11,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,X3)) = multiply(inverse(multiply(inverse(multiply(inverse(multiply(X4,X5)),multiply(X4,X6))),X2)),multiply(inverse(multiply(inverse(multiply(X7,X5)),multiply(X7,X6))),X3)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,inverse(multiply(X3,inverse(multiply(X2,multiply(inverse(X2),X2)))))))) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_10]),c_0_2]) ).
cnf(c_0_13,plain,
multiply(inverse(multiply(X1,inverse(multiply(X2,multiply(inverse(X2),X2))))),multiply(X1,X3)) = multiply(X4,multiply(inverse(multiply(inverse(multiply(X5,X2)),multiply(X5,X4))),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_10]),c_0_12]) ).
cnf(c_0_14,plain,
multiply(X1,multiply(inverse(multiply(inverse(multiply(X2,X3)),multiply(X2,X1))),X4)) = multiply(X5,multiply(inverse(multiply(inverse(multiply(X6,X3)),multiply(X6,X5))),X4)),
inference(spm,[status(thm)],[c_0_13,c_0_13]) ).
cnf(c_0_15,plain,
multiply(inverse(multiply(inverse(multiply(X1,X2)),X3)),inverse(multiply(X2,multiply(inverse(X2),X2)))) = multiply(inverse(multiply(inverse(multiply(X1,X4)),X3)),inverse(multiply(X4,multiply(inverse(X4),X4)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_2]),c_0_5]) ).
cnf(c_0_16,plain,
multiply(inverse(multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,X3)),X4)),inverse(multiply(X3,multiply(inverse(X3),X3))))))),multiply(X1,X5)) = multiply(inverse(X4),multiply(X2,X5)),
inference(spm,[status(thm)],[c_0_7,c_0_2]) ).
cnf(c_0_17,plain,
multiply(X1,multiply(inverse(multiply(b2,b2)),multiply(b2,inverse(multiply(X1,inverse(multiply(b2,multiply(inverse(b2),b2)))))))) = multiply(X2,multiply(inverse(multiply(b2,b2)),multiply(b2,inverse(multiply(X2,inverse(multiply(b2,multiply(inverse(b2),b2)))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_10]),c_0_10]) ).
cnf(c_0_18,plain,
multiply(X1,multiply(inverse(multiply(b2,b2)),multiply(b2,inverse(multiply(X1,inverse(multiply(b2,multiply(inverse(b2),b2)))))))) = multiply(inverse(X2),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_2]),c_0_2]) ).
cnf(c_0_19,plain,
multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X1,multiply(X2,X3))),X4)),inverse(multiply(multiply(X2,X3),multiply(inverse(multiply(X5,X3)),multiply(X5,X3))))))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_7]) ).
cnf(c_0_20,plain,
multiply(inverse(X1),X1) = multiply(inverse(X2),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_18]),c_0_2]),c_0_2]) ).
cnf(c_0_21,plain,
multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X2,multiply(X3,X4))),multiply(X2,X5))),inverse(multiply(multiply(X3,X4),multiply(inverse(b2),b2)))))) = multiply(X1,X5),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_7]),c_0_20]) ).
cnf(c_0_22,plain,
multiply(X1,inverse(multiply(inverse(multiply(inverse(b2),b2)),inverse(multiply(multiply(X2,X3),multiply(inverse(b2),b2)))))) = multiply(X1,multiply(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_18]),c_0_18]) ).
cnf(c_0_23,plain,
inverse(multiply(inverse(multiply(inverse(b2),b2)),inverse(multiply(multiply(X1,X2),multiply(inverse(b2),b2))))) = multiply(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_22]),c_0_2]) ).
cnf(c_0_24,plain,
multiply(inverse(multiply(X1,X2)),inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X3,X2)),multiply(X3,X4))),X5)),inverse(multiply(multiply(X1,X4),multiply(inverse(multiply(X6,X4)),multiply(X6,X4))))))) = X5,
inference(spm,[status(thm)],[c_0_9,c_0_7]) ).
cnf(c_0_25,plain,
inverse(multiply(inverse(multiply(inverse(b2),b2)),inverse(multiply(X1,multiply(inverse(b2),b2))))) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,plain,
multiply(inverse(b2),inverse(multiply(X1,inverse(multiply(b2,multiply(inverse(b2),b2)))))) = inverse(multiply(X1,multiply(inverse(b2),b2))),
inference(spm,[status(thm)],[c_0_2,c_0_25]) ).
cnf(c_0_27,plain,
inverse(multiply(inverse(b2),b2)) = multiply(inverse(b2),b2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_25]),c_0_20]) ).
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,
multiply(multiply(inverse(b2),b2),inverse(multiply(inverse(X1),multiply(inverse(b2),b2)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_27]),c_0_26]) ).
cnf(c_0_30,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
c_0_28 ).
cnf(c_0_31,plain,
multiply(inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,X3))),multiply(inverse(multiply(X4,X2)),X5)) = multiply(inverse(multiply(X6,multiply(X4,X3))),multiply(X6,X5)),
inference(spm,[status(thm)],[c_0_7,c_0_7]) ).
cnf(c_0_32,plain,
multiply(inverse(multiply(inverse(multiply(X1,X2)),X3)),multiply(inverse(multiply(X4,X2)),multiply(X4,X5))) = multiply(inverse(multiply(X6,X3)),multiply(X6,multiply(X1,X5))),
inference(spm,[status(thm)],[c_0_7,c_0_7]) ).
cnf(c_0_33,plain,
inverse(multiply(inverse(multiply(multiply(inverse(b2),b2),X1)),multiply(inverse(b2),b2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_27]),c_0_26]) ).
cnf(c_0_34,plain,
multiply(multiply(inverse(b2),b2),inverse(multiply(inverse(X1),X1))) = multiply(inverse(b2),b2),
inference(spm,[status(thm)],[c_0_29,c_0_20]) ).
cnf(c_0_35,negated_conjecture,
multiply(multiply(inverse(X1),X1),a2) != a2,
inference(spm,[status(thm)],[c_0_30,c_0_20]) ).
cnf(c_0_36,plain,
inverse(multiply(inverse(multiply(inverse(X1),X1)),inverse(multiply(X2,multiply(inverse(X2),X2))))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_18]),c_0_5]),c_0_2]) ).
cnf(c_0_37,plain,
multiply(inverse(multiply(X1,multiply(X2,X3))),multiply(X1,multiply(X2,X4))) = multiply(inverse(multiply(X5,multiply(X6,X3))),multiply(X5,multiply(X6,X4))),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,plain,
inverse(multiply(inverse(X1),X1)) = multiply(inverse(b2),b2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_20]),c_0_27]) ).
cnf(c_0_39,negated_conjecture,
multiply(multiply(X1,multiply(inverse(multiply(inverse(X2),X2)),inverse(multiply(X1,multiply(inverse(X1),X1))))),a2) != a2,
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X1,multiply(X2,multiply(X3,X4)))),X5)),inverse(multiply(multiply(X2,multiply(X3,X4)),multiply(inverse(b2),b2)))))) = X5,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_37]),c_0_20]) ).
cnf(c_0_41,plain,
multiply(multiply(inverse(b2),b2),multiply(inverse(X1),X1)) = multiply(inverse(b2),b2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_38]),c_0_18]) ).
cnf(c_0_42,negated_conjecture,
multiply(multiply(X1,multiply(inverse(multiply(inverse(X2),X2)),inverse(multiply(X1,multiply(inverse(X3),X3))))),a2) != a2,
inference(spm,[status(thm)],[c_0_39,c_0_20]) ).
cnf(c_0_43,plain,
multiply(multiply(inverse(b2),b2),X1) = 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_40,c_0_41]),c_0_38]),c_0_20]),c_0_41]),c_0_38]),c_0_33]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[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_42,c_0_43]),c_0_38]),c_0_41]),c_0_38]),c_0_41]),c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : GRP404-1 : TPTP v8.2.0. Released v2.6.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n006.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Sun May 19 05:26:22 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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
% 7.67/1.41 # Version: 3.1.0
% 7.67/1.41 # Preprocessing class: FSSSSMSSSSSNFFN.
% 7.67/1.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.67/1.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 7.67/1.41 # Starting new_bool_3 with 300s (1) cores
% 7.67/1.41 # Starting new_bool_1 with 300s (1) cores
% 7.67/1.41 # Starting sh5l with 300s (1) cores
% 7.67/1.41 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 17978 completed with status 0
% 7.67/1.41 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 7.67/1.41 # Preprocessing class: FSSSSMSSSSSNFFN.
% 7.67/1.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.67/1.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 7.67/1.41 # No SInE strategy applied
% 7.67/1.41 # Search class: FUUPF-FFSF21-DFFFFFNN
% 7.67/1.41 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 7.67/1.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 7.67/1.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 7.67/1.41 # Starting new_bool_3 with 136s (1) cores
% 7.67/1.41 # Starting new_bool_1 with 136s (1) cores
% 7.67/1.41 # Starting sh5l with 136s (1) cores
% 7.67/1.41 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 17984 completed with status 0
% 7.67/1.41 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 7.67/1.41 # Preprocessing class: FSSSSMSSSSSNFFN.
% 7.67/1.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.67/1.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 7.67/1.41 # No SInE strategy applied
% 7.67/1.41 # Search class: FUUPF-FFSF21-DFFFFFNN
% 7.67/1.41 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 7.67/1.41 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 7.67/1.41 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 7.67/1.41 # Preprocessing time : 0.001 s
% 7.67/1.41
% 7.67/1.41 # Proof found!
% 7.67/1.41 # SZS status Unsatisfiable
% 7.67/1.41 # SZS output start CNFRefutation
% See solution above
% 7.67/1.41 # Parsed axioms : 2
% 7.67/1.41 # Removed by relevancy pruning/SinE : 0
% 7.67/1.41 # Initial clauses : 2
% 7.67/1.41 # Removed in clause preprocessing : 0
% 7.67/1.41 # Initial clauses in saturation : 2
% 7.67/1.41 # Processed clauses : 975
% 7.67/1.41 # ...of these trivial : 156
% 7.67/1.41 # ...subsumed : 702
% 7.67/1.41 # ...remaining for further processing : 117
% 7.67/1.41 # Other redundant clauses eliminated : 0
% 7.67/1.41 # Clauses deleted for lack of memory : 0
% 7.67/1.41 # Backward-subsumed : 11
% 7.67/1.41 # Backward-rewritten : 21
% 7.67/1.41 # Generated clauses : 40494
% 7.67/1.41 # ...of the previous two non-redundant : 37385
% 7.67/1.41 # ...aggressively subsumed : 0
% 7.67/1.41 # Contextual simplify-reflections : 0
% 7.67/1.41 # Paramodulations : 40494
% 7.67/1.41 # Factorizations : 0
% 7.67/1.41 # NegExts : 0
% 7.67/1.41 # Equation resolutions : 0
% 7.67/1.41 # Disequality decompositions : 0
% 7.67/1.41 # Total rewrite steps : 11116
% 7.67/1.41 # ...of those cached : 7381
% 7.67/1.41 # Propositional unsat checks : 0
% 7.67/1.41 # Propositional check models : 0
% 7.67/1.41 # Propositional check unsatisfiable : 0
% 7.67/1.41 # Propositional clauses : 0
% 7.67/1.41 # Propositional clauses after purity: 0
% 7.67/1.41 # Propositional unsat core size : 0
% 7.67/1.41 # Propositional preprocessing time : 0.000
% 7.67/1.41 # Propositional encoding time : 0.000
% 7.67/1.41 # Propositional solver time : 0.000
% 7.67/1.41 # Success case prop preproc time : 0.000
% 7.67/1.41 # Success case prop encoding time : 0.000
% 7.67/1.41 # Success case prop solver time : 0.000
% 7.67/1.41 # Current number of processed clauses : 85
% 7.67/1.41 # Positive orientable unit clauses : 35
% 7.67/1.41 # Positive unorientable unit clauses: 29
% 7.67/1.41 # Negative unit clauses : 21
% 7.67/1.41 # Non-unit-clauses : 0
% 7.67/1.41 # Current number of unprocessed clauses: 36190
% 7.67/1.41 # ...number of literals in the above : 36190
% 7.67/1.41 # Current number of archived formulas : 0
% 7.67/1.41 # Current number of archived clauses : 32
% 7.67/1.41 # Clause-clause subsumption calls (NU) : 0
% 7.67/1.41 # Rec. Clause-clause subsumption calls : 0
% 7.67/1.41 # Non-unit clause-clause subsumptions : 0
% 7.67/1.41 # Unit Clause-clause subsumption calls : 368
% 7.67/1.41 # Rewrite failures with RHS unbound : 0
% 7.67/1.41 # BW rewrite match attempts : 1500
% 7.67/1.41 # BW rewrite match successes : 144
% 7.67/1.41 # Condensation attempts : 0
% 7.67/1.41 # Condensation successes : 0
% 7.67/1.41 # Termbank termtop insertions : 1331532
% 7.67/1.41 # Search garbage collected termcells : 2
% 7.67/1.41
% 7.67/1.41 # -------------------------------------------------
% 7.67/1.41 # User time : 0.935 s
% 7.67/1.41 # System time : 0.033 s
% 7.67/1.41 # Total time : 0.968 s
% 7.67/1.41 # Maximum resident set size: 1544 pages
% 7.67/1.41
% 7.67/1.41 # -------------------------------------------------
% 7.67/1.41 # User time : 4.735 s
% 7.67/1.41 # System time : 0.070 s
% 7.67/1.41 # Total time : 4.805 s
% 7.67/1.41 # Maximum resident set size: 1688 pages
% 7.67/1.41 % E---3.1 exiting
% 7.67/1.41 % E exiting
%------------------------------------------------------------------------------