TSTP Solution File: CSR073+3 by E-SAT---3.1.00

View Problem - Process Solution

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

% Computer : n022.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:18:05 EDT 2024

% Result   : Theorem 0.65s 0.76s
% Output   : CNFRefutation 0.65s
% 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/sandbox/benchmark/theBenchmark.p',query173) ).

fof(ax2_2180,axiom,
    ! [X3,X4] :
      ( tptptypes_8_400(X3,X4)
     => tptptypes_7_396(X3,X4) ),
    file('/export/starexec/sandbox/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/sandbox/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/sandbox/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/sandbox/benchmark/Axioms/CSR002+2.ax',ax2_3428) ).

fof(ax2_224,axiom,
    tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_9612),
    file('/export/starexec/sandbox/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,
    ! [X82,X83] :
      ( ~ tptptypes_8_400(X82,X83)
      | tptptypes_7_396(X82,X83) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_2180])])]) ).

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

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

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

fof(c_0_11,plain,
    ! [X44,X45] :
      ( ~ tptptypes_7_396(X44,X45)
      | tptptypes_6_388(X44,X45) ),
    inference(fof_nnf,[status(thm)],[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(X2,X1)
    | ~ tptptypes_9_401(X1,X2) ),
    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.07/0.12  % Problem    : CSR073+3 : TPTP v8.2.0. Released v3.4.0.
% 0.07/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n022.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    : 300
% 0.13/0.34  % DateTime   : Sun May 19 00:39:08 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.20/0.47  Running first-order model finding
% 0.20/0.47  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.65/0.76  # Version: 3.1.0
% 0.65/0.76  # Preprocessing class: FMLLMMSLSSSNFFN.
% 0.65/0.76  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.65/0.76  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.65/0.76  # Starting new_bool_3 with 300s (1) cores
% 0.65/0.76  # Starting new_bool_1 with 300s (1) cores
% 0.65/0.76  # Starting sh5l with 300s (1) cores
% 0.65/0.76  # sh5l with pid 18373 completed with status 0
% 0.65/0.76  # Result found by sh5l
% 0.65/0.76  # Preprocessing class: FMLLMMSLSSSNFFN.
% 0.65/0.76  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.65/0.76  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.65/0.76  # Starting new_bool_3 with 300s (1) cores
% 0.65/0.76  # Starting new_bool_1 with 300s (1) cores
% 0.65/0.76  # Starting sh5l with 300s (1) cores
% 0.65/0.76  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.65/0.76  # Search class: FHUNS-FFMM21-MFFFFFNN
% 0.65/0.76  # partial match(1): FHUSS-FFMM21-MFFFFFNN
% 0.65/0.76  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.65/0.76  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.65/0.76  # SAT001_MinMin_p005000_rr_RG with pid 18376 completed with status 0
% 0.65/0.76  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.65/0.76  # Preprocessing class: FMLLMMSLSSSNFFN.
% 0.65/0.76  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.65/0.76  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.65/0.76  # Starting new_bool_3 with 300s (1) cores
% 0.65/0.76  # Starting new_bool_1 with 300s (1) cores
% 0.65/0.76  # Starting sh5l with 300s (1) cores
% 0.65/0.76  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.65/0.76  # Search class: FHUNS-FFMM21-MFFFFFNN
% 0.65/0.76  # partial match(1): FHUSS-FFMM21-MFFFFFNN
% 0.65/0.76  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.65/0.76  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.65/0.76  # Preprocessing time       : 0.008 s
% 0.65/0.76  # Presaturation interreduction done
% 0.65/0.76  
% 0.65/0.76  # Proof found!
% 0.65/0.76  # SZS status Theorem
% 0.65/0.76  # SZS output start CNFRefutation
% See solution above
% 0.65/0.76  # Parsed axioms                        : 8006
% 0.65/0.76  # Removed by relevancy pruning/SinE    : 7807
% 0.65/0.76  # Initial clauses                      : 200
% 0.65/0.76  # Removed in clause preprocessing      : 0
% 0.65/0.76  # Initial clauses in saturation        : 200
% 0.65/0.76  # Processed clauses                    : 1515
% 0.65/0.76  # ...of these trivial                  : 28
% 0.65/0.76  # ...subsumed                          : 568
% 0.65/0.76  # ...remaining for further processing  : 919
% 0.65/0.76  # Other redundant clauses eliminated   : 0
% 0.65/0.76  # Clauses deleted for lack of memory   : 0
% 0.65/0.76  # Backward-subsumed                    : 7
% 0.65/0.76  # Backward-rewritten                   : 2
% 0.65/0.76  # Generated clauses                    : 4528
% 0.65/0.76  # ...of the previous two non-redundant : 4310
% 0.65/0.76  # ...aggressively subsumed             : 0
% 0.65/0.76  # Contextual simplify-reflections      : 0
% 0.65/0.76  # Paramodulations                      : 4526
% 0.65/0.76  # Factorizations                       : 0
% 0.65/0.76  # NegExts                              : 0
% 0.65/0.76  # Equation resolutions                 : 0
% 0.65/0.76  # Disequality decompositions           : 0
% 0.65/0.76  # Total rewrite steps                  : 579
% 0.65/0.76  # ...of those cached                   : 480
% 0.65/0.76  # Propositional unsat checks           : 0
% 0.65/0.76  #    Propositional check models        : 0
% 0.65/0.76  #    Propositional check unsatisfiable : 0
% 0.65/0.76  #    Propositional clauses             : 0
% 0.65/0.76  #    Propositional clauses after purity: 0
% 0.65/0.76  #    Propositional unsat core size     : 0
% 0.65/0.76  #    Propositional preprocessing time  : 0.000
% 0.65/0.76  #    Propositional encoding time       : 0.000
% 0.65/0.76  #    Propositional solver time         : 0.000
% 0.65/0.76  #    Success case prop preproc time    : 0.000
% 0.65/0.76  #    Success case prop encoding time   : 0.000
% 0.65/0.76  #    Success case prop solver time     : 0.000
% 0.65/0.76  # Current number of processed clauses  : 743
% 0.65/0.76  #    Positive orientable unit clauses  : 181
% 0.65/0.76  #    Positive unorientable unit clauses: 0
% 0.65/0.76  #    Negative unit clauses             : 4
% 0.65/0.76  #    Non-unit-clauses                  : 558
% 0.65/0.76  # Current number of unprocessed clauses: 3160
% 0.65/0.76  # ...number of literals in the above   : 9546
% 0.65/0.76  # Current number of archived formulas  : 0
% 0.65/0.76  # Current number of archived clauses   : 176
% 0.65/0.76  # Clause-clause subsumption calls (NU) : 50390
% 0.65/0.76  # Rec. Clause-clause subsumption calls : 49798
% 0.65/0.76  # Non-unit clause-clause subsumptions  : 575
% 0.65/0.76  # Unit Clause-clause subsumption calls : 799
% 0.65/0.76  # Rewrite failures with RHS unbound    : 0
% 0.65/0.76  # BW rewrite match attempts            : 5
% 0.65/0.76  # BW rewrite match successes           : 1
% 0.65/0.76  # Condensation attempts                : 0
% 0.65/0.76  # Condensation successes               : 0
% 0.65/0.76  # Termbank termtop insertions          : 95387
% 0.65/0.76  # Search garbage collected termcells   : 31048
% 0.65/0.76  
% 0.65/0.76  # -------------------------------------------------
% 0.65/0.76  # User time                : 0.115 s
% 0.65/0.76  # System time              : 0.040 s
% 0.65/0.76  # Total time               : 0.156 s
% 0.65/0.76  # Maximum resident set size: 18588 pages
% 0.65/0.76  
% 0.65/0.76  # -------------------------------------------------
% 0.65/0.76  # User time                : 0.218 s
% 0.65/0.76  # System time              : 0.053 s
% 0.65/0.76  # Total time               : 0.271 s
% 0.65/0.76  # Maximum resident set size: 7956 pages
% 0.65/0.76  % E---3.1 exiting
%------------------------------------------------------------------------------