TSTP Solution File: GRP435-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP435-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:41:13 EDT 2023
% Result : Unsatisfiable 0.15s 0.53s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 2
% Syntax : Number of clauses : 44 ( 44 unt; 0 nHn; 3 RR)
% Number of literals : 44 ( 43 equ; 2 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 104 ( 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/sandbox/tmp/tmp.0gZ3uxgTtj/E---3.1_11124.p',single_axiom) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox/tmp/tmp.0gZ3uxgTtj/E---3.1_11124.p',prove_these_axioms_3) ).
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(inverse(multiply(multiply(X1,X2),inverse(multiply(X3,inverse(X3))))),X1),X2)) = multiply(X4,inverse(X4)),
inference(spm,[status(thm)],[c_0_3,c_0_5]) ).
cnf(c_0_7,plain,
inverse(multiply(multiply(inverse(multiply(X1,inverse(X1))),X2),inverse(X2))) = multiply(X3,inverse(X3)),
inference(spm,[status(thm)],[c_0_6,c_0_4]) ).
cnf(c_0_8,plain,
multiply(multiply(multiply(multiply(inverse(multiply(multiply(X1,X2),X3)),X1),X2),multiply(X4,inverse(X4))),X3) = multiply(a3,inverse(a3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_2]),c_0_3]) ).
cnf(c_0_9,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_7]) ).
cnf(c_0_10,plain,
multiply(multiply(multiply(multiply(inverse(multiply(multiply(a3,inverse(a3)),X1)),X2),inverse(X2)),multiply(X3,inverse(X3))),X1) = multiply(a3,inverse(a3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_9]) ).
cnf(c_0_11,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_12,plain,
inverse(multiply(multiply(multiply(inverse(multiply(X1,X2)),multiply(inverse(multiply(a3,inverse(a3))),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_13,plain,
multiply(multiply(multiply(multiply(a3,inverse(a3)),inverse(inverse(inverse(multiply(multiply(a3,inverse(a3)),X1))))),multiply(X2,inverse(X2))),X1) = multiply(a3,inverse(a3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_6]),c_0_6]) ).
cnf(c_0_14,plain,
multiply(multiply(X1,inverse(X1)),inverse(multiply(X2,inverse(X2)))) = multiply(a3,inverse(a3)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_15,plain,
multiply(X1,inverse(X1)) = inverse(multiply(inverse(multiply(a3,inverse(a3))),multiply(X2,inverse(X2)))),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
inverse(multiply(multiply(multiply(a3,inverse(a3)),inverse(inverse(inverse(multiply(multiply(a3,inverse(a3)),X1))))),multiply(X2,inverse(X2)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_13]),c_0_5]) ).
cnf(c_0_17,plain,
inverse(multiply(multiply(multiply(a3,inverse(a3)),X1),multiply(X2,inverse(X2)))) = inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_7]),c_0_14]) ).
cnf(c_0_18,plain,
multiply(X1,inverse(X1)) = inverse(multiply(inverse(multiply(X2,inverse(X2))),multiply(X3,inverse(X3)))),
inference(spm,[status(thm)],[c_0_15,c_0_4]) ).
cnf(c_0_19,plain,
inverse(multiply(multiply(X1,inverse(X1)),inverse(inverse(inverse(multiply(X2,inverse(X2))))))) = multiply(X3,inverse(X3)),
inference(spm,[status(thm)],[c_0_7,c_0_4]) ).
cnf(c_0_20,plain,
inverse(inverse(inverse(inverse(multiply(multiply(a3,inverse(a3)),X1))))) = X1,
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
multiply(multiply(multiply(X1,inverse(X1)),inverse(inverse(inverse(multiply(X2,inverse(X2)))))),multiply(X3,inverse(X3))) = multiply(a3,inverse(a3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_18]) ).
cnf(c_0_22,plain,
inverse(inverse(inverse(inverse(multiply(multiply(X1,inverse(X1)),X2))))) = X2,
inference(spm,[status(thm)],[c_0_20,c_0_4]) ).
cnf(c_0_23,plain,
inverse(inverse(inverse(inverse(multiply(X1,inverse(X1)))))) = inverse(multiply(a3,inverse(a3))),
inference(spm,[status(thm)],[c_0_17,c_0_21]) ).
cnf(c_0_24,plain,
inverse(inverse(multiply(a3,inverse(a3)))) = multiply(X1,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_17]),c_0_23]) ).
cnf(c_0_25,plain,
inverse(inverse(multiply(X1,inverse(X1)))) = inverse(multiply(a3,inverse(a3))),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,plain,
inverse(multiply(a3,inverse(a3))) = multiply(X1,inverse(X1)),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,plain,
inverse(multiply(multiply(multiply(X1,inverse(X1)),X2),multiply(X3,inverse(X3)))) = inverse(X2),
inference(spm,[status(thm)],[c_0_17,c_0_4]) ).
cnf(c_0_28,plain,
inverse(multiply(X1,inverse(X1))) = multiply(a3,inverse(a3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_26]),c_0_23]),c_0_26]),c_0_26]) ).
cnf(c_0_29,plain,
inverse(multiply(multiply(a3,inverse(a3)),X1)) = inverse(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_27]),c_0_28]),c_0_28]) ).
cnf(c_0_30,plain,
inverse(inverse(inverse(inverse(X1)))) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_29]) ).
cnf(c_0_31,plain,
multiply(multiply(X1,inverse(X1)),X2) = X2,
inference(rw,[status(thm)],[c_0_22,c_0_30]) ).
cnf(c_0_32,plain,
multiply(multiply(a3,inverse(a3)),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_29]),c_0_30]) ).
cnf(c_0_33,plain,
inverse(multiply(X1,multiply(X2,inverse(X2)))) = inverse(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_31]),c_0_28]),c_0_32]) ).
cnf(c_0_34,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_35,plain,
multiply(X1,multiply(X2,inverse(X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_33]),c_0_30]) ).
cnf(c_0_36,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_34,c_0_35]),c_0_31]),c_0_8]),c_0_35]) ).
cnf(c_0_37,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_31]),c_0_35]) ).
cnf(c_0_38,plain,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(spm,[status(thm)],[c_0_37,c_0_36]) ).
cnf(c_0_39,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_38]),c_0_37]) ).
cnf(c_0_40,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_34,c_0_39]),c_0_37]),c_0_8]),c_0_35]) ).
cnf(c_0_41,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
prove_these_axioms_3 ).
cnf(c_0_42,plain,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_40]),c_0_37]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : GRP435-1 : TPTP v8.1.2. Released v2.6.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n007.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 : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 02:27:39 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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.0gZ3uxgTtj/E---3.1_11124.p
% 0.15/0.53 # Version: 3.1pre001
% 0.15/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.53 # Starting sh5l with 300s (1) cores
% 0.15/0.53 # new_bool_3 with pid 11203 completed with status 8
% 0.15/0.53 # new_bool_1 with pid 11204 completed with status 8
% 0.15/0.53 # sh5l with pid 11205 completed with status 0
% 0.15/0.53 # Result found by sh5l
% 0.15/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.53 # Starting sh5l with 300s (1) cores
% 0.15/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.53 # Search class: FUUPF-FFSF21-DFFFFFNN
% 0.15/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.15/0.53 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 11212 completed with status 0
% 0.15/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.53 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.53 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.53 # Starting sh5l with 300s (1) cores
% 0.15/0.53 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.53 # Search class: FUUPF-FFSF21-DFFFFFNN
% 0.15/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.15/0.53 # Preprocessing time : 0.001 s
% 0.15/0.53 # Presaturation interreduction done
% 0.15/0.53
% 0.15/0.53 # Proof found!
% 0.15/0.53 # SZS status Unsatisfiable
% 0.15/0.53 # SZS output start CNFRefutation
% See solution above
% 0.15/0.53 # Parsed axioms : 2
% 0.15/0.53 # Removed by relevancy pruning/SinE : 0
% 0.15/0.53 # Initial clauses : 2
% 0.15/0.53 # Removed in clause preprocessing : 0
% 0.15/0.53 # Initial clauses in saturation : 2
% 0.15/0.53 # Processed clauses : 533
% 0.15/0.53 # ...of these trivial : 102
% 0.15/0.53 # ...subsumed : 355
% 0.15/0.53 # ...remaining for further processing : 76
% 0.15/0.53 # Other redundant clauses eliminated : 0
% 0.15/0.53 # Clauses deleted for lack of memory : 0
% 0.15/0.53 # Backward-subsumed : 0
% 0.15/0.53 # Backward-rewritten : 62
% 0.15/0.53 # Generated clauses : 7728
% 0.15/0.53 # ...of the previous two non-redundant : 6744
% 0.15/0.53 # ...aggressively subsumed : 0
% 0.15/0.53 # Contextual simplify-reflections : 0
% 0.15/0.53 # Paramodulations : 7728
% 0.15/0.53 # Factorizations : 0
% 0.15/0.53 # NegExts : 0
% 0.15/0.53 # Equation resolutions : 0
% 0.15/0.53 # Total rewrite steps : 7622
% 0.15/0.53 # Propositional unsat checks : 0
% 0.15/0.53 # Propositional check models : 0
% 0.15/0.53 # Propositional check unsatisfiable : 0
% 0.15/0.53 # Propositional clauses : 0
% 0.15/0.53 # Propositional clauses after purity: 0
% 0.15/0.53 # Propositional unsat core size : 0
% 0.15/0.53 # Propositional preprocessing time : 0.000
% 0.15/0.53 # Propositional encoding time : 0.000
% 0.15/0.53 # Propositional solver time : 0.000
% 0.15/0.53 # Success case prop preproc time : 0.000
% 0.15/0.53 # Success case prop encoding time : 0.000
% 0.15/0.53 # Success case prop solver time : 0.000
% 0.15/0.53 # Current number of processed clauses : 12
% 0.15/0.53 # Positive orientable unit clauses : 11
% 0.15/0.53 # Positive unorientable unit clauses: 1
% 0.15/0.53 # Negative unit clauses : 0
% 0.15/0.53 # Non-unit-clauses : 0
% 0.15/0.53 # Current number of unprocessed clauses: 5971
% 0.15/0.53 # ...number of literals in the above : 5971
% 0.15/0.53 # Current number of archived formulas : 0
% 0.15/0.53 # Current number of archived clauses : 64
% 0.15/0.53 # Clause-clause subsumption calls (NU) : 0
% 0.15/0.53 # Rec. Clause-clause subsumption calls : 0
% 0.15/0.53 # Non-unit clause-clause subsumptions : 0
% 0.15/0.53 # Unit Clause-clause subsumption calls : 89
% 0.15/0.53 # Rewrite failures with RHS unbound : 0
% 0.15/0.53 # BW rewrite match attempts : 462
% 0.15/0.53 # BW rewrite match successes : 171
% 0.15/0.53 # Condensation attempts : 0
% 0.15/0.53 # Condensation successes : 0
% 0.15/0.53 # Termbank termtop insertions : 176962
% 0.15/0.53
% 0.15/0.53 # -------------------------------------------------
% 0.15/0.53 # User time : 0.096 s
% 0.15/0.53 # System time : 0.006 s
% 0.15/0.53 # Total time : 0.102 s
% 0.15/0.53 # Maximum resident set size: 1420 pages
% 0.15/0.53
% 0.15/0.53 # -------------------------------------------------
% 0.15/0.53 # User time : 0.120 s
% 0.15/0.53 # System time : 0.017 s
% 0.15/0.53 # Total time : 0.137 s
% 0.15/0.53 # Maximum resident set size: 1672 pages
% 0.15/0.53 % E---3.1 exiting
% 0.15/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------