TSTP Solution File: CSR068+4 by E---3.1.00

View Problem - Process Solution

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

% Computer : n016.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:14:00 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(query218,conjecture,
    ( mtvisible(c_tptp_member2356_mt)
   => tptpofobject(c_theprototypicalfurpelt,f_tptpquantityfn_1(n_328)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query218) ).

fof(ax3_5580,axiom,
    ! [X6] :
      ( ( mtvisible(c_tptp_spindleheadmt)
        & furpelt(X6) )
     => tptpofobject(X6,f_tptpquantityfn_1(n_328)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+3.ax',ax3_5580) ).

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

fof(ax3_10453,axiom,
    furpelt(c_theprototypicalfurpelt),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+3.ax',ax3_10453) ).

fof(ax3_9650,axiom,
    genlmt(c_tptp_member2356_mt,c_tptp_spindleheadmt),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+3.ax',ax3_9650) ).

fof(c_0_5,negated_conjecture,
    ~ ( mtvisible(c_tptp_member2356_mt)
     => tptpofobject(c_theprototypicalfurpelt,f_tptpquantityfn_1(n_328)) ),
    inference(assume_negation,[status(cth)],[query218]) ).

fof(c_0_6,negated_conjecture,
    ( mtvisible(c_tptp_member2356_mt)
    & ~ tptpofobject(c_theprototypicalfurpelt,f_tptpquantityfn_1(n_328)) ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).

fof(c_0_7,plain,
    ! [X28] :
      ( ~ mtvisible(c_tptp_spindleheadmt)
      | ~ furpelt(X28)
      | tptpofobject(X28,f_tptpquantityfn_1(n_328)) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_5580])])]) ).

fof(c_0_8,plain,
    ! [X30,X31] :
      ( ~ mtvisible(X30)
      | ~ genlmt(X30,X31)
      | mtvisible(X31) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_44208])])]) ).

cnf(c_0_9,negated_conjecture,
    ~ tptpofobject(c_theprototypicalfurpelt,f_tptpquantityfn_1(n_328)),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    ( tptpofobject(X1,f_tptpquantityfn_1(n_328))
    | ~ mtvisible(c_tptp_spindleheadmt)
    | ~ furpelt(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,plain,
    furpelt(c_theprototypicalfurpelt),
    inference(split_conjunct,[status(thm)],[ax3_10453]) ).

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

cnf(c_0_13,plain,
    genlmt(c_tptp_member2356_mt,c_tptp_spindleheadmt),
    inference(split_conjunct,[status(thm)],[ax3_9650]) ).

cnf(c_0_14,negated_conjecture,
    mtvisible(c_tptp_member2356_mt),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_15,negated_conjecture,
    ~ mtvisible(c_tptp_spindleheadmt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).

cnf(c_0_16,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),c_0_15]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : CSR068+4 : TPTP v8.2.0. Released v3.4.0.
% 0.14/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n016.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.21/0.35  % WCLimit    : 300
% 0.21/0.35  % DateTime   : Sun May 19 00:52:08 EDT 2024
% 0.21/0.35  % CPUTime    : 
% 0.21/0.49  Running first-order theorem proving
% 0.21/0.49  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
% 1.59/1.18  # Version: 3.1.0
% 1.59/1.18  # Preprocessing class: FMLLLMSLSSSNFFN.
% 1.59/1.18  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.59/1.18  # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 1.59/1.18  # Starting new_bool_3 with 300s (1) cores
% 1.59/1.18  # Starting new_bool_1 with 300s (1) cores
% 1.59/1.18  # Starting sh5l with 300s (1) cores
% 1.59/1.18  # new_bool_1 with pid 6021 completed with status 0
% 1.59/1.18  # Result found by new_bool_1
% 1.59/1.18  # Preprocessing class: FMLLLMSLSSSNFFN.
% 1.59/1.18  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.59/1.18  # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 1.59/1.18  # Starting new_bool_3 with 300s (1) cores
% 1.59/1.18  # Starting new_bool_1 with 300s (1) cores
% 1.59/1.18  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.59/1.18  # Search class: FHHSM-FFMM31-SFFFFFNN
% 1.59/1.18  # partial match(1): FGHSM-FFMM31-SFFFFFNN
% 1.59/1.18  # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 1.59/1.18  # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 1.59/1.18  # G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 6024 completed with status 0
% 1.59/1.18  # Result found by G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 1.59/1.18  # Preprocessing class: FMLLLMSLSSSNFFN.
% 1.59/1.18  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.59/1.18  # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 1.59/1.18  # Starting new_bool_3 with 300s (1) cores
% 1.59/1.18  # Starting new_bool_1 with 300s (1) cores
% 1.59/1.18  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.59/1.18  # Search class: FHHSM-FFMM31-SFFFFFNN
% 1.59/1.18  # partial match(1): FGHSM-FFMM31-SFFFFFNN
% 1.59/1.18  # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 1.59/1.18  # Starting G-E--_208_B07----S_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 1.59/1.18  # Preprocessing time       : 0.008 s
% 1.59/1.18  # Presaturation interreduction done
% 1.59/1.18  
% 1.59/1.18  # Proof found!
% 1.59/1.18  # SZS status Theorem
% 1.59/1.18  # SZS output start CNFRefutation
% See solution above
% 1.59/1.18  # Parsed axioms                        : 44217
% 1.59/1.18  # Removed by relevancy pruning/SinE    : 44142
% 1.59/1.18  # Initial clauses                      : 76
% 1.59/1.18  # Removed in clause preprocessing      : 1
% 1.59/1.18  # Initial clauses in saturation        : 75
% 1.59/1.18  # Processed clauses                    : 118
% 1.59/1.18  # ...of these trivial                  : 9
% 1.59/1.18  # ...subsumed                          : 11
% 1.59/1.18  # ...remaining for further processing  : 98
% 1.59/1.18  # Other redundant clauses eliminated   : 1
% 1.59/1.18  # Clauses deleted for lack of memory   : 0
% 1.59/1.18  # Backward-subsumed                    : 1
% 1.59/1.18  # Backward-rewritten                   : 0
% 1.59/1.18  # Generated clauses                    : 16
% 1.59/1.18  # ...of the previous two non-redundant : 6
% 1.59/1.18  # ...aggressively subsumed             : 0
% 1.59/1.18  # Contextual simplify-reflections      : 0
% 1.59/1.18  # Paramodulations                      : 15
% 1.59/1.18  # Factorizations                       : 0
% 1.59/1.18  # NegExts                              : 0
% 1.59/1.18  # Equation resolutions                 : 1
% 1.59/1.18  # Disequality decompositions           : 0
% 1.59/1.18  # Total rewrite steps                  : 13
% 1.59/1.18  # ...of those cached                   : 6
% 1.59/1.18  # Propositional unsat checks           : 0
% 1.59/1.18  #    Propositional check models        : 0
% 1.59/1.18  #    Propositional check unsatisfiable : 0
% 1.59/1.18  #    Propositional clauses             : 0
% 1.59/1.18  #    Propositional clauses after purity: 0
% 1.59/1.18  #    Propositional unsat core size     : 0
% 1.59/1.18  #    Propositional preprocessing time  : 0.000
% 1.59/1.18  #    Propositional encoding time       : 0.000
% 1.59/1.18  #    Propositional solver time         : 0.000
% 1.59/1.18  #    Success case prop preproc time    : 0.000
% 1.59/1.18  #    Success case prop encoding time   : 0.000
% 1.59/1.18  #    Success case prop solver time     : 0.000
% 1.59/1.18  # Current number of processed clauses  : 40
% 1.59/1.18  #    Positive orientable unit clauses  : 24
% 1.59/1.18  #    Positive unorientable unit clauses: 0
% 1.59/1.18  #    Negative unit clauses             : 2
% 1.59/1.18  #    Non-unit-clauses                  : 14
% 1.59/1.18  # Current number of unprocessed clauses: 19
% 1.59/1.18  # ...number of literals in the above   : 21
% 1.59/1.18  # Current number of archived formulas  : 0
% 1.59/1.18  # Current number of archived clauses   : 57
% 1.59/1.18  # Clause-clause subsumption calls (NU) : 108
% 1.59/1.18  # Rec. Clause-clause subsumption calls : 93
% 1.59/1.18  # Non-unit clause-clause subsumptions  : 10
% 1.59/1.18  # Unit Clause-clause subsumption calls : 14
% 1.59/1.18  # Rewrite failures with RHS unbound    : 0
% 1.59/1.18  # BW rewrite match attempts            : 0
% 1.59/1.18  # BW rewrite match successes           : 0
% 1.59/1.18  # Condensation attempts                : 0
% 1.59/1.18  # Condensation successes               : 0
% 1.59/1.18  # Termbank termtop insertions          : 294663
% 1.59/1.18  # Search garbage collected termcells   : 157706
% 1.59/1.18  
% 1.59/1.18  # -------------------------------------------------
% 1.59/1.18  # User time                : 0.133 s
% 1.59/1.18  # System time              : 0.065 s
% 1.59/1.18  # Total time               : 0.198 s
% 1.59/1.18  # Maximum resident set size: 81076 pages
% 1.59/1.18  
% 1.59/1.18  # -------------------------------------------------
% 1.59/1.18  # User time                : 0.564 s
% 1.59/1.18  # System time              : 0.100 s
% 1.59/1.18  # Total time               : 0.663 s
% 1.59/1.18  # Maximum resident set size: 33956 pages
% 1.59/1.18  % E---3.1 exiting
% 1.59/1.19  % E exiting
%------------------------------------------------------------------------------