TSTP Solution File: GRP442-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP442-1 : TPTP v8.1.2. Released v2.6.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:48:35 EDT 2023
% Result : Unsatisfiable 0.82s 0.58s
% Output : CNFRefutation 0.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 2
% Syntax : Number of clauses : 38 ( 38 unt; 0 nHn; 3 RR)
% Number of literals : 38 ( 37 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 12 ( 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 : 103 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
inverse(multiply(X1,multiply(X2,multiply(multiply(X3,inverse(X3)),inverse(multiply(X4,multiply(X1,X2))))))) = X4,
file('/export/starexec/sandbox2/tmp/tmp.uB5JwQo5u5/E---3.1_28365.p',single_axiom) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox2/tmp/tmp.uB5JwQo5u5/E---3.1_28365.p',prove_these_axioms_1) ).
cnf(c_0_2,axiom,
inverse(multiply(X1,multiply(X2,multiply(multiply(X3,inverse(X3)),inverse(multiply(X4,multiply(X1,X2))))))) = X4,
single_axiom ).
cnf(c_0_3,plain,
inverse(multiply(X1,multiply(multiply(multiply(X2,inverse(X2)),inverse(multiply(X3,multiply(X4,X1)))),multiply(multiply(X5,inverse(X5)),X3)))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
inverse(multiply(multiply(multiply(X1,inverse(X1)),inverse(multiply(X2,multiply(X3,X4)))),multiply(multiply(multiply(X5,inverse(X5)),X2),multiply(multiply(X6,inverse(X6)),X3)))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_5,plain,
inverse(multiply(multiply(multiply(X1,inverse(X1)),X2),multiply(multiply(multiply(X3,inverse(X3)),X4),multiply(multiply(X5,inverse(X5)),X6)))) = multiply(multiply(X7,inverse(X7)),inverse(multiply(X2,multiply(X4,X6)))),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_6,plain,
multiply(multiply(a1,inverse(a1)),inverse(multiply(inverse(multiply(X1,multiply(X2,X3))),multiply(X1,X2)))) = X3,
inference(rw,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
multiply(multiply(a1,inverse(a1)),X1) = multiply(multiply(X2,inverse(X2)),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_3]),c_0_2]) ).
cnf(c_0_8,plain,
multiply(a1,inverse(a1)) = multiply(X1,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_7]),c_0_2]) ).
cnf(c_0_9,plain,
multiply(X1,inverse(X1)) = multiply(X2,inverse(X2)),
inference(spm,[status(thm)],[c_0_8,c_0_8]) ).
cnf(c_0_10,plain,
inverse(multiply(X1,multiply(inverse(X1),multiply(multiply(X2,inverse(X2)),inverse(multiply(X3,multiply(X4,inverse(X4)))))))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_9]) ).
cnf(c_0_11,plain,
multiply(multiply(X1,inverse(X1)),inverse(multiply(inverse(multiply(X2,multiply(X3,X4))),multiply(X2,X3)))) = X4,
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_12,plain,
inverse(multiply(X1,multiply(inverse(X1),X2))) = inverse(multiply(X3,multiply(inverse(X3),X2))),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,plain,
multiply(multiply(X1,inverse(X1)),inverse(multiply(inverse(multiply(X2,multiply(inverse(X2),X3))),multiply(X4,inverse(X4))))) = X3,
inference(spm,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_14,plain,
multiply(X1,inverse(X1)) = multiply(multiply(X2,multiply(inverse(X2),X3)),inverse(multiply(X4,multiply(inverse(X4),X3)))),
inference(spm,[status(thm)],[c_0_9,c_0_12]) ).
cnf(c_0_15,plain,
multiply(multiply(X1,inverse(X1)),inverse(multiply(inverse(multiply(X2,multiply(a1,inverse(a1)))),multiply(X3,inverse(X3))))) = inverse(inverse(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_14]) ).
cnf(c_0_16,plain,
inverse(multiply(inverse(X1),multiply(inverse(inverse(X2)),multiply(multiply(X3,inverse(X3)),inverse(multiply(X2,multiply(a1,inverse(a1)))))))) = X1,
inference(spm,[status(thm)],[c_0_3,c_0_15]) ).
cnf(c_0_17,plain,
multiply(multiply(X1,inverse(X1)),inverse(multiply(inverse(multiply(X2,multiply(X3,inverse(X3)))),multiply(X2,X4)))) = inverse(X4),
inference(spm,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_18,plain,
inverse(multiply(inverse(X1),multiply(inverse(inverse(inverse(multiply(a1,multiply(X2,inverse(X2)))))),inverse(inverse(a1))))) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,plain,
inverse(multiply(inverse(X1),multiply(inverse(inverse(inverse(multiply(X2,multiply(a1,inverse(a1)))))),inverse(inverse(X2))))) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_20,plain,
multiply(multiply(inverse(X1),multiply(inverse(inverse(inverse(multiply(a1,multiply(X2,inverse(X2)))))),inverse(inverse(a1)))),X1) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_18]),c_0_14]) ).
cnf(c_0_21,plain,
inverse(multiply(inverse(X1),multiply(inverse(inverse(inverse(multiply(a1,inverse(a1))))),inverse(multiply(a1,inverse(a1)))))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_18]) ).
cnf(c_0_22,plain,
multiply(X1,multiply(inverse(X1),X2)) = multiply(X3,multiply(inverse(X3),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_12]),c_0_16]) ).
cnf(c_0_23,plain,
inverse(multiply(X1,multiply(inverse(X1),inverse(multiply(a1,inverse(a1)))))) = inverse(multiply(a1,inverse(a1))),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,plain,
multiply(X1,multiply(inverse(X1),inverse(multiply(a1,inverse(a1))))) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_23]),c_0_16]) ).
cnf(c_0_25,plain,
inverse(multiply(X1,multiply(X2,multiply(multiply(multiply(X3,multiply(X4,multiply(multiply(X5,inverse(X5)),inverse(multiply(X6,multiply(X3,X4)))))),X6),inverse(multiply(X7,multiply(X1,X2))))))) = X7,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_26,plain,
multiply(inverse(X1),inverse(multiply(a1,inverse(a1)))) = inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_24]),c_0_17]) ).
cnf(c_0_27,plain,
inverse(multiply(multiply(multiply(multiply(X1,multiply(X2,multiply(multiply(X3,inverse(X3)),inverse(multiply(X4,multiply(X1,X2)))))),X4),inverse(multiply(X5,multiply(X6,X7)))),multiply(multiply(multiply(X8,inverse(X8)),X5),multiply(multiply(X9,inverse(X9)),X6)))) = X7,
inference(spm,[status(thm)],[c_0_3,c_0_25]) ).
cnf(c_0_28,plain,
multiply(X1,inverse(multiply(a1,inverse(a1)))) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,plain,
multiply(X1,inverse(multiply(X2,inverse(X2)))) = X1,
inference(spm,[status(thm)],[c_0_28,c_0_9]) ).
cnf(c_0_30,plain,
inverse(multiply(inverse(X1),inverse(inverse(inverse(multiply(a1,inverse(a1))))))) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_29]) ).
cnf(c_0_31,plain,
inverse(multiply(X1,inverse(inverse(inverse(multiply(a1,inverse(a1))))))) = multiply(inverse(X1),inverse(inverse(inverse(multiply(a1,inverse(a1)))))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_30]),c_0_29]) ).
cnf(c_0_32,plain,
multiply(inverse(inverse(X1)),inverse(inverse(inverse(multiply(a1,inverse(a1)))))) = X1,
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,plain,
multiply(X1,multiply(inverse(X1),inverse(inverse(X2)))) = multiply(X2,multiply(a1,inverse(a1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_14]),c_0_14]) ).
cnf(c_0_34,plain,
multiply(inverse(X1),X1) = multiply(inverse(multiply(a1,inverse(a1))),multiply(a1,inverse(a1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_32]),c_0_33]) ).
cnf(c_0_35,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
prove_these_axioms_1 ).
cnf(c_0_36,plain,
multiply(inverse(X1),X1) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_34,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_35,c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GRP442-1 : TPTP v8.1.2. Released v2.6.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n021.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 2400
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Tue Oct 3 02:25:14 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.18/0.45 Running first-order model finding
% 0.18/0.45 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/tmp/tmp.uB5JwQo5u5/E---3.1_28365.p
% 0.82/0.58 # Version: 3.1pre001
% 0.82/0.58 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.82/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.82/0.58 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.82/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.82/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.82/0.58 # Starting sh5l with 300s (1) cores
% 0.82/0.58 # new_bool_3 with pid 28444 completed with status 0
% 0.82/0.58 # Result found by new_bool_3
% 0.82/0.58 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.82/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.82/0.58 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.82/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.82/0.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.82/0.58 # Search class: FUUPF-FFSF21-DFFFFFNN
% 0.82/0.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.82/0.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.82/0.58 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 28448 completed with status 0
% 0.82/0.58 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.82/0.58 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.82/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.82/0.58 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.82/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.82/0.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.82/0.58 # Search class: FUUPF-FFSF21-DFFFFFNN
% 0.82/0.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.82/0.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.82/0.58 # Preprocessing time : 0.001 s
% 0.82/0.58 # Presaturation interreduction done
% 0.82/0.58
% 0.82/0.58 # Proof found!
% 0.82/0.58 # SZS status Unsatisfiable
% 0.82/0.58 # SZS output start CNFRefutation
% See solution above
% 0.82/0.58 # Parsed axioms : 2
% 0.82/0.58 # Removed by relevancy pruning/SinE : 0
% 0.82/0.58 # Initial clauses : 2
% 0.82/0.58 # Removed in clause preprocessing : 0
% 0.82/0.58 # Initial clauses in saturation : 2
% 0.82/0.58 # Processed clauses : 205
% 0.82/0.58 # ...of these trivial : 25
% 0.82/0.58 # ...subsumed : 124
% 0.82/0.58 # ...remaining for further processing : 56
% 0.82/0.58 # Other redundant clauses eliminated : 0
% 0.82/0.58 # Clauses deleted for lack of memory : 0
% 0.82/0.58 # Backward-subsumed : 3
% 0.82/0.58 # Backward-rewritten : 11
% 0.82/0.58 # Generated clauses : 7089
% 0.82/0.58 # ...of the previous two non-redundant : 6333
% 0.82/0.58 # ...aggressively subsumed : 0
% 0.82/0.58 # Contextual simplify-reflections : 0
% 0.82/0.58 # Paramodulations : 7088
% 0.82/0.58 # Factorizations : 0
% 0.82/0.58 # NegExts : 0
% 0.82/0.58 # Equation resolutions : 0
% 0.82/0.58 # Total rewrite steps : 848
% 0.82/0.58 # Propositional unsat checks : 0
% 0.82/0.58 # Propositional check models : 0
% 0.82/0.58 # Propositional check unsatisfiable : 0
% 0.82/0.58 # Propositional clauses : 0
% 0.82/0.58 # Propositional clauses after purity: 0
% 0.82/0.58 # Propositional unsat core size : 0
% 0.82/0.58 # Propositional preprocessing time : 0.000
% 0.82/0.58 # Propositional encoding time : 0.000
% 0.82/0.58 # Propositional solver time : 0.000
% 0.82/0.58 # Success case prop preproc time : 0.000
% 0.82/0.58 # Success case prop encoding time : 0.000
% 0.82/0.58 # Success case prop solver time : 0.000
% 0.82/0.58 # Current number of processed clauses : 39
% 0.82/0.58 # Positive orientable unit clauses : 33
% 0.82/0.58 # Positive unorientable unit clauses: 6
% 0.82/0.58 # Negative unit clauses : 0
% 0.82/0.58 # Non-unit-clauses : 0
% 0.82/0.58 # Current number of unprocessed clauses: 6040
% 0.82/0.58 # ...number of literals in the above : 6040
% 0.82/0.58 # Current number of archived formulas : 0
% 0.82/0.58 # Current number of archived clauses : 17
% 0.82/0.58 # Clause-clause subsumption calls (NU) : 0
% 0.82/0.58 # Rec. Clause-clause subsumption calls : 0
% 0.82/0.58 # Non-unit clause-clause subsumptions : 0
% 0.82/0.58 # Unit Clause-clause subsumption calls : 108
% 0.82/0.58 # Rewrite failures with RHS unbound : 0
% 0.82/0.58 # BW rewrite match attempts : 467
% 0.82/0.58 # BW rewrite match successes : 54
% 0.82/0.58 # Condensation attempts : 0
% 0.82/0.58 # Condensation successes : 0
% 0.82/0.58 # Termbank termtop insertions : 200465
% 0.82/0.58
% 0.82/0.58 # -------------------------------------------------
% 0.82/0.58 # User time : 0.114 s
% 0.82/0.58 # System time : 0.006 s
% 0.82/0.58 # Total time : 0.120 s
% 0.82/0.58 # Maximum resident set size: 1424 pages
% 0.82/0.58
% 0.82/0.58 # -------------------------------------------------
% 0.82/0.58 # User time : 0.114 s
% 0.82/0.58 # System time : 0.009 s
% 0.82/0.58 # Total time : 0.123 s
% 0.82/0.58 # Maximum resident set size: 1672 pages
% 0.82/0.58 % E---3.1 exiting
%------------------------------------------------------------------------------