TSTP Solution File: GRP667-3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP667-3 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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 : Mon May 20 20:50:39 EDT 2024
% Result : Unsatisfiable 15.71s 2.46s
% Output : CNFRefutation 15.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of clauses : 61 ( 61 unt; 0 nHn; 4 RR)
% Number of literals : 61 ( 60 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 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 : 115 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c08,axiom,
mult(mult(X1,X2),X1) = mult(X1,mult(X2,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c08) ).
cnf(c01,axiom,
mult(X1,ld(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c01) ).
cnf(c07,axiom,
mult(mult(X1,X2),mult(mult(X3,X2),X3)) = mult(mult(X1,mult(mult(X2,X3),X2)),X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c07) ).
cnf(c02,axiom,
ld(X1,mult(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c02) ).
cnf(c05,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c05) ).
cnf(c04,axiom,
rd(mult(X1,X2),X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c04) ).
cnf(c06,axiom,
mult(unit,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c06) ).
cnf(c03,axiom,
mult(rd(X1,X2),X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c03) ).
cnf(c09,axiom,
mult(f(X1),f(X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c09) ).
cnf(goals,negated_conjecture,
mult(a,mult(b,mult(c,b))) != mult(mult(mult(a,b),c),b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(c_0_10,axiom,
mult(mult(X1,X2),X1) = mult(X1,mult(X2,X1)),
c08 ).
cnf(c_0_11,axiom,
mult(X1,ld(X1,X2)) = X2,
c01 ).
cnf(c_0_12,axiom,
mult(mult(X1,X2),mult(mult(X3,X2),X3)) = mult(mult(X1,mult(mult(X2,X3),X2)),X3),
c07 ).
cnf(c_0_13,axiom,
ld(X1,mult(X1,X2)) = X2,
c02 ).
cnf(c_0_14,plain,
mult(X1,mult(ld(X1,X2),X1)) = mult(X2,X1),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,axiom,
mult(X1,unit) = X1,
c05 ).
cnf(c_0_16,axiom,
rd(mult(X1,X2),X2) = X1,
c04 ).
cnf(c_0_17,plain,
mult(mult(X1,mult(X2,mult(X3,X2))),X3) = mult(mult(X1,X2),mult(X3,mult(X2,X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_10]),c_0_10]) ).
cnf(c_0_18,plain,
ld(X1,mult(X2,X1)) = mult(ld(X1,X2),X1),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,axiom,
mult(unit,X1) = X1,
c06 ).
cnf(c_0_20,plain,
ld(X1,X1) = unit,
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_21,plain,
rd(mult(X1,mult(X2,X1)),X1) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_16,c_0_10]) ).
cnf(c_0_22,axiom,
mult(rd(X1,X2),X2) = X1,
c03 ).
cnf(c_0_23,plain,
rd(mult(mult(X1,X2),mult(X3,mult(X2,X3))),X3) = mult(X1,mult(X2,mult(X3,X2))),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,plain,
mult(ld(X1,unit),X1) = unit,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_25,plain,
rd(mult(X1,X2),X1) = mult(X1,rd(X2,X1)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
mult(ld(X1,unit),mult(X1,mult(X2,X1))) = mult(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_19]),c_0_25]),c_0_16]) ).
cnf(c_0_27,plain,
mult(ld(X1,rd(X2,X1)),X1) = ld(X1,X2),
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_28,plain,
mult(mult(X1,mult(X2,X1)),X2) = mult(X1,mult(X2,mult(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_19]),c_0_19]) ).
cnf(c_0_29,plain,
mult(mult(X1,X2),X2) = mult(X1,mult(X2,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_17]),c_0_15]),c_0_19]),c_0_19]) ).
cnf(c_0_30,plain,
mult(ld(X1,unit),X2) = ld(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_11]) ).
cnf(c_0_31,plain,
mult(mult(X1,X2),ld(X2,X1)) = mult(X2,mult(ld(X2,X1),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_14]),c_0_11]) ).
cnf(c_0_32,plain,
ld(rd(X1,X2),X1) = X2,
inference(spm,[status(thm)],[c_0_13,c_0_22]) ).
cnf(c_0_33,plain,
ld(X1,mult(X2,X2)) = mult(ld(X1,X2),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_30]) ).
cnf(c_0_34,plain,
mult(mult(X1,rd(X1,X2)),X2) = mult(rd(X1,X2),mult(X2,X1)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,plain,
mult(X1,mult(ld(X1,X2),X2)) = mult(X2,X2),
inference(spm,[status(thm)],[c_0_11,c_0_33]) ).
cnf(c_0_36,plain,
rd(mult(rd(X1,X2),mult(X2,X1)),X2) = mult(X1,rd(X1,X2)),
inference(spm,[status(thm)],[c_0_16,c_0_34]) ).
cnf(c_0_37,plain,
mult(rd(X1,X2),mult(X2,X1)) = mult(X1,X1),
inference(spm,[status(thm)],[c_0_35,c_0_32]) ).
cnf(c_0_38,plain,
ld(mult(X1,X2),mult(X2,mult(ld(X2,X1),X1))) = ld(X2,X1),
inference(spm,[status(thm)],[c_0_13,c_0_31]) ).
cnf(c_0_39,plain,
rd(mult(X1,X1),X2) = mult(X1,rd(X1,X2)),
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,plain,
rd(ld(X1,X2),X2) = ld(X1,unit),
inference(spm,[status(thm)],[c_0_16,c_0_30]) ).
cnf(c_0_41,plain,
mult(mult(X1,X2),mult(X1,mult(X2,X1))) = mult(X1,mult(X2,mult(X1,mult(X2,X1)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_17]),c_0_28]) ).
cnf(c_0_42,plain,
mult(ld(mult(X1,X2),X1),X1) = ld(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_35]),c_0_33]) ).
cnf(c_0_43,plain,
mult(X1,rd(X1,mult(X2,X1))) = rd(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_37]),c_0_39]) ).
cnf(c_0_44,plain,
rd(X1,mult(X2,X1)) = ld(X2,unit),
inference(spm,[status(thm)],[c_0_40,c_0_13]) ).
cnf(c_0_45,plain,
mult(mult(ld(X1,X2),X2),X1) = mult(ld(X1,X2),mult(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_11]),c_0_14]) ).
cnf(c_0_46,plain,
mult(X1,mult(ld(X1,X2),mult(X2,X1))) = mult(X2,mult(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_14]),c_0_11]) ).
cnf(c_0_47,plain,
mult(mult(X1,mult(X2,X3)),ld(X3,X2)) = mult(mult(X1,X3),mult(ld(X3,X2),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_14]),c_0_11]) ).
cnf(c_0_48,plain,
ld(mult(X1,X2),X1) = ld(X2,unit),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_42]),c_0_40]) ).
cnf(c_0_49,plain,
mult(X1,ld(X2,unit)) = rd(X1,X2),
inference(rw,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_50,plain,
mult(mult(X1,X1),X2) = mult(X1,mult(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_33]),c_0_45]),c_0_46]) ).
cnf(c_0_51,axiom,
mult(f(X1),f(X1)) = X1,
c09 ).
cnf(c_0_52,plain,
rd(mult(X1,mult(X2,mult(X2,X3))),X3) = mult(mult(X1,X3),mult(ld(X3,X2),X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_30]),c_0_47]) ).
cnf(c_0_53,plain,
mult(f(X1),mult(f(X1),X2)) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_54,plain,
mult(ld(X1,f(X2)),f(X2)) = ld(X1,X2),
inference(spm,[status(thm)],[c_0_33,c_0_51]) ).
cnf(c_0_55,plain,
rd(mult(X1,mult(X2,X3)),X3) = mult(mult(X1,X3),ld(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]) ).
cnf(c_0_56,negated_conjecture,
mult(a,mult(b,mult(c,b))) != mult(mult(mult(a,b),c),b),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_57,plain,
mult(mult(mult(X1,X2),ld(X2,X3)),X2) = mult(X1,mult(X3,X2)),
inference(spm,[status(thm)],[c_0_22,c_0_55]) ).
cnf(c_0_58,negated_conjecture,
mult(a,mult(b,mult(c,b))) != mult(mult(mult(a,b),c),b),
c_0_56 ).
cnf(c_0_59,plain,
mult(mult(mult(X1,X2),X3),X2) = mult(X1,mult(X2,mult(X3,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_13]),c_0_10]) ).
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.12 % Problem : GRP667-3 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n012.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun May 19 04:27:07 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 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/benchmark/theBenchmark.p
% 15.71/2.46 # Version: 3.1.0
% 15.71/2.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 15.71/2.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.71/2.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 15.71/2.46 # Starting new_bool_3 with 300s (1) cores
% 15.71/2.46 # Starting new_bool_1 with 300s (1) cores
% 15.71/2.46 # Starting sh5l with 300s (1) cores
% 15.71/2.46 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3765 completed with status 0
% 15.71/2.46 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 15.71/2.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 15.71/2.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.71/2.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 15.71/2.46 # No SInE strategy applied
% 15.71/2.46 # Search class: FUUPM-FFSF21-MFFFFFNN
% 15.71/2.46 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 15.71/2.46 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 15.71/2.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 15.71/2.46 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 15.71/2.46 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 15.71/2.46 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 15.71/2.46 # G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with pid 3772 completed with status 0
% 15.71/2.46 # Result found by G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y
% 15.71/2.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 15.71/2.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.71/2.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 15.71/2.46 # No SInE strategy applied
% 15.71/2.46 # Search class: FUUPM-FFSF21-MFFFFFNN
% 15.71/2.46 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 15.71/2.46 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 15.71/2.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 15.71/2.46 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 15.71/2.46 # Preprocessing time : 0.001 s
% 15.71/2.46
% 15.71/2.46 # Proof found!
% 15.71/2.46 # SZS status Unsatisfiable
% 15.71/2.46 # SZS output start CNFRefutation
% See solution above
% 15.71/2.46 # Parsed axioms : 10
% 15.71/2.46 # Removed by relevancy pruning/SinE : 0
% 15.71/2.46 # Initial clauses : 10
% 15.71/2.46 # Removed in clause preprocessing : 0
% 15.71/2.46 # Initial clauses in saturation : 10
% 15.71/2.46 # Processed clauses : 3303
% 15.71/2.46 # ...of these trivial : 2160
% 15.71/2.46 # ...subsumed : 379
% 15.71/2.46 # ...remaining for further processing : 764
% 15.71/2.46 # Other redundant clauses eliminated : 0
% 15.71/2.46 # Clauses deleted for lack of memory : 0
% 15.71/2.46 # Backward-subsumed : 0
% 15.71/2.46 # Backward-rewritten : 233
% 15.71/2.46 # Generated clauses : 186965
% 15.71/2.46 # ...of the previous two non-redundant : 150020
% 15.71/2.46 # ...aggressively subsumed : 0
% 15.71/2.46 # Contextual simplify-reflections : 0
% 15.71/2.46 # Paramodulations : 186965
% 15.71/2.46 # Factorizations : 0
% 15.71/2.46 # NegExts : 0
% 15.71/2.46 # Equation resolutions : 0
% 15.71/2.46 # Disequality decompositions : 0
% 15.71/2.46 # Total rewrite steps : 488664
% 15.71/2.46 # ...of those cached : 432779
% 15.71/2.46 # Propositional unsat checks : 0
% 15.71/2.46 # Propositional check models : 0
% 15.71/2.46 # Propositional check unsatisfiable : 0
% 15.71/2.46 # Propositional clauses : 0
% 15.71/2.46 # Propositional clauses after purity: 0
% 15.71/2.46 # Propositional unsat core size : 0
% 15.71/2.46 # Propositional preprocessing time : 0.000
% 15.71/2.46 # Propositional encoding time : 0.000
% 15.71/2.46 # Propositional solver time : 0.000
% 15.71/2.46 # Success case prop preproc time : 0.000
% 15.71/2.46 # Success case prop encoding time : 0.000
% 15.71/2.46 # Success case prop solver time : 0.000
% 15.71/2.46 # Current number of processed clauses : 531
% 15.71/2.46 # Positive orientable unit clauses : 526
% 15.71/2.46 # Positive unorientable unit clauses: 5
% 15.71/2.46 # Negative unit clauses : 0
% 15.71/2.46 # Non-unit-clauses : 0
% 15.71/2.46 # Current number of unprocessed clauses: 146206
% 15.71/2.46 # ...number of literals in the above : 146206
% 15.71/2.46 # Current number of archived formulas : 0
% 15.71/2.46 # Current number of archived clauses : 233
% 15.71/2.46 # Clause-clause subsumption calls (NU) : 0
% 15.71/2.46 # Rec. Clause-clause subsumption calls : 0
% 15.71/2.46 # Non-unit clause-clause subsumptions : 0
% 15.71/2.46 # Unit Clause-clause subsumption calls : 21
% 15.71/2.46 # Rewrite failures with RHS unbound : 0
% 15.71/2.46 # BW rewrite match attempts : 3079
% 15.71/2.46 # BW rewrite match successes : 217
% 15.71/2.46 # Condensation attempts : 3303
% 15.71/2.46 # Condensation successes : 0
% 15.71/2.46 # Termbank termtop insertions : 2982411
% 15.71/2.46 # Search garbage collected termcells : 2
% 15.71/2.46
% 15.71/2.46 # -------------------------------------------------
% 15.71/2.46 # User time : 1.854 s
% 15.71/2.46 # System time : 0.076 s
% 15.71/2.46 # Total time : 1.930 s
% 15.71/2.46 # Maximum resident set size: 1556 pages
% 15.71/2.46
% 15.71/2.46 # -------------------------------------------------
% 15.71/2.46 # User time : 9.334 s
% 15.71/2.46 # System time : 0.347 s
% 15.71/2.46 # Total time : 9.681 s
% 15.71/2.46 # Maximum resident set size: 1688 pages
% 15.71/2.46 % E---3.1 exiting
% 15.71/2.46 % E exiting
%------------------------------------------------------------------------------