↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : CSR062+3 : 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 : n008.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.19s 0.56s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   30 (  12 unt;   0 def)
%            Number of atoms       :   51 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   38 (  17   ~;  12   |;   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(query162,conjecture,
    ? [X3] :
      ( mtvisible(c_tptp_member3205_mt)
     => tptptypes_5_387(X3,c_pushingwithfingers) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query162) ).

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

fof(ax2_2187,axiom,
    genlmt(c_tptp_member3205_mt,c_tptp_spindleheadmt),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_2187) ).

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_968,axiom,
    ( mtvisible(c_cyclistsmt)
   => tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_968) ).

fof(ax2_4288,axiom,
    genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+2.ax',ax2_4288) ).

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

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

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

fof(c_0_9,plain,
    ! [X36,X37] :
      ( mtvisible(X37)
      | ~ genlmt(X36,X37)
      | ~ mtvisible(X36) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_7997])])]) ).

fof(c_0_10,negated_conjecture,
    ! [X23] :
      ( ~ tptptypes_5_387(X23,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])])]) ).

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

cnf(c_0_12,plain,
    genlmt(c_tptp_member3205_mt,c_tptp_spindleheadmt),
    inference(split_conjunct,[status(thm)],[ax2_2187]) ).

cnf(c_0_13,negated_conjecture,
    mtvisible(c_tptp_member3205_mt),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

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

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)],[ax2_968])]) ).

cnf(c_0_16,plain,
    genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
    inference(split_conjunct,[status(thm)],[ax2_4288]) ).

cnf(c_0_17,plain,
    mtvisible(c_tptp_spindleheadmt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).

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

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

fof(c_0_20,plain,
    ! [X42,X43] :
      ( tptptypes_6_388(X43,X42)
      | ~ tptptypes_7_389(X42,X43) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_1462])])]) ).

fof(c_0_21,plain,
    ! [X54,X55] :
      ( tptptypes_7_389(X54,X55)
      | ~ tptptypes_8_390(X54,X55) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax2_2531])])]) ).

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

cnf(c_0_23,plain,
    mtvisible(c_cyclistsmt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_16]),c_0_17])]) ).

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

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

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

cnf(c_0_27,plain,
    tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR062+3 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.38  % Computer : n008.cluster.edu
% 0.10/0.38  % Model    : x86_64 x86_64
% 0.10/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38  % Memory   : 8046.5625MB
% 0.10/0.38  % OS       : Linux 6.8.0-71-generic
% 0.10/0.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Mon Sep 21 14:41:38 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.42  Running first-order theorem proving
% 0.10/0.42  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.19/0.56  % Version: 3.5.1
% 0.19/0.56  % Preprocessing class: FMLLMMSLSSSNFFN.
% 0.19/0.56  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.56  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.19/0.56  % Starting new_bool_3 with 300s (1) cores
% 0.19/0.56  % Starting new_bool_1 with 300s (1) cores
% 0.19/0.56  % Starting sh5l with 300s (1) cores
% 0.19/0.56  % sh5l with pid 1232907 completed with status 0
% 0.19/0.56  % Result found by sh5l
% 0.19/0.56  % Preprocessing class: FMLLMMSLSSSNFFN.
% 0.19/0.56  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.56  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.19/0.56  % Starting new_bool_3 with 300s (1) cores
% 0.19/0.56  % Starting new_bool_1 with 300s (1) cores
% 0.19/0.56  % Starting sh5l with 300s (1) cores
% 0.19/0.56  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.19/0.56  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.56  % Search class: FHUNF-FFMM11-SFFFFFNN
% 0.19/0.56  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.56  % Starting SubtermCWHack with 31s (1) cores
% 0.19/0.56  % SubtermCWHack with pid 1232908 completed with status 0
% 0.19/0.56  % Result found by SubtermCWHack
% 0.19/0.56  % Preprocessing class: FMLLMMSLSSSNFFN.
% 0.19/0.56  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.56  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 0.19/0.56  % Starting new_bool_3 with 300s (1) cores
% 0.19/0.56  % Starting new_bool_1 with 300s (1) cores
% 0.19/0.56  % Starting sh5l with 300s (1) cores
% 0.19/0.56  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.19/0.56  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.56  % Search class: FHUNF-FFMM11-SFFFFFNN
% 0.19/0.56  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.56  % Starting SubtermCWHack with 31s (1) cores
% 0.19/0.56  % Preprocessing time       : 0.004 s
% 0.19/0.56  
% 0.19/0.56  % Proof found!
% 0.19/0.56  % SZS status Theorem
% 0.19/0.56  % SZS output start CNFRefutation
% See solution above
% 0.19/0.56  % Parsed axioms                        : 8006
% 0.19/0.56  % Removed by relevancy pruning/SinE    : 7838
% 0.19/0.56  % Initial clauses                      : 169
% 0.19/0.56  % Removed in clause preprocessing      : 0
% 0.19/0.56  % Initial clauses in saturation        : 169
% 0.19/0.56  % Processed clauses                    : 266
% 0.19/0.56  % ...of these trivial                  : 35
% 0.19/0.56  % ...subsumed                          : 11
% 0.19/0.56  % ...remaining for further processing  : 220
% 0.19/0.56  % Other redundant clauses eliminated   : 0
% 0.19/0.56  % Clauses deleted for lack of memory   : 0
% 0.19/0.56  % Backward-subsumed                    : 2
% 0.19/0.56  % Backward-rewritten                   : 54
% 0.19/0.56  % Generated clauses                    : 128
% 0.19/0.56  % ...of the previous two non-redundant : 129
% 0.19/0.56  % ...aggressively subsumed             : 0
% 0.19/0.56  % Contextual simplify-reflections      : 0
% 0.19/0.56  % Paramodulations                      : 128
% 0.19/0.56  % Factorizations                       : 0
% 0.19/0.56  % NegExts                              : 0
% 0.19/0.56  % Equation resolutions                 : 0
% 0.19/0.56  % Disequality decompositions           : 0
% 0.19/0.56  % Total rewrite steps                  : 114
% 0.19/0.56  % ...of those cached                   : 67
% 0.19/0.56  % Propositional unsat checks           : 0
% 0.19/0.56  %    Propositional check models        : 0
% 0.19/0.56  %    Propositional check unsatisfiable : 0
% 0.19/0.56  %    Propositional clauses             : 0
% 0.19/0.56  %    Propositional clauses after purity: 0
% 0.19/0.56  %    Propositional unsat core size     : 0
% 0.19/0.56  %    Propositional preprocessing time  : 0.000
% 0.19/0.56  %    Propositional encoding time       : 0.000
% 0.19/0.56  %    Propositional solver time         : 0.000
% 0.19/0.56  %    Success case prop preproc time    : 0.000
% 0.19/0.56  %    Success case prop encoding time   : 0.000
% 0.19/0.56  %    Success case prop solver time     : 0.000
% 0.19/0.56  % Current number of processed clauses  : 164
% 0.19/0.56  %    Positive orientable unit clauses  : 113
% 0.19/0.56  %    Positive unorientable unit clauses: 0
% 0.19/0.56  %    Negative unit clauses             : 3
% 0.19/0.56  %    Non-unit-clauses                  : 48
% 0.19/0.56  % Current number of unprocessed clauses: 32
% 0.19/0.56  % ...number of literals in the above   : 69
% 0.19/0.56  % Current number of archived formulas  : 0
% 0.19/0.56  % Current number of archived clauses   : 56
% 0.19/0.56  % Clause-clause subsumption calls (NU) : 1209
% 0.19/0.56  % Rec. Clause-clause subsumption calls : 1169
% 0.19/0.56  % Non-unit clause-clause subsumptions  : 11
% 0.19/0.56  % Unit Clause-clause subsumption calls : 201
% 0.19/0.56  % Rewrite failures with RHS unbound    : 0
% 0.19/0.56  % BW rewrite match attempts            : 14
% 0.19/0.56  % BW rewrite match successes           : 14
% 0.19/0.56  % Condensation attempts                : 0
% 0.19/0.56  % Condensation successes               : 0
% 0.19/0.56  % Termbank termtop insertions          : 56446
% 0.19/0.56  % Search garbage collected termcells   : 31099
% 0.19/0.56  
% 0.19/0.56  % -------------------------------------------------
% 0.19/0.56  % User time                : 0.030 s
% 0.19/0.56  % System time              : 0.022 s
% 0.19/0.56  % Total time               : 0.052 s
% 0.19/0.56  % Maximum resident set size: 20596 pages
% 0.19/0.56  
% 0.19/0.56  % -------------------------------------------------
% 0.19/0.56  % User time                : 0.091 s
% 0.19/0.56  % System time              : 0.035 s
% 0.19/0.56  % Total time               : 0.126 s
% 0.19/0.56  % Maximum resident set size: 11008 pages
% 0.19/0.56  % E exiting
%------------------------------------------------------------------------------