TSTP Solution File: GRP697-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP697-1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:42:57 EDT 2023
% Result : Unsatisfiable 6.17s 1.42s
% Output : CNFRefutation 6.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of clauses : 61 ( 61 unt; 0 nHn; 3 RR)
% Number of literals : 61 ( 60 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 117 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox2/tmp/tmp.eomYx8V5h9/E---3.1_6684.p',c02) ).
cnf(c10,axiom,
mult(i(X1),X1) = unit,
file('/export/starexec/sandbox2/tmp/tmp.eomYx8V5h9/E---3.1_6684.p',c10) ).
cnf(c11,axiom,
mult(X1,i(X1)) = unit,
file('/export/starexec/sandbox2/tmp/tmp.eomYx8V5h9/E---3.1_6684.p',c11) ).
cnf(c08,axiom,
mult(X1,mult(X2,X3)) = mult(rd(mult(X1,X2),X1),mult(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.eomYx8V5h9/E---3.1_6684.p',c08) ).
cnf(c05,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox2/tmp/tmp.eomYx8V5h9/E---3.1_6684.p',c05) ).
cnf(c07,axiom,
mult(X1,i(mult(X2,X1))) = i(X2),
file('/export/starexec/sandbox2/tmp/tmp.eomYx8V5h9/E---3.1_6684.p',c07) ).
cnf(c03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/tmp/tmp.eomYx8V5h9/E---3.1_6684.p',c03) ).
cnf(c04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox2/tmp/tmp.eomYx8V5h9/E---3.1_6684.p',c04) ).
cnf(c01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox2/tmp/tmp.eomYx8V5h9/E---3.1_6684.p',c01) ).
cnf(c09,axiom,
mult(mult(X1,X2),X3) = mult(mult(X1,X3),ld(X3,mult(X2,X3))),
file('/export/starexec/sandbox2/tmp/tmp.eomYx8V5h9/E---3.1_6684.p',c09) ).
cnf(c06,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.eomYx8V5h9/E---3.1_6684.p',c06) ).
cnf(goals,negated_conjecture,
mult(mult(a,b),mult(b,mult(c,b))) != mult(mult(a,mult(b,mult(b,c))),b),
file('/export/starexec/sandbox2/tmp/tmp.eomYx8V5h9/E---3.1_6684.p',goals) ).
cnf(c_0_12,axiom,
ld(X1,mult(X1,X2)) = X2,
c02 ).
cnf(c_0_13,axiom,
mult(i(X1),X1) = unit,
c10 ).
cnf(c_0_14,axiom,
mult(X1,i(X1)) = unit,
c11 ).
cnf(c_0_15,axiom,
mult(X1,mult(X2,X3)) = mult(rd(mult(X1,X2),X1),mult(X1,X3)),
c08 ).
cnf(c_0_16,axiom,
mult(X1,unit) = X1,
c05 ).
cnf(c_0_17,axiom,
mult(X1,i(mult(X2,X1))) = i(X2),
c07 ).
cnf(c_0_18,plain,
ld(i(X1),unit) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
ld(X1,unit) = i(X1),
inference(spm,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_20,axiom,
mult(rd(X1,X2),X2) = X1,
c03 ).
cnf(c_0_21,axiom,
rd(mult(X1,X2),X2) = X1,
c04 ).
cnf(c_0_22,plain,
rd(mult(X1,X2),X1) = mult(X1,mult(X2,i(X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_14]),c_0_16]) ).
cnf(c_0_23,axiom,
mult(X1,ld(X1,X2)) = X2,
c01 ).
cnf(c_0_24,plain,
ld(X1,i(X2)) = i(mult(X2,X1)),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_25,plain,
i(i(X1)) = X1,
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,plain,
ld(rd(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_12,c_0_20]) ).
cnf(c_0_27,axiom,
mult(mult(X1,X2),X3) = mult(mult(X1,X3),ld(X3,mult(X2,X3))),
c09 ).
cnf(c_0_28,axiom,
mult(unit,X1) = X1,
c06 ).
cnf(c_0_29,plain,
rd(i(X1),i(mult(X1,X2))) = X2,
inference(spm,[status(thm)],[c_0_21,c_0_17]) ).
cnf(c_0_30,plain,
i(rd(X1,X2)) = mult(X2,i(X1)),
inference(spm,[status(thm)],[c_0_17,c_0_20]) ).
cnf(c_0_31,plain,
mult(X1,mult(ld(X1,X2),i(X1))) = rd(X2,X1),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_32,plain,
i(mult(i(X1),X2)) = ld(X2,X1),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_33,plain,
ld(mult(X1,mult(X2,i(X1))),mult(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_22]) ).
cnf(c_0_34,plain,
mult(i(mult(X1,X2)),X1) = i(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_17]),c_0_25]) ).
cnf(c_0_35,plain,
ld(X1,mult(X2,X1)) = mult(mult(i(X1),X2),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_13]),c_0_28]) ).
cnf(c_0_36,plain,
rd(i(X1),X2) = i(mult(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_17]),c_0_25]) ).
cnf(c_0_37,plain,
i(mult(X1,i(X2))) = rd(X2,X1),
inference(spm,[status(thm)],[c_0_25,c_0_30]) ).
cnf(c_0_38,plain,
ld(X1,rd(X2,X1)) = mult(ld(X1,X2),i(X1)),
inference(spm,[status(thm)],[c_0_12,c_0_31]) ).
cnf(c_0_39,plain,
ld(X1,rd(X2,X3)) = i(mult(mult(X3,i(X2)),X1)),
inference(spm,[status(thm)],[c_0_32,c_0_30]) ).
cnf(c_0_40,plain,
ld(mult(X1,i(X2)),mult(X1,ld(X2,X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_32]) ).
cnf(c_0_41,plain,
mult(X1,mult(mult(i(X1),X2),X1)) = mult(X2,X1),
inference(spm,[status(thm)],[c_0_23,c_0_35]) ).
cnf(c_0_42,plain,
mult(X1,mult(i(mult(X2,X1)),i(X1))) = i(mult(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_17]),c_0_36]) ).
cnf(c_0_43,plain,
rd(X1,i(X2)) = ld(i(X1),X2),
inference(spm,[status(thm)],[c_0_32,c_0_37]) ).
cnf(c_0_44,plain,
i(mult(mult(X1,i(X2)),X1)) = mult(ld(X1,X2),i(X1)),
inference(rw,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,plain,
mult(mult(X1,i(X2)),X1) = mult(X1,ld(X2,X1)),
inference(spm,[status(thm)],[c_0_23,c_0_40]) ).
cnf(c_0_46,plain,
mult(mult(X1,ld(X2,mult(X3,X2))),ld(ld(X2,mult(X3,X2)),mult(mult(X4,X3),X2))) = mult(mult(X1,mult(X4,X2)),ld(X2,mult(X3,X2))),
inference(spm,[status(thm)],[c_0_27,c_0_27]) ).
cnf(c_0_47,plain,
mult(ld(i(X1),X2),X1) = mult(X1,mult(X2,X1)),
inference(spm,[status(thm)],[c_0_41,c_0_23]) ).
cnf(c_0_48,plain,
ld(i(X1),mult(X2,X1)) = mult(mult(X1,X2),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_42]),c_0_25]),c_0_37]),c_0_43]) ).
cnf(c_0_49,plain,
ld(mult(X1,X2),mult(X1,ld(i(X2),X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_20]),c_0_43]) ).
cnf(c_0_50,plain,
i(mult(X1,ld(X2,X1))) = mult(ld(X1,X2),i(X1)),
inference(rw,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_51,plain,
mult(mult(X1,mult(mult(i(X2),X3),X2)),ld(mult(mult(i(X2),X3),X2),mult(mult(X4,X3),X2))) = mult(mult(X1,mult(X4,X2)),mult(mult(i(X2),X3),X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_35]),c_0_35]),c_0_35]) ).
cnf(c_0_52,plain,
mult(mult(mult(X1,X2),X1),X1) = mult(X1,mult(mult(X2,X1),X1)),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,plain,
mult(X1,ld(i(X2),X1)) = mult(mult(X1,X2),X1),
inference(spm,[status(thm)],[c_0_23,c_0_49]) ).
cnf(c_0_54,plain,
ld(i(mult(X1,X2)),X1) = mult(X1,mult(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_50]),c_0_25]),c_0_47]),c_0_24]) ).
cnf(c_0_55,plain,
mult(mult(X1,mult(mult(X2,X3),X2)),X2) = mult(mult(X1,X2),mult(mult(X3,X2),X2)),
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(spm,[status(thm)],[c_0_51,c_0_52]),c_0_13]),c_0_28]),c_0_13]),c_0_28]),c_0_12]),c_0_13]),c_0_28]) ).
cnf(c_0_56,plain,
mult(mult(X1,mult(X1,X2)),X1) = mult(X1,mult(X1,mult(X2,X1))),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_57,plain,
mult(mult(X1,mult(X2,mult(X2,mult(X3,X2)))),X2) = mult(mult(X1,X2),mult(X2,mult(mult(X3,X2),X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_52]) ).
cnf(c_0_58,negated_conjecture,
mult(mult(a,b),mult(b,mult(c,b))) != mult(mult(a,mult(b,mult(b,c))),b),
goals ).
cnf(c_0_59,plain,
mult(mult(X1,mult(X2,mult(X2,X3))),X2) = mult(mult(X1,X2),mult(X2,mult(X3,X2))),
inference(spm,[status(thm)],[c_0_57,c_0_20]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.09 % Problem : GRP697-1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.10 % Command : run_E %s %d THM
% 0.10/0.28 % Computer : n032.cluster.edu
% 0.10/0.28 % Model : x86_64 x86_64
% 0.10/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.28 % Memory : 8042.1875MB
% 0.10/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.28 % CPULimit : 2400
% 0.10/0.28 % WCLimit : 300
% 0.10/0.28 % DateTime : Tue Oct 3 02:36:50 EDT 2023
% 0.10/0.29 % CPUTime :
% 0.14/0.38 Running first-order theorem proving
% 0.14/0.38 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.eomYx8V5h9/E---3.1_6684.p
% 6.17/1.42 # Version: 3.1pre001
% 6.17/1.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 6.17/1.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.17/1.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 6.17/1.42 # Starting new_bool_3 with 300s (1) cores
% 6.17/1.42 # Starting new_bool_1 with 300s (1) cores
% 6.17/1.42 # Starting sh5l with 300s (1) cores
% 6.17/1.42 # new_bool_3 with pid 6851 completed with status 8
% 6.17/1.42 # new_bool_1 with pid 6852 completed with status 8
% 6.17/1.42 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 6850 completed with status 0
% 6.17/1.42 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 6.17/1.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 6.17/1.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.17/1.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 6.17/1.42 # No SInE strategy applied
% 6.17/1.42 # Search class: FUUPM-FFSF21-MFFFFFNN
% 6.17/1.42 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 6.17/1.42 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 6.17/1.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 6.17/1.42 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 6.17/1.42 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 6.17/1.42 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 6.17/1.42 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 6855 completed with status 0
% 6.17/1.42 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 6.17/1.42 # Preprocessing class: FSSSSMSSSSSNFFN.
% 6.17/1.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.17/1.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 6.17/1.42 # No SInE strategy applied
% 6.17/1.42 # Search class: FUUPM-FFSF21-MFFFFFNN
% 6.17/1.42 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 6.17/1.42 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 6.17/1.42 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 6.17/1.42 # Preprocessing time : 0.003 s
% 6.17/1.42
% 6.17/1.42 # Proof found!
% 6.17/1.42 # SZS status Unsatisfiable
% 6.17/1.42 # SZS output start CNFRefutation
% See solution above
% 6.17/1.42 # Parsed axioms : 12
% 6.17/1.42 # Removed by relevancy pruning/SinE : 0
% 6.17/1.42 # Initial clauses : 12
% 6.17/1.42 # Removed in clause preprocessing : 0
% 6.17/1.42 # Initial clauses in saturation : 12
% 6.17/1.42 # Processed clauses : 705
% 6.17/1.42 # ...of these trivial : 236
% 6.17/1.42 # ...subsumed : 47
% 6.17/1.42 # ...remaining for further processing : 422
% 6.17/1.42 # Other redundant clauses eliminated : 0
% 6.17/1.42 # Clauses deleted for lack of memory : 0
% 6.17/1.42 # Backward-subsumed : 1
% 6.17/1.42 # Backward-rewritten : 166
% 6.17/1.42 # Generated clauses : 69524
% 6.17/1.42 # ...of the previous two non-redundant : 59102
% 6.17/1.42 # ...aggressively subsumed : 0
% 6.17/1.42 # Contextual simplify-reflections : 0
% 6.17/1.42 # Paramodulations : 69524
% 6.17/1.42 # Factorizations : 0
% 6.17/1.42 # NegExts : 0
% 6.17/1.42 # Equation resolutions : 0
% 6.17/1.42 # Total rewrite steps : 268277
% 6.17/1.42 # Propositional unsat checks : 0
% 6.17/1.42 # Propositional check models : 0
% 6.17/1.42 # Propositional check unsatisfiable : 0
% 6.17/1.42 # Propositional clauses : 0
% 6.17/1.42 # Propositional clauses after purity: 0
% 6.17/1.42 # Propositional unsat core size : 0
% 6.17/1.42 # Propositional preprocessing time : 0.000
% 6.17/1.42 # Propositional encoding time : 0.000
% 6.17/1.42 # Propositional solver time : 0.000
% 6.17/1.42 # Success case prop preproc time : 0.000
% 6.17/1.42 # Success case prop encoding time : 0.000
% 6.17/1.42 # Success case prop solver time : 0.000
% 6.17/1.42 # Current number of processed clauses : 255
% 6.17/1.42 # Positive orientable unit clauses : 254
% 6.17/1.42 # Positive unorientable unit clauses: 1
% 6.17/1.42 # Negative unit clauses : 0
% 6.17/1.42 # Non-unit-clauses : 0
% 6.17/1.42 # Current number of unprocessed clauses: 57480
% 6.17/1.42 # ...number of literals in the above : 57480
% 6.17/1.42 # Current number of archived formulas : 0
% 6.17/1.42 # Current number of archived clauses : 167
% 6.17/1.42 # Clause-clause subsumption calls (NU) : 0
% 6.17/1.42 # Rec. Clause-clause subsumption calls : 0
% 6.17/1.42 # Non-unit clause-clause subsumptions : 0
% 6.17/1.42 # Unit Clause-clause subsumption calls : 167
% 6.17/1.42 # Rewrite failures with RHS unbound : 0
% 6.17/1.42 # BW rewrite match attempts : 3228
% 6.17/1.42 # BW rewrite match successes : 192
% 6.17/1.42 # Condensation attempts : 0
% 6.17/1.42 # Condensation successes : 0
% 6.17/1.42 # Termbank termtop insertions : 1548869
% 6.17/1.42
% 6.17/1.42 # -------------------------------------------------
% 6.17/1.42 # User time : 0.979 s
% 6.17/1.42 # System time : 0.028 s
% 6.17/1.42 # Total time : 1.006 s
% 6.17/1.42 # Maximum resident set size: 1516 pages
% 6.17/1.42
% 6.17/1.42 # -------------------------------------------------
% 6.17/1.42 # User time : 4.876 s
% 6.17/1.42 # System time : 0.243 s
% 6.17/1.42 # Total time : 5.119 s
% 6.17/1.42 # Maximum resident set size: 1672 pages
% 6.17/1.42 % E---3.1 exiting
% 6.17/1.42 % E---3.1 exiting
%------------------------------------------------------------------------------