↑ Up

ET---2.0.THM-CRf.s

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

% Computer : n012.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 17:44:59 EDT 2022

% Result   : Theorem 0.24s 1.42s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   15 (   3 unt;   0 def)
%            Number of atoms       :   90 (   0 equ)
%            Maximal formula atoms :   28 (   6 avg)
%            Number of connectives :  111 (  36   ~;  37   |;  30   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;   6 con; 0-2 aty)
%            Number of variables   :   38 (   5 sgn  13   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(goals,conjecture,
    ! [X100] :
      ( occurrence_of(X100,tptp0)
     => ? [X101,X102] :
          ( leaf_occ(X102,X100)
          & ( occurrence_of(X102,tptp1)
           => ~ ? [X103] :
                  ( occurrence_of(X103,tptp2)
                  & min_precedes(X101,X103,tptp0) ) )
          & ( occurrence_of(X102,tptp2)
           => ~ ? [X104] :
                  ( occurrence_of(X104,tptp1)
                  & min_precedes(X101,X104,tptp0) ) ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).

fof(sos_21,axiom,
    ! [X61,X62,X63] :
      ( ( occurrence_of(X61,X63)
        & leaf_occ(X62,X61) )
     => ~ ? [X64] : min_precedes(X62,X64,X63) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_21) ).

fof(sos_32,axiom,
    ! [X96] :
      ( occurrence_of(X96,tptp0)
     => ? [X97,X98,X99] :
          ( occurrence_of(X97,tptp3)
          & root_occ(X97,X96)
          & occurrence_of(X98,tptp4)
          & next_subocc(X97,X98,tptp0)
          & ( occurrence_of(X99,tptp1)
            | occurrence_of(X99,tptp2) )
          & next_subocc(X98,X99,tptp0)
          & leaf_occ(X99,X96) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_32) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X100] :
        ( occurrence_of(X100,tptp0)
       => ? [X101,X102] :
            ( leaf_occ(X102,X100)
            & ( occurrence_of(X102,tptp1)
             => ~ ? [X103] :
                    ( occurrence_of(X103,tptp2)
                    & min_precedes(X101,X103,tptp0) ) )
            & ( occurrence_of(X102,tptp2)
             => ~ ? [X104] :
                    ( occurrence_of(X104,tptp1)
                    & min_precedes(X101,X104,tptp0) ) ) ) ),
    inference(assume_negation,[status(cth)],[goals]) ).

fof(c_0_4,plain,
    ! [X65,X66,X67,X68] :
      ( ~ occurrence_of(X65,X67)
      | ~ leaf_occ(X66,X65)
      | ~ min_precedes(X66,X68,X67) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_21])])])])]) ).

fof(c_0_5,negated_conjecture,
    ! [X106,X107] :
      ( occurrence_of(esk1_0,tptp0)
      & ( occurrence_of(X107,tptp2)
        | occurrence_of(X107,tptp1)
        | ~ leaf_occ(X107,esk1_0) )
      & ( occurrence_of(esk3_2(X106,X107),tptp1)
        | occurrence_of(X107,tptp1)
        | ~ leaf_occ(X107,esk1_0) )
      & ( min_precedes(X106,esk3_2(X106,X107),tptp0)
        | occurrence_of(X107,tptp1)
        | ~ leaf_occ(X107,esk1_0) )
      & ( occurrence_of(X107,tptp2)
        | occurrence_of(esk2_2(X106,X107),tptp2)
        | ~ leaf_occ(X107,esk1_0) )
      & ( occurrence_of(esk3_2(X106,X107),tptp1)
        | occurrence_of(esk2_2(X106,X107),tptp2)
        | ~ leaf_occ(X107,esk1_0) )
      & ( min_precedes(X106,esk3_2(X106,X107),tptp0)
        | occurrence_of(esk2_2(X106,X107),tptp2)
        | ~ leaf_occ(X107,esk1_0) )
      & ( occurrence_of(X107,tptp2)
        | min_precedes(X106,esk2_2(X106,X107),tptp0)
        | ~ leaf_occ(X107,esk1_0) )
      & ( occurrence_of(esk3_2(X106,X107),tptp1)
        | min_precedes(X106,esk2_2(X106,X107),tptp0)
        | ~ leaf_occ(X107,esk1_0) )
      & ( min_precedes(X106,esk3_2(X106,X107),tptp0)
        | min_precedes(X106,esk2_2(X106,X107),tptp0)
        | ~ leaf_occ(X107,esk1_0) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])])])]) ).

cnf(c_0_6,plain,
    ( ~ min_precedes(X1,X2,X3)
    | ~ leaf_occ(X1,X4)
    | ~ occurrence_of(X4,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    ( min_precedes(X2,esk2_2(X2,X1),tptp0)
    | min_precedes(X2,esk3_2(X2,X1),tptp0)
    | ~ leaf_occ(X1,esk1_0) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

fof(c_0_8,plain,
    ! [X100] :
      ( ( occurrence_of(esk4_1(X100),tptp3)
        | ~ occurrence_of(X100,tptp0) )
      & ( root_occ(esk4_1(X100),X100)
        | ~ occurrence_of(X100,tptp0) )
      & ( occurrence_of(esk5_1(X100),tptp4)
        | ~ occurrence_of(X100,tptp0) )
      & ( next_subocc(esk4_1(X100),esk5_1(X100),tptp0)
        | ~ occurrence_of(X100,tptp0) )
      & ( occurrence_of(esk6_1(X100),tptp1)
        | occurrence_of(esk6_1(X100),tptp2)
        | ~ occurrence_of(X100,tptp0) )
      & ( next_subocc(esk5_1(X100),esk6_1(X100),tptp0)
        | ~ occurrence_of(X100,tptp0) )
      & ( leaf_occ(esk6_1(X100),X100)
        | ~ occurrence_of(X100,tptp0) ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_32])])])])])]) ).

cnf(c_0_9,negated_conjecture,
    ( ~ leaf_occ(X1,esk1_0)
    | ~ leaf_occ(X2,X3)
    | ~ occurrence_of(X3,tptp0) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_6]) ).

cnf(c_0_10,plain,
    ( leaf_occ(esk6_1(X1),X1)
    | ~ occurrence_of(X1,tptp0) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    occurrence_of(esk1_0,tptp0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_12,negated_conjecture,
    ( ~ leaf_occ(X1,X2)
    | ~ occurrence_of(X2,tptp0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).

cnf(c_0_13,negated_conjecture,
    ~ occurrence_of(X1,tptp0),
    inference(spm,[status(thm)],[c_0_12,c_0_10]) ).

cnf(c_0_14,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_11,c_0_13]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : PRO010+2 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n012.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon Jun 13 02:27:26 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.24/1.42  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42  # Preprocessing time       : 0.019 s
% 0.24/1.42  
% 0.24/1.42  # Proof found!
% 0.24/1.42  # SZS status Theorem
% 0.24/1.42  # SZS output start CNFRefutation
% See solution above
% 0.24/1.42  # Proof object total steps             : 15
% 0.24/1.42  # Proof object clause steps            : 8
% 0.24/1.42  # Proof object formula steps           : 7
% 0.24/1.42  # Proof object conjectures             : 9
% 0.24/1.42  # Proof object clause conjectures      : 6
% 0.24/1.42  # Proof object formula conjectures     : 3
% 0.24/1.42  # Proof object initial clauses used    : 4
% 0.24/1.42  # Proof object initial formulas used   : 3
% 0.24/1.42  # Proof object generating inferences   : 3
% 0.24/1.42  # Proof object simplifying inferences  : 4
% 0.24/1.42  # Training examples: 0 positive, 0 negative
% 0.24/1.42  # Parsed axioms                        : 46
% 0.24/1.42  # Removed by relevancy pruning/SinE    : 8
% 0.24/1.42  # Initial clauses                      : 74
% 0.24/1.42  # Removed in clause preprocessing      : 0
% 0.24/1.42  # Initial clauses in saturation        : 74
% 0.24/1.42  # Processed clauses                    : 104
% 0.24/1.42  # ...of these trivial                  : 0
% 0.24/1.42  # ...subsumed                          : 2
% 0.24/1.42  # ...remaining for further processing  : 102
% 0.24/1.42  # Other redundant clauses eliminated   : 0
% 0.24/1.42  # Clauses deleted for lack of memory   : 0
% 0.24/1.42  # Backward-subsumed                    : 4
% 0.24/1.42  # Backward-rewritten                   : 2
% 0.24/1.42  # Generated clauses                    : 164
% 0.24/1.42  # ...of the previous two non-trivial   : 149
% 0.24/1.42  # Contextual simplify-reflections      : 1
% 0.24/1.42  # Paramodulations                      : 163
% 0.24/1.42  # Factorizations                       : 0
% 0.24/1.42  # Equation resolutions                 : 0
% 0.24/1.42  # Current number of processed clauses  : 95
% 0.24/1.42  #    Positive orientable unit clauses  : 12
% 0.24/1.42  #    Positive unorientable unit clauses: 0
% 0.24/1.42  #    Negative unit clauses             : 9
% 0.24/1.42  #    Non-unit-clauses                  : 74
% 0.24/1.42  # Current number of unprocessed clauses: 114
% 0.24/1.42  # ...number of literals in the above   : 362
% 0.24/1.42  # Current number of archived formulas  : 0
% 0.24/1.42  # Current number of archived clauses   : 7
% 0.24/1.42  # Clause-clause subsumption calls (NU) : 1392
% 0.24/1.42  # Rec. Clause-clause subsumption calls : 1012
% 0.24/1.42  # Non-unit clause-clause subsumptions  : 6
% 0.24/1.42  # Unit Clause-clause subsumption calls : 159
% 0.24/1.42  # Rewrite failures with RHS unbound    : 0
% 0.24/1.42  # BW rewrite match attempts            : 2
% 0.24/1.42  # BW rewrite match successes           : 2
% 0.24/1.42  # Condensation attempts                : 0
% 0.24/1.42  # Condensation successes               : 0
% 0.24/1.42  # Termbank termtop insertions          : 5712
% 0.24/1.42  
% 0.24/1.42  # -------------------------------------------------
% 0.24/1.42  # User time                : 0.028 s
% 0.24/1.42  # System time              : 0.001 s
% 0.24/1.42  # Total time               : 0.029 s
% 0.24/1.42  # Maximum resident set size: 3444 pages
% 0.24/23.44  eprover: CPU time limit exceeded, terminating
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.48  eprover: No such file or directory
% 0.24/23.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.49  eprover: No such file or directory
% 0.24/23.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.49  eprover: No such file or directory
% 0.24/23.50  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.50  eprover: No such file or directory
% 0.24/23.50  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.50  eprover: No such file or directory
%------------------------------------------------------------------------------