↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n016.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:27 PM UTC 2026

% Result   : Theorem 73.26s 29.76s
% Output   : CNFRefutation 73.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   24 (   7 unt;   0 def)
%            Number of atoms       :   48 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   43 (  19   ~;  14   |;   4   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :   10 (  10 usr;   6 con; 0-4 aty)
%            Number of variables   :   28 (   0 sgn  15   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(query266,conjecture,
    ? [X23] :
      ( mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21))
     => ( tptpcol_16_25972(X23)
        & tptp_8_271(X23,c_theprototypicalshavingrazor_manual) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',query266) ).

fof(ax4_142113,axiom,
    ! [X6] :
      ( shavingrazor_manual(X6)
     => tptp_8_271(f_relationexistsallfn(X6,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),X6) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR002+4.ax',ax4_142113) ).

fof(ax4_407582,axiom,
    ! [X23] :
      ( isa(X23,c_tptpcol_16_25972)
     => tptpcol_16_25972(X23) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR002+4.ax',ax4_407582) ).

fof(ax4_46691,axiom,
    ! [X6,X9,X10,X11] :
      ( ( relationexistsall(X10,X11,X9)
        & isa(X6,X9) )
     => isa(f_relationexistsallfn(X6,X10,X11,X9),X11) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR002+4.ax',ax4_46691) ).

fof(ax4_3273,axiom,
    shavingrazor_manual(c_theprototypicalshavingrazor_manual),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR002+4.ax',ax4_3273) ).

fof(ax4_142114,axiom,
    relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR002+4.ax',ax4_142114) ).

fof(ax4_538309,axiom,
    ! [X23] :
      ( shavingrazor_manual(X23)
     => isa(X23,c_shavingrazor_manual) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR002+4.ax',ax4_538309) ).

fof(c_0_7,negated_conjecture,
    ~ ? [X23] :
        ( mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21))
       => ( tptpcol_16_25972(X23)
          & tptp_8_271(X23,c_theprototypicalshavingrazor_manual) ) ),
    inference(assume_negation,[status(cth)],[query266]) ).

fof(c_0_8,negated_conjecture,
    ! [X30] :
      ( ( ~ tptpcol_16_25972(X30)
        | ~ tptp_8_271(X30,c_theprototypicalshavingrazor_manual) )
      & mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_webnjiteducjohnsontreebiochhtm)),c_translation_21)) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).

fof(c_0_9,plain,
    ! [X38] :
      ( tptp_8_271(f_relationexistsallfn(X38,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),X38)
      | ~ shavingrazor_manual(X38) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax4_142113])])]) ).

fof(c_0_10,plain,
    ! [X31] :
      ( tptpcol_16_25972(X31)
      | ~ isa(X31,c_tptpcol_16_25972) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax4_407582])])]) ).

fof(c_0_11,plain,
    ! [X54,X55,X56,X57] :
      ( isa(f_relationexistsallfn(X54,X56,X57,X55),X57)
      | ~ relationexistsall(X56,X57,X55)
      | ~ isa(X54,X55) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax4_46691])])]) ).

cnf(c_0_12,negated_conjecture,
    ( ~ tptpcol_16_25972(X1)
    | ~ tptp_8_271(X1,c_theprototypicalshavingrazor_manual) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,plain,
    ( ~ shavingrazor_manual(X1)
    | tptp_8_271(f_relationexistsallfn(X1,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14,plain,
    shavingrazor_manual(c_theprototypicalshavingrazor_manual),
    inference(split_conjunct,[status(thm)],[ax4_3273]) ).

cnf(c_0_15,plain,
    ( ~ isa(X1,c_tptpcol_16_25972)
    | tptpcol_16_25972(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_16,plain,
    ( ~ relationexistsall(X3,X4,X2)
    | ~ isa(X1,X2)
    | isa(f_relationexistsallfn(X1,X3,X4,X2),X4) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_17,negated_conjecture,
    ~ tptpcol_16_25972(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).

cnf(c_0_18,plain,
    ( ~ isa(X1,X3)
    | ~ relationexistsall(X2,c_tptpcol_16_25972,X3)
    | tptpcol_16_25972(f_relationexistsallfn(X1,X2,c_tptpcol_16_25972,X3)) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,plain,
    relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),
    inference(split_conjunct,[status(thm)],[ax4_142114]) ).

fof(c_0_20,plain,
    ! [X113] :
      ( isa(X113,c_shavingrazor_manual)
      | ~ shavingrazor_manual(X113) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax4_538309])])]) ).

cnf(c_0_21,negated_conjecture,
    ~ isa(c_theprototypicalshavingrazor_manual,c_shavingrazor_manual),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).

cnf(c_0_22,plain,
    ( ~ shavingrazor_manual(X1)
    | isa(X1,c_shavingrazor_manual) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_23,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_14])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR066+5 : TPTP v9.3.1. Bugfixed v3.5.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.35  % Computer : n016.cluster.edu
% 0.10/0.35  % Model    : x86_64 x86_64
% 0.10/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35  % Memory   : 8046.5625MB
% 0.10/0.35  % OS       : Linux 6.8.0-71-generic
% 0.10/0.35  % CPULimit : 300
% 0.10/0.35  % WCLimit  : 300
% 0.10/0.35  % DateTime : Mon Sep 21 14:48:09 UTC 2026
% 0.10/0.35  % CPUTime  : 
% 0.10/0.35  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.39  Running first-order theorem proving
% 0.14/0.39  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
% 73.26/29.76  % Version: 3.5.1
% 73.26/29.76  % Preprocessing class: FLLLLMLLSSSNFFN.
% 73.26/29.76  % Scheduled 4 strats onto 8 cores with 285 seconds (2280 total)
% 73.26/29.76  % Starting new_ho_10 with 570s (2) cores
% 73.26/29.76  % Starting sh3 with 570s (2) cores
% 73.26/29.76  % Starting ho_unfolding_3 with 570s (2) cores
% 73.26/29.76  % Starting new_ho_10_cnf2 with 570s (2) cores
% 73.26/29.76  % new_ho_10 with pid 2681890 completed with status 0
% 73.26/29.76  % Result found by new_ho_10
% 73.26/29.76  % Preprocessing class: FLLLLMLLSSSNFFN.
% 73.26/29.76  % Scheduled 4 strats onto 8 cores with 285 seconds (2280 total)
% 73.26/29.76  % Starting new_ho_10 with 570s (2) cores
% 73.26/29.76  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 73.26/29.76  % SinE strategy is gf500_h_gu_R04_F100_L20000
% 73.26/29.76  % Search class: FHHSM-SMLM31-MFFFFFNN
% 73.26/29.76  % Scheduled 7 strats onto 2 cores with 565 seconds (565 total)
% 73.26/29.76  % Starting SubtermCWHack with 51s (1) cores
% 73.26/29.76  % Starting new_ho_10 with 57s (1) cores
% 73.26/29.76  % new_ho_10 with pid 2681897 completed with status 0
% 73.26/29.76  % Result found by new_ho_10
% 73.26/29.76  % Preprocessing class: FLLLLMLLSSSNFFN.
% 73.26/29.76  % Scheduled 4 strats onto 8 cores with 285 seconds (2280 total)
% 73.26/29.76  % Starting new_ho_10 with 570s (2) cores
% 73.26/29.76  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 73.26/29.76  % SinE strategy is gf500_h_gu_R04_F100_L20000
% 73.26/29.76  % Search class: FHHSM-SMLM31-MFFFFFNN
% 73.26/29.76  % Scheduled 7 strats onto 2 cores with 565 seconds (565 total)
% 73.26/29.76  % Starting SubtermCWHack with 51s (1) cores
% 73.26/29.76  % Starting new_ho_10 with 57s (1) cores
% 73.26/29.76  % Preprocessing time       : 0.388 s
% 73.26/29.76  % Presaturation interreduction done
% 73.26/29.76  
% 73.26/29.76  % Proof found!
% 73.26/29.76  % SZS status Theorem
% 73.26/29.76  % SZS output start CNFRefutation
% See solution above
% 73.26/29.76  % Parsed axioms                        : 540250
% 73.26/29.76  % Removed by relevancy pruning/SinE    : 534642
% 73.26/29.76  % Initial clauses                      : 5609
% 73.26/29.76  % Removed in clause preprocessing      : 2
% 73.26/29.76  % Initial clauses in saturation        : 5607
% 73.26/29.76  % Processed clauses                    : 20039
% 73.26/29.76  % ...of these trivial                  : 370
% 73.26/29.76  % ...subsumed                          : 803
% 73.26/29.76  % ...remaining for further processing  : 18866
% 73.26/29.76  % Other redundant clauses eliminated   : 1
% 73.26/29.76  % Clauses deleted for lack of memory   : 0
% 73.26/29.76  % Backward-subsumed                    : 39
% 73.26/29.76  % Backward-rewritten                   : 137
% 73.26/29.76  % Generated clauses                    : 62158
% 73.26/29.76  % ...of the previous two non-redundant : 45143
% 73.26/29.76  % ...aggressively subsumed             : 0
% 73.26/29.76  % Contextual simplify-reflections      : 6
% 73.26/29.76  % Paramodulations                      : 62157
% 73.26/29.76  % Factorizations                       : 0
% 73.26/29.76  % NegExts                              : 0
% 73.26/29.76  % Equation resolutions                 : 1
% 73.26/29.76  % Disequality decompositions           : 0
% 73.26/29.76  % Total rewrite steps                  : 20613
% 73.26/29.76  % ...of those cached                   : 15648
% 73.26/29.76  % Propositional unsat checks           : 0
% 73.26/29.76  %    Propositional check models        : 0
% 73.26/29.76  %    Propositional check unsatisfiable : 0
% 73.26/29.76  %    Propositional clauses             : 0
% 73.26/29.76  %    Propositional clauses after purity: 0
% 73.26/29.76  %    Propositional unsat core size     : 0
% 73.26/29.76  %    Propositional preprocessing time  : 0.000
% 73.26/29.76  %    Propositional encoding time       : 0.000
% 73.26/29.76  %    Propositional solver time         : 0.000
% 73.26/29.76  %    Success case prop preproc time    : 0.000
% 73.26/29.76  %    Success case prop encoding time   : 0.000
% 73.26/29.76  %    Success case prop solver time     : 0.000
% 73.26/29.76  % Current number of processed clauses  : 13461
% 73.26/29.76  %    Positive orientable unit clauses  : 4877
% 73.26/29.76  %    Positive unorientable unit clauses: 0
% 73.26/29.76  %    Negative unit clauses             : 224
% 73.26/29.76  %    Non-unit-clauses                  : 8360
% 73.26/29.76  % Current number of unprocessed clauses: 35778
% 73.26/29.76  % ...number of literals in the above   : 100952
% 73.26/29.76  % Current number of archived formulas  : 0
% 73.26/29.76  % Current number of archived clauses   : 5404
% 73.26/29.76  % Clause-clause subsumption calls (NU) : 10157186
% 73.26/29.76  % Rec. Clause-clause subsumption calls : 7327287
% 73.26/29.76  % Non-unit clause-clause subsumptions  : 813
% 73.26/29.76  % Unit Clause-clause subsumption calls : 123125
% 73.26/29.76  % Rewrite failures with RHS unbound    : 0
% 73.26/29.76  % BW rewrite match attempts            : 134069
% 73.26/29.76  % BW rewrite match successes           : 96
% 73.26/29.76  % Condensation attempts                : 20144
% 73.26/29.76  % Condensation successes               : 0
% 73.26/29.76  % Termbank termtop insertions          : 4497743
% 73.26/29.76  % Search garbage collected termcells   : 2164080
% 73.26/29.76  
% 73.26/29.76  % -------------------------------------------------
% 73.26/29.76  % User time                : 9.200 s
% 73.26/29.76  % System time              : 2.784 s
% 73.26/29.76  % Total time               : 11.984 s
% 73.26/29.76  % Maximum resident set size: 1242144 pages
% 73.26/29.76  
% 73.26/29.76  % -------------------------------------------------
% 73.26/29.76  % User time                : 29.311 s
% 73.26/29.76  % System time              : 5.035 s
% 73.26/29.76  % Total time               : 34.345 s
% 73.26/29.76  % Maximum resident set size: 456192 pages
% 73.26/29.76  % E exiting
%------------------------------------------------------------------------------