↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : CSR026+4 : 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:15:56 PM UTC 2026

% Result   : Theorem 18.57s 7.44s
% Output   : CNFRefutation 18.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   27 (  13 unt;   0 def)
%            Number of atoms       :   47 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   35 (  15   ~;  12   |;   3   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   7 con; 0-1 aty)
%            Number of variables   :    9 (   0 sgn   6   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(query176,conjecture,
    ( mtvisible(c_tptp_spindlecollectormt)
   => tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query176) ).

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

fof(ax3_773,axiom,
    genlmt(c_tptp_member1489_mt,c_tptp_spindleheadmt),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+3.ax',ax3_773) ).

fof(ax3_3921,axiom,
    genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+3.ax',ax3_3921) ).

fof(ax3_4764,axiom,
    genlmt(c_tptp_spindlecollectormt,c_tptp_member1489_mt),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+3.ax',ax3_4764) ).

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

fof(ax3_29493,axiom,
    ! [X6] :
      ( ( runningshorts(X6)
        & mtvisible(c_tptp_member2701_mt) )
     => tptpofobject(X6,f_tptpquantityfn_2(n_756)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+3.ax',ax3_29493) ).

fof(ax3_5712,axiom,
    ( mtvisible(c_cyclistsmt)
   => runningshorts(c_tptprunningshorts) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+3.ax',ax3_5712) ).

fof(c_0_8,negated_conjecture,
    ~ ( mtvisible(c_tptp_spindlecollectormt)
     => tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)) ),
    inference(assume_negation,[status(cth)],[query176]) ).

fof(c_0_9,plain,
    ! [X24054,X24055] :
      ( mtvisible(X24055)
      | ~ genlmt(X24054,X24055)
      | ~ mtvisible(X24054) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_44208])])]) ).

fof(c_0_10,negated_conjecture,
    ( ~ tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756))
    & mtvisible(c_tptp_spindlecollectormt) ),
    inference(fof_nnf,[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_member1489_mt,c_tptp_spindleheadmt),
    inference(split_conjunct,[status(thm)],[ax3_773]) ).

cnf(c_0_13,plain,
    genlmt(c_tptp_spindlecollectormt,c_tptp_member2701_mt),
    inference(split_conjunct,[status(thm)],[ax3_3921]) ).

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

cnf(c_0_15,plain,
    genlmt(c_tptp_spindlecollectormt,c_tptp_member1489_mt),
    inference(split_conjunct,[status(thm)],[ax3_4764]) ).

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

fof(c_0_17,plain,
    ! [X6545] :
      ( tptpofobject(X6545,f_tptpquantityfn_2(n_756))
      | ~ runningshorts(X6545)
      | ~ mtvisible(c_tptp_member2701_mt) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_29493])])]) ).

fof(c_0_18,plain,
    ( runningshorts(c_tptprunningshorts)
    | ~ mtvisible(c_cyclistsmt) ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_5712])]) ).

cnf(c_0_19,plain,
    ( ~ mtvisible(c_tptp_member1489_mt)
    | mtvisible(c_tptp_spindleheadmt) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_20,plain,
    mtvisible(c_tptp_member2701_mt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_13]),c_0_14])]) ).

cnf(c_0_21,plain,
    mtvisible(c_tptp_member1489_mt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_15]),c_0_14])]) ).

cnf(c_0_22,plain,
    ( ~ mtvisible(c_tptp_spindleheadmt)
    | mtvisible(c_cyclistsmt) ),
    inference(spm,[status(thm)],[c_0_11,c_0_16]) ).

cnf(c_0_23,plain,
    ( ~ runningshorts(X1)
    | ~ mtvisible(c_tptp_member2701_mt)
    | tptpofobject(X1,f_tptpquantityfn_2(n_756)) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_24,plain,
    ( ~ mtvisible(c_cyclistsmt)
    | runningshorts(c_tptprunningshorts) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_25,negated_conjecture,
    ~ tptpofobject(c_tptprunningshorts,f_tptpquantityfn_2(n_756)),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_26,plain,
    $false,
    inference(cdclpropres,[status(thm)],[c_0_19,c_0_20,c_0_21,c_0_22,c_0_23,c_0_24,c_0_25]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR026+4 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37  % Computer : n008.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Mon Sep 21 14:25:53 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42  Running first-order theorem proving
% 0.11/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
% 18.57/7.44  % Version: 3.5.1
% 18.57/7.44  % Preprocessing class: FMLLLMSLSSSNFFN.
% 18.57/7.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.57/7.44  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 18.57/7.44  % Starting new_bool_3 with 300s (1) cores
% 18.57/7.44  % Starting new_bool_1 with 300s (1) cores
% 18.57/7.44  % Starting sh5l with 300s (1) cores
% 18.57/7.44  % new_bool_1 with pid 1218140 completed with status 9
% 18.57/7.44  % new_bool_3 with pid 1218139 completed with status 9
% 18.57/7.44  % G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 1218138 completed with status 0
% 18.57/7.44  % Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 18.57/7.44  % Preprocessing class: FMLLLMSLSSSNFFN.
% 18.57/7.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.57/7.44  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 18.57/7.44  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 18.57/7.44  % No SInE strategy applied
% 18.57/7.44  % Search class: FHHSM-SMLM31-MFFFFFNN
% 18.57/7.44  % Scheduled 5 strats onto 5 cores with 1495 seconds (1495 total)
% 18.57/7.44  % Starting SubtermCWHack with 150s (1) cores
% 18.57/7.44  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 898s (1) cores
% 18.57/7.44  % Starting G----_0021_C18_F1_SE_CS_SP_S4S with 150s (1) cores
% 18.57/7.44  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 150s (1) cores
% 18.57/7.44  % Starting new_bool_3 with 147s (1) cores
% 18.57/7.44  % G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with pid 1218184 completed with status 0
% 18.57/7.44  % Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y
% 18.57/7.44  % Preprocessing class: FMLLLMSLSSSNFFN.
% 18.57/7.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.57/7.44  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 18.57/7.44  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 18.57/7.44  % No SInE strategy applied
% 18.57/7.44  % Search class: FHHSM-SMLM31-MFFFFFNN
% 18.57/7.44  % Scheduled 5 strats onto 5 cores with 1495 seconds (1495 total)
% 18.57/7.44  % Starting SubtermCWHack with 150s (1) cores
% 18.57/7.44  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 898s (1) cores
% 18.57/7.44  % Starting G----_0021_C18_F1_SE_CS_SP_S4S with 150s (1) cores
% 18.57/7.44  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 150s (1) cores
% 18.57/7.44  % Preprocessing time       : 0.546 s
% 18.57/7.44  % SatCheck found unsatisfiable ground set
% 18.57/7.44  
% 18.57/7.44  % Proof found!
% 18.57/7.44  % SZS status Theorem
% 18.57/7.44  % SZS output start CNFRefutation
% See solution above
% 18.57/7.44  % Parsed axioms                        : 44217
% 18.57/7.44  % Removed by relevancy pruning/SinE    : 0
% 18.57/7.44  % Initial clauses                      : 44218
% 18.57/7.44  % Removed in clause preprocessing      : 3
% 18.57/7.44  % Initial clauses in saturation        : 44215
% 18.57/7.44  % Processed clauses                    : 5376
% 18.57/7.44  % ...of these trivial                  : 199
% 18.57/7.44  % ...subsumed                          : 177
% 18.57/7.44  % ...remaining for further processing  : 5000
% 18.57/7.44  % Other redundant clauses eliminated   : 2
% 18.57/7.44  % Clauses deleted for lack of memory   : 0
% 18.57/7.44  % Backward-subsumed                    : 0
% 18.57/7.44  % Backward-rewritten                   : 36
% 18.57/7.44  % Generated clauses                    : 5388
% 18.57/7.44  % ...of the previous two non-redundant : 4282
% 18.57/7.44  % ...aggressively subsumed             : 0
% 18.57/7.44  % Contextual simplify-reflections      : 0
% 18.57/7.44  % Paramodulations                      : 5386
% 18.57/7.44  % Factorizations                       : 0
% 18.57/7.44  % NegExts                              : 0
% 18.57/7.44  % Equation resolutions                 : 2
% 18.57/7.44  % Disequality decompositions           : 0
% 18.57/7.44  % Total rewrite steps                  : 1472
% 18.57/7.44  % ...of those cached                   : 1231
% 18.57/7.44  % Propositional unsat checks           : 1
% 18.57/7.44  %    Propositional check models        : 0
% 18.57/7.44  %    Propositional check unsatisfiable : 1
% 18.57/7.44  %    Propositional clauses             : 48083
% 18.57/7.44  %    Propositional clauses after purity: 17399
% 18.57/7.44  %    Propositional unsat core size     : 7
% 18.57/7.44  %    Propositional preprocessing time  : 0.000
% 18.57/7.44  %    Propositional encoding time       : 0.056
% 18.57/7.44  %    Propositional solver time         : 0.008
% 18.57/7.44  %    Success case prop preproc time    : 0.000
% 18.57/7.44  %    Success case prop encoding time   : 0.056
% 18.57/7.44  %    Success case prop solver time     : 0.008
% 18.57/7.44  % Current number of processed clauses  : 4962
% 18.57/7.44  %    Positive orientable unit clauses  : 2702
% 18.57/7.44  %    Positive unorientable unit clauses: 0
% 18.57/7.44  %    Negative unit clauses             : 99
% 18.57/7.44  %    Non-unit-clauses                  : 2161
% 18.57/7.44  % Current number of unprocessed clauses: 43121
% 18.57/7.44  % ...number of literals in the above   : 62523
% 18.57/7.44  % Current number of archived formulas  : 0
% 18.57/7.44  % Current number of archived clauses   : 36
% 18.57/7.44  % Clause-clause subsumption calls (NU) : 1294881
% 18.57/7.44  % Rec. Clause-clause subsumption calls : 1177235
% 18.57/7.44  % Non-unit clause-clause subsumptions  : 177
% 18.57/7.44  % Unit Clause-clause subsumption calls : 84269
% 18.57/7.44  % Rewrite failures with RHS unbound    : 0
% 18.57/7.44  % BW rewrite match attempts            : 38
% 18.57/7.44  % BW rewrite match successes           : 36
% 18.57/7.44  % Condensation attempts                : 0
% 18.57/7.44  % Condensation successes               : 0
% 18.57/7.44  % Termbank termtop insertions          : 1835648
% 18.57/7.44  % Search garbage collected termcells   : 183137
% 18.57/7.44  
% 18.57/7.44  % -------------------------------------------------
% 18.57/7.44  % User time                : 6.267 s
% 18.57/7.44  % System time              : 0.263 s
% 18.57/7.44  % Total time               : 6.530 s
% 18.57/7.44  % Maximum resident set size: 105780 pages
% 18.57/7.44  
% 18.57/7.44  % -------------------------------------------------
% 18.57/7.44  % User time                : 16.226 s
% 18.57/7.44  % System time              : 1.931 s
% 18.57/7.44  % Total time               : 18.157 s
% 18.57/7.44  % Maximum resident set size: 38144 pages
% 18.57/7.44  % E exiting
%------------------------------------------------------------------------------