↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : GRP687-1 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n001.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 12:40:46 PM UTC 2026

% Result   : Unsatisfiable 1.00s 0.78s
% Output   : CNFRefutation 1.00s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   21
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   54 (  54 unt;   0 nHn;   4 RR)
%            Number of literals    :   54 (  53 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    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :  109 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c05,axiom,
    mult(X1,unit) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c05) ).

cnf(c07,axiom,
    mult(mult(X1,X1),mult(X2,X3)) = mult(mult(X1,mult(X1,X2)),X3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c07) ).

cnf(c04,axiom,
    rd(mult(X1,X2),X2) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c04) ).

cnf(c02,axiom,
    ld(X1,mult(X1,X2)) = X2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c02) ).

cnf(c03,axiom,
    mult(rd(X1,X2),X2) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c03) ).

cnf(c01,axiom,
    mult(X1,ld(X1,X2)) = X2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c01) ).

cnf(goals,negated_conjecture,
    mult(a,mult(b,mult(b,c))) != mult(mult(a,mult(b,b)),c),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

cnf(c_0_7,axiom,
    mult(X1,unit) = X1,
    c05 ).

cnf(c_0_8,axiom,
    mult(mult(X1,X1),mult(X2,X3)) = mult(mult(X1,mult(X1,X2)),X3),
    c07 ).

cnf(c_0_9,plain,
    mult(mult(X1,X1),X2) = mult(X1,mult(X1,X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_7]) ).

cnf(c_0_10,axiom,
    rd(mult(X1,X2),X2) = X1,
    c04 ).

cnf(c_0_11,plain,
    mult(mult(X1,mult(X1,X2)),X3) = mult(X1,mult(X1,mult(X2,X3))),
    inference(rw,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,axiom,
    ld(X1,mult(X1,X2)) = X2,
    c02 ).

cnf(c_0_13,axiom,
    mult(rd(X1,X2),X2) = X1,
    c03 ).

cnf(c_0_14,plain,
    rd(mult(X1,mult(X1,X2)),X2) = mult(X1,X1),
    inference(spm,[status(thm)],[c_0_10,c_0_9]) ).

cnf(c_0_15,axiom,
    mult(X1,ld(X1,X2)) = X2,
    c01 ).

cnf(c_0_16,plain,
    rd(mult(X1,mult(X1,mult(X2,X3))),X3) = mult(X1,mult(X1,X2)),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_17,plain,
    ld(rd(X1,X2),X1) = X2,
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_18,plain,
    rd(mult(X1,X2),ld(X1,X2)) = mult(X1,X1),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_19,plain,
    rd(mult(X1,mult(X1,X2)),ld(X3,X2)) = mult(X1,mult(X1,X3)),
    inference(spm,[status(thm)],[c_0_16,c_0_15]) ).

cnf(c_0_20,plain,
    ld(mult(X1,X1),mult(X1,X2)) = ld(X1,X2),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_21,plain,
    rd(mult(X1,X1),ld(X2,unit)) = mult(X1,mult(X1,X2)),
    inference(spm,[status(thm)],[c_0_19,c_0_7]) ).

cnf(c_0_22,plain,
    ld(X1,ld(X1,X2)) = ld(mult(X1,X1),X2),
    inference(spm,[status(thm)],[c_0_20,c_0_15]) ).

cnf(c_0_23,plain,
    ld(mult(X1,mult(X1,X2)),mult(X1,X1)) = ld(X2,unit),
    inference(spm,[status(thm)],[c_0_17,c_0_21]) ).

cnf(c_0_24,plain,
    mult(X1,ld(mult(X1,X1),X2)) = ld(X1,X2),
    inference(spm,[status(thm)],[c_0_15,c_0_22]) ).

cnf(c_0_25,plain,
    rd(X1,ld(X1,unit)) = mult(X1,X1),
    inference(spm,[status(thm)],[c_0_18,c_0_7]) ).

cnf(c_0_26,plain,
    ld(ld(mult(X1,X1),X2),unit) = ld(X2,mult(X1,X1)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_15]) ).

cnf(c_0_27,plain,
    ld(mult(X1,X1),X1) = ld(X1,unit),
    inference(spm,[status(thm)],[c_0_17,c_0_25]) ).

cnf(c_0_28,plain,
    mult(X1,mult(X1,mult(ld(X1,X2),X3))) = mult(mult(X1,X2),X3),
    inference(spm,[status(thm)],[c_0_11,c_0_15]) ).

cnf(c_0_29,plain,
    rd(X1,ld(X2,X1)) = X2,
    inference(spm,[status(thm)],[c_0_10,c_0_15]) ).

cnf(c_0_30,plain,
    ld(ld(X1,unit),unit) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_12]) ).

cnf(c_0_31,plain,
    mult(X1,mult(ld(X1,X2),X3)) = ld(X1,mult(mult(X1,X2),X3)),
    inference(spm,[status(thm)],[c_0_12,c_0_28]) ).

cnf(c_0_32,plain,
    ld(X1,unit) = rd(unit,X1),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_33,plain,
    mult(X1,mult(rd(unit,X1),X2)) = X2,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_7]),c_0_12]) ).

cnf(c_0_34,plain,
    mult(rd(unit,X1),X2) = ld(X1,X2),
    inference(spm,[status(thm)],[c_0_12,c_0_33]) ).

cnf(c_0_35,plain,
    rd(ld(X1,X2),X2) = rd(unit,X1),
    inference(spm,[status(thm)],[c_0_10,c_0_34]) ).

cnf(c_0_36,plain,
    mult(X1,mult(X1,rd(X2,X3))) = rd(mult(X1,mult(X1,X2)),X3),
    inference(spm,[status(thm)],[c_0_16,c_0_13]) ).

cnf(c_0_37,plain,
    rd(unit,rd(X1,X2)) = rd(X2,X1),
    inference(spm,[status(thm)],[c_0_35,c_0_17]) ).

cnf(c_0_38,plain,
    rd(mult(X1,X1),rd(X2,X3)) = rd(mult(X1,mult(X1,X3)),X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_36]),c_0_7]) ).

cnf(c_0_39,plain,
    rd(rd(X1,X2),mult(X3,X3)) = rd(X1,mult(X3,mult(X3,X2))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_37]) ).

cnf(c_0_40,plain,
    rd(mult(X1,X2),mult(X3,mult(X3,X2))) = rd(X1,mult(X3,X3)),
    inference(spm,[status(thm)],[c_0_39,c_0_10]) ).

cnf(c_0_41,plain,
    rd(ld(mult(X1,X1),X2),X3) = ld(mult(X1,X1),rd(X2,X3)),
    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_36,c_0_34]),c_0_34]),c_0_22]),c_0_34]),c_0_34]),c_0_22]) ).

cnf(c_0_42,plain,
    rd(unit,ld(mult(X1,X1),X2)) = ld(X2,mult(X1,X1)),
    inference(rw,[status(thm)],[c_0_26,c_0_32]) ).

cnf(c_0_43,plain,
    ld(rd(X1,X2),X3) = mult(rd(X2,X1),X3),
    inference(spm,[status(thm)],[c_0_34,c_0_37]) ).

cnf(c_0_44,plain,
    rd(mult(X1,ld(mult(X2,X2),X3)),X3) = rd(X1,mult(X2,X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_24]),c_0_15]) ).

cnf(c_0_45,plain,
    rd(X1,ld(mult(X2,X2),X3)) = mult(rd(X1,X3),mult(X2,X2)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_41]),c_0_42]),c_0_43]) ).

cnf(c_0_46,plain,
    rd(X1,unit) = X1,
    inference(spm,[status(thm)],[c_0_7,c_0_13]) ).

cnf(c_0_47,negated_conjecture,
    mult(a,mult(b,mult(b,c))) != mult(mult(a,mult(b,b)),c),
    inference(fof_simplification,[status(thm)],[goals]) ).

cnf(c_0_48,plain,
    mult(X1,ld(mult(X2,X2),X3)) = mult(rd(X1,mult(X2,X2)),X3),
    inference(spm,[status(thm)],[c_0_13,c_0_44]) ).

cnf(c_0_49,plain,
    ld(X1,rd(unit,X1)) = rd(unit,mult(X1,X1)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_32]),c_0_32]) ).

cnf(c_0_50,plain,
    rd(X1,rd(unit,mult(X2,X2))) = mult(X1,mult(X2,X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_32]),c_0_46]) ).

cnf(c_0_51,negated_conjecture,
    mult(a,mult(b,mult(b,c))) != mult(mult(a,mult(b,b)),c),
    c_0_47 ).

cnf(c_0_52,plain,
    mult(mult(X1,mult(X2,X2)),X3) = mult(X1,mult(X2,mult(X2,X3))),
    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_48,c_0_34]),c_0_49]),c_0_43]),c_0_46]),c_0_9]),c_0_49]),c_0_50]) ).

cnf(c_0_53,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : GRP687-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.47  % Computer : n001.cluster.edu
% 0.20/0.47  % Model    : x86_64 x86_64
% 0.20/0.47  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.47  % Memory   : 8046.5625MB
% 0.20/0.47  % OS       : Linux 6.8.0-71-generic
% 0.20/0.47  % CPULimit : 300
% 0.20/0.47  % WCLimit  : 300
% 0.20/0.47  % DateTime : Sun Sep 20 20:38:42 UTC 2026
% 0.20/0.48  % CPUTime  : 
% 0.20/0.48  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.53  Running first-order theorem proving
% 0.25/0.53  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/benchmark/theBenchmark.p
% 1.00/0.78  % Version: 3.5.1
% 1.00/0.78  % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.00/0.78  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.00/0.78  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.00/0.78  % Starting new_bool_3 with 300s (1) cores
% 1.00/0.78  % Starting new_bool_1 with 300s (1) cores
% 1.00/0.78  % Starting sh5l with 300s (1) cores
% 1.00/0.78  % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1369797 completed with status 0
% 1.00/0.78  % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.00/0.78  % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.00/0.78  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.00/0.78  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.00/0.78  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.00/0.78  % No SInE strategy applied
% 1.00/0.78  % Search class: FUUPM-FFSF22-MFFFFFNN
% 1.00/0.78  % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 1.00/0.78  % Starting SubtermCWHack with 136s (1) cores
% 1.00/0.78  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.00/0.78  % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 1.00/0.78  % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.00/0.78  % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.00/0.78  % U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 1369805 completed with status 0
% 1.00/0.78  % Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 1.00/0.78  % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.00/0.78  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.00/0.78  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.00/0.78  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.00/0.78  % No SInE strategy applied
% 1.00/0.78  % Search class: FUUPM-FFSF22-MFFFFFNN
% 1.00/0.78  % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 1.00/0.78  % Starting SubtermCWHack with 136s (1) cores
% 1.00/0.78  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.00/0.78  % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 1.00/0.78  % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.00/0.78  % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.00/0.78  % Preprocessing time       : 0.002 s
% 1.00/0.78  % Presaturation interreduction done
% 1.00/0.78  
% 1.00/0.78  % Proof found!
% 1.00/0.78  % SZS status Unsatisfiable
% 1.00/0.78  % SZS output start CNFRefutation
% See solution above
% 1.00/0.78  % Parsed axioms                        : 8
% 1.00/0.78  % Removed by relevancy pruning/SinE    : 0
% 1.00/0.78  % Initial clauses                      : 8
% 1.00/0.78  % Removed in clause preprocessing      : 0
% 1.00/0.78  % Initial clauses in saturation        : 8
% 1.00/0.78  % Processed clauses                    : 348
% 1.00/0.78  % ...of these trivial                  : 178
% 1.00/0.78  % ...subsumed                          : 0
% 1.00/0.78  % ...remaining for further processing  : 170
% 1.00/0.78  % Other redundant clauses eliminated   : 0
% 1.00/0.78  % Clauses deleted for lack of memory   : 0
% 1.00/0.78  % Backward-subsumed                    : 0
% 1.00/0.78  % Backward-rewritten                   : 44
% 1.00/0.78  % Generated clauses                    : 8432
% 1.00/0.78  % ...of the previous two non-redundant : 5405
% 1.00/0.78  % ...aggressively subsumed             : 0
% 1.00/0.78  % Contextual simplify-reflections      : 0
% 1.00/0.78  % Paramodulations                      : 8432
% 1.00/0.78  % Factorizations                       : 0
% 1.00/0.78  % NegExts                              : 0
% 1.00/0.78  % Equation resolutions                 : 0
% 1.00/0.78  % Disequality decompositions           : 0
% 1.00/0.78  % Total rewrite steps                  : 24433
% 1.00/0.78  % ...of those cached                   : 20591
% 1.00/0.78  % Propositional unsat checks           : 0
% 1.00/0.78  %    Propositional check models        : 0
% 1.00/0.78  %    Propositional check unsatisfiable : 0
% 1.00/0.78  %    Propositional clauses             : 0
% 1.00/0.78  %    Propositional clauses after purity: 0
% 1.00/0.78  %    Propositional unsat core size     : 0
% 1.00/0.78  %    Propositional preprocessing time  : 0.000
% 1.00/0.78  %    Propositional encoding time       : 0.000
% 1.00/0.78  %    Propositional solver time         : 0.000
% 1.00/0.78  %    Success case prop preproc time    : 0.000
% 1.00/0.78  %    Success case prop encoding time   : 0.000
% 1.00/0.78  %    Success case prop solver time     : 0.000
% 1.00/0.78  % Current number of processed clauses  : 118
% 1.00/0.78  %    Positive orientable unit clauses  : 116
% 1.00/0.78  %    Positive unorientable unit clauses: 2
% 1.00/0.78  %    Negative unit clauses             : 0
% 1.00/0.78  %    Non-unit-clauses                  : 0
% 1.00/0.78  % Current number of unprocessed clauses: 4971
% 1.00/0.78  % ...number of literals in the above   : 4971
% 1.00/0.78  % Current number of archived formulas  : 0
% 1.00/0.78  % Current number of archived clauses   : 52
% 1.00/0.78  % Clause-clause subsumption calls (NU) : 0
% 1.00/0.78  % Rec. Clause-clause subsumption calls : 0
% 1.00/0.78  % Non-unit clause-clause subsumptions  : 0
% 1.00/0.78  % Unit Clause-clause subsumption calls : 5
% 1.00/0.78  % Rewrite failures with RHS unbound    : 0
% 1.00/0.78  % BW rewrite match attempts            : 136
% 1.00/0.78  % BW rewrite match successes           : 50
% 1.00/0.78  % Condensation attempts                : 0
% 1.00/0.78  % Condensation successes               : 0
% 1.00/0.78  % Termbank termtop insertions          : 122077
% 1.00/0.78  % Search garbage collected termcells   : 2
% 1.00/0.78  
% 1.00/0.78  % -------------------------------------------------
% 1.00/0.78  % User time                : 0.196 s
% 1.00/0.78  % System time              : 0.012 s
% 1.00/0.78  % Total time               : 0.208 s
% 1.00/0.78  % Maximum resident set size: 3632 pages
% 1.00/0.78  
% 1.00/0.78  % -------------------------------------------------
% 1.00/0.78  % User time                : 0.823 s
% 1.00/0.78  % System time              : 0.063 s
% 1.00/0.78  % Total time               : 0.886 s
% 1.00/0.78  % Maximum resident set size: 4608 pages
% 1.00/0.78  % E exiting
%------------------------------------------------------------------------------