TSTP Solution File: CSR073+3 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : CSR073+3 : TPTP v8.1.0. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n028.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:13 EDT 2022

% Result   : Theorem 0.85s 3.03s
% Output   : CNFRefutation 0.85s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   23 (   6 unt;   0 def)
%            Number of atoms       :   40 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   32 (  15   ~;  10   |;   1   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   34 (   3 sgn  17   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(query173,conjecture,
    ? [X3] :
      ( mtvisible(c_tptp_spindlecollectormt)
     => tptptypes_5_387(X3,c_pushingababycarriage) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',query173) ).

fof(ax2_2180,axiom,
    ! [X3,X4] :
      ( tptptypes_8_400(X3,X4)
     => tptptypes_7_396(X3,X4) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_2180) ).

fof(ax2_187,axiom,
    ! [X3,X4] :
      ( tptptypes_9_401(X3,X4)
     => tptptypes_8_400(X4,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_187) ).

fof(ax2_1143,axiom,
    ! [X3,X4] :
      ( tptptypes_6_388(X3,X4)
     => tptptypes_5_387(X3,X4) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_1143) ).

fof(ax2_3428,axiom,
    ! [X3,X4] :
      ( tptptypes_7_396(X3,X4)
     => tptptypes_6_388(X3,X4) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_3428) ).

fof(ax2_224,axiom,
    tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_9612),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_224) ).

fof(c_0_6,negated_conjecture,
    ~ ? [X3] :
        ( mtvisible(c_tptp_spindlecollectormt)
       => tptptypes_5_387(X3,c_pushingababycarriage) ),
    inference(assume_negation,[status(cth)],[query173]) ).

fof(c_0_7,plain,
    ! [X5,X6] :
      ( ~ tptptypes_8_400(X5,X6)
      | tptptypes_7_396(X5,X6) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_2180])]) ).

fof(c_0_8,plain,
    ! [X5,X6] :
      ( ~ tptptypes_9_401(X5,X6)
      | tptptypes_8_400(X6,X5) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_187])]) ).

fof(c_0_9,negated_conjecture,
    ! [X4] :
      ( mtvisible(c_tptp_spindlecollectormt)
      & ~ tptptypes_5_387(X4,c_pushingababycarriage) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).

fof(c_0_10,plain,
    ! [X5,X6] :
      ( ~ tptptypes_6_388(X5,X6)
      | tptptypes_5_387(X5,X6) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_1143])]) ).

fof(c_0_11,plain,
    ! [X5,X6] :
      ( ~ tptptypes_7_396(X5,X6)
      | tptptypes_6_388(X5,X6) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_3428])]) ).

cnf(c_0_12,plain,
    ( tptptypes_7_396(X1,X2)
    | ~ tptptypes_8_400(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_13,plain,
    ( tptptypes_8_400(X1,X2)
    | ~ tptptypes_9_401(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_14,negated_conjecture,
    ~ tptptypes_5_387(X1,c_pushingababycarriage),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_15,plain,
    ( tptptypes_5_387(X1,X2)
    | ~ tptptypes_6_388(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_16,plain,
    ( tptptypes_6_388(X1,X2)
    | ~ tptptypes_7_396(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_17,plain,
    ( tptptypes_7_396(X1,X2)
    | ~ tptptypes_9_401(X2,X1) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_18,negated_conjecture,
    ~ tptptypes_6_388(X1,c_pushingababycarriage),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_19,plain,
    ( tptptypes_6_388(X1,X2)
    | ~ tptptypes_9_401(X2,X1) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_20,plain,
    tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_9612),
    inference(split_conjunct,[status(thm)],[ax2_224]) ).

cnf(c_0_21,negated_conjecture,
    ~ tptptypes_9_401(c_pushingababycarriage,X1),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_22,plain,
    $false,
    inference(sr,[status(thm)],[c_0_20,c_0_21]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : CSR073+3 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.12  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n028.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 : Fri Jun 10 02:05:03 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.85/3.03  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.85/3.03  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.85/3.03  # Preprocessing time       : 0.148 s
% 0.85/3.03  
% 0.85/3.03  # Failure: Out of unprocessed clauses!
% 0.85/3.03  # OLD status GaveUp
% 0.85/3.03  # Parsed axioms                        : 8006
% 0.85/3.03  # Removed by relevancy pruning/SinE    : 7983
% 0.85/3.03  # Initial clauses                      : 24
% 0.85/3.03  # Removed in clause preprocessing      : 0
% 0.85/3.03  # Initial clauses in saturation        : 24
% 0.85/3.03  # Processed clauses                    : 30
% 0.85/3.03  # ...of these trivial                  : 0
% 0.85/3.03  # ...subsumed                          : 9
% 0.85/3.03  # ...remaining for further processing  : 21
% 0.85/3.03  # Other redundant clauses eliminated   : 0
% 0.85/3.03  # Clauses deleted for lack of memory   : 0
% 0.85/3.03  # Backward-subsumed                    : 0
% 0.85/3.03  # Backward-rewritten                   : 0
% 0.85/3.03  # Generated clauses                    : 6
% 0.85/3.03  # ...of the previous two non-trivial   : 6
% 0.85/3.03  # Contextual simplify-reflections      : 0
% 0.85/3.03  # Paramodulations                      : 6
% 0.85/3.03  # Factorizations                       : 0
% 0.85/3.03  # Equation resolutions                 : 0
% 0.85/3.03  # Current number of processed clauses  : 21
% 0.85/3.03  #    Positive orientable unit clauses  : 1
% 0.85/3.03  #    Positive unorientable unit clauses: 0
% 0.85/3.03  #    Negative unit clauses             : 2
% 0.85/3.03  #    Non-unit-clauses                  : 18
% 0.85/3.03  # Current number of unprocessed clauses: 0
% 0.85/3.03  # ...number of literals in the above   : 0
% 0.85/3.03  # Current number of archived formulas  : 0
% 0.85/3.03  # Current number of archived clauses   : 0
% 0.85/3.03  # Clause-clause subsumption calls (NU) : 21
% 0.85/3.03  # Rec. Clause-clause subsumption calls : 21
% 0.85/3.03  # Non-unit clause-clause subsumptions  : 9
% 0.85/3.03  # Unit Clause-clause subsumption calls : 0
% 0.85/3.03  # Rewrite failures with RHS unbound    : 0
% 0.85/3.03  # BW rewrite match attempts            : 0
% 0.85/3.03  # BW rewrite match successes           : 0
% 0.85/3.03  # Condensation attempts                : 0
% 0.85/3.03  # Condensation successes               : 0
% 0.85/3.03  # Termbank termtop insertions          : 52022
% 0.85/3.03  
% 0.85/3.03  # -------------------------------------------------
% 0.85/3.03  # User time                : 0.136 s
% 0.85/3.03  # System time              : 0.013 s
% 0.85/3.03  # Total time               : 0.149 s
% 0.85/3.03  # Maximum resident set size: 19708 pages
% 0.85/3.03  # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.85/3.03  # Preprocessing time       : 0.255 s
% 0.85/3.03  
% 0.85/3.03  # Proof found!
% 0.85/3.03  # SZS status Theorem
% 0.85/3.03  # SZS output start CNFRefutation
% See solution above
% 0.85/3.03  # Proof object total steps             : 23
% 0.85/3.03  # Proof object clause steps            : 11
% 0.85/3.03  # Proof object formula steps           : 12
% 0.85/3.03  # Proof object conjectures             : 6
% 0.85/3.03  # Proof object clause conjectures      : 3
% 0.85/3.03  # Proof object formula conjectures     : 3
% 0.85/3.03  # Proof object initial clauses used    : 6
% 0.85/3.03  # Proof object initial formulas used   : 6
% 0.85/3.03  # Proof object generating inferences   : 4
% 0.85/3.03  # Proof object simplifying inferences  : 1
% 0.85/3.03  # Training examples: 0 positive, 0 negative
% 0.85/3.03  # Parsed axioms                        : 8006
% 0.85/3.03  # Removed by relevancy pruning/SinE    : 0
% 0.85/3.03  # Initial clauses                      : 8007
% 0.85/3.03  # Removed in clause preprocessing      : 0
% 0.85/3.03  # Initial clauses in saturation        : 8007
% 0.85/3.03  # Processed clauses                    : 10011
% 0.85/3.03  # ...of these trivial                  : 1236
% 0.85/3.03  # ...subsumed                          : 368
% 0.85/3.03  # ...remaining for further processing  : 8407
% 0.85/3.03  # Other redundant clauses eliminated   : 0
% 0.85/3.03  # Clauses deleted for lack of memory   : 0
% 0.85/3.03  # Backward-subsumed                    : 5
% 0.85/3.03  # Backward-rewritten                   : 230
% 0.85/3.03  # Generated clauses                    : 25450
% 0.85/3.03  # ...of the previous two non-trivial   : 23803
% 0.85/3.03  # Contextual simplify-reflections      : 20
% 0.85/3.03  # Paramodulations                      : 25448
% 0.85/3.03  # Factorizations                       : 0
% 0.85/3.03  # Equation resolutions                 : 0
% 0.85/3.03  # Current number of processed clauses  : 8170
% 0.85/3.03  #    Positive orientable unit clauses  : 3447
% 0.85/3.03  #    Positive unorientable unit clauses: 0
% 0.85/3.03  #    Negative unit clauses             : 193
% 0.85/3.03  #    Non-unit-clauses                  : 4530
% 0.85/3.03  # Current number of unprocessed clauses: 21451
% 0.85/3.03  # ...number of literals in the above   : 38013
% 0.85/3.03  # Current number of archived formulas  : 0
% 0.85/3.03  # Current number of archived clauses   : 237
% 0.85/3.03  # Clause-clause subsumption calls (NU) : 2788722
% 0.85/3.03  # Rec. Clause-clause subsumption calls : 2606488
% 0.85/3.03  # Non-unit clause-clause subsumptions  : 390
% 0.85/3.03  # Unit Clause-clause subsumption calls : 685512
% 0.85/3.03  # Rewrite failures with RHS unbound    : 0
% 0.85/3.03  # BW rewrite match attempts            : 2686
% 0.85/3.03  # BW rewrite match successes           : 52
% 0.85/3.03  # Condensation attempts                : 0
% 0.85/3.03  # Condensation successes               : 0
% 0.85/3.03  # Termbank termtop insertions          : 503934
% 0.85/3.03  
% 0.85/3.03  # -------------------------------------------------
% 0.85/3.03  # User time                : 1.066 s
% 0.85/3.03  # System time              : 0.028 s
% 0.85/3.03  # Total time               : 1.094 s
% 0.85/3.03  # Maximum resident set size: 68676 pages
%------------------------------------------------------------------------------