TSTP Solution File: GRP370-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP370-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:39:55 EDT 2023
% Result : Unsatisfiable 1.27s 0.70s
% Output : CNFRefutation 1.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 11
% Syntax : Number of clauses : 50 ( 17 unt; 26 nHn; 37 RR)
% Number of literals : 126 ( 125 equ; 55 neg)
% Maximal clause size : 11 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 49 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.Hs0vdlkUgy/E---3.1_6467.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/tmp/tmp.Hs0vdlkUgy/E---3.1_6467.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.Hs0vdlkUgy/E---3.1_6467.p',left_identity) ).
cnf(prove_this_10,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c8
| multiply(sk_c4,sk_c7) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.Hs0vdlkUgy/E---3.1_6467.p',prove_this_10) ).
cnf(prove_this_11,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c8
| inverse(sk_c4) = sk_c7 ),
file('/export/starexec/sandbox/tmp/tmp.Hs0vdlkUgy/E---3.1_6467.p',prove_this_11) ).
cnf(prove_this_17,negated_conjecture,
( inverse(sk_c1) = sk_c2
| multiply(sk_c4,sk_c7) = sk_c8 ),
file('/export/starexec/sandbox/tmp/tmp.Hs0vdlkUgy/E---3.1_6467.p',prove_this_17) ).
cnf(prove_this_18,negated_conjecture,
( inverse(sk_c1) = sk_c2
| inverse(sk_c4) = sk_c7 ),
file('/export/starexec/sandbox/tmp/tmp.Hs0vdlkUgy/E---3.1_6467.p',prove_this_18) ).
cnf(prove_this_6,negated_conjecture,
( multiply(sk_c7,sk_c8) = sk_c9
| multiply(sk_c5,sk_c9) = sk_c6 ),
file('/export/starexec/sandbox/tmp/tmp.Hs0vdlkUgy/E---3.1_6467.p',prove_this_6) ).
cnf(prove_this_7,negated_conjecture,
( multiply(sk_c7,sk_c8) = sk_c9
| inverse(sk_c5) = sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.Hs0vdlkUgy/E---3.1_6467.p',prove_this_7) ).
cnf(prove_this_5,negated_conjecture,
( multiply(sk_c7,sk_c8) = sk_c9
| multiply(sk_c9,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox/tmp/tmp.Hs0vdlkUgy/E---3.1_6467.p',prove_this_5) ).
cnf(prove_this_29,negated_conjecture,
( multiply(sk_c7,sk_c8) != sk_c9
| multiply(X1,X2) != sk_c8
| inverse(X1) != X2
| multiply(X2,sk_c7) != sk_c8
| multiply(X3,sk_c9) != sk_c8
| inverse(X3) != sk_c9
| multiply(X4,sk_c7) != sk_c8
| inverse(X4) != sk_c7
| multiply(sk_c9,X5) != sk_c7
| multiply(X6,sk_c9) != X5
| inverse(X6) != sk_c9 ),
file('/export/starexec/sandbox/tmp/tmp.Hs0vdlkUgy/E---3.1_6467.p',prove_this_29) ).
cnf(c_0_11,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_12,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_13,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_14,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_15,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c8
| multiply(sk_c4,sk_c7) = sk_c8 ),
prove_this_10 ).
cnf(c_0_16,negated_conjecture,
( multiply(inverse(sk_c4),sk_c8) = sk_c7
| multiply(sk_c1,sk_c2) = sk_c8 ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c8
| inverse(sk_c4) = sk_c7 ),
prove_this_11 ).
cnf(c_0_18,negated_conjecture,
( multiply(sk_c1,sk_c2) = sk_c8
| multiply(sk_c7,sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,negated_conjecture,
( multiply(inverse(sk_c1),sk_c8) = sk_c2
| multiply(sk_c7,sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_14,c_0_18]) ).
cnf(c_0_20,negated_conjecture,
( inverse(sk_c1) = sk_c2
| multiply(sk_c4,sk_c7) = sk_c8 ),
prove_this_17 ).
cnf(c_0_21,negated_conjecture,
( multiply(sk_c4,sk_c7) = sk_c8
| multiply(sk_c7,sk_c8) = sk_c7
| multiply(sk_c2,sk_c8) = sk_c2 ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
( multiply(inverse(sk_c4),sk_c8) = sk_c7
| multiply(sk_c2,sk_c8) = sk_c2
| multiply(sk_c7,sk_c8) = sk_c7 ),
inference(spm,[status(thm)],[c_0_14,c_0_21]) ).
cnf(c_0_23,negated_conjecture,
( inverse(sk_c1) = sk_c2
| inverse(sk_c4) = sk_c7 ),
prove_this_18 ).
cnf(c_0_24,negated_conjecture,
( multiply(sk_c2,sk_c8) = sk_c2
| multiply(sk_c7,sk_c8) = sk_c7
| inverse(sk_c1) = sk_c2 ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,negated_conjecture,
( multiply(sk_c7,sk_c8) = sk_c7
| multiply(sk_c2,sk_c8) = sk_c2 ),
inference(spm,[status(thm)],[c_0_19,c_0_24]) ).
cnf(c_0_26,negated_conjecture,
( multiply(sk_c7,sk_c8) = sk_c9
| multiply(sk_c5,sk_c9) = sk_c6 ),
prove_this_6 ).
cnf(c_0_27,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_14,c_0_14]) ).
cnf(c_0_28,negated_conjecture,
( multiply(sk_c7,sk_c8) = sk_c7
| identity = sk_c8 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_25]),c_0_12]) ).
cnf(c_0_29,negated_conjecture,
( multiply(inverse(sk_c5),sk_c6) = sk_c9
| multiply(sk_c7,sk_c8) = sk_c9 ),
inference(spm,[status(thm)],[c_0_14,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( multiply(sk_c7,sk_c8) = sk_c9
| inverse(sk_c5) = sk_c9 ),
prove_this_7 ).
cnf(c_0_31,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_12]),c_0_27]) ).
cnf(c_0_32,negated_conjecture,
identity = sk_c8,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_28]),c_0_12])]) ).
cnf(c_0_33,negated_conjecture,
( multiply(sk_c7,sk_c8) = sk_c9
| multiply(sk_c9,sk_c6) = sk_c9 ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
multiply(X1,sk_c8) = X1,
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
( multiply(sk_c7,sk_c8) = sk_c9
| multiply(sk_c9,sk_c6) = sk_c7 ),
prove_this_5 ).
cnf(c_0_36,negated_conjecture,
( multiply(sk_c7,sk_c8) != sk_c9
| multiply(X1,X2) != sk_c8
| inverse(X1) != X2
| multiply(X2,sk_c7) != sk_c8
| multiply(X3,sk_c9) != sk_c8
| inverse(X3) != sk_c9
| multiply(X4,sk_c7) != sk_c8
| inverse(X4) != sk_c7
| multiply(sk_c9,X5) != sk_c7
| multiply(X6,sk_c9) != X5
| inverse(X6) != sk_c9 ),
prove_this_29 ).
cnf(c_0_37,negated_conjecture,
( multiply(sk_c9,sk_c6) = sk_c9
| sk_c7 = sk_c9 ),
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( multiply(sk_c9,sk_c6) = sk_c7
| sk_c7 = sk_c9 ),
inference(rw,[status(thm)],[c_0_35,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( multiply(sk_c9,multiply(X1,sk_c9)) != sk_c7
| multiply(inverse(X2),sk_c7) != sk_c8
| multiply(sk_c7,sk_c8) != sk_c9
| multiply(X2,inverse(X2)) != sk_c8
| multiply(X3,sk_c7) != sk_c8
| multiply(X4,sk_c9) != sk_c8
| inverse(X1) != sk_c9
| inverse(X3) != sk_c7
| inverse(X4) != sk_c9 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_36])]) ).
cnf(c_0_40,negated_conjecture,
sk_c7 = sk_c9,
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,plain,
multiply(inverse(X1),X1) = sk_c8,
inference(rw,[status(thm)],[c_0_12,c_0_32]) ).
cnf(c_0_42,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_31]),c_0_31]) ).
cnf(c_0_43,negated_conjecture,
( multiply(sk_c9,multiply(X1,sk_c9)) != sk_c9
| multiply(inverse(X2),sk_c9) != sk_c8
| multiply(X2,inverse(X2)) != sk_c8
| multiply(X3,sk_c9) != sk_c8
| multiply(X4,sk_c9) != sk_c8
| inverse(X1) != sk_c9
| inverse(X3) != sk_c9
| inverse(X4) != sk_c9 ),
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(rw,[status(thm)],[c_0_39,c_0_34]),c_0_40]),c_0_40]),c_0_40]),c_0_40]),c_0_40])]) ).
cnf(c_0_44,plain,
multiply(X1,inverse(X1)) = sk_c8,
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
( multiply(sk_c9,multiply(X1,sk_c9)) != sk_c9
| multiply(inverse(X2),sk_c9) != sk_c8
| multiply(X3,sk_c9) != sk_c8
| multiply(X4,sk_c9) != sk_c8
| inverse(X1) != sk_c9
| inverse(X3) != sk_c9
| inverse(X4) != sk_c9 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]) ).
cnf(c_0_46,negated_conjecture,
( multiply(inverse(X1),sk_c9) != sk_c8
| multiply(X2,sk_c9) != sk_c8
| multiply(X3,sk_c9) != sk_c8
| inverse(X2) != sk_c9
| inverse(X3) != sk_c9 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_42])]),c_0_12]),c_0_32]),c_0_34])]) ).
cnf(c_0_47,negated_conjecture,
( multiply(inverse(X1),sk_c9) != sk_c8
| multiply(X2,sk_c9) != sk_c8
| inverse(X2) != sk_c9 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_42])]),c_0_12]),c_0_32])]) ).
cnf(c_0_48,negated_conjecture,
multiply(inverse(X1),sk_c9) != sk_c8,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_42])]),c_0_12]),c_0_32])]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_48,c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP370-1 : TPTP v8.1.2. Released v2.5.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n016.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Oct 3 03:17:07 EDT 2023
% 0.14/0.36 % 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.Hs0vdlkUgy/E---3.1_6467.p
% 1.27/0.70 # Version: 3.1pre001
% 1.27/0.70 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1.27/0.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.27/0.70 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.27/0.70 # Starting new_bool_3 with 300s (1) cores
% 1.27/0.70 # Starting new_bool_1 with 300s (1) cores
% 1.27/0.70 # Starting sh5l with 300s (1) cores
% 1.27/0.70 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 6546 completed with status 0
% 1.27/0.70 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 1.27/0.70 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1.27/0.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.27/0.70 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.27/0.70 # No SInE strategy applied
% 1.27/0.70 # Search class: FGHPS-FFMM21-SFFFFFNN
% 1.27/0.70 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.27/0.70 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 1.27/0.70 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 1.27/0.70 # Starting new_bool_3 with 136s (1) cores
% 1.27/0.70 # Starting new_bool_1 with 136s (1) cores
% 1.27/0.70 # Starting sh5l with 136s (1) cores
% 1.27/0.70 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 6551 completed with status 0
% 1.27/0.70 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 1.27/0.70 # Preprocessing class: FSMSSMSMSSSNFFN.
% 1.27/0.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.27/0.70 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 1.27/0.70 # No SInE strategy applied
% 1.27/0.70 # Search class: FGHPS-FFMM21-SFFFFFNN
% 1.27/0.70 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.27/0.70 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 1.27/0.70 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 1.27/0.70 # Preprocessing time : 0.001 s
% 1.27/0.70 # Presaturation interreduction done
% 1.27/0.70
% 1.27/0.70 # Proof found!
% 1.27/0.70 # SZS status Unsatisfiable
% 1.27/0.70 # SZS output start CNFRefutation
% See solution above
% 1.27/0.70 # Parsed axioms : 32
% 1.27/0.70 # Removed by relevancy pruning/SinE : 0
% 1.27/0.70 # Initial clauses : 32
% 1.27/0.70 # Removed in clause preprocessing : 0
% 1.27/0.70 # Initial clauses in saturation : 32
% 1.27/0.70 # Processed clauses : 2881
% 1.27/0.70 # ...of these trivial : 49
% 1.27/0.70 # ...subsumed : 1935
% 1.27/0.70 # ...remaining for further processing : 897
% 1.27/0.70 # Other redundant clauses eliminated : 20
% 1.27/0.70 # Clauses deleted for lack of memory : 0
% 1.27/0.70 # Backward-subsumed : 150
% 1.27/0.70 # Backward-rewritten : 450
% 1.27/0.70 # Generated clauses : 11205
% 1.27/0.70 # ...of the previous two non-redundant : 10993
% 1.27/0.70 # ...aggressively subsumed : 0
% 1.27/0.70 # Contextual simplify-reflections : 22
% 1.27/0.70 # Paramodulations : 11178
% 1.27/0.70 # Factorizations : 3
% 1.27/0.70 # NegExts : 0
% 1.27/0.70 # Equation resolutions : 20
% 1.27/0.70 # Total rewrite steps : 4808
% 1.27/0.70 # Propositional unsat checks : 0
% 1.27/0.70 # Propositional check models : 0
% 1.27/0.70 # Propositional check unsatisfiable : 0
% 1.27/0.70 # Propositional clauses : 0
% 1.27/0.70 # Propositional clauses after purity: 0
% 1.27/0.70 # Propositional unsat core size : 0
% 1.27/0.70 # Propositional preprocessing time : 0.000
% 1.27/0.70 # Propositional encoding time : 0.000
% 1.27/0.70 # Propositional solver time : 0.000
% 1.27/0.70 # Success case prop preproc time : 0.000
% 1.27/0.70 # Success case prop encoding time : 0.000
% 1.27/0.70 # Success case prop solver time : 0.000
% 1.27/0.70 # Current number of processed clauses : 259
% 1.27/0.70 # Positive orientable unit clauses : 14
% 1.27/0.70 # Positive unorientable unit clauses: 0
% 1.27/0.70 # Negative unit clauses : 1
% 1.27/0.70 # Non-unit-clauses : 244
% 1.27/0.70 # Current number of unprocessed clauses: 5686
% 1.27/0.70 # ...number of literals in the above : 21351
% 1.27/0.70 # Current number of archived formulas : 0
% 1.27/0.70 # Current number of archived clauses : 637
% 1.27/0.70 # Clause-clause subsumption calls (NU) : 22860
% 1.27/0.70 # Rec. Clause-clause subsumption calls : 12378
% 1.27/0.70 # Non-unit clause-clause subsumptions : 2102
% 1.27/0.70 # Unit Clause-clause subsumption calls : 1003
% 1.27/0.70 # Rewrite failures with RHS unbound : 0
% 1.27/0.70 # BW rewrite match attempts : 108
% 1.27/0.70 # BW rewrite match successes : 83
% 1.27/0.70 # Condensation attempts : 0
% 1.27/0.70 # Condensation successes : 0
% 1.27/0.70 # Termbank termtop insertions : 150498
% 1.27/0.70
% 1.27/0.70 # -------------------------------------------------
% 1.27/0.70 # User time : 0.185 s
% 1.27/0.70 # System time : 0.009 s
% 1.27/0.70 # Total time : 0.194 s
% 1.27/0.70 # Maximum resident set size: 1600 pages
% 1.27/0.70
% 1.27/0.70 # -------------------------------------------------
% 1.27/0.70 # User time : 0.799 s
% 1.27/0.70 # System time : 0.017 s
% 1.27/0.70 # Total time : 0.816 s
% 1.27/0.70 # Maximum resident set size: 1684 pages
% 1.27/0.70 % E---3.1 exiting
% 1.27/0.70 % E---3.1 exiting
%------------------------------------------------------------------------------