↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n002.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:24 PM UTC 2026

% Result   : Theorem 0.92s 1.46s
% Output   : CNFRefutation 0.92s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   30 (  11 unt;   0 def)
%            Number of atoms       :   52 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   41 (  19   ~;  13   |;   2   &)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   30 (   3 sgn  17   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(query212,conjecture,
    ? [X2] :
      ( mtvisible(c_tptp_member3205_mt)
     => tptptypes_5_387(X2,c_pushingwithfingers) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',query212) ).

fof(ax3_11372,axiom,
    ! [X2,X3] :
      ( tptptypes_6_388(X2,X3)
     => tptptypes_5_387(X2,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR002+3.ax',ax3_11372) ).

fof(ax3_6493,axiom,
    ! [X2,X3] :
      ( tptptypes_7_389(X2,X3)
     => tptptypes_6_388(X3,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR002+3.ax',ax3_6493) ).

fof(ax3_10910,axiom,
    ! [X2,X3] :
      ( tptptypes_8_390(X2,X3)
     => tptptypes_7_389(X2,X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR002+3.ax',ax3_10910) ).

fof(ax3_11228,axiom,
    ( mtvisible(c_cyclistsmt)
   => tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR002+3.ax',ax3_11228) ).

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

fof(ax3_6288,axiom,
    genlmt(c_tptp_member3205_mt,c_tptp_spindleheadmt),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR002+3.ax',ax3_6288) ).

fof(ax3_86,axiom,
    genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR002+3.ax',ax3_86) ).

fof(c_0_8,negated_conjecture,
    ~ ? [X2] :
        ( mtvisible(c_tptp_member3205_mt)
       => tptptypes_5_387(X2,c_pushingwithfingers) ),
    inference(assume_negation,[status(cth)],[query212]) ).

fof(c_0_9,negated_conjecture,
    ! [X24] :
      ( ~ tptptypes_5_387(X24,c_pushingwithfingers)
      & mtvisible(c_tptp_member3205_mt) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).

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

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

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

fof(c_0_13,plain,
    ! [X43,X44] :
      ( tptptypes_6_388(X44,X43)
      | ~ tptptypes_7_389(X43,X44) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_6493])])]) ).

fof(c_0_14,plain,
    ! [X61,X62] :
      ( tptptypes_7_389(X61,X62)
      | ~ tptptypes_8_390(X61,X62) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_10910])])]) ).

fof(c_0_15,plain,
    ( tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027)
    | ~ mtvisible(c_cyclistsmt) ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_11228])]) ).

fof(c_0_16,plain,
    ! [X37,X38] :
      ( mtvisible(X38)
      | ~ genlmt(X37,X38)
      | ~ mtvisible(X37) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_44208])])]) ).

cnf(c_0_17,negated_conjecture,
    ~ tptptypes_6_388(X1,c_pushingwithfingers),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_18,plain,
    ( ~ tptptypes_7_389(X1,X2)
    | tptptypes_6_388(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_19,plain,
    ( ~ tptptypes_8_390(X1,X2)
    | tptptypes_7_389(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_20,plain,
    ( ~ mtvisible(c_cyclistsmt)
    | tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

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

cnf(c_0_22,plain,
    genlmt(c_tptp_member3205_mt,c_tptp_spindleheadmt),
    inference(split_conjunct,[status(thm)],[ax3_6288]) ).

cnf(c_0_23,negated_conjecture,
    mtvisible(c_tptp_member3205_mt),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_24,negated_conjecture,
    ~ tptptypes_7_389(c_pushingwithfingers,X1),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_25,plain,
    ( ~ mtvisible(c_cyclistsmt)
    | tptptypes_7_389(c_pushingwithfingers,c_tptpcol_15_4027) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_26,plain,
    genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
    inference(split_conjunct,[status(thm)],[ax3_86]) ).

cnf(c_0_27,plain,
    mtvisible(c_tptp_spindleheadmt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).

cnf(c_0_28,negated_conjecture,
    ~ mtvisible(c_cyclistsmt),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_29,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_26]),c_0_27])]),c_0_28]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : CSR062+4 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.35  % Computer : n002.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Mon Sep 21 14:43:16 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.35  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.39  Running first-order theorem proving
% 0.13/0.39  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.92/1.46  % Version: 3.5.1
% 0.92/1.46  % Preprocessing class: FMLLLMSLSSSNFFN.
% 0.92/1.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.92/1.46  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 0.92/1.46  % Starting new_bool_3 with 300s (1) cores
% 0.92/1.46  % Starting new_bool_1 with 300s (1) cores
% 0.92/1.46  % Starting sh5l with 300s (1) cores
% 0.92/1.46  % sh5l with pid 3533346 completed with status 0
% 0.92/1.46  % Result found by sh5l
% 0.92/1.46  % Preprocessing class: FMLLLMSLSSSNFFN.
% 0.92/1.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.92/1.46  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 0.92/1.46  % Starting new_bool_3 with 300s (1) cores
% 0.92/1.46  % Starting new_bool_1 with 300s (1) cores
% 0.92/1.46  % Starting sh5l with 300s (1) cores
% 0.92/1.46  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.92/1.46  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.92/1.46  % Search class: FHUNM-FSLM31-MFFFFFNN
% 0.92/1.46  % partial match(2): FHHNM-SSLM31-MFFFFFNN
% 0.92/1.46  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.92/1.46  % Starting SubtermCWHack with 31s (1) cores
% 0.92/1.46  % SubtermCWHack with pid 3533347 completed with status 0
% 0.92/1.46  % Result found by SubtermCWHack
% 0.92/1.46  % Preprocessing class: FMLLLMSLSSSNFFN.
% 0.92/1.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.92/1.46  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 0.92/1.46  % Starting new_bool_3 with 300s (1) cores
% 0.92/1.46  % Starting new_bool_1 with 300s (1) cores
% 0.92/1.46  % Starting sh5l with 300s (1) cores
% 0.92/1.46  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.92/1.46  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.92/1.46  % Search class: FHUNM-FSLM31-MFFFFFNN
% 0.92/1.46  % partial match(2): FHHNM-SSLM31-MFFFFFNN
% 0.92/1.46  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.92/1.46  % Starting SubtermCWHack with 31s (1) cores
% 0.92/1.46  % Preprocessing time       : 0.023 s
% 0.92/1.46  
% 0.92/1.46  % Proof found!
% 0.92/1.46  % SZS status Theorem
% 0.92/1.46  % SZS output start CNFRefutation
% See solution above
% 0.92/1.46  % Parsed axioms                        : 44217
% 0.92/1.46  % Removed by relevancy pruning/SinE    : 43920
% 0.92/1.46  % Initial clauses                      : 298
% 0.92/1.46  % Removed in clause preprocessing      : 0
% 0.92/1.46  % Initial clauses in saturation        : 298
% 0.92/1.46  % Processed clauses                    : 292
% 0.92/1.46  % ...of these trivial                  : 25
% 0.92/1.46  % ...subsumed                          : 14
% 0.92/1.46  % ...remaining for further processing  : 252
% 0.92/1.46  % Other redundant clauses eliminated   : 0
% 0.92/1.46  % Clauses deleted for lack of memory   : 0
% 0.92/1.46  % Backward-subsumed                    : 4
% 0.92/1.46  % Backward-rewritten                   : 5
% 0.92/1.46  % Generated clauses                    : 132
% 0.92/1.46  % ...of the previous two non-redundant : 102
% 0.92/1.46  % ...aggressively subsumed             : 0
% 0.92/1.46  % Contextual simplify-reflections      : 0
% 0.92/1.46  % Paramodulations                      : 132
% 0.92/1.46  % Factorizations                       : 0
% 0.92/1.46  % NegExts                              : 0
% 0.92/1.46  % Equation resolutions                 : 0
% 0.92/1.46  % Disequality decompositions           : 0
% 0.92/1.46  % Total rewrite steps                  : 55
% 0.92/1.46  % ...of those cached                   : 26
% 0.92/1.46  % Propositional unsat checks           : 0
% 0.92/1.46  %    Propositional check models        : 0
% 0.92/1.46  %    Propositional check unsatisfiable : 0
% 0.92/1.46  %    Propositional clauses             : 0
% 0.92/1.46  %    Propositional clauses after purity: 0
% 0.92/1.46  %    Propositional unsat core size     : 0
% 0.92/1.46  %    Propositional preprocessing time  : 0.000
% 0.92/1.46  %    Propositional encoding time       : 0.000
% 0.92/1.46  %    Propositional solver time         : 0.000
% 0.92/1.46  %    Success case prop preproc time    : 0.000
% 0.92/1.46  %    Success case prop encoding time   : 0.000
% 0.92/1.46  %    Success case prop solver time     : 0.000
% 0.92/1.46  % Current number of processed clauses  : 243
% 0.92/1.46  %    Positive orientable unit clauses  : 130
% 0.92/1.46  %    Positive unorientable unit clauses: 0
% 0.92/1.46  %    Negative unit clauses             : 4
% 0.92/1.46  %    Non-unit-clauses                  : 109
% 0.92/1.46  % Current number of unprocessed clauses: 108
% 0.92/1.46  % ...number of literals in the above   : 185
% 0.92/1.46  % Current number of archived formulas  : 0
% 0.92/1.46  % Current number of archived clauses   : 9
% 0.92/1.46  % Clause-clause subsumption calls (NU) : 1200
% 0.92/1.46  % Rec. Clause-clause subsumption calls : 1195
% 0.92/1.46  % Non-unit clause-clause subsumptions  : 11
% 0.92/1.46  % Unit Clause-clause subsumption calls : 111
% 0.92/1.46  % Rewrite failures with RHS unbound    : 0
% 0.92/1.46  % BW rewrite match attempts            : 2
% 0.92/1.46  % BW rewrite match successes           : 2
% 0.92/1.46  % Condensation attempts                : 0
% 0.92/1.46  % Condensation successes               : 0
% 0.92/1.46  % Termbank termtop insertions          : 302846
% 0.92/1.46  % Search garbage collected termcells   : 157661
% 0.92/1.46  
% 0.92/1.46  % -------------------------------------------------
% 0.92/1.46  % User time                : 0.132 s
% 0.92/1.46  % System time              : 0.099 s
% 0.92/1.46  % Total time               : 0.232 s
% 0.92/1.46  % Maximum resident set size: 84532 pages
% 0.92/1.46  
% 0.92/1.46  % -------------------------------------------------
% 0.92/1.46  % User time                : 0.876 s
% 0.92/1.46  % System time              : 0.146 s
% 0.92/1.46  % Total time               : 1.022 s
% 0.92/1.46  % Maximum resident set size: 38144 pages
% 0.92/1.46  % E exiting
%------------------------------------------------------------------------------