↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : CSR068+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 : n012.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 10.25s 10.25s
% Output   : CNFRefutation 10.25s
% 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(query268,conjecture,
    ( mtvisible(c_tptp_member2356_mt)
   => tptpofobject(c_theprototypicalfurpelt,f_tptpquantityfn_1(n_328)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query268) ).

fof(ax4_116580,axiom,
    ! [X7] :
      ( ( furpelt(X7)
        & mtvisible(c_tptp_spindleheadmt) )
     => tptpofobject(X7,f_tptpquantityfn_1(n_328)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+4.ax',ax4_116580) ).

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_137436,axiom,
    furpelt(c_theprototypicalfurpelt),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+4.ax',ax4_137436) ).

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

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

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,
    ! [X33] :
      ( tptpofobject(X33,f_tptpquantityfn_1(n_328))
      | ~ furpelt(X33)
      | ~ mtvisible(c_tptp_spindleheadmt) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax4_116580])])]) ).

fof(c_0_8,plain,
    ! [X166,X167] :
      ( mtvisible(X167)
      | ~ genlmt(X166,X167)
      | ~ mtvisible(X166) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax4_540220])])]) ).

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

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

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.01  % Problem  : CSR068+5 : TPTP v9.3.1. Bugfixed v3.5.0.
% 0.00/0.02  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.30  % Computer : n012.cluster.edu
% 0.03/0.30  % Model    : x86_64 x86_64
% 0.03/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30  % Memory   : 8046.5625MB
% 0.03/0.30  % OS       : Linux 6.8.0-71-generic
% 0.03/0.30  % CPULimit : 300
% 0.03/0.30  % WCLimit  : 300
% 0.03/0.30  % DateTime : Mon Sep 21 14:43:52 UTC 2026
% 0.03/0.31  % CPUTime  : 
% 0.03/0.31  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.33  Running first-order theorem proving
% 0.07/0.33  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
% 10.25/10.25  % Version: 3.5.1
% 10.25/10.25  % Preprocessing class: FLLLLMLLSSSNFFN.
% 10.25/10.25  % Scheduled 4 strats onto 8 cores with 294 seconds (2352 total)
% 10.25/10.25  % Starting new_ho_10 with 588s (2) cores
% 10.25/10.25  % Starting sh3 with 588s (2) cores
% 10.25/10.25  % Starting ho_unfolding_3 with 588s (2) cores
% 10.25/10.25  % Starting new_ho_10_cnf2 with 588s (2) cores
% 10.25/10.25  % new_ho_10 with pid 2585907 completed with status 0
% 10.25/10.25  % Result found by new_ho_10
% 10.25/10.25  % Preprocessing class: FLLLLMLLSSSNFFN.
% 10.25/10.25  % Scheduled 4 strats onto 8 cores with 294 seconds (2352 total)
% 10.25/10.25  % Starting new_ho_10 with 588s (2) cores
% 10.25/10.25  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 10.25/10.25  % SinE strategy is gf500_h_gu_R04_F100_L20000
% 10.25/10.25  % Search class: FHHSM-SSLM31-MFFFFFNN
% 10.25/10.25  % partial match(1): FHHNM-SSLM31-MFFFFFNN
% 10.25/10.25  % Scheduled 7 strats onto 2 cores with 586 seconds (586 total)
% 10.25/10.25  % Starting SubtermCWHack with 53s (1) cores
% 10.25/10.25  % Starting new_ho_10 with 59s (1) cores
% 10.25/10.25  % SubtermCWHack with pid 2585913 completed with status 0
% 10.25/10.25  % Result found by SubtermCWHack
% 10.25/10.25  % Preprocessing class: FLLLLMLLSSSNFFN.
% 10.25/10.25  % Scheduled 4 strats onto 8 cores with 294 seconds (2352 total)
% 10.25/10.25  % Starting new_ho_10 with 588s (2) cores
% 10.25/10.25  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 10.25/10.25  % SinE strategy is gf500_h_gu_R04_F100_L20000
% 10.25/10.25  % Search class: FHHSM-SSLM31-MFFFFFNN
% 10.25/10.25  % partial match(1): FHHNM-SSLM31-MFFFFFNN
% 10.25/10.25  % Scheduled 7 strats onto 2 cores with 586 seconds (586 total)
% 10.25/10.25  % Starting SubtermCWHack with 53s (1) cores
% 10.25/10.25  % Preprocessing time       : 0.249 s
% 10.25/10.25  
% 10.25/10.25  % Proof found!
% 10.25/10.25  % SZS status Theorem
% 10.25/10.25  % SZS output start CNFRefutation
% See solution above
% 10.25/10.25  % Parsed axioms                        : 540250
% 10.25/10.25  % Removed by relevancy pruning/SinE    : 538163
% 10.25/10.25  % Initial clauses                      : 2088
% 10.25/10.25  % Removed in clause preprocessing      : 2
% 10.25/10.25  % Initial clauses in saturation        : 2086
% 10.25/10.25  % Processed clauses                    : 1309
% 10.25/10.25  % ...of these trivial                  : 142
% 10.25/10.25  % ...subsumed                          : 19
% 10.25/10.25  % ...remaining for further processing  : 1148
% 10.25/10.25  % Other redundant clauses eliminated   : 1
% 10.25/10.25  % Clauses deleted for lack of memory   : 0
% 10.25/10.25  % Backward-subsumed                    : 17
% 10.25/10.25  % Backward-rewritten                   : 48
% 10.25/10.25  % Generated clauses                    : 1304
% 10.25/10.25  % ...of the previous two non-redundant : 880
% 10.25/10.25  % ...aggressively subsumed             : 0
% 10.25/10.25  % Contextual simplify-reflections      : 0
% 10.25/10.25  % Paramodulations                      : 1303
% 10.25/10.25  % Factorizations                       : 0
% 10.25/10.25  % NegExts                              : 0
% 10.25/10.25  % Equation resolutions                 : 1
% 10.25/10.25  % Disequality decompositions           : 0
% 10.25/10.25  % Total rewrite steps                  : 532
% 10.25/10.25  % ...of those cached                   : 359
% 10.25/10.25  % Propositional unsat checks           : 0
% 10.25/10.25  %    Propositional check models        : 0
% 10.25/10.25  %    Propositional check unsatisfiable : 0
% 10.25/10.25  %    Propositional clauses             : 0
% 10.25/10.25  %    Propositional clauses after purity: 0
% 10.25/10.25  %    Propositional unsat core size     : 0
% 10.25/10.25  %    Propositional preprocessing time  : 0.000
% 10.25/10.25  %    Propositional encoding time       : 0.000
% 10.25/10.25  %    Propositional solver time         : 0.000
% 10.25/10.25  %    Success case prop preproc time    : 0.000
% 10.25/10.25  %    Success case prop encoding time   : 0.000
% 10.25/10.25  %    Success case prop solver time     : 0.000
% 10.25/10.25  % Current number of processed clauses  : 1082
% 10.25/10.25  %    Positive orientable unit clauses  : 688
% 10.25/10.25  %    Positive unorientable unit clauses: 0
% 10.25/10.25  %    Negative unit clauses             : 238
% 10.25/10.25  %    Non-unit-clauses                  : 156
% 10.25/10.25  % Current number of unprocessed clauses: 1639
% 10.25/10.25  % ...number of literals in the above   : 1828
% 10.25/10.25  % Current number of archived formulas  : 0
% 10.25/10.25  % Current number of archived clauses   : 65
% 10.25/10.25  % Clause-clause subsumption calls (NU) : 5400
% 10.25/10.25  % Rec. Clause-clause subsumption calls : 4935
% 10.25/10.25  % Non-unit clause-clause subsumptions  : 17
% 10.25/10.25  % Unit Clause-clause subsumption calls : 29193
% 10.25/10.25  % Rewrite failures with RHS unbound    : 0
% 10.25/10.25  % BW rewrite match attempts            : 98
% 10.25/10.25  % BW rewrite match successes           : 49
% 10.25/10.25  % Condensation attempts                : 0
% 10.25/10.25  % Condensation successes               : 0
% 10.25/10.25  % Termbank termtop insertions          : 3744926
% 10.25/10.25  % Search garbage collected termcells   : 2169797
% 10.25/10.25  
% 10.25/10.25  % -------------------------------------------------
% 10.25/10.25  % User time                : 2.182 s
% 10.25/10.25  % System time              : 0.978 s
% 10.25/10.25  % Total time               : 3.161 s
% 10.25/10.25  % Maximum resident set size: 1242144 pages
% 10.25/10.25  
% 10.25/10.25  % -------------------------------------------------
% 10.25/10.25  % User time                : 8.630 s
% 10.25/10.25  % System time              : 1.575 s
% 10.25/10.25  % Total time               : 10.205 s
% 10.25/10.25  % Maximum resident set size: 456704 pages
% 10.25/10.25  % E exiting
%------------------------------------------------------------------------------