↑ Up

ET---2.0.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : GRP747+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n008.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  : 600s
% DateTime : Sat Jul 16 09:03:32 EDT 2022

% Result   : Theorem 0.16s 1.34s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   31 (  23 unt;   0 def)
%            Number of atoms       :   47 (  46 equ)
%            Maximal formula atoms :    8 (   1 avg)
%            Number of connectives :   22 (   6   ~;  11   |;   5   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   2 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   65 (   0 sgn  18   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f06,axiom,
    ! [X2] : mult(unit,X2) = X2,
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',f06) ).

fof(f08,axiom,
    ! [X4,X5,X6] :
      ( ( mult(mult(X4,X5),X6) = mult(X4,mult(X6,X5))
        & mult(mult(X4,X6),X5) = mult(X4,mult(X5,X6)) )
      | ( mult(mult(X4,X5),X6) = mult(mult(X4,X6),X5)
        & mult(X4,mult(X5,X6)) = mult(X4,mult(X6,X5)) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',f08) ).

fof(f07,axiom,
    ! [X3,X1,X2] : mult(mult(mult(X2,X1),X3),X1) = mult(X2,mult(mult(X1,X3),X1)),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',f07) ).

fof(f02,axiom,
    ! [X1,X2] : ld(X2,mult(X2,X1)) = X1,
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',f02) ).

fof(goals,conjecture,
    mult(mult(a,b),c) = mult(a,mult(b,c)),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).

fof(c_0_5,plain,
    ! [X3] : mult(unit,X3) = X3,
    inference(variable_rename,[status(thm)],[f06]) ).

fof(c_0_6,plain,
    ! [X7,X8,X9] :
      ( ( mult(mult(X7,X8),X9) = mult(mult(X7,X9),X8)
        | mult(mult(X7,X8),X9) = mult(X7,mult(X9,X8)) )
      & ( mult(X7,mult(X8,X9)) = mult(X7,mult(X9,X8))
        | mult(mult(X7,X8),X9) = mult(X7,mult(X9,X8)) )
      & ( mult(mult(X7,X8),X9) = mult(mult(X7,X9),X8)
        | mult(mult(X7,X9),X8) = mult(X7,mult(X8,X9)) )
      & ( mult(X7,mult(X8,X9)) = mult(X7,mult(X9,X8))
        | mult(mult(X7,X9),X8) = mult(X7,mult(X8,X9)) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[f08])]) ).

fof(c_0_7,plain,
    ! [X4,X5,X6] : mult(mult(mult(X6,X5),X4),X5) = mult(X6,mult(mult(X5,X4),X5)),
    inference(variable_rename,[status(thm)],[f07]) ).

cnf(c_0_8,plain,
    mult(unit,X1) = X1,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    ( mult(mult(X1,X2),X3) = mult(X1,mult(X3,X2))
    | mult(X1,mult(X3,X2)) = mult(X1,mult(X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    mult(mult(mult(X1,X2),X3),X2) = mult(X1,mult(mult(X2,X3),X2)),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

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

fof(c_0_12,plain,
    ! [X3,X4] : ld(X4,mult(X4,X3)) = X3,
    inference(variable_rename,[status(thm)],[f02]) ).

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

cnf(c_0_14,plain,
    ( mult(mult(X1,X2),X3) = mult(X1,mult(X3,X2))
    | mult(mult(X1,X3),X2) = mult(mult(X1,X2),X3) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

fof(c_0_15,negated_conjecture,
    mult(mult(a,b),c) != mult(a,mult(b,c)),
    inference(assume_negation,[status(cth)],[goals]) ).

cnf(c_0_16,plain,
    ld(X1,mult(X1,X2)) = X2,
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_17,plain,
    mult(X1,mult(mult(X1,X2),X3)) = mult(X2,mult(X1,mult(X1,X3))),
    inference(spm,[status(thm)],[c_0_13,c_0_11]) ).

cnf(c_0_18,plain,
    ( mult(mult(X1,X2),X3) = mult(X1,mult(X3,X2))
    | mult(mult(X1,X3),X2) != mult(X1,mult(X3,X2)) ),
    inference(ef,[status(thm)],[c_0_14]) ).

cnf(c_0_19,plain,
    ( mult(X1,mult(X2,X3)) = mult(X2,mult(X1,X3))
    | mult(mult(X2,X1),X3) = mult(X1,mult(X2,X3)) ),
    inference(spm,[status(thm)],[c_0_14,c_0_11]) ).

fof(c_0_20,negated_conjecture,
    mult(mult(a,b),c) != mult(a,mult(b,c)),
    inference(fof_simplification,[status(thm)],[c_0_15]) ).

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

cnf(c_0_22,plain,
    mult(X1,mult(X2,mult(X1,X3))) = mult(X3,mult(X1,mult(X1,X2))),
    inference(spm,[status(thm)],[c_0_17,c_0_11]) ).

cnf(c_0_23,plain,
    ( mult(mult(X1,X2),X3) = mult(X1,mult(X3,X2))
    | mult(X2,mult(X1,X3)) != mult(X1,mult(X3,X2)) ),
    inference(spm,[status(thm)],[c_0_18,c_0_11]) ).

cnf(c_0_24,plain,
    ( mult(mult(X1,X2),X3) = mult(X1,mult(X2,X3))
    | mult(X1,mult(X2,X3)) = mult(X2,mult(X1,X3)) ),
    inference(spm,[status(thm)],[c_0_19,c_0_11]) ).

cnf(c_0_25,negated_conjecture,
    mult(mult(a,b),c) != mult(a,mult(b,c)),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_26,plain,
    mult(X1,mult(X2,X3)) = mult(mult(X3,X2),X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_16]) ).

cnf(c_0_27,plain,
    mult(mult(X1,X2),X3) = mult(X1,mult(X2,X3)),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_11]),c_0_24]) ).

cnf(c_0_28,negated_conjecture,
    mult(c,mult(a,b)) != mult(a,mult(b,c)),
    inference(rw,[status(thm)],[c_0_25,c_0_11]) ).

cnf(c_0_29,plain,
    mult(X1,mult(X2,X3)) = mult(X3,mult(X2,X1)),
    inference(rw,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_30,negated_conjecture,
    $false,
    inference(ar,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29]),c_0_11,c_0_27]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.08  % Problem  : GRP747+1 : TPTP v8.1.0. Released v4.0.0.
% 0.05/0.09  % Command  : run_ET %s %d
% 0.08/0.28  % Computer : n008.cluster.edu
% 0.08/0.28  % Model    : x86_64 x86_64
% 0.08/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28  % Memory   : 8042.1875MB
% 0.08/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28  % CPULimit : 300
% 0.08/0.28  % WCLimit  : 600
% 0.08/0.28  % DateTime : Tue Jun 14 07:15:22 EDT 2022
% 0.08/0.28  % CPUTime  : 
% 0.16/1.34  # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.16/1.34  # Preprocessing time       : 0.012 s
% 0.16/1.34  
% 0.16/1.34  # Proof found!
% 0.16/1.34  # SZS status Theorem
% 0.16/1.34  # SZS output start CNFRefutation
% See solution above
% 0.16/1.34  # Proof object total steps             : 31
% 0.16/1.34  # Proof object clause steps            : 20
% 0.16/1.34  # Proof object formula steps           : 11
% 0.16/1.34  # Proof object conjectures             : 6
% 0.16/1.34  # Proof object clause conjectures      : 3
% 0.16/1.34  # Proof object formula conjectures     : 3
% 0.16/1.34  # Proof object initial clauses used    : 6
% 0.16/1.34  # Proof object initial formulas used   : 5
% 0.16/1.34  # Proof object generating inferences   : 10
% 0.16/1.34  # Proof object simplifying inferences  : 12
% 0.16/1.34  # Training examples: 0 positive, 0 negative
% 0.16/1.34  # Parsed axioms                        : 9
% 0.16/1.34  # Removed by relevancy pruning/SinE    : 0
% 0.16/1.34  # Initial clauses                      : 12
% 0.16/1.34  # Removed in clause preprocessing      : 0
% 0.16/1.34  # Initial clauses in saturation        : 12
% 0.16/1.34  # Processed clauses                    : 309
% 0.16/1.34  # ...of these trivial                  : 30
% 0.16/1.34  # ...subsumed                          : 164
% 0.16/1.34  # ...remaining for further processing  : 115
% 0.16/1.34  # Other redundant clauses eliminated   : 0
% 0.16/1.34  # Clauses deleted for lack of memory   : 0
% 0.16/1.34  # Backward-subsumed                    : 4
% 0.16/1.34  # Backward-rewritten                   : 75
% 0.16/1.34  # Generated clauses                    : 23075
% 0.16/1.34  # ...of the previous two non-trivial   : 21725
% 0.16/1.34  # Contextual simplify-reflections      : 1
% 0.16/1.34  # Paramodulations                      : 23050
% 0.16/1.34  # Factorizations                       : 23
% 0.16/1.34  # Equation resolutions                 : 2
% 0.16/1.34  # Current number of processed clauses  : 36
% 0.16/1.34  #    Positive orientable unit clauses  : 26
% 0.16/1.34  #    Positive unorientable unit clauses: 9
% 0.16/1.34  #    Negative unit clauses             : 0
% 0.16/1.34  #    Non-unit-clauses                  : 1
% 0.16/1.34  # Current number of unprocessed clauses: 1099
% 0.16/1.34  # ...number of literals in the above   : 1228
% 0.16/1.34  # Current number of archived formulas  : 0
% 0.16/1.34  # Current number of archived clauses   : 79
% 0.16/1.34  # Clause-clause subsumption calls (NU) : 676
% 0.16/1.34  # Rec. Clause-clause subsumption calls : 560
% 0.16/1.34  # Non-unit clause-clause subsumptions  : 13
% 0.16/1.34  # Unit Clause-clause subsumption calls : 573
% 0.16/1.34  # Rewrite failures with RHS unbound    : 0
% 0.16/1.34  # BW rewrite match attempts            : 997
% 0.16/1.34  # BW rewrite match successes           : 309
% 0.16/1.34  # Condensation attempts                : 0
% 0.16/1.34  # Condensation successes               : 0
% 0.16/1.34  # Termbank termtop insertions          : 474509
% 0.16/1.34  
% 0.16/1.34  # -------------------------------------------------
% 0.16/1.34  # User time                : 0.447 s
% 0.16/1.34  # System time              : 0.012 s
% 0.16/1.34  # Total time               : 0.459 s
% 0.16/1.34  # Maximum resident set size: 21516 pages
% 0.16/23.33  eprover: CPU time limit exceeded, terminating
% 0.16/23.35  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.16/23.35  eprover: No such file or directory
% 0.16/23.35  eprover: CPU time limit exceeded, terminating
% 0.16/23.35  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.16/23.35  eprover: No such file or directory
% 0.16/23.36  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.16/23.36  eprover: No such file or directory
% 0.16/23.36  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.16/23.36  eprover: No such file or directory
% 0.16/23.36  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.16/23.36  eprover: No such file or directory
% 0.16/23.37  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.16/23.37  eprover: No such file or directory
% 0.16/23.37  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.16/23.37  eprover: No such file or directory
% 0.16/23.37  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.16/23.37  eprover: No such file or directory
% 0.16/23.37  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.16/23.37  eprover: No such file or directory
% 0.16/23.37  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.16/23.37  eprover: No such file or directory
% 0.16/23.38  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.16/23.38  eprover: No such file or directory
% 0.16/23.38  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.16/23.38  eprover: No such file or directory
% 0.16/23.38  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.16/23.38  eprover: No such file or directory
% 0.16/23.38  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.16/23.38  eprover: No such file or directory
% 0.16/23.38  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.16/23.38  eprover: No such file or directory
% 0.16/23.39  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.16/23.39  eprover: No such file or directory
% 0.16/23.39  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.16/23.39  eprover: No such file or directory
% 0.16/23.39  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.16/23.39  eprover: No such file or directory
% 0.16/23.39  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.16/23.39  eprover: No such file or directory
% 0.16/23.40  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.16/23.40  eprover: No such file or directory
% 0.16/23.40  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.16/23.40  eprover: No such file or directory
% 0.16/23.41  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.16/23.41  eprover: No such file or directory
%------------------------------------------------------------------------------