↑ Up

E---3.5.1.UNS-CRf.s

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

% Computer : n014.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:58 PM UTC 2026

% Result   : Unsatisfiable 1.00s 0.58s
% Output   : CNFRefutation 1.00s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   24 (  24 unt;   0 nHn;   4 RR)
%            Number of literals    :   24 (  23 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   :   42 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c08,axiom,
    mult(mult(X1,X2),mult(X2,mult(X3,X2))) = mult(mult(X1,mult(X2,mult(X2,X3))),X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c08) ).

cnf(c06,axiom,
    mult(unit,X1) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c06) ).

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

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

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

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

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

cnf(c_0_7,axiom,
    mult(mult(X1,X2),mult(X2,mult(X3,X2))) = mult(mult(X1,mult(X2,mult(X2,X3))),X2),
    c08 ).

cnf(c_0_8,axiom,
    mult(unit,X1) = X1,
    c06 ).

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

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

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

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

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

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

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

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

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

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

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

cnf(c_0_20,plain,
    mult(mult(X1,rd(X2,X3)),X3) = mult(mult(X1,X3),ld(X3,X2)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_18]),c_0_16]),c_0_12]),c_0_16]) ).

cnf(c_0_21,negated_conjecture,
    mult(mult(a,b),c) != mult(mult(a,c),ld(c,mult(b,c))),
    c_0_19 ).

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

cnf(c_0_23,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : GRP699-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.42  % Computer : n014.cluster.edu
% 0.17/0.42  % Model    : x86_64 x86_64
% 0.17/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42  % Memory   : 8046.5625MB
% 0.17/0.42  % OS       : Linux 6.8.0-71-generic
% 0.17/0.42  % CPULimit : 300
% 0.17/0.42  % WCLimit  : 300
% 0.17/0.42  % DateTime : Sun Sep 20 20:34:06 UTC 2026
% 0.17/0.43  % CPUTime  : 
% 0.17/0.43  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.47  Running first-order theorem proving
% 0.17/0.47  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
% 1.00/0.58  % Version: 3.5.1
% 1.00/0.58  % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.00/0.58  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.00/0.58  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.00/0.58  % Starting new_bool_3 with 300s (1) cores
% 1.00/0.58  % Starting new_bool_1 with 300s (1) cores
% 1.00/0.58  % Starting sh5l with 300s (1) cores
% 1.00/0.58  % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2312127 completed with status 0
% 1.00/0.58  % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.00/0.58  % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.00/0.58  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.00/0.58  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.00/0.58  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.00/0.58  % No SInE strategy applied
% 1.00/0.58  % Search class: FUUPM-FFSF22-MFFFFFNN
% 1.00/0.58  % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 1.00/0.58  % Starting SubtermCWHack with 136s (1) cores
% 1.00/0.58  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.00/0.58  % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 1.00/0.58  % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.00/0.58  % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.00/0.58  % U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 2312139 completed with status 0
% 1.00/0.58  % Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 1.00/0.58  % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.00/0.58  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.00/0.58  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.00/0.58  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.00/0.58  % No SInE strategy applied
% 1.00/0.58  % Search class: FUUPM-FFSF22-MFFFFFNN
% 1.00/0.58  % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 1.00/0.58  % Starting SubtermCWHack with 136s (1) cores
% 1.00/0.58  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.00/0.58  % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 1.00/0.58  % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.00/0.58  % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.00/0.58  % Preprocessing time       : 0.001 s
% 1.00/0.58  % Presaturation interreduction done
% 1.00/0.58  
% 1.00/0.58  % Proof found!
% 1.00/0.58  % SZS status Unsatisfiable
% 1.00/0.58  % SZS output start CNFRefutation
% See solution above
% 1.00/0.58  % Parsed axioms                        : 9
% 1.00/0.58  % Removed by relevancy pruning/SinE    : 0
% 1.00/0.58  % Initial clauses                      : 9
% 1.00/0.58  % Removed in clause preprocessing      : 0
% 1.00/0.58  % Initial clauses in saturation        : 9
% 1.00/0.58  % Processed clauses                    : 283
% 1.00/0.58  % ...of these trivial                  : 110
% 1.00/0.58  % ...subsumed                          : 4
% 1.00/0.58  % ...remaining for further processing  : 169
% 1.00/0.58  % Other redundant clauses eliminated   : 0
% 1.00/0.58  % Clauses deleted for lack of memory   : 0
% 1.00/0.58  % Backward-subsumed                    : 0
% 1.00/0.58  % Backward-rewritten                   : 38
% 1.00/0.58  % Generated clauses                    : 7094
% 1.00/0.58  % ...of the previous two non-redundant : 4909
% 1.00/0.58  % ...aggressively subsumed             : 0
% 1.00/0.58  % Contextual simplify-reflections      : 0
% 1.00/0.58  % Paramodulations                      : 7094
% 1.00/0.58  % Factorizations                       : 0
% 1.00/0.58  % NegExts                              : 0
% 1.00/0.58  % Equation resolutions                 : 0
% 1.00/0.58  % Disequality decompositions           : 0
% 1.00/0.58  % Total rewrite steps                  : 16086
% 1.00/0.58  % ...of those cached                   : 15059
% 1.00/0.58  % Propositional unsat checks           : 0
% 1.00/0.58  %    Propositional check models        : 0
% 1.00/0.58  %    Propositional check unsatisfiable : 0
% 1.00/0.58  %    Propositional clauses             : 0
% 1.00/0.58  %    Propositional clauses after purity: 0
% 1.00/0.58  %    Propositional unsat core size     : 0
% 1.00/0.58  %    Propositional preprocessing time  : 0.000
% 1.00/0.58  %    Propositional encoding time       : 0.000
% 1.00/0.58  %    Propositional solver time         : 0.000
% 1.00/0.58  %    Success case prop preproc time    : 0.000
% 1.00/0.58  %    Success case prop encoding time   : 0.000
% 1.00/0.58  %    Success case prop solver time     : 0.000
% 1.00/0.58  % Current number of processed clauses  : 122
% 1.00/0.58  %    Positive orientable unit clauses  : 121
% 1.00/0.58  %    Positive unorientable unit clauses: 1
% 1.00/0.58  %    Negative unit clauses             : 0
% 1.00/0.58  %    Non-unit-clauses                  : 0
% 1.00/0.58  % Current number of unprocessed clauses: 4612
% 1.00/0.58  % ...number of literals in the above   : 4612
% 1.00/0.58  % Current number of archived formulas  : 0
% 1.00/0.58  % Current number of archived clauses   : 47
% 1.00/0.58  % Clause-clause subsumption calls (NU) : 0
% 1.00/0.58  % Rec. Clause-clause subsumption calls : 0
% 1.00/0.58  % Non-unit clause-clause subsumptions  : 0
% 1.00/0.58  % Unit Clause-clause subsumption calls : 10
% 1.00/0.58  % Rewrite failures with RHS unbound    : 0
% 1.00/0.58  % BW rewrite match attempts            : 182
% 1.00/0.58  % BW rewrite match successes           : 72
% 1.00/0.58  % Condensation attempts                : 0
% 1.00/0.58  % Condensation successes               : 0
% 1.00/0.58  % Termbank termtop insertions          : 105737
% 1.00/0.58  % Search garbage collected termcells   : 2
% 1.00/0.58  
% 1.00/0.58  % -------------------------------------------------
% 1.00/0.58  % User time                : 0.085 s
% 1.00/0.58  % System time              : 0.011 s
% 1.00/0.58  % Total time               : 0.095 s
% 1.00/0.58  % Maximum resident set size: 3604 pages
% 1.00/0.58  
% 1.00/0.58  % -------------------------------------------------
% 1.00/0.58  % User time                : 0.415 s
% 1.00/0.58  % System time              : 0.046 s
% 1.00/0.58  % Total time               : 0.461 s
% 1.00/0.58  % Maximum resident set size: 4864 pages
% 1.00/0.58  % E exiting
%------------------------------------------------------------------------------