↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : CSR044+2 : 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 : n020.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:10 PM UTC 2026

% Result   : Theorem 0.18s 0.51s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   38 (  13 unt;   0 def)
%            Number of atoms       :   75 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   65 (  28   ~;  23   |;   6   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   7 con; 0-4 aty)
%            Number of variables   :   34 (   0 sgn  19   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(query94,conjecture,
    ? [X13] :
      ( mtvisible(c_tptp_member3633_mt)
     => ( tptpcol_16_29490(X13)
        & tptp_9_720(c_tptpexecutionbyfiringsquad_90,X13) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',query94) ).

fof(ax1_1123,axiom,
    ! [X20,X21] :
      ( ( genlmt(X20,X21)
        & mtvisible(X20) )
     => mtvisible(X21) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_1123) ).

fof(ax1_243,axiom,
    genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_243) ).

fof(ax1_783,axiom,
    ! [X13] :
      ( isa(X13,c_tptpcol_16_29490)
     => tptpcol_16_29490(X13) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_783) ).

fof(ax1_164,axiom,
    ! [X7] :
      ( ( executionbyfiringsquad(X7)
        & mtvisible(c_cyclistsmt) )
     => tptp_9_720(X7,f_relationallexistsfn(X7,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_164) ).

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

fof(ax1_165,axiom,
    ( mtvisible(c_cyclistsmt)
   => relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_165) ).

fof(ax1_297,axiom,
    ! [X7,X8,X3,X9] :
      ( ( relationallexists(X3,X8,X9)
        & isa(X7,X8) )
     => isa(f_relationallexistsfn(X7,X3,X8,X9),X9) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_297) ).

fof(ax1_919,axiom,
    ! [X13] :
      ( executionbyfiringsquad(X13)
     => isa(X13,c_executionbyfiringsquad) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_919) ).

fof(ax1_94,axiom,
    executionbyfiringsquad(c_tptpexecutionbyfiringsquad_90),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR002+1.ax',ax1_94) ).

fof(c_0_10,negated_conjecture,
    ~ ? [X13] :
        ( mtvisible(c_tptp_member3633_mt)
       => ( tptpcol_16_29490(X13)
          & tptp_9_720(c_tptpexecutionbyfiringsquad_90,X13) ) ),
    inference(assume_negation,[status(cth)],[query94]) ).

fof(c_0_11,plain,
    ! [X30,X31] :
      ( mtvisible(X31)
      | ~ genlmt(X30,X31)
      | ~ mtvisible(X30) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_1123])])]) ).

fof(c_0_12,negated_conjecture,
    ! [X22] :
      ( ( ~ tptpcol_16_29490(X22)
        | ~ tptp_9_720(c_tptpexecutionbyfiringsquad_90,X22) )
      & mtvisible(c_tptp_member3633_mt) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).

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

cnf(c_0_14,plain,
    genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt),
    inference(split_conjunct,[status(thm)],[ax1_243]) ).

cnf(c_0_15,negated_conjecture,
    mtvisible(c_tptp_member3633_mt),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

fof(c_0_16,plain,
    ! [X23] :
      ( tptpcol_16_29490(X23)
      | ~ isa(X23,c_tptpcol_16_29490) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_783])])]) ).

fof(c_0_17,plain,
    ! [X25] :
      ( tptp_9_720(X25,f_relationallexistsfn(X25,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490))
      | ~ executionbyfiringsquad(X25)
      | ~ mtvisible(c_cyclistsmt) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_164])])]) ).

cnf(c_0_18,plain,
    genlmt(c_tptp_spindleheadmt,c_cyclistsmt),
    inference(split_conjunct,[status(thm)],[ax1_254]) ).

cnf(c_0_19,plain,
    mtvisible(c_tptp_spindleheadmt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).

fof(c_0_20,plain,
    ( relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)
    | ~ mtvisible(c_cyclistsmt) ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_165])]) ).

cnf(c_0_21,negated_conjecture,
    ( ~ tptpcol_16_29490(X1)
    | ~ tptp_9_720(c_tptpexecutionbyfiringsquad_90,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_22,plain,
    ( ~ isa(X1,c_tptpcol_16_29490)
    | tptpcol_16_29490(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_23,plain,
    ( ~ executionbyfiringsquad(X1)
    | ~ mtvisible(c_cyclistsmt)
    | tptp_9_720(X1,f_relationallexistsfn(X1,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_24,plain,
    mtvisible(c_cyclistsmt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_18]),c_0_19])]) ).

fof(c_0_25,plain,
    ! [X36,X37,X38,X39] :
      ( isa(f_relationallexistsfn(X36,X38,X37,X39),X39)
      | ~ relationallexists(X38,X37,X39)
      | ~ isa(X36,X37) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_297])])]) ).

cnf(c_0_26,plain,
    ( ~ mtvisible(c_cyclistsmt)
    | relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

fof(c_0_27,plain,
    ! [X65] :
      ( isa(X65,c_executionbyfiringsquad)
      | ~ executionbyfiringsquad(X65) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_919])])]) ).

cnf(c_0_28,negated_conjecture,
    ( ~ isa(X1,c_tptpcol_16_29490)
    | ~ tptp_9_720(c_tptpexecutionbyfiringsquad_90,X1) ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_29,plain,
    ( ~ executionbyfiringsquad(X1)
    | tptp_9_720(X1,f_relationallexistsfn(X1,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).

cnf(c_0_30,plain,
    executionbyfiringsquad(c_tptpexecutionbyfiringsquad_90),
    inference(split_conjunct,[status(thm)],[ax1_94]) ).

cnf(c_0_31,plain,
    ( ~ relationallexists(X3,X2,X4)
    | ~ isa(X1,X2)
    | isa(f_relationallexistsfn(X1,X3,X2,X4),X4) ),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

cnf(c_0_32,plain,
    relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_24])]) ).

cnf(c_0_33,plain,
    ( ~ executionbyfiringsquad(X1)
    | isa(X1,c_executionbyfiringsquad) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

cnf(c_0_34,negated_conjecture,
    ~ isa(f_relationallexistsfn(c_tptpexecutionbyfiringsquad_90,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490),c_tptpcol_16_29490),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).

cnf(c_0_35,plain,
    ( ~ isa(X1,c_executionbyfiringsquad)
    | isa(f_relationallexistsfn(X1,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490),c_tptpcol_16_29490) ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_36,plain,
    isa(c_tptpexecutionbyfiringsquad_90,c_executionbyfiringsquad),
    inference(spm,[status(thm)],[c_0_33,c_0_30]) ).

cnf(c_0_37,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR044+2 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.39  % Computer : n020.cluster.edu
% 0.11/0.39  % Model    : x86_64 x86_64
% 0.11/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39  % Memory   : 8046.5625MB
% 0.11/0.39  % OS       : Linux 6.8.0-71-generic
% 0.11/0.39  % CPULimit : 300
% 0.11/0.39  % WCLimit  : 300
% 0.11/0.39  % DateTime : Mon Sep 21 14:33:34 UTC 2026
% 0.11/0.39  % CPUTime  : 
% 0.11/0.39  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.43  Running first-order theorem proving
% 0.11/0.43  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.18/0.51  % Version: 3.5.1
% 0.18/0.51  % Preprocessing class: FMLMSMSLSSSNFFN.
% 0.18/0.51  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51  % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.18/0.51  % Starting new_bool_3 with 600s (2) cores
% 0.18/0.51  % Starting new_bool_1 with 600s (2) cores
% 0.18/0.51  % Starting sh5l with 300s (1) cores
% 0.18/0.51  % sh5l with pid 3178206 completed with status 0
% 0.18/0.51  % Result found by sh5l
% 0.18/0.51  % Preprocessing class: FMLMSMSLSSSNFFN.
% 0.18/0.51  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51  % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.18/0.51  % Starting new_bool_3 with 600s (2) cores
% 0.18/0.51  % Starting new_bool_1 with 600s (2) cores
% 0.18/0.51  % Starting sh5l with 300s (1) cores
% 0.18/0.51  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.18/0.51  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.51  % Search class: FHHNM-FFMM31-SFFFFFNN
% 0.18/0.51  % partial match(1): FHHNM-FFMM33-SFFFFFNN
% 0.18/0.51  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.51  % Starting SubtermCWHack with 31s (1) cores
% 0.18/0.51  % SubtermCWHack with pid 3178211 completed with status 0
% 0.18/0.51  % Result found by SubtermCWHack
% 0.18/0.51  % Preprocessing class: FMLMSMSLSSSNFFN.
% 0.18/0.51  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.51  % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.18/0.51  % Starting new_bool_3 with 600s (2) cores
% 0.18/0.51  % Starting new_bool_1 with 600s (2) cores
% 0.18/0.51  % Starting sh5l with 300s (1) cores
% 0.18/0.51  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.18/0.51  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.51  % Search class: FHHNM-FFMM31-SFFFFFNN
% 0.18/0.51  % partial match(1): FHHNM-FFMM33-SFFFFFNN
% 0.18/0.51  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.51  % Starting SubtermCWHack with 31s (1) cores
% 0.18/0.51  % Preprocessing time       : 0.005 s
% 0.18/0.51  
% 0.18/0.51  % Proof found!
% 0.18/0.51  % SZS status Theorem
% 0.18/0.51  % SZS output start CNFRefutation
% See solution above
% 0.18/0.51  % Parsed axioms                        : 1132
% 0.18/0.51  % Removed by relevancy pruning/SinE    : 930
% 0.18/0.51  % Initial clauses                      : 203
% 0.18/0.51  % Removed in clause preprocessing      : 0
% 0.18/0.51  % Initial clauses in saturation        : 203
% 0.18/0.51  % Processed clauses                    : 478
% 0.18/0.51  % ...of these trivial                  : 3
% 0.18/0.51  % ...subsumed                          : 42
% 0.18/0.51  % ...remaining for further processing  : 433
% 0.18/0.51  % Other redundant clauses eliminated   : 0
% 0.18/0.51  % Clauses deleted for lack of memory   : 0
% 0.18/0.51  % Backward-subsumed                    : 1
% 0.18/0.51  % Backward-rewritten                   : 23
% 0.18/0.51  % Generated clauses                    : 391
% 0.18/0.51  % ...of the previous two non-redundant : 279
% 0.18/0.51  % ...aggressively subsumed             : 0
% 0.18/0.51  % Contextual simplify-reflections      : 0
% 0.18/0.51  % Paramodulations                      : 391
% 0.18/0.51  % Factorizations                       : 0
% 0.18/0.51  % NegExts                              : 0
% 0.18/0.51  % Equation resolutions                 : 0
% 0.18/0.51  % Disequality decompositions           : 0
% 0.18/0.51  % Total rewrite steps                  : 152
% 0.18/0.51  % ...of those cached                   : 93
% 0.18/0.51  % Propositional unsat checks           : 0
% 0.18/0.51  %    Propositional check models        : 0
% 0.18/0.51  %    Propositional check unsatisfiable : 0
% 0.18/0.51  %    Propositional clauses             : 0
% 0.18/0.51  %    Propositional clauses after purity: 0
% 0.18/0.51  %    Propositional unsat core size     : 0
% 0.18/0.51  %    Propositional preprocessing time  : 0.000
% 0.18/0.51  %    Propositional encoding time       : 0.000
% 0.18/0.51  %    Propositional solver time         : 0.000
% 0.18/0.51  %    Success case prop preproc time    : 0.000
% 0.18/0.51  %    Success case prop encoding time   : 0.000
% 0.18/0.51  %    Success case prop solver time     : 0.000
% 0.18/0.51  % Current number of processed clauses  : 409
% 0.18/0.51  %    Positive orientable unit clauses  : 180
% 0.18/0.51  %    Positive unorientable unit clauses: 0
% 0.18/0.51  %    Negative unit clauses             : 3
% 0.18/0.51  %    Non-unit-clauses                  : 226
% 0.18/0.51  % Current number of unprocessed clauses: 3
% 0.18/0.51  % ...number of literals in the above   : 9
% 0.18/0.51  % Current number of archived formulas  : 0
% 0.18/0.51  % Current number of archived clauses   : 24
% 0.18/0.51  % Clause-clause subsumption calls (NU) : 10497
% 0.18/0.51  % Rec. Clause-clause subsumption calls : 10025
% 0.18/0.51  % Non-unit clause-clause subsumptions  : 43
% 0.18/0.51  % Unit Clause-clause subsumption calls : 885
% 0.18/0.51  % Rewrite failures with RHS unbound    : 0
% 0.18/0.51  % BW rewrite match attempts            : 7
% 0.18/0.51  % BW rewrite match successes           : 7
% 0.18/0.51  % Condensation attempts                : 0
% 0.18/0.51  % Condensation successes               : 0
% 0.18/0.51  % Termbank termtop insertions          : 20269
% 0.18/0.51  % Search garbage collected termcells   : 4920
% 0.18/0.51  
% 0.18/0.51  % -------------------------------------------------
% 0.18/0.51  % User time                : 0.033 s
% 0.18/0.51  % System time              : 0.009 s
% 0.18/0.51  % Total time               : 0.042 s
% 0.18/0.51  % Maximum resident set size: 6348 pages
% 0.18/0.51  
% 0.18/0.51  % -------------------------------------------------
% 0.18/0.51  % User time                : 0.051 s
% 0.18/0.51  % System time              : 0.014 s
% 0.18/0.51  % Total time               : 0.065 s
% 0.18/0.51  % Maximum resident set size: 5888 pages
% 0.18/0.51  % E exiting
%------------------------------------------------------------------------------