↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SWB014+2 : TPTP v9.3.1. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n011.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 02:38:03 PM UTC 2026

% Result   : Theorem 0.23s 0.61s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   29 (  13 unt;   0 def)
%            Number of atoms       :  151 (   0 equ)
%            Maximal formula atoms :   71 (   5 avg)
%            Number of connectives :  205 (  83   ~;  87   |;  31   &)
%                                         (   3 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   27 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :   13 (  13 usr;  12 con; 0-5 aty)
%            Number of variables   :   40 (   0 sgn  18   !;   5   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(rdfs_cext_def,axiom,
    ! [X1,X2] :
      ( iext(uri_rdf_type,X1,X2)
    <=> icext(X2,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rdfs_cext_def) ).

fof(testcase_premise_fullish_014_Harry_belongs_to_some_Species,axiom,
    ? [X9,X10,X11] :
      ( iext(uri_rdf_rest,X11,uri_rdf_nil)
      & iext(uri_rdf_first,X11,uri_ex_Falcon)
      & iext(uri_rdf_rest,X10,X11)
      & iext(uri_rdf_first,X10,uri_ex_Eagle)
      & iext(uri_owl_unionOf,X9,X10)
      & iext(uri_rdf_type,uri_ex_harry,X9)
      & iext(uri_rdf_type,uri_ex_Falcon,uri_ex_Species)
      & iext(uri_rdf_type,uri_ex_Eagle,uri_ex_Species) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_premise_fullish_014_Harry_belongs_to_some_Species) ).

fof(owl_bool_unionof_class_002,axiom,
    ! [X3,X4,X5,X6,X7] :
      ( ( iext(uri_rdf_rest,X6,uri_rdf_nil)
        & iext(uri_rdf_first,X6,X7)
        & iext(uri_rdf_rest,X4,X6)
        & iext(uri_rdf_first,X4,X5) )
     => ( iext(uri_owl_unionOf,X3,X4)
      <=> ( ! [X1] :
              ( icext(X3,X1)
            <=> ( icext(X7,X1)
                | icext(X5,X1) ) )
          & ic(X7)
          & ic(X5)
          & ic(X3) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',owl_bool_unionof_class_002) ).

fof(testcase_conclusion_fullish_014_Harry_belongs_to_some_Species,conjecture,
    ? [X8] :
      ( iext(uri_rdf_type,X8,uri_ex_Species)
      & iext(uri_rdf_type,uri_ex_harry,X8) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_conclusion_fullish_014_Harry_belongs_to_some_Species) ).

fof(c_0_4,plain,
    ! [X12,X13] :
      ( ( iext(uri_rdf_type,X12,X13)
        | ~ icext(X13,X12) )
      & ( icext(X13,X12)
        | ~ iext(uri_rdf_type,X12,X13) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdfs_cext_def])])]) ).

fof(c_0_5,plain,
    ( iext(uri_rdf_rest,esk4_0,uri_rdf_nil)
    & iext(uri_rdf_first,esk4_0,uri_ex_Falcon)
    & iext(uri_rdf_rest,esk3_0,esk4_0)
    & iext(uri_rdf_first,esk3_0,uri_ex_Eagle)
    & iext(uri_owl_unionOf,esk2_0,esk3_0)
    & iext(uri_rdf_type,uri_ex_harry,esk2_0)
    & iext(uri_rdf_type,uri_ex_Falcon,uri_ex_Species)
    & iext(uri_rdf_type,uri_ex_Eagle,uri_ex_Species) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[testcase_premise_fullish_014_Harry_belongs_to_some_Species])]) ).

fof(c_0_6,plain,
    ! [X14,X15,X16,X17,X18,X19,X20] :
      ( ( ~ iext(uri_rdf_rest,X17,uri_rdf_nil)
        | ~ iext(uri_rdf_first,X17,X18)
        | ~ iext(uri_rdf_rest,X15,X17)
        | ~ iext(uri_rdf_first,X15,X16)
        | iext(uri_owl_unionOf,X14,X15)
        | ~ ic(X18)
        | ~ ic(X16)
        | ~ ic(X14)
        | icext(X18,esk1_5(X14,X15,X16,X17,X18))
        | icext(X16,esk1_5(X14,X15,X16,X17,X18))
        | icext(X14,esk1_5(X14,X15,X16,X17,X18)) )
      & ( ~ iext(uri_rdf_rest,X17,uri_rdf_nil)
        | ~ iext(uri_rdf_first,X17,X18)
        | ~ iext(uri_rdf_rest,X15,X17)
        | ~ iext(uri_rdf_first,X15,X16)
        | iext(uri_owl_unionOf,X14,X15)
        | ~ ic(X18)
        | ~ ic(X16)
        | ~ ic(X14)
        | ~ icext(X14,esk1_5(X14,X15,X16,X17,X18))
        | ~ icext(X18,esk1_5(X14,X15,X16,X17,X18)) )
      & ( ~ iext(uri_rdf_rest,X17,uri_rdf_nil)
        | ~ iext(uri_rdf_first,X17,X18)
        | ~ iext(uri_rdf_rest,X15,X17)
        | ~ iext(uri_rdf_first,X15,X16)
        | iext(uri_owl_unionOf,X14,X15)
        | ~ ic(X18)
        | ~ ic(X16)
        | ~ ic(X14)
        | ~ icext(X14,esk1_5(X14,X15,X16,X17,X18))
        | ~ icext(X16,esk1_5(X14,X15,X16,X17,X18)) )
      & ( ~ iext(uri_rdf_rest,X17,uri_rdf_nil)
        | ~ iext(uri_rdf_first,X17,X18)
        | ~ iext(uri_rdf_rest,X15,X17)
        | ~ iext(uri_rdf_first,X15,X16)
        | ~ iext(uri_owl_unionOf,X14,X15)
        | icext(X14,X20)
        | ~ icext(X18,X20) )
      & ( ~ iext(uri_rdf_rest,X17,uri_rdf_nil)
        | ~ iext(uri_rdf_first,X17,X18)
        | ~ iext(uri_rdf_rest,X15,X17)
        | ~ iext(uri_rdf_first,X15,X16)
        | ~ iext(uri_owl_unionOf,X14,X15)
        | icext(X14,X20)
        | ~ icext(X16,X20) )
      & ( ~ iext(uri_rdf_rest,X17,uri_rdf_nil)
        | ~ iext(uri_rdf_first,X17,X18)
        | ~ iext(uri_rdf_rest,X15,X17)
        | ~ iext(uri_rdf_first,X15,X16)
        | ~ iext(uri_owl_unionOf,X14,X15)
        | icext(X18,X19)
        | icext(X16,X19)
        | ~ icext(X14,X19) )
      & ( ~ iext(uri_rdf_rest,X17,uri_rdf_nil)
        | ~ iext(uri_rdf_first,X17,X18)
        | ~ iext(uri_rdf_rest,X15,X17)
        | ~ iext(uri_rdf_first,X15,X16)
        | ~ iext(uri_owl_unionOf,X14,X15)
        | ic(X18) )
      & ( ~ iext(uri_rdf_rest,X17,uri_rdf_nil)
        | ~ iext(uri_rdf_first,X17,X18)
        | ~ iext(uri_rdf_rest,X15,X17)
        | ~ iext(uri_rdf_first,X15,X16)
        | ~ iext(uri_owl_unionOf,X14,X15)
        | ic(X16) )
      & ( ~ iext(uri_rdf_rest,X17,uri_rdf_nil)
        | ~ iext(uri_rdf_first,X17,X18)
        | ~ iext(uri_rdf_rest,X15,X17)
        | ~ iext(uri_rdf_first,X15,X16)
        | ~ iext(uri_owl_unionOf,X14,X15)
        | ic(X14) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_bool_unionof_class_002])])])])])])]) ).

cnf(c_0_7,plain,
    ( ~ iext(uri_rdf_type,X1,X2)
    | icext(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,plain,
    iext(uri_rdf_type,uri_ex_harry,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    ( ~ iext(uri_rdf_rest,X6,uri_rdf_nil)
    | ~ iext(uri_rdf_first,X6,X4)
    | ~ iext(uri_rdf_rest,X5,X6)
    | ~ iext(uri_rdf_first,X5,X3)
    | ~ iext(uri_owl_unionOf,X1,X5)
    | ~ icext(X1,X2)
    | icext(X4,X2)
    | icext(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    icext(esk2_0,uri_ex_harry),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

fof(c_0_11,negated_conjecture,
    ~ ? [X8] :
        ( iext(uri_rdf_type,X8,uri_ex_Species)
        & iext(uri_rdf_type,uri_ex_harry,X8) ),
    inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_014_Harry_belongs_to_some_Species]) ).

cnf(c_0_12,plain,
    ( ~ iext(uri_rdf_rest,X4,X3)
    | ~ iext(uri_rdf_first,X4,X1)
    | ~ iext(uri_rdf_first,X3,X2)
    | ~ iext(uri_owl_unionOf,esk2_0,X4)
    | ~ iext(uri_rdf_rest,X3,uri_rdf_nil)
    | icext(X2,uri_ex_harry)
    | icext(X1,uri_ex_harry) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,plain,
    iext(uri_rdf_first,esk4_0,uri_ex_Falcon),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_14,plain,
    iext(uri_rdf_rest,esk4_0,uri_rdf_nil),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

fof(c_0_15,negated_conjecture,
    ! [X22] :
      ( ~ iext(uri_rdf_type,X22,uri_ex_Species)
      | ~ iext(uri_rdf_type,uri_ex_harry,X22) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).

cnf(c_0_16,plain,
    ( ~ iext(uri_rdf_first,X2,X1)
    | ~ iext(uri_rdf_rest,X2,esk4_0)
    | ~ iext(uri_owl_unionOf,esk2_0,X2)
    | icext(X1,uri_ex_harry)
    | icext(uri_ex_Falcon,uri_ex_harry) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).

cnf(c_0_17,plain,
    iext(uri_rdf_first,esk3_0,uri_ex_Eagle),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_18,plain,
    iext(uri_owl_unionOf,esk2_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_19,plain,
    iext(uri_rdf_rest,esk3_0,esk4_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_20,negated_conjecture,
    ( ~ iext(uri_rdf_type,X1,uri_ex_Species)
    | ~ iext(uri_rdf_type,uri_ex_harry,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_21,plain,
    iext(uri_rdf_type,uri_ex_Falcon,uri_ex_Species),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_22,plain,
    ( ~ icext(X1,X2)
    | iext(uri_rdf_type,X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_23,plain,
    ( icext(uri_ex_Falcon,uri_ex_harry)
    | icext(uri_ex_Eagle,uri_ex_harry) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19])]) ).

cnf(c_0_24,negated_conjecture,
    ~ iext(uri_rdf_type,uri_ex_harry,uri_ex_Falcon),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_25,plain,
    iext(uri_rdf_type,uri_ex_Eagle,uri_ex_Species),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_26,plain,
    icext(uri_ex_Eagle,uri_ex_harry),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).

cnf(c_0_27,negated_conjecture,
    ~ iext(uri_rdf_type,uri_ex_harry,uri_ex_Eagle),
    inference(spm,[status(thm)],[c_0_20,c_0_25]) ).

cnf(c_0_28,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_26]),c_0_27]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWB014+2 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.45  % Computer : n011.cluster.edu
% 0.20/0.45  % Model    : x86_64 x86_64
% 0.20/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45  % Memory   : 8046.5625MB
% 0.20/0.45  % OS       : Linux 6.8.0-71-generic
% 0.20/0.45  % CPULimit : 300
% 0.20/0.46  % WCLimit  : 300
% 0.20/0.46  % DateTime : Mon Sep 21 07:38:56 UTC 2026
% 0.20/0.46  % CPUTime  : 
% 0.20/0.46  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.54  Running first-order theorem proving
% 0.23/0.54  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
% 0.23/0.61  % Version: 3.5.1
% 0.23/0.61  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.23/0.61  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.61  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.23/0.61  % Starting new_bool_3 with 300s (1) cores
% 0.23/0.61  % Starting new_bool_1 with 300s (1) cores
% 0.23/0.61  % Starting sh5l with 300s (1) cores
% 0.23/0.61  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1361954 completed with status 0
% 0.23/0.61  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.23/0.61  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.23/0.61  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.61  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.23/0.61  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.61  % No SInE strategy applied
% 0.23/0.61  % Search class: FGHNF-FFMM33-SFFFFFNN
% 0.23/0.61  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.61  % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.61  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.23/0.61  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.23/0.61  % Starting new_bool_3 with 136s (1) cores
% 0.23/0.61  % Starting new_bool_1 with 136s (1) cores
% 0.23/0.61  % new_bool_1 with pid 1361967 completed with status 0
% 0.23/0.61  % Result found by new_bool_1
% 0.23/0.61  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.23/0.61  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.61  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.23/0.61  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.61  % No SInE strategy applied
% 0.23/0.61  % Search class: FGHNF-FFMM33-SFFFFFNN
% 0.23/0.61  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.61  % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.61  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.23/0.61  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.23/0.61  % Starting new_bool_3 with 136s (1) cores
% 0.23/0.61  % Starting new_bool_1 with 136s (1) cores
% 0.23/0.61  % Preprocessing time       : 0.001 s
% 0.23/0.61  % Presaturation interreduction done
% 0.23/0.61  
% 0.23/0.61  % Proof found!
% 0.23/0.61  % SZS status Theorem
% 0.23/0.61  % SZS output start CNFRefutation
% See solution above
% 0.23/0.61  % Parsed axioms                        : 4
% 0.23/0.61  % Removed by relevancy pruning/SinE    : 0
% 0.23/0.61  % Initial clauses                      : 20
% 0.23/0.61  % Removed in clause preprocessing      : 0
% 0.23/0.61  % Initial clauses in saturation        : 20
% 0.23/0.61  % Processed clauses                    : 95
% 0.23/0.61  % ...of these trivial                  : 1
% 0.23/0.61  % ...subsumed                          : 3
% 0.23/0.61  % ...remaining for further processing  : 91
% 0.23/0.61  % Other redundant clauses eliminated   : 0
% 0.23/0.61  % Clauses deleted for lack of memory   : 0
% 0.23/0.61  % Backward-subsumed                    : 3
% 0.23/0.61  % Backward-rewritten                   : 4
% 0.23/0.61  % Generated clauses                    : 79
% 0.23/0.61  % ...of the previous two non-redundant : 66
% 0.23/0.61  % ...aggressively subsumed             : 0
% 0.23/0.61  % Contextual simplify-reflections      : 0
% 0.23/0.61  % Paramodulations                      : 79
% 0.23/0.61  % Factorizations                       : 0
% 0.23/0.61  % NegExts                              : 0
% 0.23/0.61  % Equation resolutions                 : 0
% 0.23/0.61  % Disequality decompositions           : 0
% 0.23/0.61  % Total rewrite steps                  : 36
% 0.23/0.61  % ...of those cached                   : 26
% 0.23/0.61  % Propositional unsat checks           : 0
% 0.23/0.61  %    Propositional check models        : 0
% 0.23/0.61  %    Propositional check unsatisfiable : 0
% 0.23/0.61  %    Propositional clauses             : 0
% 0.23/0.61  %    Propositional clauses after purity: 0
% 0.23/0.61  %    Propositional unsat core size     : 0
% 0.23/0.61  %    Propositional preprocessing time  : 0.000
% 0.23/0.61  %    Propositional encoding time       : 0.000
% 0.23/0.61  %    Propositional solver time         : 0.000
% 0.23/0.61  %    Success case prop preproc time    : 0.000
% 0.23/0.61  %    Success case prop encoding time   : 0.000
% 0.23/0.61  %    Success case prop solver time     : 0.000
% 0.23/0.61  % Current number of processed clauses  : 64
% 0.23/0.61  %    Positive orientable unit clauses  : 15
% 0.23/0.61  %    Positive unorientable unit clauses: 0
% 0.23/0.61  %    Negative unit clauses             : 2
% 0.23/0.61  %    Non-unit-clauses                  : 47
% 0.23/0.61  % Current number of unprocessed clauses: 10
% 0.23/0.61  % ...number of literals in the above   : 66
% 0.23/0.61  % Current number of archived formulas  : 0
% 0.23/0.61  % Current number of archived clauses   : 27
% 0.23/0.61  % Clause-clause subsumption calls (NU) : 1945
% 0.23/0.61  % Rec. Clause-clause subsumption calls : 141
% 0.23/0.61  % Non-unit clause-clause subsumptions  : 6
% 0.23/0.61  % Unit Clause-clause subsumption calls : 80
% 0.23/0.61  % Rewrite failures with RHS unbound    : 0
% 0.23/0.61  % BW rewrite match attempts            : 3
% 0.23/0.61  % BW rewrite match successes           : 3
% 0.23/0.61  % Condensation attempts                : 0
% 0.23/0.61  % Condensation successes               : 0
% 0.23/0.61  % Termbank termtop insertions          : 4232
% 0.23/0.61  % Search garbage collected termcells   : 305
% 0.23/0.61  
% 0.23/0.61  % -------------------------------------------------
% 0.23/0.61  % User time                : 0.012 s
% 0.23/0.61  % System time              : 0.004 s
% 0.23/0.61  % Total time               : 0.016 s
% 0.23/0.61  % Maximum resident set size: 3640 pages
% 0.23/0.61  
% 0.23/0.61  % -------------------------------------------------
% 0.23/0.61  % User time                : 0.026 s
% 0.23/0.61  % System time              : 0.014 s
% 0.23/0.61  % Total time               : 0.040 s
% 0.23/0.61  % Maximum resident set size: 4864 pages
% 0.23/0.61  % E exiting
%------------------------------------------------------------------------------