↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n011.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.30s 23.99s
% Output   : CNFRefutation 0.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   31 (  13 unt;   0 def)
%            Number of atoms       :   52 (   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(query262,conjecture,
    ? [X2] :
      ( mtvisible(c_tptp_member3205_mt)
     => tptptypes_5_387(X2,c_pushingwithfingers) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query262) ).

fof(ax4_540220,axiom,
    ! [X28,X29] :
      ( ( genlmt(X28,X29)
        & mtvisible(X28) )
     => mtvisible(X29) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+4.ax',ax4_540220) ).

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

fof(ax4_61642,axiom,
    ( mtvisible(c_cyclistsmt)
   => tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+4.ax',ax4_61642) ).

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

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

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

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

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

fof(c_0_9,plain,
    ! [X79,X80] :
      ( mtvisible(X80)
      | ~ genlmt(X79,X80)
      | ~ mtvisible(X79) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax4_540220])])]) ).

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

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

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

cnf(c_0_15,plain,
    genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
    inference(split_conjunct,[status(thm)],[ax4_71548]) ).

cnf(c_0_16,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])]) ).

fof(c_0_17,plain,
    ! [X31,X32] :
      ( tptptypes_5_387(X31,X32)
      | ~ tptptypes_6_388(X31,X32) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax4_56790])])]) ).

fof(c_0_18,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)],[ax4_104527])])]) ).

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

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

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

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

fof(c_0_23,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)],[ax4_16164])])]) ).

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

cnf(c_0_25,plain,
    tptptypes_8_390(c_pushingwithfingers,c_tptpcol_15_4027),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]) ).

cnf(c_0_26,negated_conjecture,
    ~ tptptypes_6_388(X1,c_pushingwithfingers),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

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

cnf(c_0_28,plain,
    tptptypes_7_389(c_pushingwithfingers,c_tptpcol_15_4027),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_29,negated_conjecture,
    ~ tptptypes_7_389(c_pushingwithfingers,X1),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : CSR062+5 : TPTP v9.3.1. Bugfixed v3.5.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/0.45  % Computer : n011.cluster.edu
% 0.22/0.45  % Model    : x86_64 x86_64
% 0.22/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.22/0.45  % Memory   : 8046.5625MB
% 0.22/0.45  % OS       : Linux 6.8.0-71-generic
% 0.22/0.45  % CPULimit : 300
% 0.22/0.45  % WCLimit  : 300
% 0.22/0.45  % DateTime : Mon Sep 21 14:41:10 UTC 2026
% 0.22/0.46  % CPUTime  : 
% 0.22/0.46  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.52  Running first-order theorem proving
% 0.24/0.53  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.30/23.99  % Version: 3.5.1
% 0.30/23.99  % Preprocessing class: FLLLLMLLSSSNFFN.
% 0.30/23.99  % Scheduled 4 strats onto 8 cores with 282 seconds (2256 total)
% 0.30/23.99  % Starting new_ho_10 with 564s (2) cores
% 0.30/23.99  % Starting sh3 with 564s (2) cores
% 0.30/23.99  % Starting ho_unfolding_3 with 564s (2) cores
% 0.30/23.99  % Starting new_ho_10_cnf2 with 564s (2) cores
% 0.30/23.99  % new_ho_10_cnf2 with pid 2167421 completed with status 0
% 0.30/23.99  % Result found by new_ho_10_cnf2
% 0.30/23.99  % Preprocessing class: FLLLLMLLSSSNFFN.
% 0.30/23.99  % Scheduled 4 strats onto 8 cores with 282 seconds (2256 total)
% 0.30/23.99  % Starting new_ho_10 with 564s (2) cores
% 0.30/23.99  % Starting sh3 with 564s (2) cores
% 0.30/23.99  % Starting ho_unfolding_3 with 564s (2) cores
% 0.30/23.99  % Starting new_ho_10_cnf2 with 564s (2) cores
% 0.30/23.99  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.30/23.99  % SinE strategy is gf500_h_gu_R04_F100_L20000
% 0.30/23.99  % Search class: FHHNM-FSLM31-MFFFFFNN
% 0.30/23.99  % partial match(1): FHHNM-SSLM31-MFFFFFNN
% 0.30/23.99  % Scheduled 7 strats onto 2 cores with 561 seconds (561 total)
% 0.30/23.99  % Starting SubtermCWHack with 51s (1) cores
% 0.30/23.99  % Starting new_ho_10_cnf2 with 57s (1) cores
% 0.30/23.99  % SubtermCWHack with pid 2167422 completed with status 0
% 0.30/23.99  % Result found by SubtermCWHack
% 0.30/23.99  % Preprocessing class: FLLLLMLLSSSNFFN.
% 0.30/23.99  % Scheduled 4 strats onto 8 cores with 282 seconds (2256 total)
% 0.30/23.99  % Starting new_ho_10 with 564s (2) cores
% 0.30/23.99  % Starting sh3 with 564s (2) cores
% 0.30/23.99  % Starting ho_unfolding_3 with 564s (2) cores
% 0.30/23.99  % Starting new_ho_10_cnf2 with 564s (2) cores
% 0.30/23.99  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.30/23.99  % SinE strategy is gf500_h_gu_R04_F100_L20000
% 0.30/23.99  % Search class: FHHNM-FSLM31-MFFFFFNN
% 0.30/23.99  % partial match(1): FHHNM-SSLM31-MFFFFFNN
% 0.30/23.99  % Scheduled 7 strats onto 2 cores with 561 seconds (561 total)
% 0.30/23.99  % Starting SubtermCWHack with 51s (1) cores
% 0.30/23.99  % Preprocessing time       : 0.407 s
% 0.30/23.99  
% 0.30/23.99  % Proof found!
% 0.30/23.99  % SZS status Theorem
% 0.30/23.99  % SZS output start CNFRefutation
% See solution above
% 0.30/23.99  % Parsed axioms                        : 540250
% 0.30/23.99  % Removed by relevancy pruning/SinE    : 539801
% 0.30/23.99  % Initial clauses                      : 450
% 0.30/23.99  % Removed in clause preprocessing      : 0
% 0.30/23.99  % Initial clauses in saturation        : 450
% 0.30/23.99  % Processed clauses                    : 661
% 0.30/23.99  % ...of these trivial                  : 43
% 0.30/23.99  % ...subsumed                          : 27
% 0.30/23.99  % ...remaining for further processing  : 591
% 0.30/23.99  % Other redundant clauses eliminated   : 0
% 0.30/23.99  % Clauses deleted for lack of memory   : 0
% 0.30/23.99  % Backward-subsumed                    : 7
% 0.30/23.99  % Backward-rewritten                   : 41
% 0.30/23.99  % Generated clauses                    : 533
% 0.30/23.99  % ...of the previous two non-redundant : 338
% 0.30/23.99  % ...aggressively subsumed             : 0
% 0.30/23.99  % Contextual simplify-reflections      : 0
% 0.30/23.99  % Paramodulations                      : 532
% 0.30/23.99  % Factorizations                       : 0
% 0.30/23.99  % NegExts                              : 0
% 0.30/23.99  % Equation resolutions                 : 0
% 0.30/23.99  % Disequality decompositions           : 0
% 0.30/23.99  % Total rewrite steps                  : 290
% 0.30/23.99  % ...of those cached                   : 195
% 0.30/23.99  % Propositional unsat checks           : 0
% 0.30/23.99  %    Propositional check models        : 0
% 0.30/23.99  %    Propositional check unsatisfiable : 0
% 0.30/23.99  %    Propositional clauses             : 0
% 0.30/23.99  %    Propositional clauses after purity: 0
% 0.30/23.99  %    Propositional unsat core size     : 0
% 0.30/23.99  %    Propositional preprocessing time  : 0.000
% 0.30/23.99  %    Propositional encoding time       : 0.000
% 0.30/23.99  %    Propositional solver time         : 0.000
% 0.30/23.99  %    Success case prop preproc time    : 0.000
% 0.30/23.99  %    Success case prop encoding time   : 0.000
% 0.30/23.99  %    Success case prop solver time     : 0.000
% 0.30/23.99  % Current number of processed clauses  : 542
% 0.30/23.99  %    Positive orientable unit clauses  : 345
% 0.30/23.99  %    Positive unorientable unit clauses: 0
% 0.30/23.99  %    Negative unit clauses             : 4
% 0.30/23.99  %    Non-unit-clauses                  : 193
% 0.30/23.99  % Current number of unprocessed clauses: 127
% 0.30/23.99  % ...number of literals in the above   : 229
% 0.30/23.99  % Current number of archived formulas  : 0
% 0.30/23.99  % Current number of archived clauses   : 49
% 0.30/23.99  % Clause-clause subsumption calls (NU) : 6436
% 0.30/23.99  % Rec. Clause-clause subsumption calls : 6099
% 0.30/23.99  % Non-unit clause-clause subsumptions  : 27
% 0.30/23.99  % Unit Clause-clause subsumption calls : 1196
% 0.30/23.99  % Rewrite failures with RHS unbound    : 0
% 0.30/23.99  % BW rewrite match attempts            : 14
% 0.30/23.99  % BW rewrite match successes           : 14
% 0.30/23.99  % Condensation attempts                : 0
% 0.30/23.99  % Condensation successes               : 0
% 0.30/23.99  % Termbank termtop insertions          : 3697076
% 0.30/23.99  % Search garbage collected termcells   : 2174251
% 0.30/23.99  
% 0.30/23.99  % -------------------------------------------------
% 0.30/23.99  % User time                : 2.967 s
% 0.30/23.99  % System time              : 1.248 s
% 0.30/23.99  % Total time               : 4.215 s
% 0.30/23.99  % Maximum resident set size: 1242144 pages
% 0.30/23.99  
% 0.30/23.99  % -------------------------------------------------
% 0.30/23.99  % User time                : 20.997 s
% 0.30/23.99  % System time              : 2.382 s
% 0.30/23.99  % Total time               : 23.379 s
% 0.30/23.99  % Maximum resident set size: 456704 pages
% 0.30/23.99  % E exiting
%------------------------------------------------------------------------------