TSTP Solution File: GRP292-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP292-1 : TPTP v8.1.2. Released v2.5.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:39:35 EDT 2023
% Result : Unsatisfiable 0.35s 0.53s
% Output : CNFRefutation 0.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 9
% Syntax : Number of clauses : 48 ( 18 unt; 22 nHn; 33 RR)
% Number of literals : 113 ( 112 equ; 51 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 44 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.TvXJnCLQVU/E---3.1_5789.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox2/tmp/tmp.TvXJnCLQVU/E---3.1_5789.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.TvXJnCLQVU/E---3.1_5789.p',left_identity) ).
cnf(prove_this_19,negated_conjecture,
( inverse(sk_c2) = sk_c5
| inverse(sk_c3) = sk_c4 ),
file('/export/starexec/sandbox2/tmp/tmp.TvXJnCLQVU/E---3.1_5789.p',prove_this_19) ).
cnf(prove_this_18,negated_conjecture,
( inverse(sk_c2) = sk_c5
| multiply(sk_c3,sk_c4) = sk_c6 ),
file('/export/starexec/sandbox2/tmp/tmp.TvXJnCLQVU/E---3.1_5789.p',prove_this_18) ).
cnf(prove_this_15,negated_conjecture,
( multiply(sk_c2,sk_c5) = sk_c6
| inverse(sk_c3) = sk_c4 ),
file('/export/starexec/sandbox2/tmp/tmp.TvXJnCLQVU/E---3.1_5789.p',prove_this_15) ).
cnf(prove_this_21,negated_conjecture,
( multiply(sk_c7,sk_c6) != sk_c5
| multiply(X1,sk_c7) != sk_c6
| inverse(X1) != sk_c7
| multiply(X2,sk_c5) != sk_c6
| inverse(X2) != sk_c5
| multiply(sk_c5,sk_c6) != sk_c7
| multiply(X3,X4) != sk_c6
| inverse(X3) != X4
| multiply(X4,sk_c5) != sk_c6 ),
file('/export/starexec/sandbox2/tmp/tmp.TvXJnCLQVU/E---3.1_5789.p',prove_this_21) ).
cnf(prove_this_14,negated_conjecture,
( multiply(sk_c2,sk_c5) = sk_c6
| multiply(sk_c3,sk_c4) = sk_c6 ),
file('/export/starexec/sandbox2/tmp/tmp.TvXJnCLQVU/E---3.1_5789.p',prove_this_14) ).
cnf(prove_this_1,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c5
| multiply(sk_c5,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox2/tmp/tmp.TvXJnCLQVU/E---3.1_5789.p',prove_this_1) ).
cnf(c_0_9,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_10,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_11,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_12,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_13,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_14,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_12,c_0_12]) ).
cnf(c_0_15,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_15]) ).
cnf(c_0_17,negated_conjecture,
( inverse(sk_c2) = sk_c5
| inverse(sk_c3) = sk_c4 ),
prove_this_19 ).
cnf(c_0_18,negated_conjecture,
( inverse(sk_c2) = sk_c5
| multiply(sk_c3,sk_c4) = sk_c6 ),
prove_this_18 ).
cnf(c_0_19,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_10,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
( multiply(sk_c5,sk_c2) = identity
| inverse(sk_c3) = sk_c4 ),
inference(spm,[status(thm)],[c_0_10,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
( multiply(sk_c3,sk_c4) = sk_c6
| multiply(sk_c5,sk_c2) = identity ),
inference(spm,[status(thm)],[c_0_10,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( multiply(sk_c5,sk_c2) = identity
| multiply(sk_c3,sk_c4) = identity ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
( multiply(sk_c5,sk_c2) = identity
| sk_c6 = identity ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,negated_conjecture,
( multiply(sk_c2,sk_c5) = sk_c6
| inverse(sk_c3) = sk_c4 ),
prove_this_15 ).
cnf(c_0_25,negated_conjecture,
( inverse(sk_c5) = sk_c2
| sk_c6 = identity ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_23]),c_0_15]) ).
cnf(c_0_26,negated_conjecture,
( multiply(sk_c7,sk_c6) != sk_c5
| multiply(X1,sk_c7) != sk_c6
| inverse(X1) != sk_c7
| multiply(X2,sk_c5) != sk_c6
| inverse(X2) != sk_c5
| multiply(sk_c5,sk_c6) != sk_c7
| multiply(X3,X4) != sk_c6
| inverse(X3) != X4
| multiply(X4,sk_c5) != sk_c6 ),
prove_this_21 ).
cnf(c_0_27,negated_conjecture,
( multiply(sk_c2,sk_c5) = sk_c6
| multiply(sk_c3,sk_c4) = sk_c6 ),
prove_this_14 ).
cnf(c_0_28,negated_conjecture,
( multiply(sk_c3,sk_c4) = sk_c6
| multiply(sk_c2,sk_c5) = identity ),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_29,negated_conjecture,
( multiply(sk_c2,sk_c5) = sk_c6
| multiply(sk_c3,sk_c4) = identity ),
inference(spm,[status(thm)],[c_0_19,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
( multiply(sk_c2,sk_c5) = identity
| sk_c6 = identity ),
inference(spm,[status(thm)],[c_0_10,c_0_25]) ).
cnf(c_0_31,negated_conjecture,
( multiply(sk_c7,sk_c6) = sk_c5
| multiply(sk_c5,sk_c6) = sk_c7 ),
prove_this_1 ).
cnf(c_0_32,plain,
multiply(inverse(identity),X1) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_33,negated_conjecture,
( multiply(inverse(X1),sk_c5) != sk_c6
| multiply(sk_c7,sk_c6) != sk_c5
| multiply(sk_c5,sk_c6) != sk_c7
| multiply(X1,inverse(X1)) != sk_c6
| multiply(X2,sk_c5) != sk_c6
| multiply(X3,sk_c7) != sk_c6
| inverse(X2) != sk_c5
| inverse(X3) != sk_c7 ),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_34,negated_conjecture,
( multiply(sk_c3,sk_c4) = sk_c6
| sk_c6 = identity ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,negated_conjecture,
( multiply(sk_c3,sk_c4) = identity
| sk_c6 = identity ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
( multiply(sk_c7,multiply(sk_c6,X1)) = multiply(sk_c5,X1)
| multiply(sk_c5,sk_c6) = sk_c7 ),
inference(spm,[status(thm)],[c_0_9,c_0_31]) ).
cnf(c_0_37,plain,
multiply(inverse(inverse(identity)),X1) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
( multiply(inverse(X1),sk_c5) != sk_c6
| multiply(sk_c7,sk_c6) != sk_c5
| multiply(sk_c5,sk_c6) != sk_c7
| multiply(X2,sk_c5) != sk_c6
| multiply(X3,sk_c7) != sk_c6
| inverse(X2) != sk_c5
| inverse(X3) != sk_c7
| sk_c6 != identity ),
inference(rw,[status(thm)],[c_0_33,c_0_19]) ).
cnf(c_0_39,negated_conjecture,
sk_c6 = identity,
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,negated_conjecture,
( multiply(sk_c5,inverse(sk_c6)) = sk_c7
| multiply(sk_c5,sk_c6) = sk_c7 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_19]),c_0_15]) ).
cnf(c_0_41,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_10,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( multiply(inverse(X1),sk_c5) != identity
| multiply(X2,sk_c5) != identity
| multiply(X3,sk_c7) != identity
| inverse(X2) != sk_c5
| inverse(X3) != sk_c7
| sk_c7 != sk_c5 ),
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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39]),c_0_39]),c_0_15]),c_0_39]),c_0_15]),c_0_39]),c_0_39]),c_0_39])]) ).
cnf(c_0_43,negated_conjecture,
sk_c7 = sk_c5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_39]),c_0_41]),c_0_15]),c_0_39]),c_0_15])]) ).
cnf(c_0_44,negated_conjecture,
( multiply(inverse(X1),sk_c5) != identity
| multiply(X2,sk_c5) != identity
| multiply(X3,sk_c5) != identity
| inverse(X2) != sk_c5
| inverse(X3) != sk_c5 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43]),c_0_43]),c_0_43])]) ).
cnf(c_0_45,negated_conjecture,
( multiply(X1,sk_c5) != identity
| multiply(X2,sk_c5) != identity
| inverse(X1) != sk_c5
| inverse(X2) != sk_c5 ),
inference(spm,[status(thm)],[c_0_44,c_0_10]) ).
cnf(c_0_46,negated_conjecture,
( multiply(X1,sk_c5) != identity
| inverse(X1) != sk_c5 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_10]),c_0_16])]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_16])]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP292-1 : TPTP v8.1.2. Released v2.5.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n007.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 02:47:25 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.20/0.50 Running first-order theorem proving
% 0.20/0.50 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.TvXJnCLQVU/E---3.1_5789.p
% 0.35/0.53 # Version: 3.1pre001
% 0.35/0.53 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.35/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.35/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.35/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.35/0.53 # Starting sh5l with 300s (1) cores
% 0.35/0.53 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 5888 completed with status 0
% 0.35/0.53 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.35/0.53 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.35/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.35/0.53 # No SInE strategy applied
% 0.35/0.53 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.35/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.35/0.53 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.35/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.35/0.53 # Starting new_bool_3 with 136s (1) cores
% 0.35/0.53 # Starting new_bool_1 with 136s (1) cores
% 0.35/0.53 # Starting sh5l with 136s (1) cores
% 0.35/0.53 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 5892 completed with status 0
% 0.35/0.53 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.35/0.53 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.35/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.35/0.53 # No SInE strategy applied
% 0.35/0.53 # Search class: FGHPS-FFMM21-SFFFFFNN
% 0.35/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.35/0.53 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 0.35/0.53 # Preprocessing time : 0.001 s
% 0.35/0.53 # Presaturation interreduction done
% 0.35/0.53
% 0.35/0.53 # Proof found!
% 0.35/0.53 # SZS status Unsatisfiable
% 0.35/0.53 # SZS output start CNFRefutation
% See solution above
% 0.35/0.53 # Parsed axioms : 24
% 0.35/0.53 # Removed by relevancy pruning/SinE : 0
% 0.35/0.53 # Initial clauses : 24
% 0.35/0.53 # Removed in clause preprocessing : 0
% 0.35/0.53 # Initial clauses in saturation : 24
% 0.35/0.53 # Processed clauses : 318
% 0.35/0.53 # ...of these trivial : 6
% 0.35/0.53 # ...subsumed : 122
% 0.35/0.53 # ...remaining for further processing : 190
% 0.35/0.53 # Other redundant clauses eliminated : 2
% 0.35/0.53 # Clauses deleted for lack of memory : 0
% 0.35/0.53 # Backward-subsumed : 2
% 0.35/0.53 # Backward-rewritten : 135
% 0.35/0.53 # Generated clauses : 1210
% 0.35/0.53 # ...of the previous two non-redundant : 1233
% 0.35/0.53 # ...aggressively subsumed : 0
% 0.35/0.53 # Contextual simplify-reflections : 1
% 0.35/0.53 # Paramodulations : 1207
% 0.35/0.53 # Factorizations : 1
% 0.35/0.53 # NegExts : 0
% 0.35/0.53 # Equation resolutions : 2
% 0.35/0.53 # Total rewrite steps : 636
% 0.35/0.53 # Propositional unsat checks : 0
% 0.35/0.53 # Propositional check models : 0
% 0.35/0.53 # Propositional check unsatisfiable : 0
% 0.35/0.53 # Propositional clauses : 0
% 0.35/0.53 # Propositional clauses after purity: 0
% 0.35/0.53 # Propositional unsat core size : 0
% 0.35/0.53 # Propositional preprocessing time : 0.000
% 0.35/0.53 # Propositional encoding time : 0.000
% 0.35/0.53 # Propositional solver time : 0.000
% 0.35/0.53 # Success case prop preproc time : 0.000
% 0.35/0.53 # Success case prop encoding time : 0.000
% 0.35/0.53 # Success case prop solver time : 0.000
% 0.35/0.53 # Current number of processed clauses : 28
% 0.35/0.53 # Positive orientable unit clauses : 12
% 0.35/0.53 # Positive unorientable unit clauses: 0
% 0.35/0.53 # Negative unit clauses : 0
% 0.35/0.53 # Non-unit-clauses : 16
% 0.35/0.53 # Current number of unprocessed clauses: 945
% 0.35/0.53 # ...number of literals in the above : 2238
% 0.35/0.53 # Current number of archived formulas : 0
% 0.35/0.53 # Current number of archived clauses : 161
% 0.35/0.53 # Clause-clause subsumption calls (NU) : 553
% 0.35/0.53 # Rec. Clause-clause subsumption calls : 531
% 0.35/0.53 # Non-unit clause-clause subsumptions : 125
% 0.35/0.53 # Unit Clause-clause subsumption calls : 15
% 0.35/0.53 # Rewrite failures with RHS unbound : 0
% 0.35/0.53 # BW rewrite match attempts : 8
% 0.35/0.53 # BW rewrite match successes : 7
% 0.35/0.53 # Condensation attempts : 0
% 0.35/0.53 # Condensation successes : 0
% 0.35/0.53 # Termbank termtop insertions : 11507
% 0.35/0.53
% 0.35/0.53 # -------------------------------------------------
% 0.35/0.53 # User time : 0.019 s
% 0.35/0.53 # System time : 0.003 s
% 0.35/0.53 # Total time : 0.022 s
% 0.35/0.53 # Maximum resident set size: 1584 pages
% 0.35/0.53
% 0.35/0.53 # -------------------------------------------------
% 0.35/0.53 # User time : 0.078 s
% 0.35/0.53 # System time : 0.008 s
% 0.35/0.53 # Total time : 0.086 s
% 0.35/0.53 # Maximum resident set size: 1680 pages
% 0.35/0.53 % E---3.1 exiting
% 0.35/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------