↑ Up

ET---2.0.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : CSR065+3 : TPTP v8.1.0. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n013.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:02:05 EDT 2022

% Result   : Theorem 0.86s 2.04s
% Output   : CNFRefutation 0.86s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   29 (  15 unt;   0 def)
%            Number of atoms       :   49 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   38 (  18   ~;  12   |;   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   :    9 (   0 sgn   6   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(query165,conjecture,
    ( mtvisible(c_tptp_spindlecollectormt)
   => tptpofobject(c_tptpridgeline_topographical,f_tptpquantityfn_13(n_468)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',query165) ).

fof(ax2_2569,axiom,
    ! [X2] :
      ( ( mtvisible(c_tptp_member235_mt)
        & ridgeline_topographical(X2) )
     => tptpofobject(X2,f_tptpquantityfn_13(n_468)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_2569) ).

fof(ax2_7997,axiom,
    ! [X21,X22] :
      ( ( mtvisible(X21)
        & genlmt(X21,X22) )
     => mtvisible(X22) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_7997) ).

fof(ax2_737,axiom,
    ( mtvisible(c_cyclistsmt)
   => ridgeline_topographical(c_tptpridgeline_topographical) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_737) ).

fof(ax2_2882,axiom,
    genlmt(c_tptp_spindlecollectormt,c_tptp_member3633_mt),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_2882) ).

fof(ax2_279,axiom,
    genlmt(c_tptp_spindlecollectormt,c_tptp_member235_mt),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_279) ).

fof(ax2_142,axiom,
    genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_142) ).

fof(ax2_4288,axiom,
    genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_4288) ).

fof(c_0_8,negated_conjecture,
    ~ ( mtvisible(c_tptp_spindlecollectormt)
     => tptpofobject(c_tptpridgeline_topographical,f_tptpquantityfn_13(n_468)) ),
    inference(assume_negation,[status(cth)],[query165]) ).

fof(c_0_9,negated_conjecture,
    ( mtvisible(c_tptp_spindlecollectormt)
    & ~ tptpofobject(c_tptpridgeline_topographical,f_tptpquantityfn_13(n_468)) ),
    inference(fof_nnf,[status(thm)],[c_0_8]) ).

fof(c_0_10,plain,
    ! [X3] :
      ( ~ mtvisible(c_tptp_member235_mt)
      | ~ ridgeline_topographical(X3)
      | tptpofobject(X3,f_tptpquantityfn_13(n_468)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_2569])]) ).

fof(c_0_11,plain,
    ! [X23,X24] :
      ( ~ mtvisible(X23)
      | ~ genlmt(X23,X24)
      | mtvisible(X24) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_7997])]) ).

cnf(c_0_12,negated_conjecture,
    ~ tptpofobject(c_tptpridgeline_topographical,f_tptpquantityfn_13(n_468)),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_13,plain,
    ( tptpofobject(X1,f_tptpquantityfn_13(n_468))
    | ~ ridgeline_topographical(X1)
    | ~ mtvisible(c_tptp_member235_mt) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_14,plain,
    ( ~ mtvisible(c_cyclistsmt)
    | ridgeline_topographical(c_tptpridgeline_topographical) ),
    inference(fof_nnf,[status(thm)],[ax2_737]) ).

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

cnf(c_0_16,plain,
    genlmt(c_tptp_spindlecollectormt,c_tptp_member3633_mt),
    inference(split_conjunct,[status(thm)],[ax2_2882]) ).

cnf(c_0_17,negated_conjecture,
    mtvisible(c_tptp_spindlecollectormt),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_18,negated_conjecture,
    ( ~ ridgeline_topographical(c_tptpridgeline_topographical)
    | ~ mtvisible(c_tptp_member235_mt) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_19,plain,
    ( ridgeline_topographical(c_tptpridgeline_topographical)
    | ~ mtvisible(c_cyclistsmt) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_20,plain,
    genlmt(c_tptp_spindlecollectormt,c_tptp_member235_mt),
    inference(split_conjunct,[status(thm)],[ax2_279]) ).

cnf(c_0_21,plain,
    genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt),
    inference(split_conjunct,[status(thm)],[ax2_142]) ).

cnf(c_0_22,plain,
    mtvisible(c_tptp_member3633_mt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).

cnf(c_0_23,negated_conjecture,
    ( ~ mtvisible(c_tptp_member235_mt)
    | ~ mtvisible(c_cyclistsmt) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_24,plain,
    mtvisible(c_tptp_member235_mt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_20]),c_0_17])]) ).

cnf(c_0_25,plain,
    genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
    inference(split_conjunct,[status(thm)],[ax2_4288]) ).

cnf(c_0_26,plain,
    mtvisible(c_tptp_spindleheadmt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_21]),c_0_22])]) ).

cnf(c_0_27,negated_conjecture,
    ~ mtvisible(c_cyclistsmt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[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_15,c_0_25]),c_0_26])]),c_0_27]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : CSR065+3 : TPTP v8.1.0. Released v3.4.0.
% 0.11/0.12  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n013.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 : Sat Jun 11 02:03:14 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.86/2.04  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.86/2.04  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.86/2.04  # Preprocessing time       : 0.084 s
% 0.86/2.04  
% 0.86/2.04  # Failure: Out of unprocessed clauses!
% 0.86/2.04  # OLD status GaveUp
% 0.86/2.04  # Parsed axioms                        : 8006
% 0.86/2.04  # Removed by relevancy pruning/SinE    : 7942
% 0.86/2.04  # Initial clauses                      : 65
% 0.86/2.04  # Removed in clause preprocessing      : 0
% 0.86/2.04  # Initial clauses in saturation        : 65
% 0.86/2.04  # Processed clauses                    : 108
% 0.86/2.04  # ...of these trivial                  : 2
% 0.86/2.04  # ...subsumed                          : 20
% 0.86/2.04  # ...remaining for further processing  : 86
% 0.86/2.04  # Other redundant clauses eliminated   : 0
% 0.86/2.04  # Clauses deleted for lack of memory   : 0
% 0.86/2.04  # Backward-subsumed                    : 0
% 0.86/2.04  # Backward-rewritten                   : 2
% 0.86/2.04  # Generated clauses                    : 82
% 0.86/2.04  # ...of the previous two non-trivial   : 47
% 0.86/2.04  # Contextual simplify-reflections      : 0
% 0.86/2.04  # Paramodulations                      : 82
% 0.86/2.04  # Factorizations                       : 0
% 0.86/2.04  # Equation resolutions                 : 0
% 0.86/2.04  # Current number of processed clauses  : 84
% 0.86/2.04  #    Positive orientable unit clauses  : 33
% 0.86/2.04  #    Positive unorientable unit clauses: 0
% 0.86/2.04  #    Negative unit clauses             : 9
% 0.86/2.04  #    Non-unit-clauses                  : 42
% 0.86/2.04  # Current number of unprocessed clauses: 0
% 0.86/2.04  # ...number of literals in the above   : 0
% 0.86/2.04  # Current number of archived formulas  : 0
% 0.86/2.04  # Current number of archived clauses   : 2
% 0.86/2.04  # Clause-clause subsumption calls (NU) : 287
% 0.86/2.04  # Rec. Clause-clause subsumption calls : 253
% 0.86/2.04  # Non-unit clause-clause subsumptions  : 18
% 0.86/2.04  # Unit Clause-clause subsumption calls : 60
% 0.86/2.04  # Rewrite failures with RHS unbound    : 0
% 0.86/2.04  # BW rewrite match attempts            : 1
% 0.86/2.04  # BW rewrite match successes           : 1
% 0.86/2.04  # Condensation attempts                : 0
% 0.86/2.04  # Condensation successes               : 0
% 0.86/2.04  # Termbank termtop insertions          : 54076
% 0.86/2.04  
% 0.86/2.04  # -------------------------------------------------
% 0.86/2.04  # User time                : 0.078 s
% 0.86/2.04  # System time              : 0.008 s
% 0.86/2.04  # Total time               : 0.086 s
% 0.86/2.04  # Maximum resident set size: 19716 pages
% 0.86/2.04  # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.86/2.04  # Preprocessing time       : 0.243 s
% 0.86/2.04  
% 0.86/2.04  # Proof found!
% 0.86/2.04  # SZS status Theorem
% 0.86/2.04  # SZS output start CNFRefutation
% See solution above
% 0.86/2.04  # Proof object total steps             : 29
% 0.86/2.04  # Proof object clause steps            : 16
% 0.86/2.04  # Proof object formula steps           : 13
% 0.86/2.04  # Proof object conjectures             : 8
% 0.86/2.04  # Proof object clause conjectures      : 5
% 0.86/2.04  # Proof object formula conjectures     : 3
% 0.86/2.04  # Proof object initial clauses used    : 9
% 0.86/2.04  # Proof object initial formulas used   : 8
% 0.86/2.04  # Proof object generating inferences   : 6
% 0.86/2.04  # Proof object simplifying inferences  : 11
% 0.86/2.04  # Training examples: 0 positive, 0 negative
% 0.86/2.04  # Parsed axioms                        : 8006
% 0.86/2.04  # Removed by relevancy pruning/SinE    : 0
% 0.86/2.04  # Initial clauses                      : 8007
% 0.86/2.04  # Removed in clause preprocessing      : 0
% 0.86/2.04  # Initial clauses in saturation        : 8007
% 0.86/2.04  # Processed clauses                    : 8748
% 0.86/2.04  # ...of these trivial                  : 672
% 0.86/2.04  # ...subsumed                          : 346
% 0.86/2.04  # ...remaining for further processing  : 7729
% 0.86/2.04  # Other redundant clauses eliminated   : 0
% 0.86/2.04  # Clauses deleted for lack of memory   : 0
% 0.86/2.04  # Backward-subsumed                    : 3
% 0.86/2.04  # Backward-rewritten                   : 87
% 0.86/2.04  # Generated clauses                    : 23323
% 0.86/2.04  # ...of the previous two non-trivial   : 21658
% 0.86/2.04  # Contextual simplify-reflections      : 20
% 0.86/2.04  # Paramodulations                      : 23323
% 0.86/2.04  # Factorizations                       : 0
% 0.86/2.04  # Equation resolutions                 : 0
% 0.86/2.04  # Current number of processed clauses  : 7639
% 0.86/2.04  #    Positive orientable unit clauses  : 3082
% 0.86/2.04  #    Positive unorientable unit clauses: 0
% 0.86/2.04  #    Negative unit clauses             : 97
% 0.86/2.04  #    Non-unit-clauses                  : 4460
% 0.86/2.04  # Current number of unprocessed clauses: 20734
% 0.86/2.04  # ...number of literals in the above   : 37501
% 0.86/2.04  # Current number of archived formulas  : 0
% 0.86/2.04  # Current number of archived clauses   : 90
% 0.86/2.04  # Clause-clause subsumption calls (NU) : 2585973
% 0.86/2.04  # Rec. Clause-clause subsumption calls : 2421148
% 0.86/2.04  # Non-unit clause-clause subsumptions  : 365
% 0.86/2.04  # Unit Clause-clause subsumption calls : 209155
% 0.86/2.04  # Rewrite failures with RHS unbound    : 0
% 0.86/2.04  # BW rewrite match attempts            : 2622
% 0.86/2.04  # BW rewrite match successes           : 43
% 0.86/2.04  # Condensation attempts                : 0
% 0.86/2.04  # Condensation successes               : 0
% 0.86/2.04  # Termbank termtop insertions          : 491609
% 0.86/2.04  
% 0.86/2.04  # -------------------------------------------------
% 0.86/2.04  # User time                : 0.861 s
% 0.86/2.04  # System time              : 0.039 s
% 0.86/2.04  # Total time               : 0.900 s
% 0.86/2.04  # Maximum resident set size: 67092 pages
%------------------------------------------------------------------------------