TSTP Solution File: GRP407-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP407-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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 : Sat May 4 07:59:07 EDT 2024
% Result : Unsatisfiable 6.36s 1.18s
% Output : CNFRefutation 6.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 2
% Syntax : Number of clauses : 37 ( 37 unt; 0 nHn; 9 RR)
% Number of literals : 37 ( 36 equ; 8 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 10 ( 2 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 : 94 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X1,X2)),X3)),multiply(inverse(X2),multiply(inverse(X2),X2))))) = X3,
file('/export/starexec/sandbox2/tmp/tmp.k9q0PuqJ7H/E---3.1_31579.p',single_axiom) ).
cnf(prove_these_axioms_2,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox2/tmp/tmp.k9q0PuqJ7H/E---3.1_31579.p',prove_these_axioms_2) ).
cnf(c_0_2,axiom,
multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X1,X2)),X3)),multiply(inverse(X2),multiply(inverse(X2),X2))))) = X3,
single_axiom ).
cnf(c_0_3,plain,
multiply(X1,inverse(multiply(inverse(X2),multiply(inverse(X3),multiply(inverse(X3),X3))))) = inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X1,X3)),X4)),X2)),multiply(inverse(X4),multiply(inverse(X4),X4)))),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,inverse(multiply(inverse(X3),multiply(inverse(X2),multiply(inverse(X2),X2)))))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_5,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,multiply(X3,inverse(multiply(inverse(X4),multiply(inverse(X5),multiply(inverse(X5),X5))))))) = multiply(inverse(multiply(inverse(multiply(X3,X5)),X2)),X4),
inference(spm,[status(thm)],[c_0_4,c_0_3]) ).
cnf(c_0_6,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,X3)) = multiply(inverse(multiply(inverse(multiply(X4,X5)),X2)),multiply(inverse(multiply(X4,X5)),X3)),
inference(spm,[status(thm)],[c_0_5,c_0_2]) ).
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_6,c_0_6]) ).
cnf(c_0_8,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_9,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_10,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_8,c_0_9]) ).
cnf(c_0_11,plain,
multiply(inverse(multiply(inverse(multiply(X1,X2)),X3)),inverse(multiply(multiply(X1,inverse(multiply(inverse(X4),multiply(inverse(X2),multiply(inverse(X2),X2))))),multiply(inverse(X4),multiply(inverse(X4),X4))))) = multiply(inverse(X3),multiply(inverse(X3),X3)),
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_12,plain,
multiply(inverse(multiply(X1,X2)),inverse(multiply(inverse(multiply(b2,multiply(b2,X3))),multiply(b2,multiply(b2,X3))))) = inverse(multiply(multiply(X1,inverse(multiply(inverse(X4),multiply(inverse(X2),multiply(inverse(X2),X2))))),multiply(inverse(X4),multiply(inverse(X4),X4)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_3]),c_0_7]),c_0_10]) ).
cnf(c_0_13,plain,
inverse(multiply(inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,X3))),multiply(inverse(X2),multiply(inverse(X2),X2)))) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_7]),c_0_2]) ).
cnf(c_0_14,plain,
multiply(inverse(multiply(b2,X1)),multiply(b2,inverse(multiply(inverse(multiply(b2,multiply(b2,b2))),multiply(b2,multiply(b2,b2)))))) = multiply(inverse(X1),multiply(inverse(X1),X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_7]) ).
cnf(c_0_15,plain,
inverse(multiply(inverse(multiply(b2,multiply(b2,X1))),multiply(b2,multiply(b2,X1)))) = inverse(multiply(inverse(multiply(b2,multiply(b2,b2))),multiply(b2,multiply(b2,b2)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_7]),c_0_10]) ).
cnf(c_0_16,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,inverse(multiply(inverse(multiply(inverse(multiply(X3,X4)),X5)),multiply(inverse(X4),multiply(inverse(X4),X4)))))) = multiply(inverse(multiply(X3,X2)),X5),
inference(spm,[status(thm)],[c_0_7,c_0_2]) ).
cnf(c_0_17,plain,
inverse(multiply(inverse(X1),X1)) = inverse(multiply(inverse(multiply(b2,multiply(b2,b2))),multiply(b2,multiply(b2,b2)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_3]),c_0_16]),c_0_2]) ).
cnf(c_0_18,plain,
inverse(multiply(inverse(X1),X1)) = inverse(multiply(inverse(b2),b2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_17]),c_0_17]) ).
cnf(c_0_19,plain,
multiply(inverse(X1),X1) = multiply(inverse(b2),b2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_18]),c_0_4]) ).
cnf(c_0_20,plain,
multiply(inverse(X1),X1) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_19,c_0_19]) ).
cnf(c_0_21,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
inference(fof_simplification,[status(thm)],[prove_these_axioms_2]) ).
cnf(c_0_22,plain,
inverse(multiply(inverse(multiply(inverse(X1),X1)),multiply(inverse(X2),multiply(inverse(X2),X2)))) = X2,
inference(spm,[status(thm)],[c_0_13,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
c_0_21 ).
cnf(c_0_24,plain,
inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,multiply(inverse(X2),X2)))) = X2,
inference(spm,[status(thm)],[c_0_22,c_0_7]) ).
cnf(c_0_25,negated_conjecture,
multiply(multiply(inverse(X1),X1),a2) != a2,
inference(spm,[status(thm)],[c_0_23,c_0_19]) ).
cnf(c_0_26,plain,
inverse(multiply(inverse(multiply(X1,X2)),multiply(X1,multiply(inverse(X3),X3)))) = X2,
inference(spm,[status(thm)],[c_0_24,c_0_20]) ).
cnf(c_0_27,negated_conjecture,
multiply(multiply(X1,multiply(inverse(multiply(inverse(multiply(X2,X3)),multiply(X2,X1))),multiply(inverse(X3),multiply(inverse(X3),X3)))),a2) != a2,
inference(spm,[status(thm)],[c_0_25,c_0_13]) ).
cnf(c_0_28,plain,
multiply(inverse(multiply(X1,X2)),multiply(X1,X3)) = multiply(inverse(X2),X3),
inference(spm,[status(thm)],[c_0_4,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
multiply(multiply(X1,multiply(inverse(multiply(inverse(X2),X2)),multiply(inverse(X1),multiply(inverse(X1),X1)))),a2) != a2,
inference(spm,[status(thm)],[c_0_27,c_0_20]) ).
cnf(c_0_30,plain,
inverse(multiply(inverse(X1),multiply(inverse(X2),X2))) = X1,
inference(rw,[status(thm)],[c_0_26,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
multiply(multiply(X1,multiply(inverse(multiply(inverse(X2),X2)),multiply(inverse(multiply(b2,X1)),multiply(b2,inverse(multiply(inverse(b2),b2)))))),a2) != a2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_14]),c_0_18]) ).
cnf(c_0_32,plain,
inverse(multiply(inverse(X1),X1)) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_26,c_0_20]) ).
cnf(c_0_33,plain,
inverse(multiply(inverse(X1),X2)) = multiply(inverse(X2),X1),
inference(spm,[status(thm)],[c_0_30,c_0_28]) ).
cnf(c_0_34,negated_conjecture,
multiply(multiply(X1,multiply(multiply(inverse(b2),b2),multiply(inverse(X1),multiply(inverse(b2),b2)))),a2) != a2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_28]),c_0_32]),c_0_32]),c_0_28]) ).
cnf(c_0_35,plain,
multiply(multiply(inverse(b2),b2),X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_33]),c_0_32]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_20]),c_0_35]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : GRP407-1 : TPTP v8.1.2. Released v2.6.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n017.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Fri May 3 16:04:08 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.14/0.39 Running first-order model finding
% 0.14/0.39 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.k9q0PuqJ7H/E---3.1_31579.p
% 6.36/1.18 # Version: 3.1.0
% 6.36/1.18 # Preprocessing class: FSSSSMSSSSSNFFN.
% 6.36/1.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.36/1.18 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 6.36/1.18 # Starting new_bool_3 with 300s (1) cores
% 6.36/1.18 # Starting new_bool_1 with 300s (1) cores
% 6.36/1.18 # Starting sh5l with 300s (1) cores
% 6.36/1.18 # new_bool_3 with pid 31658 completed with status 0
% 6.36/1.18 # Result found by new_bool_3
% 6.36/1.18 # Preprocessing class: FSSSSMSSSSSNFFN.
% 6.36/1.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.36/1.18 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 6.36/1.18 # Starting new_bool_3 with 300s (1) cores
% 6.36/1.18 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 6.36/1.18 # Search class: FUUPF-FFSF21-DFFFFFNN
% 6.36/1.18 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 6.36/1.18 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 6.36/1.18 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 31662 completed with status 0
% 6.36/1.18 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 6.36/1.18 # Preprocessing class: FSSSSMSSSSSNFFN.
% 6.36/1.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.36/1.18 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 6.36/1.18 # Starting new_bool_3 with 300s (1) cores
% 6.36/1.18 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 6.36/1.18 # Search class: FUUPF-FFSF21-DFFFFFNN
% 6.36/1.18 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 6.36/1.18 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 6.36/1.18 # Preprocessing time : 0.001 s
% 6.36/1.18 # Presaturation interreduction done
% 6.36/1.18
% 6.36/1.18 # Proof found!
% 6.36/1.18 # SZS status Unsatisfiable
% 6.36/1.18 # SZS output start CNFRefutation
% See solution above
% 6.36/1.18 # Parsed axioms : 2
% 6.36/1.18 # Removed by relevancy pruning/SinE : 0
% 6.36/1.18 # Initial clauses : 2
% 6.36/1.18 # Removed in clause preprocessing : 0
% 6.36/1.18 # Initial clauses in saturation : 2
% 6.36/1.18 # Processed clauses : 475
% 6.36/1.18 # ...of these trivial : 29
% 6.36/1.18 # ...subsumed : 343
% 6.36/1.18 # ...remaining for further processing : 103
% 6.36/1.18 # Other redundant clauses eliminated : 0
% 6.36/1.18 # Clauses deleted for lack of memory : 0
% 6.36/1.18 # Backward-subsumed : 12
% 6.36/1.18 # Backward-rewritten : 61
% 6.36/1.18 # Generated clauses : 27275
% 6.36/1.18 # ...of the previous two non-redundant : 26961
% 6.36/1.18 # ...aggressively subsumed : 0
% 6.36/1.18 # Contextual simplify-reflections : 0
% 6.36/1.18 # Paramodulations : 27275
% 6.36/1.18 # Factorizations : 0
% 6.36/1.18 # NegExts : 0
% 6.36/1.18 # Equation resolutions : 0
% 6.36/1.18 # Disequality decompositions : 0
% 6.36/1.18 # Total rewrite steps : 10577
% 6.36/1.18 # ...of those cached : 8488
% 6.36/1.18 # Propositional unsat checks : 0
% 6.36/1.18 # Propositional check models : 0
% 6.36/1.18 # Propositional check unsatisfiable : 0
% 6.36/1.18 # Propositional clauses : 0
% 6.36/1.18 # Propositional clauses after purity: 0
% 6.36/1.18 # Propositional unsat core size : 0
% 6.36/1.18 # Propositional preprocessing time : 0.000
% 6.36/1.18 # Propositional encoding time : 0.000
% 6.36/1.18 # Propositional solver time : 0.000
% 6.36/1.18 # Success case prop preproc time : 0.000
% 6.36/1.18 # Success case prop encoding time : 0.000
% 6.36/1.18 # Success case prop solver time : 0.000
% 6.36/1.18 # Current number of processed clauses : 28
% 6.36/1.18 # Positive orientable unit clauses : 8
% 6.36/1.18 # Positive unorientable unit clauses: 2
% 6.36/1.18 # Negative unit clauses : 18
% 6.36/1.18 # Non-unit-clauses : 0
% 6.36/1.18 # Current number of unprocessed clauses: 26125
% 6.36/1.18 # ...number of literals in the above : 26125
% 6.36/1.18 # Current number of archived formulas : 0
% 6.36/1.18 # Current number of archived clauses : 75
% 6.36/1.18 # Clause-clause subsumption calls (NU) : 0
% 6.36/1.18 # Rec. Clause-clause subsumption calls : 0
% 6.36/1.18 # Non-unit clause-clause subsumptions : 0
% 6.36/1.18 # Unit Clause-clause subsumption calls : 314
% 6.36/1.18 # Rewrite failures with RHS unbound : 0
% 6.36/1.18 # BW rewrite match attempts : 1351
% 6.36/1.18 # BW rewrite match successes : 182
% 6.36/1.18 # Condensation attempts : 0
% 6.36/1.18 # Condensation successes : 0
% 6.36/1.18 # Termbank termtop insertions : 1594534
% 6.36/1.18 # Search garbage collected termcells : 2
% 6.36/1.18
% 6.36/1.18 # -------------------------------------------------
% 6.36/1.18 # User time : 0.732 s
% 6.36/1.18 # System time : 0.033 s
% 6.36/1.18 # Total time : 0.765 s
% 6.36/1.18 # Maximum resident set size: 1616 pages
% 6.36/1.18
% 6.36/1.18 # -------------------------------------------------
% 6.36/1.18 # User time : 0.734 s
% 6.36/1.18 # System time : 0.034 s
% 6.36/1.18 # Total time : 0.768 s
% 6.36/1.18 # Maximum resident set size: 1684 pages
% 6.36/1.18 % E---3.1 exiting
%------------------------------------------------------------------------------