↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : CSR068+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 : n006.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:29 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(query218,conjecture,
    ( mtvisible(c_tptp_member2356_mt)
   => tptpofobject(c_theprototypicalfurpelt,f_tptpquantityfn_1(n_328)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',query218) ).

fof(ax3_5580,axiom,
    ! [X6] :
      ( ( furpelt(X6)
        & mtvisible(c_tptp_spindleheadmt) )
     => tptpofobject(X6,f_tptpquantityfn_1(n_328)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR002+3.ax',ax3_5580) ).

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_10453,axiom,
    furpelt(c_theprototypicalfurpelt),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR002+3.ax',ax3_10453) ).

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

fof(c_0_5,negated_conjecture,
    ~ ( mtvisible(c_tptp_member2356_mt)
     => tptpofobject(c_theprototypicalfurpelt,f_tptpquantityfn_1(n_328)) ),
    inference(assume_negation,[status(cth)],[query218]) ).

fof(c_0_6,negated_conjecture,
    ( ~ tptpofobject(c_theprototypicalfurpelt,f_tptpquantityfn_1(n_328))
    & mtvisible(c_tptp_member2356_mt) ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).

fof(c_0_7,plain,
    ! [X28] :
      ( tptpofobject(X28,f_tptpquantityfn_1(n_328))
      | ~ furpelt(X28)
      | ~ mtvisible(c_tptp_spindleheadmt) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_5580])])]) ).

fof(c_0_8,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)],[ax3_44208])])]) ).

cnf(c_0_9,negated_conjecture,
    ~ tptpofobject(c_theprototypicalfurpelt,f_tptpquantityfn_1(n_328)),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    ( ~ furpelt(X1)
    | ~ mtvisible(c_tptp_spindleheadmt)
    | tptpofobject(X1,f_tptpquantityfn_1(n_328)) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,plain,
    furpelt(c_theprototypicalfurpelt),
    inference(split_conjunct,[status(thm)],[ax3_10453]) ).

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

cnf(c_0_13,plain,
    genlmt(c_tptp_member2356_mt,c_tptp_spindleheadmt),
    inference(split_conjunct,[status(thm)],[ax3_9650]) ).

cnf(c_0_14,negated_conjecture,
    mtvisible(c_tptp_member2356_mt),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_15,negated_conjecture,
    ~ mtvisible(c_tptp_spindleheadmt),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).

cnf(c_0_16,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),c_0_15]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR068+4 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37  % Computer : n006.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Mon Sep 21 14:43:58 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41  Running first-order theorem proving
% 0.10/0.41  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
% 1.32/1.42  % Version: 3.5.1
% 1.32/1.42  % Preprocessing class: FMLLLMSLSSSNFFN.
% 1.32/1.42  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.32/1.42  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 1.32/1.42  % Starting new_bool_3 with 300s (1) cores
% 1.32/1.42  % Starting new_bool_1 with 300s (1) cores
% 1.32/1.42  % Starting sh5l with 300s (1) cores
% 1.32/1.42  % new_bool_3 with pid 3090102 completed with status 0
% 1.32/1.42  % Result found by new_bool_3
% 1.32/1.42  % Preprocessing class: FMLLLMSLSSSNFFN.
% 1.32/1.42  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.32/1.42  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 1.32/1.42  % Starting new_bool_3 with 300s (1) cores
% 1.32/1.42  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.32/1.42  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.32/1.42  % Search class: FHHSM-FFMM31-SFFFFFNN
% 1.32/1.42  % partial match(1): FGHSM-FFMM31-SFFFFFNN
% 1.32/1.42  % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 1.32/1.42  % Starting SubtermCWHack with 28s (1) cores
% 1.32/1.42  % SubtermCWHack with pid 3090105 completed with status 0
% 1.32/1.42  % Result found by SubtermCWHack
% 1.32/1.42  % Preprocessing class: FMLLLMSLSSSNFFN.
% 1.32/1.42  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.32/1.42  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 1.32/1.42  % Starting new_bool_3 with 300s (1) cores
% 1.32/1.42  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.32/1.42  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.32/1.42  % Search class: FHHSM-FFMM31-SFFFFFNN
% 1.32/1.42  % partial match(1): FGHSM-FFMM31-SFFFFFNN
% 1.32/1.42  % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 1.32/1.42  % Starting SubtermCWHack with 28s (1) cores
% 1.32/1.42  % Preprocessing time       : 0.018 s
% 1.32/1.42  
% 1.32/1.42  % Proof found!
% 1.32/1.42  % SZS status Theorem
% 1.32/1.42  % SZS output start CNFRefutation
% See solution above
% 1.32/1.42  % Parsed axioms                        : 44217
% 1.32/1.42  % Removed by relevancy pruning/SinE    : 44142
% 1.32/1.42  % Initial clauses                      : 76
% 1.32/1.42  % Removed in clause preprocessing      : 1
% 1.32/1.42  % Initial clauses in saturation        : 75
% 1.32/1.42  % Processed clauses                    : 74
% 1.32/1.42  % ...of these trivial                  : 9
% 1.32/1.42  % ...subsumed                          : 9
% 1.32/1.42  % ...remaining for further processing  : 56
% 1.32/1.42  % Other redundant clauses eliminated   : 1
% 1.32/1.42  % Clauses deleted for lack of memory   : 0
% 1.32/1.42  % Backward-subsumed                    : 1
% 1.32/1.42  % Backward-rewritten                   : 0
% 1.32/1.42  % Generated clauses                    : 17
% 1.32/1.42  % ...of the previous two non-redundant : 7
% 1.32/1.42  % ...aggressively subsumed             : 0
% 1.32/1.42  % Contextual simplify-reflections      : 0
% 1.32/1.42  % Paramodulations                      : 16
% 1.32/1.42  % Factorizations                       : 0
% 1.32/1.42  % NegExts                              : 0
% 1.32/1.42  % Equation resolutions                 : 1
% 1.32/1.42  % Disequality decompositions           : 0
% 1.32/1.42  % Total rewrite steps                  : 12
% 1.32/1.42  % ...of those cached                   : 5
% 1.32/1.42  % Propositional unsat checks           : 0
% 1.32/1.42  %    Propositional check models        : 0
% 1.32/1.42  %    Propositional check unsatisfiable : 0
% 1.32/1.42  %    Propositional clauses             : 0
% 1.32/1.42  %    Propositional clauses after purity: 0
% 1.32/1.42  %    Propositional unsat core size     : 0
% 1.32/1.42  %    Propositional preprocessing time  : 0.000
% 1.32/1.42  %    Propositional encoding time       : 0.000
% 1.32/1.42  %    Propositional solver time         : 0.000
% 1.32/1.42  %    Success case prop preproc time    : 0.000
% 1.32/1.42  %    Success case prop encoding time   : 0.000
% 1.32/1.42  %    Success case prop solver time     : 0.000
% 1.32/1.42  % Current number of processed clauses  : 54
% 1.32/1.42  %    Positive orientable unit clauses  : 38
% 1.32/1.42  %    Positive unorientable unit clauses: 0
% 1.32/1.42  %    Negative unit clauses             : 2
% 1.32/1.42  %    Non-unit-clauses                  : 14
% 1.32/1.42  % Current number of unprocessed clauses: 7
% 1.32/1.42  % ...number of literals in the above   : 11
% 1.32/1.42  % Current number of archived formulas  : 0
% 1.32/1.42  % Current number of archived clauses   : 1
% 1.32/1.42  % Clause-clause subsumption calls (NU) : 62
% 1.32/1.42  % Rec. Clause-clause subsumption calls : 54
% 1.32/1.42  % Non-unit clause-clause subsumptions  : 8
% 1.32/1.42  % Unit Clause-clause subsumption calls : 7
% 1.32/1.42  % Rewrite failures with RHS unbound    : 0
% 1.32/1.42  % BW rewrite match attempts            : 0
% 1.32/1.42  % BW rewrite match successes           : 0
% 1.32/1.42  % Condensation attempts                : 0
% 1.32/1.42  % Condensation successes               : 0
% 1.32/1.42  % Termbank termtop insertions          : 294734
% 1.32/1.42  % Search garbage collected termcells   : 157706
% 1.32/1.42  
% 1.32/1.42  % -------------------------------------------------
% 1.32/1.42  % User time                : 0.119 s
% 1.32/1.42  % System time              : 0.070 s
% 1.32/1.42  % Total time               : 0.189 s
% 1.32/1.42  % Maximum resident set size: 84020 pages
% 1.32/1.42  
% 1.32/1.42  % -------------------------------------------------
% 1.32/1.42  % User time                : 0.853 s
% 1.32/1.42  % System time              : 0.122 s
% 1.32/1.42  % Total time               : 0.975 s
% 1.32/1.42  % Maximum resident set size: 38144 pages
% 1.32/1.42  % E exiting
%------------------------------------------------------------------------------