TSTP Solution File: CSR065+2 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : CSR065+2 : TPTP v8.2.0. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n011.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  : 300s
% DateTime : Mon May 20 19:13:57 EDT 2024

% Result   : Theorem 0.64s 0.56s
% Output   : CNFRefutation 0.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            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 :   33 (  14   ~;  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(query115,conjecture,
    ( mtvisible(c_tptp_spindlecollectormt)
   => tptpofobject(c_tptpridgeline_topographical,f_tptpquantityfn_13(n_468)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query115) ).

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

fof(ax1_364,axiom,
    genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_364) ).

fof(ax1_315,axiom,
    genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_315) ).

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

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

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

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

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

fof(c_0_9,plain,
    ! [X33,X34] :
      ( ~ mtvisible(X33)
      | ~ genlmt(X33,X34)
      | mtvisible(X34) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_1123])])]) ).

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

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

cnf(c_0_12,plain,
    genlmt(c_tptp_spindlecollectormt,c_tptp_member3993_mt),
    inference(split_conjunct,[status(thm)],[ax1_364]) ).

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

cnf(c_0_14,plain,
    genlmt(c_tptp_member3993_mt,c_tptp_spindleheadmt),
    inference(split_conjunct,[status(thm)],[ax1_315]) ).

cnf(c_0_15,plain,
    mtvisible(c_tptp_member3993_mt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).

fof(c_0_16,plain,
    ! [X23] :
      ( ~ mtvisible(c_tptp_member235_mt)
      | ~ ridgeline_topographical(X23)
      | tptpofobject(X23,f_tptpquantityfn_13(n_468)) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_105])])]) ).

cnf(c_0_17,plain,
    genlmt(c_tptp_spindlecollectormt,c_tptp_member235_mt),
    inference(split_conjunct,[status(thm)],[ax1_419]) ).

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

cnf(c_0_19,plain,
    genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
    inference(split_conjunct,[status(thm)],[ax1_254]) ).

cnf(c_0_20,plain,
    mtvisible(c_tptp_spindleheadmt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_14]),c_0_15])]) ).

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

cnf(c_0_22,plain,
    mtvisible(c_tptp_member235_mt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_17]),c_0_13])]) ).

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

cnf(c_0_24,plain,
    mtvisible(c_cyclistsmt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_19]),c_0_20])]) ).

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

cnf(c_0_26,plain,
    ( tptpofobject(X1,f_tptpquantityfn_13(n_468))
    | ~ ridgeline_topographical(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).

cnf(c_0_27,plain,
    ridgeline_topographical(c_tptpridgeline_topographical),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : CSR065+2 : TPTP v8.2.0. Released v3.4.0.
% 0.03/0.13  % Command    : run_E %s %d THM
% 0.12/0.34  % Computer : n011.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Sun May 19 01:05:23 EDT 2024
% 0.12/0.34  % CPUTime    : 
% 0.21/0.48  Running first-order theorem proving
% 0.21/0.48  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.64/0.56  # Version: 3.1.0
% 0.64/0.56  # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.64/0.56  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.56  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.64/0.56  # Starting new_bool_3 with 600s (2) cores
% 0.64/0.56  # Starting new_bool_1 with 600s (2) cores
% 0.64/0.56  # Starting sh5l with 300s (1) cores
% 0.64/0.56  # sh5l with pid 19695 completed with status 0
% 0.64/0.56  # Result found by sh5l
% 0.64/0.56  # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.64/0.56  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.56  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.64/0.56  # Starting new_bool_3 with 600s (2) cores
% 0.64/0.56  # Starting new_bool_1 with 600s (2) cores
% 0.64/0.56  # Starting sh5l with 300s (1) cores
% 0.64/0.56  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.64/0.56  # Search class: FHHNM-FSLM31-SFFFFFNN
% 0.64/0.56  # partial match(2): FHHNM-SSLM31-MFFFFFNN
% 0.64/0.56  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.64/0.56  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.64/0.56  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 19707 completed with status 0
% 0.64/0.56  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.64/0.56  # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.64/0.56  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.56  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.64/0.56  # Starting new_bool_3 with 600s (2) cores
% 0.64/0.56  # Starting new_bool_1 with 600s (2) cores
% 0.64/0.56  # Starting sh5l with 300s (1) cores
% 0.64/0.56  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.64/0.56  # Search class: FHHNM-FSLM31-SFFFFFNN
% 0.64/0.56  # partial match(2): FHHNM-SSLM31-MFFFFFNN
% 0.64/0.56  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.64/0.56  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.64/0.56  # Preprocessing time       : 0.005 s
% 0.64/0.56  # Presaturation interreduction done
% 0.64/0.56  
% 0.64/0.56  # Proof found!
% 0.64/0.56  # SZS status Theorem
% 0.64/0.56  # SZS output start CNFRefutation
% See solution above
% 0.64/0.56  # Parsed axioms                        : 1132
% 0.64/0.56  # Removed by relevancy pruning/SinE    : 749
% 0.64/0.56  # Initial clauses                      : 384
% 0.64/0.56  # Removed in clause preprocessing      : 0
% 0.64/0.56  # Initial clauses in saturation        : 384
% 0.64/0.56  # Processed clauses                    : 608
% 0.64/0.56  # ...of these trivial                  : 1
% 0.64/0.56  # ...subsumed                          : 14
% 0.64/0.56  # ...remaining for further processing  : 593
% 0.64/0.56  # Other redundant clauses eliminated   : 0
% 0.64/0.56  # Clauses deleted for lack of memory   : 0
% 0.64/0.56  # Backward-subsumed                    : 1
% 0.64/0.56  # Backward-rewritten                   : 12
% 0.64/0.56  # Generated clauses                    : 53
% 0.64/0.56  # ...of the previous two non-redundant : 59
% 0.64/0.56  # ...aggressively subsumed             : 0
% 0.64/0.56  # Contextual simplify-reflections      : 0
% 0.64/0.56  # Paramodulations                      : 53
% 0.64/0.56  # Factorizations                       : 0
% 0.64/0.56  # NegExts                              : 0
% 0.64/0.56  # Equation resolutions                 : 0
% 0.64/0.56  # Disequality decompositions           : 0
% 0.64/0.56  # Total rewrite steps                  : 33
% 0.64/0.56  # ...of those cached                   : 14
% 0.64/0.56  # Propositional unsat checks           : 0
% 0.64/0.56  #    Propositional check models        : 0
% 0.64/0.56  #    Propositional check unsatisfiable : 0
% 0.64/0.56  #    Propositional clauses             : 0
% 0.64/0.56  #    Propositional clauses after purity: 0
% 0.64/0.56  #    Propositional unsat core size     : 0
% 0.64/0.56  #    Propositional preprocessing time  : 0.000
% 0.64/0.56  #    Propositional encoding time       : 0.000
% 0.64/0.56  #    Propositional solver time         : 0.000
% 0.64/0.56  #    Success case prop preproc time    : 0.000
% 0.64/0.56  #    Success case prop encoding time   : 0.000
% 0.64/0.56  #    Success case prop solver time     : 0.000
% 0.64/0.56  # Current number of processed clauses  : 212
% 0.64/0.56  #    Positive orientable unit clauses  : 111
% 0.64/0.56  #    Positive unorientable unit clauses: 0
% 0.64/0.56  #    Negative unit clauses             : 3
% 0.64/0.56  #    Non-unit-clauses                  : 98
% 0.64/0.56  # Current number of unprocessed clauses: 203
% 0.64/0.56  # ...number of literals in the above   : 382
% 0.64/0.56  # Current number of archived formulas  : 0
% 0.64/0.56  # Current number of archived clauses   : 381
% 0.64/0.56  # Clause-clause subsumption calls (NU) : 16084
% 0.64/0.56  # Rec. Clause-clause subsumption calls : 15025
% 0.64/0.56  # Non-unit clause-clause subsumptions  : 15
% 0.64/0.56  # Unit Clause-clause subsumption calls : 1277
% 0.64/0.56  # Rewrite failures with RHS unbound    : 0
% 0.64/0.56  # BW rewrite match attempts            : 10
% 0.64/0.56  # BW rewrite match successes           : 10
% 0.64/0.56  # Condensation attempts                : 0
% 0.64/0.56  # Condensation successes               : 0
% 0.64/0.56  # Termbank termtop insertions          : 24926
% 0.64/0.56  # Search garbage collected termcells   : 5536
% 0.64/0.56  
% 0.64/0.56  # -------------------------------------------------
% 0.64/0.56  # User time                : 0.040 s
% 0.64/0.56  # System time              : 0.008 s
% 0.64/0.56  # Total time               : 0.048 s
% 0.64/0.56  # Maximum resident set size: 4760 pages
% 0.64/0.56  
% 0.64/0.56  # -------------------------------------------------
% 0.64/0.56  # User time                : 0.057 s
% 0.64/0.56  # System time              : 0.011 s
% 0.64/0.56  # Total time               : 0.067 s
% 0.64/0.56  # Maximum resident set size: 2648 pages
% 0.64/0.56  % E---3.1 exiting
% 0.64/0.56  % E exiting
%------------------------------------------------------------------------------