↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : CSR073+1 : TPTP v9.3.1. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n001.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 12:16:32 PM UTC 2026

% Result   : Theorem 0.23s 0.58s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   31 (   9 unt;   0 def)
%            Number of atoms       :   56 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   44 (  19   ~;  15   |;   2   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   37 (   2 sgn  21   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(query73,conjecture,
    ? [X1] :
      ( mtvisible(c_tptp_spindlecollectormt)
     => tptptypes_5_387(X1,c_pushingababycarriage) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query73) ).

fof(just59,axiom,
    ! [X15,X16] :
      ( ( genlmt(X15,X16)
        & mtvisible(X15) )
     => mtvisible(X16) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just59) ).

fof(just11,axiom,
    ! [X1,X2] :
      ( tptptypes_8_400(X1,X2)
     => tptptypes_7_396(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just11) ).

fof(just13,axiom,
    ! [X1,X2] :
      ( tptptypes_9_401(X1,X2)
     => tptptypes_8_400(X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just13) ).

fof(just18,axiom,
    ( mtvisible(c_tptp_member237_mt)
   => tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just18) ).

fof(just15,axiom,
    genlmt(c_tptp_spindlecollectormt,c_tptp_member237_mt),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just15) ).

fof(just7,axiom,
    ! [X1,X2] :
      ( tptptypes_6_388(X1,X2)
     => tptptypes_5_387(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just7) ).

fof(just9,axiom,
    ! [X1,X2] :
      ( tptptypes_7_396(X1,X2)
     => tptptypes_6_388(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',just9) ).

fof(c_0_8,negated_conjecture,
    ~ ? [X1] :
        ( mtvisible(c_tptp_spindlecollectormt)
       => tptptypes_5_387(X1,c_pushingababycarriage) ),
    inference(assume_negation,[status(cth)],[query73]) ).

fof(c_0_9,plain,
    ! [X24,X25] :
      ( mtvisible(X25)
      | ~ genlmt(X24,X25)
      | ~ mtvisible(X24) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just59])])]) ).

fof(c_0_10,negated_conjecture,
    ! [X17] :
      ( ~ tptptypes_5_387(X17,c_pushingababycarriage)
      & mtvisible(c_tptp_spindlecollectormt) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).

fof(c_0_11,plain,
    ! [X35,X36] :
      ( tptptypes_7_396(X35,X36)
      | ~ tptptypes_8_400(X35,X36) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just11])])]) ).

fof(c_0_12,plain,
    ! [X41,X42] :
      ( tptptypes_8_400(X42,X41)
      | ~ tptptypes_9_401(X41,X42) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just13])])]) ).

fof(c_0_13,plain,
    ( tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258)
    | ~ mtvisible(c_tptp_member237_mt) ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[just18])]) ).

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

cnf(c_0_15,plain,
    genlmt(c_tptp_spindlecollectormt,c_tptp_member237_mt),
    inference(split_conjunct,[status(thm)],[just15]) ).

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

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

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

cnf(c_0_19,plain,
    ( ~ mtvisible(c_tptp_member237_mt)
    | tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

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

fof(c_0_21,plain,
    ! [X18,X19] :
      ( tptptypes_5_387(X18,X19)
      | ~ tptptypes_6_388(X18,X19) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just7])])]) ).

fof(c_0_22,plain,
    ! [X26,X27] :
      ( tptptypes_6_388(X26,X27)
      | ~ tptptypes_7_396(X26,X27) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[just9])])]) ).

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

cnf(c_0_24,plain,
    tptptypes_9_401(c_pushingababycarriage,c_tptpcol_16_10258),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]) ).

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

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

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

cnf(c_0_28,plain,
    tptptypes_7_396(c_tptpcol_16_10258,c_pushingababycarriage),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_29,negated_conjecture,
    ~ tptptypes_6_388(X1,c_pushingababycarriage),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_30,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : CSR073+1 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.46  % Computer : n001.cluster.edu
% 0.20/0.46  % Model    : x86_64 x86_64
% 0.20/0.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46  % Memory   : 8046.5625MB
% 0.20/0.46  % OS       : Linux 6.8.0-71-generic
% 0.20/0.46  % CPULimit : 300
% 0.20/0.46  % WCLimit  : 300
% 0.20/0.46  % DateTime : Mon Sep 21 14:51:59 UTC 2026
% 0.20/0.46  % CPUTime  : 
% 0.20/0.46  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.52  Running first-order theorem proving
% 0.20/0.52  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.23/0.58  % Version: 3.5.1
% 0.23/0.58  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.23/0.58  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.58  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.23/0.58  % Starting new_bool_3 with 300s (1) cores
% 0.23/0.58  % Starting new_bool_1 with 300s (1) cores
% 0.23/0.58  % Starting sh5l with 300s (1) cores
% 0.23/0.58  % new_bool_3 with pid 3394981 completed with status 0
% 0.23/0.58  % Result found by new_bool_3
% 0.23/0.58  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.23/0.58  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.58  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.23/0.58  % Starting new_bool_3 with 300s (1) cores
% 0.23/0.58  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.58  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.58  % Search class: FHUNF-FFSS00-SFFFFFNN
% 0.23/0.58  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.58  % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.58  % SubtermCWHack with pid 3394989 completed with status 0
% 0.23/0.58  % Result found by SubtermCWHack
% 0.23/0.58  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.23/0.58  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.58  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.23/0.58  % Starting new_bool_3 with 300s (1) cores
% 0.23/0.58  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/0.58  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.58  % Search class: FHUNF-FFSS00-SFFFFFNN
% 0.23/0.58  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.58  % Starting SubtermCWHack with 31s (1) cores
% 0.23/0.58  % Preprocessing time       : 0.002 s
% 0.23/0.58  
% 0.23/0.58  % Proof found!
% 0.23/0.58  % SZS status Theorem
% 0.23/0.58  % SZS output start CNFRefutation
% See solution above
% 0.23/0.58  % Parsed axioms                        : 68
% 0.23/0.58  % Removed by relevancy pruning/SinE    : 46
% 0.23/0.58  % Initial clauses                      : 23
% 0.23/0.58  % Removed in clause preprocessing      : 0
% 0.23/0.58  % Initial clauses in saturation        : 23
% 0.23/0.58  % Processed clauses                    : 36
% 0.23/0.58  % ...of these trivial                  : 0
% 0.23/0.58  % ...subsumed                          : 2
% 0.23/0.58  % ...remaining for further processing  : 34
% 0.23/0.58  % Other redundant clauses eliminated   : 0
% 0.23/0.58  % Clauses deleted for lack of memory   : 0
% 0.23/0.58  % Backward-subsumed                    : 0
% 0.23/0.58  % Backward-rewritten                   : 3
% 0.23/0.58  % Generated clauses                    : 17
% 0.23/0.58  % ...of the previous two non-redundant : 14
% 0.23/0.58  % ...aggressively subsumed             : 0
% 0.23/0.58  % Contextual simplify-reflections      : 0
% 0.23/0.58  % Paramodulations                      : 17
% 0.23/0.58  % Factorizations                       : 0
% 0.23/0.58  % NegExts                              : 0
% 0.23/0.58  % Equation resolutions                 : 0
% 0.23/0.58  % Disequality decompositions           : 0
% 0.23/0.58  % Total rewrite steps                  : 10
% 0.23/0.58  % ...of those cached                   : 4
% 0.23/0.58  % Propositional unsat checks           : 0
% 0.23/0.58  %    Propositional check models        : 0
% 0.23/0.58  %    Propositional check unsatisfiable : 0
% 0.23/0.58  %    Propositional clauses             : 0
% 0.23/0.58  %    Propositional clauses after purity: 0
% 0.23/0.58  %    Propositional unsat core size     : 0
% 0.23/0.58  %    Propositional preprocessing time  : 0.000
% 0.23/0.58  %    Propositional encoding time       : 0.000
% 0.23/0.58  %    Propositional solver time         : 0.000
% 0.23/0.58  %    Success case prop preproc time    : 0.000
% 0.23/0.58  %    Success case prop encoding time   : 0.000
% 0.23/0.58  %    Success case prop solver time     : 0.000
% 0.23/0.58  % Current number of processed clauses  : 31
% 0.23/0.58  %    Positive orientable unit clauses  : 13
% 0.23/0.58  %    Positive unorientable unit clauses: 0
% 0.23/0.58  %    Negative unit clauses             : 2
% 0.23/0.58  %    Non-unit-clauses                  : 16
% 0.23/0.58  % Current number of unprocessed clauses: 1
% 0.23/0.58  % ...number of literals in the above   : 3
% 0.23/0.58  % Current number of archived formulas  : 0
% 0.23/0.58  % Current number of archived clauses   : 3
% 0.23/0.58  % Clause-clause subsumption calls (NU) : 20
% 0.23/0.58  % Rec. Clause-clause subsumption calls : 18
% 0.23/0.58  % Non-unit clause-clause subsumptions  : 2
% 0.23/0.58  % Unit Clause-clause subsumption calls : 12
% 0.23/0.58  % Rewrite failures with RHS unbound    : 0
% 0.23/0.58  % BW rewrite match attempts            : 1
% 0.23/0.58  % BW rewrite match successes           : 1
% 0.23/0.58  % Condensation attempts                : 0
% 0.23/0.58  % Condensation successes               : 0
% 0.23/0.58  % Termbank termtop insertions          : 1673
% 0.23/0.58  % Search garbage collected termcells   : 434
% 0.23/0.58  
% 0.23/0.58  % -------------------------------------------------
% 0.23/0.58  % User time                : 0.005 s
% 0.23/0.58  % System time              : 0.006 s
% 0.23/0.58  % Total time               : 0.011 s
% 0.23/0.58  % Maximum resident set size: 3692 pages
% 0.23/0.58  
% 0.23/0.58  % -------------------------------------------------
% 0.23/0.58  % User time                : 0.008 s
% 0.23/0.58  % System time              : 0.013 s
% 0.23/0.58  % Total time               : 0.021 s
% 0.23/0.58  % Maximum resident set size: 4608 pages
% 0.23/0.58  % E exiting
%------------------------------------------------------------------------------