↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n001.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:34 PM UTC 2026

% Result   : Theorem 0.13s 0.44s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   30 (  14 unt;   0 def)
%            Number of atoms       :   84 (   0 equ)
%            Maximal formula atoms :   20 (   2 avg)
%            Number of connectives :   90 (  36   ~;  34   |;  14   &)
%                                         (   5 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   51 (   7 sgn  33   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(owl_prop_topobjectproperty_ext,axiom,
    ! [X4,X7] :
      ( iext(uri_owl_topObjectProperty,X4,X7)
    <=> ( ir(X7)
        & ir(X4) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWB001+0.ax',owl_prop_topobjectproperty_ext) ).

fof(simple_ir,axiom,
    ! [X4] : ir(X4),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWB001+0.ax',simple_ir) ).

fof(owl_char_reflexive,axiom,
    ! [X2] :
      ( icext(uri_owl_ReflexiveProperty,X2)
    <=> ( ! [X4] : iext(X2,X4,X4)
        & ip(X2) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWB001+0.ax',owl_char_reflexive) ).

fof(simple_iext_property,axiom,
    ! [X1,X2,X3] :
      ( iext(X2,X1,X3)
     => ip(X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWB001+0.ax',simple_iext_property) ).

fof(owl_eqdis_equivalentproperty,axiom,
    ! [X33,X34] :
      ( iext(uri_owl_equivalentProperty,X33,X34)
    <=> ( ! [X4,X7] :
            ( iext(X33,X4,X7)
          <=> iext(X34,X4,X7) )
        & ip(X34)
        & ip(X33) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWB001+0.ax',owl_eqdis_equivalentproperty) ).

fof(conclusion_rdfbased_sem_char_reflexive_ext,conjecture,
    iext(uri_rdf_type,uri_ex_p,uri_owl_ReflexiveProperty),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conclusion_rdfbased_sem_char_reflexive_ext) ).

fof(premise_rdfbased_sem_char_reflexive_ext,axiom,
    iext(uri_owl_equivalentProperty,uri_ex_p,uri_owl_topObjectProperty),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_rdfbased_sem_char_reflexive_ext) ).

fof(rdfs_cext_def,axiom,
    ! [X4,X5] :
      ( iext(uri_rdf_type,X4,X5)
    <=> icext(X5,X4) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWB001+0.ax',rdfs_cext_def) ).

fof(c_0_8,plain,
    ! [X59,X60] :
      ( ( iext(uri_owl_topObjectProperty,X59,X60)
        | ~ ir(X60)
        | ~ ir(X59) )
      & ( ~ iext(uri_owl_topObjectProperty,X59,X60)
        | ir(X60) )
      & ( ~ iext(uri_owl_topObjectProperty,X59,X60)
        | ir(X59) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_prop_topobjectproperty_ext])])])]) ).

fof(c_0_9,plain,
    ! [X88] : ir(X88),
    inference(variable_rename,[status(thm)],[simple_ir]) ).

fof(c_0_10,plain,
    ! [X43,X44,X45] :
      ( ( icext(uri_owl_ReflexiveProperty,X45)
        | ~ iext(X45,esk1_1(X45),esk1_1(X45))
        | ~ ip(X45) )
      & ( ~ icext(uri_owl_ReflexiveProperty,X43)
        | iext(X43,X44,X44) )
      & ( ~ icext(uri_owl_ReflexiveProperty,X43)
        | ip(X43) ) ),
    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_char_reflexive])])])])])])]) ).

fof(c_0_11,plain,
    ! [X52,X53,X54] :
      ( ip(X53)
      | ~ iext(X53,X52,X54) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[simple_iext_property])])]) ).

fof(c_0_12,plain,
    ! [X63,X64,X65,X66,X67,X68,X69,X70] :
      ( ( iext(uri_owl_equivalentProperty,X69,X70)
        | ~ ip(X70)
        | ~ ip(X69)
        | iext(X70,esk2_2(X69,X70),esk3_2(X69,X70))
        | iext(X69,esk2_2(X69,X70),esk3_2(X69,X70)) )
      & ( iext(uri_owl_equivalentProperty,X69,X70)
        | ~ ip(X70)
        | ~ ip(X69)
        | ~ iext(X70,esk2_2(X69,X70),esk3_2(X69,X70))
        | ~ iext(X69,esk2_2(X69,X70),esk3_2(X69,X70)) )
      & ( ~ iext(uri_owl_equivalentProperty,X63,X64)
        | iext(X63,X67,X68)
        | ~ iext(X64,X67,X68) )
      & ( ~ iext(uri_owl_equivalentProperty,X63,X64)
        | iext(X64,X65,X66)
        | ~ iext(X63,X65,X66) )
      & ( ~ iext(uri_owl_equivalentProperty,X63,X64)
        | ip(X64) )
      & ( ~ iext(uri_owl_equivalentProperty,X63,X64)
        | ip(X63) ) ),
    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_eqdis_equivalentproperty])])])])])])]) ).

cnf(c_0_13,plain,
    ( ~ ir(X2)
    | ~ ir(X1)
    | iext(uri_owl_topObjectProperty,X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_14,plain,
    ir(X1),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_15,negated_conjecture,
    ~ iext(uri_rdf_type,uri_ex_p,uri_owl_ReflexiveProperty),
    inference(assume_negation,[status(cth)],[conclusion_rdfbased_sem_char_reflexive_ext]) ).

cnf(c_0_16,plain,
    ( ~ iext(X1,esk1_1(X1),esk1_1(X1))
    | ~ ip(X1)
    | icext(uri_owl_ReflexiveProperty,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_17,plain,
    ( ~ iext(X1,X2,X3)
    | ip(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_18,plain,
    ( ~ iext(uri_owl_equivalentProperty,X4,X1)
    | ~ iext(X1,X2,X3)
    | iext(X4,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_19,plain,
    iext(uri_owl_equivalentProperty,uri_ex_p,uri_owl_topObjectProperty),
    inference(split_conjunct,[status(thm)],[premise_rdfbased_sem_char_reflexive_ext]) ).

cnf(c_0_20,plain,
    iext(uri_owl_topObjectProperty,X1,X2),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_14])]) ).

fof(c_0_21,negated_conjecture,
    ~ iext(uri_rdf_type,uri_ex_p,uri_owl_ReflexiveProperty),
    inference(fof_simplification,[status(thm)],[c_0_15]) ).

fof(c_0_22,plain,
    ! [X48,X49] :
      ( ( iext(uri_rdf_type,X48,X49)
        | ~ icext(X49,X48) )
      & ( icext(X49,X48)
        | ~ iext(uri_rdf_type,X48,X49) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdfs_cext_def])])]) ).

cnf(c_0_23,plain,
    ( ~ iext(X1,esk1_1(X1),esk1_1(X1))
    | icext(uri_owl_ReflexiveProperty,X1) ),
    inference(csr,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_24,plain,
    iext(uri_ex_p,X1,X2),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).

fof(c_0_25,negated_conjecture,
    ~ iext(uri_rdf_type,uri_ex_p,uri_owl_ReflexiveProperty),
    inference(fof_nnf,[status(thm)],[c_0_21]) ).

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

cnf(c_0_27,plain,
    icext(uri_owl_ReflexiveProperty,uri_ex_p),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_28,negated_conjecture,
    ~ iext(uri_rdf_type,uri_ex_p,uri_owl_ReflexiveProperty),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWB049+1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.35  % Computer : n001.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 07:49:13 UTC 2026
% 0.10/0.35  % CPUTime  : 
% 0.10/0.35  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.39  Running first-order theorem proving
% 0.13/0.39  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
% 0.13/0.44  % Version: 3.5.1
% 0.13/0.44  % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.13/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.13/0.44  % Starting new_bool_3 with 600s (2) cores
% 0.13/0.44  % Starting new_bool_1 with 600s (2) cores
% 0.13/0.44  % Starting sh5l with 300s (1) cores
% 0.13/0.44  % new_bool_1 with pid 2597714 completed with status 0
% 0.13/0.44  % Result found by new_bool_1
% 0.13/0.44  % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.13/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.13/0.44  % Starting new_bool_3 with 600s (2) cores
% 0.13/0.44  % Starting new_bool_1 with 600s (2) cores
% 0.13/0.44  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.44  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.44  % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.13/0.44  % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 0.13/0.44  % Starting SubtermCWHack with 55s (1) cores
% 0.13/0.44  % Starting new_bool_1 with 61s (1) cores
% 0.13/0.44  % SubtermCWHack with pid 2597716 completed with status 0
% 0.13/0.44  % Result found by SubtermCWHack
% 0.13/0.44  % Preprocessing class: FSLMSMSLSSSNFFN.
% 0.13/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.13/0.44  % Starting new_bool_3 with 600s (2) cores
% 0.13/0.44  % Starting new_bool_1 with 600s (2) cores
% 0.13/0.44  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.44  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.44  % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.13/0.44  % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 0.13/0.44  % Starting SubtermCWHack with 55s (1) cores
% 0.13/0.44  % Preprocessing time       : 0.002 s
% 0.13/0.44  
% 0.13/0.44  % Proof found!
% 0.13/0.44  % SZS status Theorem
% 0.13/0.44  % SZS output start CNFRefutation
% See solution above
% 0.13/0.44  % Parsed axioms                        : 560
% 0.13/0.44  % Removed by relevancy pruning/SinE    : 517
% 0.13/0.44  % Initial clauses                      : 69
% 0.13/0.44  % Removed in clause preprocessing      : 0
% 0.13/0.44  % Initial clauses in saturation        : 69
% 0.13/0.44  % Processed clauses                    : 109
% 0.13/0.44  % ...of these trivial                  : 14
% 0.13/0.44  % ...subsumed                          : 18
% 0.13/0.44  % ...remaining for further processing  : 77
% 0.13/0.44  % Other redundant clauses eliminated   : 0
% 0.13/0.44  % Clauses deleted for lack of memory   : 0
% 0.13/0.44  % Backward-subsumed                    : 0
% 0.13/0.44  % Backward-rewritten                   : 1
% 0.13/0.44  % Generated clauses                    : 99
% 0.13/0.44  % ...of the previous two non-redundant : 49
% 0.13/0.44  % ...aggressively subsumed             : 0
% 0.13/0.44  % Contextual simplify-reflections      : 1
% 0.13/0.44  % Paramodulations                      : 99
% 0.13/0.44  % Factorizations                       : 0
% 0.13/0.44  % NegExts                              : 0
% 0.13/0.44  % Equation resolutions                 : 0
% 0.13/0.44  % Disequality decompositions           : 0
% 0.13/0.44  % Total rewrite steps                  : 71
% 0.13/0.44  % ...of those cached                   : 51
% 0.13/0.44  % Propositional unsat checks           : 0
% 0.13/0.44  %    Propositional check models        : 0
% 0.13/0.44  %    Propositional check unsatisfiable : 0
% 0.13/0.44  %    Propositional clauses             : 0
% 0.13/0.44  %    Propositional clauses after purity: 0
% 0.13/0.44  %    Propositional unsat core size     : 0
% 0.13/0.44  %    Propositional preprocessing time  : 0.000
% 0.13/0.44  %    Propositional encoding time       : 0.000
% 0.13/0.44  %    Propositional solver time         : 0.000
% 0.13/0.44  %    Success case prop preproc time    : 0.000
% 0.13/0.44  %    Success case prop encoding time   : 0.000
% 0.13/0.44  %    Success case prop solver time     : 0.000
% 0.13/0.44  % Current number of processed clauses  : 76
% 0.13/0.44  %    Positive orientable unit clauses  : 36
% 0.13/0.44  %    Positive unorientable unit clauses: 0
% 0.13/0.44  %    Negative unit clauses             : 1
% 0.13/0.44  %    Non-unit-clauses                  : 39
% 0.13/0.44  % Current number of unprocessed clauses: 8
% 0.13/0.44  % ...number of literals in the above   : 33
% 0.13/0.44  % Current number of archived formulas  : 0
% 0.13/0.44  % Current number of archived clauses   : 1
% 0.13/0.44  % Clause-clause subsumption calls (NU) : 260
% 0.13/0.44  % Rec. Clause-clause subsumption calls : 235
% 0.13/0.44  % Non-unit clause-clause subsumptions  : 19
% 0.13/0.44  % Unit Clause-clause subsumption calls : 17
% 0.13/0.44  % Rewrite failures with RHS unbound    : 0
% 0.13/0.44  % BW rewrite match attempts            : 6
% 0.13/0.44  % BW rewrite match successes           : 1
% 0.13/0.44  % Condensation attempts                : 0
% 0.13/0.44  % Condensation successes               : 0
% 0.13/0.44  % Termbank termtop insertions          : 11083
% 0.13/0.44  % Search garbage collected termcells   : 3545
% 0.13/0.44  
% 0.13/0.44  % -------------------------------------------------
% 0.13/0.44  % User time                : 0.006 s
% 0.13/0.44  % System time              : 0.003 s
% 0.13/0.44  % Total time               : 0.009 s
% 0.13/0.44  % Maximum resident set size: 4384 pages
% 0.13/0.44  
% 0.13/0.44  % -------------------------------------------------
% 0.13/0.44  % User time                : 0.025 s
% 0.13/0.44  % System time              : 0.008 s
% 0.13/0.44  % Total time               : 0.033 s
% 0.13/0.44  % Maximum resident set size: 5376 pages
% 0.13/0.44  % E exiting
%------------------------------------------------------------------------------