TSTP Solution File: GRP406-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP406-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:40:11 EDT 2023
% Result : Unsatisfiable 1.10s 0.64s
% Output : CNFRefutation 1.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 2
% Syntax : Number of clauses : 22 ( 22 unt; 0 nHn; 3 RR)
% Number of literals : 22 ( 21 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 66 ( 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/sandbox/tmp/tmp.FrKt6RudMB/E---3.1_13380.p',single_axiom) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/tmp/tmp.FrKt6RudMB/E---3.1_13380.p',prove_these_axioms_1) ).
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(a1,multiply(a1,X3))),multiply(a1,multiply(a1,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(a1,X1)),multiply(a1,inverse(multiply(inverse(multiply(a1,multiply(a1,a1))),multiply(a1,multiply(a1,a1)))))) = 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(a1,multiply(a1,X1))),multiply(a1,multiply(a1,X1)))) = inverse(multiply(inverse(multiply(a1,multiply(a1,a1))),multiply(a1,multiply(a1,a1)))),
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(a1,multiply(a1,a1))),multiply(a1,multiply(a1,a1)))),
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(a1),a1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_17]),c_0_17]) ).
cnf(c_0_19,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
prove_these_axioms_1 ).
cnf(c_0_20,plain,
multiply(inverse(X1),X1) = multiply(inverse(a1),a1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_18]),c_0_4]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_19,c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.14 % Problem : GRP406-1 : TPTP v8.1.2. Released v2.6.0.
% 0.06/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n023.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Oct 3 03:02:22 EDT 2023
% 0.14/0.37 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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.FrKt6RudMB/E---3.1_13380.p
% 1.10/0.64 # Version: 3.1pre001
% 1.10/0.64 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.10/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.10/0.64 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.10/0.64 # Starting new_bool_3 with 300s (1) cores
% 1.10/0.64 # Starting new_bool_1 with 300s (1) cores
% 1.10/0.64 # Starting sh5l with 300s (1) cores
% 1.10/0.64 # new_bool_3 with pid 13459 completed with status 0
% 1.10/0.64 # Result found by new_bool_3
% 1.10/0.64 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.10/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.10/0.64 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.10/0.64 # Starting new_bool_3 with 300s (1) cores
% 1.10/0.64 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.10/0.64 # Search class: FUUPF-FFSF21-DFFFFFNN
% 1.10/0.64 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.10/0.64 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 1.10/0.64 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 13462 completed with status 0
% 1.10/0.64 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.10/0.64 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.10/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.10/0.64 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.10/0.64 # Starting new_bool_3 with 300s (1) cores
% 1.10/0.64 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.10/0.64 # Search class: FUUPF-FFSF21-DFFFFFNN
% 1.10/0.64 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.10/0.64 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 1.10/0.64 # Preprocessing time : 0.001 s
% 1.10/0.64 # Presaturation interreduction done
% 1.10/0.64
% 1.10/0.64 # Proof found!
% 1.10/0.64 # SZS status Unsatisfiable
% 1.10/0.64 # SZS output start CNFRefutation
% See solution above
% 1.10/0.64 # Parsed axioms : 2
% 1.10/0.64 # Removed by relevancy pruning/SinE : 0
% 1.10/0.64 # Initial clauses : 2
% 1.10/0.64 # Removed in clause preprocessing : 0
% 1.10/0.64 # Initial clauses in saturation : 2
% 1.10/0.64 # Processed clauses : 104
% 1.10/0.64 # ...of these trivial : 16
% 1.10/0.64 # ...subsumed : 52
% 1.10/0.64 # ...remaining for further processing : 36
% 1.10/0.64 # Other redundant clauses eliminated : 0
% 1.10/0.64 # Clauses deleted for lack of memory : 0
% 1.10/0.64 # Backward-subsumed : 2
% 1.10/0.64 # Backward-rewritten : 10
% 1.10/0.64 # Generated clauses : 5494
% 1.10/0.64 # ...of the previous two non-redundant : 5171
% 1.10/0.64 # ...aggressively subsumed : 0
% 1.10/0.64 # Contextual simplify-reflections : 0
% 1.10/0.64 # Paramodulations : 5493
% 1.10/0.64 # Factorizations : 0
% 1.10/0.64 # NegExts : 0
% 1.10/0.64 # Equation resolutions : 0
% 1.10/0.64 # Total rewrite steps : 1158
% 1.10/0.64 # Propositional unsat checks : 0
% 1.10/0.64 # Propositional check models : 0
% 1.10/0.64 # Propositional check unsatisfiable : 0
% 1.10/0.64 # Propositional clauses : 0
% 1.10/0.64 # Propositional clauses after purity: 0
% 1.10/0.64 # Propositional unsat core size : 0
% 1.10/0.64 # Propositional preprocessing time : 0.000
% 1.10/0.64 # Propositional encoding time : 0.000
% 1.10/0.64 # Propositional solver time : 0.000
% 1.10/0.64 # Success case prop preproc time : 0.000
% 1.10/0.64 # Success case prop encoding time : 0.000
% 1.10/0.64 # Success case prop solver time : 0.000
% 1.10/0.64 # Current number of processed clauses : 21
% 1.10/0.64 # Positive orientable unit clauses : 10
% 1.10/0.64 # Positive unorientable unit clauses: 11
% 1.10/0.64 # Negative unit clauses : 0
% 1.10/0.64 # Non-unit-clauses : 0
% 1.10/0.64 # Current number of unprocessed clauses: 4988
% 1.10/0.64 # ...number of literals in the above : 4988
% 1.10/0.64 # Current number of archived formulas : 0
% 1.10/0.64 # Current number of archived clauses : 15
% 1.10/0.64 # Clause-clause subsumption calls (NU) : 0
% 1.10/0.64 # Rec. Clause-clause subsumption calls : 0
% 1.10/0.64 # Non-unit clause-clause subsumptions : 0
% 1.10/0.64 # Unit Clause-clause subsumption calls : 52
% 1.10/0.64 # Rewrite failures with RHS unbound : 0
% 1.10/0.64 # BW rewrite match attempts : 325
% 1.10/0.64 # BW rewrite match successes : 43
% 1.10/0.64 # Condensation attempts : 0
% 1.10/0.64 # Condensation successes : 0
% 1.10/0.64 # Termbank termtop insertions : 310830
% 1.10/0.64
% 1.10/0.64 # -------------------------------------------------
% 1.10/0.64 # User time : 0.109 s
% 1.10/0.64 # System time : 0.008 s
% 1.10/0.64 # Total time : 0.118 s
% 1.10/0.64 # Maximum resident set size: 1428 pages
% 1.10/0.64
% 1.10/0.64 # -------------------------------------------------
% 1.10/0.64 # User time : 0.110 s
% 1.10/0.64 # System time : 0.010 s
% 1.10/0.64 # Total time : 0.120 s
% 1.10/0.64 # Maximum resident set size: 1672 pages
% 1.10/0.64 % E---3.1 exiting
% 1.10/0.64 % E---3.1 exiting
%------------------------------------------------------------------------------