↑ Up

ET---2.0.THM-CRf.s

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

% Computer : n020.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:07 EDT 2022

% Result   : Theorem 0.25s 1.43s
% Output   : CNFRefutation 0.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   31 (  27 unt;   0 def)
%            Number of atoms       :   35 (  34 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    9 (   5   ~;   2   |;   2   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   0 con; 1-2 aty)
%            Number of variables   :   71 (   0 sgn  21   !;   2   ?)

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

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

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

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

fof(goals,conjecture,
    ? [X4] :
    ! [X5] :
      ( mult(X5,X4) = X5
      & mult(X4,X5) = X5 ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).

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

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

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

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

fof(c_0_9,plain,
    ! [X3,X4] : mult(rd(X4,X3),X3) = X4,
    inference(variable_rename,[status(thm)],[f03]) ).

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

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

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

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

cnf(c_0_14,plain,
    mult(mult(mult(X1,X2),mult(X2,mult(X3,X3))),X4) = mult(mult(mult(X1,X2),mult(X2,X3)),mult(X3,X4)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_8]),c_0_8]) ).

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

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

fof(c_0_17,plain,
    ! [X3,X4] : rd(mult(X4,X3),X3) = X4,
    inference(variable_rename,[status(thm)],[f04]) ).

cnf(c_0_18,plain,
    mult(mult(mult(X1,X2),mult(X2,mult(X1,X2))),mult(X2,X3)) = mult(mult(X1,X2),mult(X2,mult(mult(X1,X2),mult(X2,X3)))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_8]),c_0_8]),c_0_8]) ).

cnf(c_0_19,plain,
    rd(mult(X1,X2),X2) = X1,
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

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

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

cnf(c_0_22,plain,
    rd(X1,X1) = mult(rd(X2,mult(X2,X2)),X2),
    inference(spm,[status(thm)],[c_0_19,c_0_13]) ).

fof(c_0_23,negated_conjecture,
    ~ ? [X4] :
      ! [X5] :
        ( mult(X5,X4) = X5
        & mult(X4,X5) = X5 ),
    inference(assume_negation,[status(cth)],[goals]) ).

cnf(c_0_24,plain,
    mult(mult(X1,mult(X2,X1)),X3) = mult(X1,mult(X2,mult(X1,X3))),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_25,plain,
    mult(rd(X1,X1),X2) = X2,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_22]),c_0_11]),c_0_7]) ).

fof(c_0_26,negated_conjecture,
    ! [X6] :
      ( mult(esk1_1(X6),X6) != esk1_1(X6)
      | mult(X6,esk2_1(X6)) != esk2_1(X6) ),
    inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])])]) ).

cnf(c_0_27,plain,
    mult(mult(X1,rd(X2,X2)),X3) = mult(X1,X3),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_25]),c_0_25]) ).

cnf(c_0_28,negated_conjecture,
    ( mult(X1,esk2_1(X1)) != esk2_1(X1)
    | mult(esk1_1(X1),X1) != esk1_1(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_26]) ).

cnf(c_0_29,plain,
    mult(X1,rd(X2,X2)) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_27]),c_0_19]) ).

cnf(c_0_30,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_25])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13  % Problem  : GRP658+1 : TPTP v8.1.0. Released v4.0.0.
% 0.13/0.14  % Command  : run_ET %s %d
% 0.13/0.35  % Computer : n020.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Tue Jun 14 01:30:50 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.25/1.43  # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.25/1.43  # Preprocessing time       : 0.013 s
% 0.25/1.43  
% 0.25/1.43  # Proof found!
% 0.25/1.43  # SZS status Theorem
% 0.25/1.43  # SZS output start CNFRefutation
% See solution above
% 0.25/1.43  # Proof object total steps             : 31
% 0.25/1.43  # Proof object clause steps            : 20
% 0.25/1.43  # Proof object formula steps           : 11
% 0.25/1.43  # Proof object conjectures             : 5
% 0.25/1.43  # Proof object clause conjectures      : 2
% 0.25/1.43  # Proof object formula conjectures     : 3
% 0.25/1.43  # Proof object initial clauses used    : 5
% 0.25/1.43  # Proof object initial formulas used   : 5
% 0.25/1.43  # Proof object generating inferences   : 15
% 0.25/1.43  # Proof object simplifying inferences  : 13
% 0.25/1.43  # Training examples: 0 positive, 0 negative
% 0.25/1.43  # Parsed axioms                        : 6
% 0.25/1.43  # Removed by relevancy pruning/SinE    : 0
% 0.25/1.43  # Initial clauses                      : 6
% 0.25/1.43  # Removed in clause preprocessing      : 0
% 0.25/1.43  # Initial clauses in saturation        : 6
% 0.25/1.43  # Processed clauses                    : 94
% 0.25/1.43  # ...of these trivial                  : 19
% 0.25/1.43  # ...subsumed                          : 30
% 0.25/1.43  # ...remaining for further processing  : 45
% 0.25/1.43  # Other redundant clauses eliminated   : 0
% 0.25/1.43  # Clauses deleted for lack of memory   : 0
% 0.25/1.43  # Backward-subsumed                    : 0
% 0.25/1.43  # Backward-rewritten                   : 10
% 0.25/1.43  # Generated clauses                    : 1847
% 0.25/1.43  # ...of the previous two non-trivial   : 1475
% 0.25/1.43  # Contextual simplify-reflections      : 0
% 0.25/1.43  # Paramodulations                      : 1847
% 0.25/1.43  # Factorizations                       : 0
% 0.25/1.43  # Equation resolutions                 : 0
% 0.25/1.43  # Current number of processed clauses  : 35
% 0.25/1.43  #    Positive orientable unit clauses  : 30
% 0.25/1.43  #    Positive unorientable unit clauses: 4
% 0.25/1.43  #    Negative unit clauses             : 0
% 0.25/1.43  #    Non-unit-clauses                  : 1
% 0.25/1.43  # Current number of unprocessed clauses: 898
% 0.25/1.43  # ...number of literals in the above   : 898
% 0.25/1.43  # Current number of archived formulas  : 0
% 0.25/1.43  # Current number of archived clauses   : 10
% 0.25/1.43  # Clause-clause subsumption calls (NU) : 0
% 0.25/1.43  # Rec. Clause-clause subsumption calls : 0
% 0.25/1.43  # Non-unit clause-clause subsumptions  : 0
% 0.25/1.43  # Unit Clause-clause subsumption calls : 2
% 0.25/1.43  # Rewrite failures with RHS unbound    : 30
% 0.25/1.43  # BW rewrite match attempts            : 108
% 0.25/1.43  # BW rewrite match successes           : 19
% 0.25/1.43  # Condensation attempts                : 0
% 0.25/1.43  # Condensation successes               : 0
% 0.25/1.43  # Termbank termtop insertions          : 36525
% 0.25/1.43  
% 0.25/1.43  # -------------------------------------------------
% 0.25/1.43  # User time                : 0.040 s
% 0.25/1.43  # System time              : 0.004 s
% 0.25/1.43  # Total time               : 0.044 s
% 0.25/1.43  # Maximum resident set size: 4348 pages
% 0.25/23.42  eprover: CPU time limit exceeded, terminating
% 0.25/23.43  eprover: CPU time limit exceeded, terminating
% 0.25/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.44  eprover: No such file or directory
% 0.25/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.44  eprover: No such file or directory
% 0.25/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45  eprover: No such file or directory
% 0.25/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45  eprover: No such file or directory
% 0.25/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45  eprover: No such file or directory
% 0.25/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45  eprover: No such file or directory
% 0.25/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46  eprover: No such file or directory
% 0.25/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46  eprover: No such file or directory
% 0.25/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46  eprover: No such file or directory
% 0.25/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47  eprover: No such file or directory
% 0.25/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.47  eprover: No such file or directory
% 0.25/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47  eprover: No such file or directory
% 0.25/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.47  eprover: No such file or directory
% 0.25/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47  eprover: No such file or directory
% 0.25/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48  eprover: No such file or directory
% 0.25/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.48  eprover: No such file or directory
% 0.25/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48  eprover: No such file or directory
% 0.25/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.48  eprover: No such file or directory
% 0.25/23.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.49  eprover: No such file or directory
% 0.25/23.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.49  eprover: No such file or directory
% 0.25/23.50  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.50  eprover: No such file or directory
% 0.25/23.50  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.50  eprover: No such file or directory
%------------------------------------------------------------------------------