↑ Up

E---3.5.1.THM-CRf.s

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

% Result   : Theorem 1.99s 6.64s
% Output   : CNFRefutation 1.99s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   24 (   8 unt;   0 def)
%            Number of atoms       :   46 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   39 (  17   ~;  12   |;   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   :   25 (   0 sgn  15   !;   2   ?)

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

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

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

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

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

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

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

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

fof(c_0_8,negated_conjecture,
    ! [X24] :
      ( ( ~ tptpcol_16_25972(X24)
        | ~ tptp_8_271(X24,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,
    ! [X29] :
      ( tptp_8_271(f_relationexistsallfn(X29,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),X29)
      | ~ shavingrazor_manual(X29) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_1502])])]) ).

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

cnf(c_0_11,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_12,plain,
    shavingrazor_manual(c_theprototypicalshavingrazor_manual),
    inference(split_conjunct,[status(thm)],[ax3_3201]) ).

fof(c_0_13,plain,
    ! [X25] :
      ( tptpcol_16_25972(X25)
      | ~ isa(X25,c_tptpcol_16_25972) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_43031])])]) ).

fof(c_0_14,plain,
    ! [X32] :
      ( isa(X32,c_shavingrazor_manual)
      | ~ shavingrazor_manual(X32) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_43030])])]) ).

cnf(c_0_15,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_10,c_0_11]),c_0_12])]) ).

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

fof(c_0_17,plain,
    ! [X36,X37,X38,X39] :
      ( isa(f_relationexistsallfn(X36,X38,X39,X37),X39)
      | ~ relationexistsall(X38,X39,X37)
      | ~ isa(X36,X37) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_4485])])]) ).

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

cnf(c_0_19,negated_conjecture,
    ~ isa(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),c_tptpcol_16_25972),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

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

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

cnf(c_0_22,plain,
    isa(c_theprototypicalshavingrazor_manual,c_shavingrazor_manual),
    inference(spm,[status(thm)],[c_0_18,c_0_12]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR066+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.12/5.38  % Computer : n008.cluster.edu
% 0.12/5.38  % Model    : x86_64 x86_64
% 0.12/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.38  % Memory   : 8046.5625MB
% 0.12/5.38  % OS       : Linux 6.8.0-71-generic
% 0.12/5.38  % CPULimit : 300
% 0.12/5.38  % WCLimit  : 300
% 0.12/5.38  % DateTime : Mon Sep 21 14:44:01 UTC 2026
% 0.12/5.38  % CPUTime  : 
% 0.12/5.38  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/5.43  Running first-order theorem proving
% 0.16/5.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
% 1.99/6.64  % Version: 3.5.1
% 1.99/6.64  % Preprocessing class: FMLLLMSLSSSNFFN.
% 1.99/6.64  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.99/6.64  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 1.99/6.64  % Starting new_bool_3 with 300s (1) cores
% 1.99/6.64  % Starting new_bool_1 with 300s (1) cores
% 1.99/6.64  % Starting sh5l with 300s (1) cores
% 1.99/6.64  % new_bool_1 with pid 1235748 completed with status 0
% 1.99/6.64  % Result found by new_bool_1
% 1.99/6.64  % Preprocessing class: FMLLLMSLSSSNFFN.
% 1.99/6.64  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.99/6.64  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 1.99/6.64  % Starting new_bool_3 with 300s (1) cores
% 1.99/6.64  % Starting new_bool_1 with 300s (1) cores
% 1.99/6.64  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.99/6.64  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.99/6.64  % Search class: FHHNM-SSLM31-MFFFFFNN
% 1.99/6.64  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.99/6.64  % Starting SubtermCWHack with 31s (1) cores
% 1.99/6.64  % SubtermCWHack with pid 1235750 completed with status 0
% 1.99/6.64  % Result found by SubtermCWHack
% 1.99/6.64  % Preprocessing class: FMLLLMSLSSSNFFN.
% 1.99/6.64  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.99/6.64  % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 1.99/6.64  % Starting new_bool_3 with 300s (1) cores
% 1.99/6.64  % Starting new_bool_1 with 300s (1) cores
% 1.99/6.64  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.99/6.64  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.99/6.64  % Search class: FHHNM-SSLM31-MFFFFFNN
% 1.99/6.64  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.99/6.64  % Starting SubtermCWHack with 31s (1) cores
% 1.99/6.64  % Preprocessing time       : 0.042 s
% 1.99/6.64  
% 1.99/6.64  % Proof found!
% 1.99/6.64  % SZS status Theorem
% 1.99/6.64  % SZS output start CNFRefutation
% See solution above
% 1.99/6.64  % Parsed axioms                        : 44217
% 1.99/6.64  % Removed by relevancy pruning/SinE    : 42823
% 1.99/6.64  % Initial clauses                      : 1395
% 1.99/6.64  % Removed in clause preprocessing      : 0
% 1.99/6.64  % Initial clauses in saturation        : 1395
% 1.99/6.64  % Processed clauses                    : 1430
% 1.99/6.64  % ...of these trivial                  : 27
% 1.99/6.64  % ...subsumed                          : 6
% 1.99/6.64  % ...remaining for further processing  : 1397
% 1.99/6.64  % Other redundant clauses eliminated   : 0
% 1.99/6.64  % Clauses deleted for lack of memory   : 0
% 1.99/6.64  % Backward-subsumed                    : 0
% 1.99/6.64  % Backward-rewritten                   : 0
% 1.99/6.64  % Generated clauses                    : 5461
% 1.99/6.64  % ...of the previous two non-redundant : 1844
% 1.99/6.64  % ...aggressively subsumed             : 0
% 1.99/6.64  % Contextual simplify-reflections      : 0
% 1.99/6.64  % Paramodulations                      : 5461
% 1.99/6.64  % Factorizations                       : 0
% 1.99/6.64  % NegExts                              : 0
% 1.99/6.64  % Equation resolutions                 : 0
% 1.99/6.64  % Disequality decompositions           : 0
% 1.99/6.64  % Total rewrite steps                  : 3640
% 1.99/6.64  % ...of those cached                   : 2951
% 1.99/6.64  % Propositional unsat checks           : 0
% 1.99/6.64  %    Propositional check models        : 0
% 1.99/6.64  %    Propositional check unsatisfiable : 0
% 1.99/6.64  %    Propositional clauses             : 0
% 1.99/6.64  %    Propositional clauses after purity: 0
% 1.99/6.64  %    Propositional unsat core size     : 0
% 1.99/6.64  %    Propositional preprocessing time  : 0.000
% 1.99/6.64  %    Propositional encoding time       : 0.000
% 1.99/6.64  %    Propositional solver time         : 0.000
% 1.99/6.64  %    Success case prop preproc time    : 0.000
% 1.99/6.64  %    Success case prop encoding time   : 0.000
% 1.99/6.64  %    Success case prop solver time     : 0.000
% 1.99/6.64  % Current number of processed clauses  : 1397
% 1.99/6.64  %    Positive orientable unit clauses  : 1378
% 1.99/6.64  %    Positive unorientable unit clauses: 0
% 1.99/6.64  %    Negative unit clauses             : 2
% 1.99/6.64  %    Non-unit-clauses                  : 17
% 1.99/6.64  % Current number of unprocessed clauses: 1809
% 1.99/6.64  % ...number of literals in the above   : 3620
% 1.99/6.64  % Current number of archived formulas  : 0
% 1.99/6.64  % Current number of archived clauses   : 0
% 1.99/6.64  % Clause-clause subsumption calls (NU) : 132
% 1.99/6.64  % Rec. Clause-clause subsumption calls : 109
% 1.99/6.64  % Non-unit clause-clause subsumptions  : 6
% 1.99/6.64  % Unit Clause-clause subsumption calls : 39
% 1.99/6.64  % Rewrite failures with RHS unbound    : 0
% 1.99/6.64  % BW rewrite match attempts            : 15068
% 1.99/6.64  % BW rewrite match successes           : 0
% 1.99/6.64  % Condensation attempts                : 0
% 1.99/6.64  % Condensation successes               : 0
% 1.99/6.64  % Termbank termtop insertions          : 380557
% 1.99/6.64  % Search garbage collected termcells   : 154259
% 1.99/6.64  
% 1.99/6.64  % -------------------------------------------------
% 1.99/6.64  % User time                : 0.233 s
% 1.99/6.64  % System time              : 0.141 s
% 1.99/6.64  % Total time               : 0.373 s
% 1.99/6.64  % Maximum resident set size: 84020 pages
% 1.99/6.64  
% 1.99/6.64  % -------------------------------------------------
% 1.99/6.64  % User time                : 0.954 s
% 1.99/6.64  % System time              : 0.203 s
% 1.99/6.64  % Total time               : 1.157 s
% 1.99/6.64  % Maximum resident set size: 38144 pages
% 1.99/6.64  % E exiting
%------------------------------------------------------------------------------