TSTP Solution File: RNG055+2 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : RNG055+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n017.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 : Mon Jul 18 20:26:44 EDT 2022

% Result   : Theorem 0.22s 1.41s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   28 (  12 unt;   0 def)
%            Number of atoms       :   71 (  26 equ)
%            Maximal formula atoms :   16 (   2 avg)
%            Number of connectives :   77 (  34   ~;  28   |;  13   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;  10 con; 0-2 aty)
%            Number of variables   :   22 (   1 sgn  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(mArith,axiom,
    ! [X1,X2,X3] :
      ( ( aScalar0(X1)
        & aScalar0(X2)
        & aScalar0(X3) )
     => ( sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3))
        & sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
        & sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
        & sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mArith) ).

fof(m__,conjecture,
    sdtasdt0(xP,xP) = sdtasdt0(sdtasdt0(xH,xH),sdtasdt0(xE,xE)),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).

fof(m__1949,hypothesis,
    ( aScalar0(xN)
    & xN = sdtasdt0(xR,xS) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1949) ).

fof(m__1911,hypothesis,
    ( aScalar0(xP)
    & xP = sdtasdt0(xE,xH) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1911) ).

fof(m__1820,hypothesis,
    ( aScalar0(xE)
    & xE = sdtasasdt0(xp,xq) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1820) ).

fof(m__1873,hypothesis,
    ( aScalar0(xH)
    & xH = sdtasdt0(xA,xB) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1873) ).

fof(mMulSc,axiom,
    ! [X1,X2] :
      ( ( aScalar0(X1)
        & aScalar0(X2) )
     => aScalar0(sdtasdt0(X1,X2)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mMulSc) ).

fof(c_0_7,plain,
    ! [X4,X5,X6] :
      ( ( sdtpldt0(sdtpldt0(X4,X5),X6) = sdtpldt0(X4,sdtpldt0(X5,X6))
        | ~ aScalar0(X4)
        | ~ aScalar0(X5)
        | ~ aScalar0(X6) )
      & ( sdtpldt0(X4,X5) = sdtpldt0(X5,X4)
        | ~ aScalar0(X4)
        | ~ aScalar0(X5)
        | ~ aScalar0(X6) )
      & ( sdtasdt0(sdtasdt0(X4,X5),X6) = sdtasdt0(X4,sdtasdt0(X5,X6))
        | ~ aScalar0(X4)
        | ~ aScalar0(X5)
        | ~ aScalar0(X6) )
      & ( sdtasdt0(X4,X5) = sdtasdt0(X5,X4)
        | ~ aScalar0(X4)
        | ~ aScalar0(X5)
        | ~ aScalar0(X6) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mArith])])]) ).

fof(c_0_8,negated_conjecture,
    sdtasdt0(xP,xP) != sdtasdt0(sdtasdt0(xH,xH),sdtasdt0(xE,xE)),
    inference(assume_negation,[status(cth)],[m__]) ).

cnf(c_0_9,plain,
    ( sdtasdt0(X3,X2) = sdtasdt0(X2,X3)
    | ~ aScalar0(X1)
    | ~ aScalar0(X2)
    | ~ aScalar0(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_10,hypothesis,
    aScalar0(xN),
    inference(split_conjunct,[status(thm)],[m__1949]) ).

fof(c_0_11,negated_conjecture,
    sdtasdt0(xP,xP) != sdtasdt0(sdtasdt0(xH,xH),sdtasdt0(xE,xE)),
    inference(fof_simplification,[status(thm)],[c_0_8]) ).

cnf(c_0_12,hypothesis,
    xP = sdtasdt0(xE,xH),
    inference(split_conjunct,[status(thm)],[m__1911]) ).

cnf(c_0_13,hypothesis,
    ( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
    | ~ aScalar0(X2)
    | ~ aScalar0(X1) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_14,hypothesis,
    aScalar0(xE),
    inference(split_conjunct,[status(thm)],[m__1820]) ).

cnf(c_0_15,hypothesis,
    aScalar0(xH),
    inference(split_conjunct,[status(thm)],[m__1873]) ).

cnf(c_0_16,negated_conjecture,
    sdtasdt0(xP,xP) != sdtasdt0(sdtasdt0(xH,xH),sdtasdt0(xE,xE)),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_17,plain,
    ( sdtasdt0(sdtasdt0(X3,X2),X1) = sdtasdt0(X3,sdtasdt0(X2,X1))
    | ~ aScalar0(X1)
    | ~ aScalar0(X2)
    | ~ aScalar0(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_18,hypothesis,
    sdtasdt0(xH,xE) = xP,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15])]) ).

cnf(c_0_19,negated_conjecture,
    ( sdtasdt0(xH,sdtasdt0(xH,sdtasdt0(xE,xE))) != sdtasdt0(xP,xP)
    | ~ aScalar0(sdtasdt0(xE,xE)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_15])]) ).

cnf(c_0_20,hypothesis,
    ( sdtasdt0(xH,sdtasdt0(xE,X1)) = sdtasdt0(xP,X1)
    | ~ aScalar0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_15]),c_0_14])]) ).

fof(c_0_21,plain,
    ! [X3,X4] :
      ( ~ aScalar0(X3)
      | ~ aScalar0(X4)
      | aScalar0(sdtasdt0(X3,X4)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulSc])]) ).

cnf(c_0_22,negated_conjecture,
    ( sdtasdt0(xH,sdtasdt0(xP,xE)) != sdtasdt0(xP,xP)
    | ~ aScalar0(sdtasdt0(xE,xE)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_14])]) ).

cnf(c_0_23,plain,
    ( aScalar0(sdtasdt0(X1,X2))
    | ~ aScalar0(X2)
    | ~ aScalar0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_24,negated_conjecture,
    sdtasdt0(xH,sdtasdt0(xP,xE)) != sdtasdt0(xP,xP),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_14])]) ).

cnf(c_0_25,hypothesis,
    ( sdtasdt0(xH,sdtasdt0(X1,xE)) = sdtasdt0(xP,X1)
    | ~ aScalar0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_13]),c_0_14])]) ).

cnf(c_0_26,hypothesis,
    aScalar0(xP),
    inference(split_conjunct,[status(thm)],[m__1911]) ).

cnf(c_0_27,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : RNG055+2 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n017.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.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Mon May 30 07:13:55 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.22/1.41  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41  # Preprocessing time       : 0.029 s
% 0.22/1.41  
% 0.22/1.41  # Proof found!
% 0.22/1.41  # SZS status Theorem
% 0.22/1.41  # SZS output start CNFRefutation
% See solution above
% 0.22/1.41  # Proof object total steps             : 28
% 0.22/1.41  # Proof object clause steps            : 17
% 0.22/1.41  # Proof object formula steps           : 11
% 0.22/1.41  # Proof object conjectures             : 8
% 0.22/1.41  # Proof object clause conjectures      : 5
% 0.22/1.41  # Proof object formula conjectures     : 3
% 0.22/1.41  # Proof object initial clauses used    : 9
% 0.22/1.41  # Proof object initial formulas used   : 7
% 0.22/1.41  # Proof object generating inferences   : 8
% 0.22/1.41  # Proof object simplifying inferences  : 16
% 0.22/1.41  # Training examples: 0 positive, 0 negative
% 0.22/1.41  # Parsed axioms                        : 57
% 0.22/1.41  # Removed by relevancy pruning/SinE    : 4
% 0.22/1.41  # Initial clauses                      : 83
% 0.22/1.41  # Removed in clause preprocessing      : 5
% 0.22/1.41  # Initial clauses in saturation        : 78
% 0.22/1.41  # Processed clauses                    : 124
% 0.22/1.41  # ...of these trivial                  : 5
% 0.22/1.41  # ...subsumed                          : 10
% 0.22/1.41  # ...remaining for further processing  : 109
% 0.22/1.41  # Other redundant clauses eliminated   : 0
% 0.22/1.41  # Clauses deleted for lack of memory   : 0
% 0.22/1.41  # Backward-subsumed                    : 1
% 0.22/1.41  # Backward-rewritten                   : 2
% 0.22/1.41  # Generated clauses                    : 428
% 0.22/1.41  # ...of the previous two non-trivial   : 393
% 0.22/1.41  # Contextual simplify-reflections      : 0
% 0.22/1.41  # Paramodulations                      : 422
% 0.22/1.41  # Factorizations                       : 0
% 0.22/1.41  # Equation resolutions                 : 6
% 0.22/1.41  # Current number of processed clauses  : 106
% 0.22/1.41  #    Positive orientable unit clauses  : 48
% 0.22/1.41  #    Positive unorientable unit clauses: 0
% 0.22/1.41  #    Negative unit clauses             : 3
% 0.22/1.41  #    Non-unit-clauses                  : 55
% 0.22/1.41  # Current number of unprocessed clauses: 331
% 0.22/1.41  # ...number of literals in the above   : 1471
% 0.22/1.41  # Current number of archived formulas  : 0
% 0.22/1.41  # Current number of archived clauses   : 3
% 0.22/1.41  # Clause-clause subsumption calls (NU) : 723
% 0.22/1.41  # Rec. Clause-clause subsumption calls : 181
% 0.22/1.41  # Non-unit clause-clause subsumptions  : 4
% 0.22/1.41  # Unit Clause-clause subsumption calls : 52
% 0.22/1.41  # Rewrite failures with RHS unbound    : 0
% 0.22/1.41  # BW rewrite match attempts            : 1
% 0.22/1.41  # BW rewrite match successes           : 1
% 0.22/1.41  # Condensation attempts                : 0
% 0.22/1.41  # Condensation successes               : 0
% 0.22/1.41  # Termbank termtop insertions          : 12158
% 0.22/1.41  
% 0.22/1.41  # -------------------------------------------------
% 0.22/1.41  # User time                : 0.037 s
% 0.22/1.41  # System time              : 0.004 s
% 0.22/1.41  # Total time               : 0.041 s
% 0.22/1.41  # Maximum resident set size: 3692 pages
% 0.22/23.40  eprover: CPU time limit exceeded, terminating
% 0.22/23.42  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.42  eprover: No such file or directory
% 0.22/23.42  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.42  eprover: No such file or directory
% 0.22/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.43  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.46  eprover: No such file or directory
% 0.22/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.46  eprover: No such file or directory
% 0.22/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.47  eprover: No such file or directory
% 0.22/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.48  eprover: No such file or directory
%------------------------------------------------------------------------------