↑ Up

ET---2.0.THM-CRf.s

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

% Computer : n021.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 09:32:50 EDT 2022

% Result   : Theorem 0.25s 1.43s
% Output   : CNFRefutation 0.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   32 (  19 unt;   0 def)
%            Number of atoms       :   71 (  32 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   58 (  19   ~;  14   |;  23   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   8 con; 0-2 aty)
%            Number of variables   :   18 (   0 sgn  10   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(m__1324_04,hypothesis,
    ( ? [X1] :
        ( aNaturalNumber0(X1)
        & xm = sdtasdt0(xl,X1) )
    & doDivides0(xl,xm)
    & ? [X1] :
        ( aNaturalNumber0(X1)
        & sdtpldt0(xm,xn) = sdtasdt0(xl,X1) )
    & doDivides0(xl,sdtpldt0(xm,xn)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1324_04) ).

fof(m__,conjecture,
    sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)) = sdtpldt0(sdtasdt0(xl,xp),xn),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).

fof(m__1379,hypothesis,
    ( aNaturalNumber0(xq)
    & sdtpldt0(xm,xn) = sdtasdt0(xl,xq)
    & xq = sdtsldt0(sdtpldt0(xm,xn),xl) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1379) ).

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

fof(m__1324,hypothesis,
    ( aNaturalNumber0(xl)
    & aNaturalNumber0(xm)
    & aNaturalNumber0(xn) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1324) ).

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

fof(m__1360,hypothesis,
    ( aNaturalNumber0(xp)
    & xm = sdtasdt0(xl,xp)
    & xp = sdtsldt0(xm,xl) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1360) ).

fof(m__1422,hypothesis,
    ( aNaturalNumber0(xr)
    & sdtpldt0(xp,xr) = xq
    & xr = sdtmndt0(xq,xp) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1422) ).

fof(c_0_8,hypothesis,
    ( aNaturalNumber0(esk1_0)
    & xm = sdtasdt0(xl,esk1_0)
    & doDivides0(xl,xm)
    & aNaturalNumber0(esk2_0)
    & sdtpldt0(xm,xn) = sdtasdt0(xl,esk2_0)
    & doDivides0(xl,sdtpldt0(xm,xn)) ),
    inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[m__1324_04])])])]) ).

fof(c_0_9,negated_conjecture,
    sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)) != sdtpldt0(sdtasdt0(xl,xp),xn),
    inference(assume_negation,[status(cth)],[m__]) ).

cnf(c_0_10,hypothesis,
    sdtpldt0(xm,xn) = sdtasdt0(xl,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_11,hypothesis,
    sdtpldt0(xm,xn) = sdtasdt0(xl,xq),
    inference(split_conjunct,[status(thm)],[m__1379]) ).

fof(c_0_12,plain,
    ! [X3,X4] :
      ( ~ aNaturalNumber0(X3)
      | ~ aNaturalNumber0(X4)
      | sdtasdt0(X3,X4) = sdtasdt0(X4,X3) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])]) ).

fof(c_0_13,negated_conjecture,
    sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)) != sdtpldt0(sdtasdt0(xl,xp),xn),
    inference(fof_simplification,[status(thm)],[c_0_9]) ).

cnf(c_0_14,hypothesis,
    sdtasdt0(xl,xq) = sdtasdt0(xl,esk2_0),
    inference(rw,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_15,plain,
    ( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_16,hypothesis,
    aNaturalNumber0(xl),
    inference(split_conjunct,[status(thm)],[m__1324]) ).

cnf(c_0_17,hypothesis,
    aNaturalNumber0(xq),
    inference(split_conjunct,[status(thm)],[m__1379]) ).

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

cnf(c_0_19,negated_conjecture,
    sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)) != sdtpldt0(sdtasdt0(xl,xp),xn),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_20,hypothesis,
    xm = sdtasdt0(xl,xp),
    inference(split_conjunct,[status(thm)],[m__1360]) ).

cnf(c_0_21,hypothesis,
    sdtasdt0(xl,esk2_0) = sdtasdt0(xq,xl),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]) ).

cnf(c_0_22,hypothesis,
    aNaturalNumber0(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_23,plain,
    ( sdtasdt0(X3,sdtpldt0(X2,X1)) = sdtpldt0(sdtasdt0(X3,X2),sdtasdt0(X3,X1))
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_24,hypothesis,
    aNaturalNumber0(xp),
    inference(split_conjunct,[status(thm)],[m__1360]) ).

cnf(c_0_25,negated_conjecture,
    sdtpldt0(xm,sdtasdt0(xl,xr)) != sdtasdt0(xl,esk2_0),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_20]),c_0_11]),c_0_14]) ).

cnf(c_0_26,hypothesis,
    sdtasdt0(xq,xl) = sdtasdt0(esk2_0,xl),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_21]),c_0_22]),c_0_16])]) ).

cnf(c_0_27,hypothesis,
    ( sdtasdt0(xl,sdtpldt0(xp,X1)) = sdtpldt0(xm,sdtasdt0(xl,X1))
    | ~ aNaturalNumber0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_20]),c_0_16]),c_0_24])]) ).

cnf(c_0_28,hypothesis,
    sdtpldt0(xp,xr) = xq,
    inference(split_conjunct,[status(thm)],[m__1422]) ).

cnf(c_0_29,hypothesis,
    aNaturalNumber0(xr),
    inference(split_conjunct,[status(thm)],[m__1422]) ).

cnf(c_0_30,negated_conjecture,
    sdtpldt0(xm,sdtasdt0(xl,xr)) != sdtasdt0(esk2_0,xl),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_21]),c_0_26]) ).

cnf(c_0_31,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_14]),c_0_21]),c_0_26]),c_0_29])]),c_0_30]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUM474+2 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : run_ET %s %d
% 0.13/0.35  % Computer : n021.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 : Thu Jul  7 02:30:34 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.25/1.43  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.43  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.43  # Preprocessing time       : 0.019 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             : 32
% 0.25/1.43  # Proof object clause steps            : 19
% 0.25/1.43  # Proof object formula steps           : 13
% 0.25/1.43  # Proof object conjectures             : 6
% 0.25/1.43  # Proof object clause conjectures      : 3
% 0.25/1.43  # Proof object formula conjectures     : 3
% 0.25/1.43  # Proof object initial clauses used    : 12
% 0.25/1.43  # Proof object initial formulas used   : 8
% 0.25/1.43  # Proof object generating inferences   : 4
% 0.25/1.43  # Proof object simplifying inferences  : 22
% 0.25/1.43  # Training examples: 0 positive, 0 negative
% 0.25/1.43  # Parsed axioms                        : 41
% 0.25/1.43  # Removed by relevancy pruning/SinE    : 5
% 0.25/1.43  # Initial clauses                      : 72
% 0.25/1.43  # Removed in clause preprocessing      : 1
% 0.25/1.43  # Initial clauses in saturation        : 71
% 0.25/1.43  # Processed clauses                    : 496
% 0.25/1.43  # ...of these trivial                  : 50
% 0.25/1.43  # ...subsumed                          : 102
% 0.25/1.43  # ...remaining for further processing  : 344
% 0.25/1.43  # Other redundant clauses eliminated   : 11
% 0.25/1.43  # Clauses deleted for lack of memory   : 0
% 0.25/1.43  # Backward-subsumed                    : 2
% 0.25/1.43  # Backward-rewritten                   : 60
% 0.25/1.43  # Generated clauses                    : 7317
% 0.25/1.43  # ...of the previous two non-trivial   : 6956
% 0.25/1.43  # Contextual simplify-reflections      : 48
% 0.25/1.43  # Paramodulations                      : 7294
% 0.25/1.43  # Factorizations                       : 0
% 0.25/1.43  # Equation resolutions                 : 23
% 0.25/1.43  # Current number of processed clauses  : 281
% 0.25/1.43  #    Positive orientable unit clauses  : 106
% 0.25/1.43  #    Positive unorientable unit clauses: 0
% 0.25/1.43  #    Negative unit clauses             : 5
% 0.25/1.43  #    Non-unit-clauses                  : 170
% 0.25/1.43  # Current number of unprocessed clauses: 5159
% 0.25/1.43  # ...number of literals in the above   : 21508
% 0.25/1.43  # Current number of archived formulas  : 0
% 0.25/1.43  # Current number of archived clauses   : 62
% 0.25/1.43  # Clause-clause subsumption calls (NU) : 6145
% 0.25/1.43  # Rec. Clause-clause subsumption calls : 3163
% 0.25/1.43  # Non-unit clause-clause subsumptions  : 143
% 0.25/1.43  # Unit Clause-clause subsumption calls : 324
% 0.25/1.43  # Rewrite failures with RHS unbound    : 0
% 0.25/1.43  # BW rewrite match attempts            : 37
% 0.25/1.43  # BW rewrite match successes           : 29
% 0.25/1.43  # Condensation attempts                : 0
% 0.25/1.43  # Condensation successes               : 0
% 0.25/1.43  # Termbank termtop insertions          : 144993
% 0.25/1.43  
% 0.25/1.43  # -------------------------------------------------
% 0.25/1.43  # User time                : 0.141 s
% 0.25/1.43  # System time              : 0.005 s
% 0.25/1.43  # Total time               : 0.146 s
% 0.25/1.43  # Maximum resident set size: 8120 pages
% 0.25/23.43  eprover: CPU time limit exceeded, terminating
% 0.25/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45  eprover: No such file or directory
% 0.25/23.46  eprover: Cannot stat file /export/starexec/sandbox/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/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46  eprover: No such file or directory
% 0.25/23.47  eprover: Cannot stat file /export/starexec/sandbox/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/sandbox/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/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48  eprover: No such file or directory
% 0.25/23.49  eprover: Cannot stat file /export/starexec/sandbox/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/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.49  eprover: No such file or directory
% 0.25/23.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.50  eprover: No such file or directory
% 0.25/23.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.50  eprover: No such file or directory
% 0.25/23.51  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.51  eprover: No such file or directory
%------------------------------------------------------------------------------