↑ Up

ET---2.0.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : CSR026+1 : TPTP v8.1.0. Released v3.4.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 : Fri Jul 15 03:01:27 EDT 2022

% Result   : Theorem 0.24s 1.42s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   29 (  16 unt;   0 def)
%            Number of atoms       :   48 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   36 (  17   ~;  11   |;   3   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   7 con; 0-1 aty)
%            Number of variables   :   10 (   0 sgn   6   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(query26,conjecture,
    ( mtvisible(c_tptp_spindlecollectormt)
   => tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',query26) ).

fof(just48,axiom,
    ! [X16,X17] :
      ( ( mtvisible(X16)
        & genlmt(X16,X17) )
     => mtvisible(X17) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just48) ).

fof(just9,axiom,
    ! [X1] :
      ( ( mtvisible(c_tptp_member2701_mt)
        & runningshorts(X1) )
     => tptpofobject(X1,f_tptpquantityfn_2(n_756)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just9) ).

fof(just6,axiom,
    genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just6) ).

fof(just11,axiom,
    ( mtvisible(c_cyclistsmt)
   => runningshorts(c_tptprunningshorts) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just11) ).

fof(just8,axiom,
    genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just8) ).

fof(just5,axiom,
    genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just5) ).

fof(just7,axiom,
    genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',just7) ).

fof(c_0_8,negated_conjecture,
    ~ ( mtvisible(c_tptp_spindlecollectormt)
     => tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)) ),
    inference(assume_negation,[status(cth)],[query26]) ).

fof(c_0_9,plain,
    ! [X18,X19] :
      ( ~ mtvisible(X18)
      | ~ genlmt(X18,X19)
      | mtvisible(X19) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just48])]) ).

fof(c_0_10,negated_conjecture,
    ( mtvisible(c_tptp_spindlecollectormt)
    & ~ tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)) ),
    inference(fof_nnf,[status(thm)],[c_0_8]) ).

fof(c_0_11,plain,
    ! [X2] :
      ( ~ mtvisible(c_tptp_member2701_mt)
      | ~ runningshorts(X2)
      | tptpofobject(X2,f_tptpquantityfn_2(n_756)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just9])]) ).

cnf(c_0_12,plain,
    ( mtvisible(X1)
    | ~ genlmt(X2,X1)
    | ~ mtvisible(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_13,plain,
    genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
    inference(split_conjunct,[status(thm)],[just6]) ).

cnf(c_0_14,negated_conjecture,
    mtvisible(c_tptp_spindlecollectormt),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_15,plain,
    ( tptpofobject(X1,f_tptpquantityfn_2(n_756))
    | ~ runningshorts(X1)
    | ~ mtvisible(c_tptp_member2701_mt) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_16,plain,
    mtvisible(c_tptp_member2701_mt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).

cnf(c_0_17,negated_conjecture,
    ~ tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_18,plain,
    ( tptpofobject(X1,f_tptpquantityfn_2(n_756))
    | ~ runningshorts(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]) ).

fof(c_0_19,plain,
    ( ~ mtvisible(c_cyclistsmt)
    | runningshorts(c_tptprunningshorts) ),
    inference(fof_nnf,[status(thm)],[just11]) ).

cnf(c_0_20,negated_conjecture,
    ~ runningshorts(c_tptprunningshorts),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_21,plain,
    ( runningshorts(c_tptprunningshorts)
    | ~ mtvisible(c_cyclistsmt) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_22,plain,
    genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt),
    inference(split_conjunct,[status(thm)],[just8]) ).

cnf(c_0_23,plain,
    genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
    inference(split_conjunct,[status(thm)],[just5]) ).

cnf(c_0_24,negated_conjecture,
    ~ mtvisible(c_cyclistsmt),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_25,plain,
    genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt),
    inference(split_conjunct,[status(thm)],[just7]) ).

cnf(c_0_26,plain,
    mtvisible(c_tptp_member3993_mt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_22]),c_0_14])]) ).

cnf(c_0_27,plain,
    ~ mtvisible(c_tptp_spindleheadmt),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_23]),c_0_24]) ).

cnf(c_0_28,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_25]),c_0_26])]),c_0_27]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : CSR026+1 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n017.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 : Thu Jun  9 21:42:04 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.014 s
% 0.24/1.42  
% 0.24/1.42  # Failure: Out of unprocessed clauses!
% 0.24/1.42  # OLD status GaveUp
% 0.24/1.42  # Parsed axioms                        : 57
% 0.24/1.42  # Removed by relevancy pruning/SinE    : 49
% 0.24/1.42  # Initial clauses                      : 9
% 0.24/1.42  # Removed in clause preprocessing      : 0
% 0.24/1.42  # Initial clauses in saturation        : 9
% 0.24/1.42  # Processed clauses                    : 15
% 0.24/1.42  # ...of these trivial                  : 0
% 0.24/1.42  # ...subsumed                          : 0
% 0.24/1.42  # ...remaining for further processing  : 15
% 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                    : 0
% 0.24/1.42  # Backward-rewritten                   : 1
% 0.24/1.42  # Generated clauses                    : 8
% 0.24/1.42  # ...of the previous two non-trivial   : 7
% 0.24/1.42  # Contextual simplify-reflections      : 0
% 0.24/1.42  # Paramodulations                      : 8
% 0.24/1.42  # Factorizations                       : 0
% 0.24/1.42  # Equation resolutions                 : 0
% 0.24/1.42  # Current number of processed clauses  : 14
% 0.24/1.42  #    Positive orientable unit clauses  : 3
% 0.24/1.42  #    Positive unorientable unit clauses: 0
% 0.24/1.42  #    Negative unit clauses             : 3
% 0.24/1.42  #    Non-unit-clauses                  : 8
% 0.24/1.42  # Current number of unprocessed clauses: 0
% 0.24/1.42  # ...number of literals in the above   : 0
% 0.24/1.42  # Current number of archived formulas  : 0
% 0.24/1.42  # Current number of archived clauses   : 1
% 0.24/1.42  # Clause-clause subsumption calls (NU) : 5
% 0.24/1.42  # Rec. Clause-clause subsumption calls : 5
% 0.24/1.42  # Non-unit clause-clause subsumptions  : 0
% 0.24/1.42  # Unit Clause-clause subsumption calls : 2
% 0.24/1.42  # Rewrite failures with RHS unbound    : 0
% 0.24/1.42  # BW rewrite match attempts            : 1
% 0.24/1.42  # BW rewrite match successes           : 1
% 0.24/1.42  # Condensation attempts                : 0
% 0.24/1.42  # Condensation successes               : 0
% 0.24/1.42  # Termbank termtop insertions          : 858
% 0.24/1.42  
% 0.24/1.42  # -------------------------------------------------
% 0.24/1.42  # User time                : 0.012 s
% 0.24/1.42  # System time              : 0.003 s
% 0.24/1.42  # Total time               : 0.015 s
% 0.24/1.42  # Maximum resident set size: 2760 pages
% 0.24/1.42  # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.24/1.42  # Preprocessing time       : 0.016 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             : 29
% 0.24/1.42  # Proof object clause steps            : 16
% 0.24/1.42  # Proof object formula steps           : 13
% 0.24/1.42  # Proof object conjectures             : 7
% 0.24/1.42  # Proof object clause conjectures      : 4
% 0.24/1.42  # Proof object formula conjectures     : 3
% 0.24/1.42  # Proof object initial clauses used    : 9
% 0.24/1.42  # Proof object initial formulas used   : 8
% 0.24/1.42  # Proof object generating inferences   : 6
% 0.24/1.42  # Proof object simplifying inferences  : 10
% 0.24/1.42  # Training examples: 0 positive, 0 negative
% 0.24/1.42  # Parsed axioms                        : 57
% 0.24/1.42  # Removed by relevancy pruning/SinE    : 0
% 0.24/1.42  # Initial clauses                      : 58
% 0.24/1.42  # Removed in clause preprocessing      : 0
% 0.24/1.42  # Initial clauses in saturation        : 58
% 0.24/1.42  # Processed clauses                    : 86
% 0.24/1.42  # ...of these trivial                  : 6
% 0.24/1.42  # ...subsumed                          : 9
% 0.24/1.42  # ...remaining for further processing  : 70
% 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                    : 0
% 0.24/1.42  # Backward-rewritten                   : 2
% 0.24/1.42  # Generated clauses                    : 58
% 0.24/1.42  # ...of the previous two non-trivial   : 51
% 0.24/1.42  # Contextual simplify-reflections      : 0
% 0.24/1.42  # Paramodulations                      : 58
% 0.24/1.42  # Factorizations                       : 0
% 0.24/1.42  # Equation resolutions                 : 0
% 0.24/1.42  # Current number of processed clauses  : 68
% 0.24/1.42  #    Positive orientable unit clauses  : 28
% 0.24/1.42  #    Positive unorientable unit clauses: 0
% 0.24/1.42  #    Negative unit clauses             : 5
% 0.24/1.42  #    Non-unit-clauses                  : 35
% 0.24/1.42  # Current number of unprocessed clauses: 18
% 0.24/1.42  # ...number of literals in the above   : 27
% 0.24/1.42  # Current number of archived formulas  : 0
% 0.24/1.42  # Current number of archived clauses   : 2
% 0.24/1.42  # Clause-clause subsumption calls (NU) : 174
% 0.24/1.42  # Rec. Clause-clause subsumption calls : 168
% 0.24/1.42  # Non-unit clause-clause subsumptions  : 8
% 0.24/1.42  # Unit Clause-clause subsumption calls : 102
% 0.24/1.42  # Rewrite failures with RHS unbound    : 0
% 0.24/1.42  # BW rewrite match attempts            : 1
% 0.24/1.42  # BW rewrite match successes           : 1
% 0.24/1.42  # Condensation attempts                : 0
% 0.24/1.42  # Condensation successes               : 0
% 0.24/1.42  # Termbank termtop insertions          : 3208
% 0.24/1.42  
% 0.24/1.42  # -------------------------------------------------
% 0.24/1.42  # User time                : 0.016 s
% 0.24/1.42  # System time              : 0.002 s
% 0.24/1.42  # Total time               : 0.019 s
% 0.24/1.42  # Maximum resident set size: 2968 pages
%------------------------------------------------------------------------------