↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SWB087+1 : 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 : n015.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:38 PM UTC 2026

% Result   : Theorem 5.90s 6.25s
% Output   : CNFRefutation 5.90s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   19 (  10 unt;   0 def)
%            Number of atoms       :   42 (   0 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   42 (  19   ~;  15   |;   5   &)
%                                         (   2 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   8 con; 0-2 aty)
%            Number of variables   :   21 (   1 sgn  12   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(owl_restrict_hasself,axiom,
    ! [X11,X2,X31] :
      ( ( iext(uri_owl_onProperty,X11,X2)
        & iext(uri_owl_hasSelf,X11,X31) )
     => ! [X4] :
          ( icext(X11,X4)
        <=> iext(X2,X4,X4) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWB001+0.ax',owl_restrict_hasself) ).

fof(premise_rdfbased_sem_restrict_hasself_inst_subj,axiom,
    ( iext(uri_ex_p,uri_ex_w,uri_ex_w)
    & iext(uri_owl_onProperty,uri_ex_z,uri_ex_p)
    & iext(uri_owl_hasSelf,uri_ex_z,literal_typed(dat_str_true,uri_xsd_boolean)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_rdfbased_sem_restrict_hasself_inst_subj) ).

fof(conclusion_rdfbased_sem_restrict_hasself_inst_subj,conjecture,
    iext(uri_rdf_type,uri_ex_w,uri_ex_z),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conclusion_rdfbased_sem_restrict_hasself_inst_subj) ).

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

fof(c_0_4,plain,
    ! [X531,X532,X533,X534] :
      ( ( ~ iext(uri_owl_onProperty,X531,X532)
        | ~ iext(uri_owl_hasSelf,X531,X533)
        | icext(X531,X534)
        | ~ iext(X532,X534,X534) )
      & ( ~ iext(uri_owl_onProperty,X531,X532)
        | ~ iext(uri_owl_hasSelf,X531,X533)
        | iext(X532,X534,X534)
        | ~ icext(X531,X534) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_restrict_hasself])])])])]) ).

cnf(c_0_5,plain,
    ( ~ iext(uri_owl_onProperty,X3,X1)
    | ~ iext(uri_owl_hasSelf,X3,X4)
    | ~ iext(X1,X2,X2)
    | icext(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_6,plain,
    iext(uri_owl_hasSelf,uri_ex_z,literal_typed(dat_str_true,uri_xsd_boolean)),
    inference(split_conjunct,[status(thm)],[premise_rdfbased_sem_restrict_hasself_inst_subj]) ).

fof(c_0_7,negated_conjecture,
    ~ iext(uri_rdf_type,uri_ex_w,uri_ex_z),
    inference(assume_negation,[status(cth)],[conclusion_rdfbased_sem_restrict_hasself_inst_subj]) ).

cnf(c_0_8,plain,
    ( ~ iext(X2,X1,X1)
    | ~ iext(uri_owl_onProperty,uri_ex_z,X2)
    | icext(uri_ex_z,X1) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_9,plain,
    iext(uri_owl_onProperty,uri_ex_z,uri_ex_p),
    inference(split_conjunct,[status(thm)],[premise_rdfbased_sem_restrict_hasself_inst_subj]) ).

fof(c_0_10,negated_conjecture,
    ~ iext(uri_rdf_type,uri_ex_w,uri_ex_z),
    inference(fof_simplification,[status(thm)],[c_0_7]) ).

fof(c_0_11,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_12,plain,
    ( ~ iext(uri_ex_p,X1,X1)
    | icext(uri_ex_z,X1) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,plain,
    iext(uri_ex_p,uri_ex_w,uri_ex_w),
    inference(split_conjunct,[status(thm)],[premise_rdfbased_sem_restrict_hasself_inst_subj]) ).

fof(c_0_14,negated_conjecture,
    ~ iext(uri_rdf_type,uri_ex_w,uri_ex_z),
    inference(fof_nnf,[status(thm)],[c_0_10]) ).

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

cnf(c_0_16,plain,
    icext(uri_ex_z,uri_ex_w),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_17,negated_conjecture,
    ~ iext(uri_rdf_type,uri_ex_w,uri_ex_z),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_18,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWB087+1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/5.38  % Computer : n015.cluster.edu
% 0.10/5.38  % Model    : x86_64 x86_64
% 0.10/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38  % Memory   : 8046.5625MB
% 0.10/5.38  % OS       : Linux 6.8.0-71-generic
% 0.10/5.38  % CPULimit : 300
% 0.10/5.38  % WCLimit  : 300
% 0.10/5.38  % DateTime : Mon Sep 21 07:49:12 UTC 2026
% 0.10/5.38  % CPUTime  : 
% 0.10/5.38  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/5.42  Running first-order theorem proving
% 0.14/5.42  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
% 5.90/6.25  % Version: 3.5.1
% 5.90/6.25  % Preprocessing class: FSLMSMSLSSSNFFN.
% 5.90/6.25  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.90/6.25  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 5.90/6.25  % Starting new_bool_3 with 600s (2) cores
% 5.90/6.25  % Starting new_bool_1 with 600s (2) cores
% 5.90/6.25  % Starting sh5l with 300s (1) cores
% 5.90/6.25  % G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 963364 completed with status 0
% 5.90/6.25  % Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 5.90/6.25  % Preprocessing class: FSLMSMSLSSSNFFN.
% 5.90/6.25  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.90/6.25  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 5.90/6.25  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.90/6.25  % No SInE strategy applied
% 5.90/6.25  % Search class: FGHSM-SMLM33-SFFFFFNN
% 5.90/6.25  % partial match(1): FGHSM-SMLM33-DFFFFFNN
% 5.90/6.25  % Scheduled 7 strats onto 3 cores with 900 seconds (900 total)
% 5.90/6.25  % Starting SubtermCWHack with 82s (1) cores
% 5.90/6.25  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 91s (1) cores
% 5.90/6.25  % Starting U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 82s (1) cores
% 5.90/6.25  % G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 963389 completed with status 0
% 5.90/6.25  % Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 5.90/6.25  % Preprocessing class: FSLMSMSLSSSNFFN.
% 5.90/6.25  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.90/6.25  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 5.90/6.25  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.90/6.25  % No SInE strategy applied
% 5.90/6.25  % Search class: FGHSM-SMLM33-SFFFFFNN
% 5.90/6.25  % partial match(1): FGHSM-SMLM33-DFFFFFNN
% 5.90/6.25  % Scheduled 7 strats onto 3 cores with 900 seconds (900 total)
% 5.90/6.25  % Starting SubtermCWHack with 82s (1) cores
% 5.90/6.25  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 91s (1) cores
% 5.90/6.25  % Preprocessing time       : 0.012 s
% 5.90/6.25  
% 5.90/6.25  % Proof found!
% 5.90/6.25  % SZS status Theorem
% 5.90/6.25  % SZS output start CNFRefutation
% See solution above
% 5.90/6.25  % Parsed axioms                        : 560
% 5.90/6.25  % Removed by relevancy pruning/SinE    : 0
% 5.90/6.25  % Initial clauses                      : 1270
% 5.90/6.25  % Removed in clause preprocessing      : 111
% 5.90/6.25  % Initial clauses in saturation        : 1159
% 5.90/6.25  % Processed clauses                    : 9282
% 5.90/6.25  % ...of these trivial                  : 1521
% 5.90/6.25  % ...subsumed                          : 3038
% 5.90/6.25  % ...remaining for further processing  : 4723
% 5.90/6.25  % Other redundant clauses eliminated   : 16
% 5.90/6.25  % Clauses deleted for lack of memory   : 0
% 5.90/6.25  % Backward-subsumed                    : 28
% 5.90/6.25  % Backward-rewritten                   : 0
% 5.90/6.25  % Generated clauses                    : 25062
% 5.90/6.25  % ...of the previous two non-redundant : 19128
% 5.90/6.25  % ...aggressively subsumed             : 0
% 5.90/6.25  % Contextual simplify-reflections      : 24
% 5.90/6.25  % Paramodulations                      : 25044
% 5.90/6.25  % Factorizations                       : 2
% 5.90/6.25  % NegExts                              : 0
% 5.90/6.25  % Equation resolutions                 : 16
% 5.90/6.25  % Disequality decompositions           : 0
% 5.90/6.25  % Total rewrite steps                  : 19226
% 5.90/6.25  % ...of those cached                   : 17862
% 5.90/6.25  % Propositional unsat checks           : 0
% 5.90/6.25  %    Propositional check models        : 0
% 5.90/6.25  %    Propositional check unsatisfiable : 0
% 5.90/6.25  %    Propositional clauses             : 0
% 5.90/6.25  %    Propositional clauses after purity: 0
% 5.90/6.25  %    Propositional unsat core size     : 0
% 5.90/6.25  %    Propositional preprocessing time  : 0.000
% 5.90/6.25  %    Propositional encoding time       : 0.000
% 5.90/6.25  %    Propositional solver time         : 0.000
% 5.90/6.25  %    Success case prop preproc time    : 0.000
% 5.90/6.25  %    Success case prop encoding time   : 0.000
% 5.90/6.25  %    Success case prop solver time     : 0.000
% 5.90/6.25  % Current number of processed clauses  : 4679
% 5.90/6.25  %    Positive orientable unit clauses  : 2237
% 5.90/6.25  %    Positive unorientable unit clauses: 0
% 5.90/6.25  %    Negative unit clauses             : 8
% 5.90/6.25  %    Non-unit-clauses                  : 2434
% 5.90/6.25  % Current number of unprocessed clauses: 11001
% 5.90/6.25  % ...number of literals in the above   : 55190
% 5.90/6.25  % Current number of archived formulas  : 0
% 5.90/6.25  % Current number of archived clauses   : 29
% 5.90/6.25  % Clause-clause subsumption calls (NU) : 1380028
% 5.90/6.25  % Rec. Clause-clause subsumption calls : 688749
% 5.90/6.25  % Non-unit clause-clause subsumptions  : 3079
% 5.90/6.25  % Unit Clause-clause subsumption calls : 442920
% 5.90/6.25  % Rewrite failures with RHS unbound    : 0
% 5.90/6.25  % BW rewrite match attempts            : 1483
% 5.90/6.25  % BW rewrite match successes           : 0
% 5.90/6.25  % Condensation attempts                : 0
% 5.90/6.25  % Condensation successes               : 0
% 5.90/6.25  % Termbank termtop insertions          : 451962
% 5.90/6.25  % Search garbage collected termcells   : 19088
% 5.90/6.25  
% 5.90/6.25  % -------------------------------------------------
% 5.90/6.25  % User time                : 0.744 s
% 5.90/6.25  % System time              : 0.039 s
% 5.90/6.25  % Total time               : 0.783 s
% 5.90/6.25  % Maximum resident set size: 7508 pages
% 5.90/6.25  
% 5.90/6.25  % -------------------------------------------------
% 5.90/6.25  % User time                : 2.123 s
% 5.90/6.25  % System time              : 0.106 s
% 5.90/6.25  % Total time               : 2.228 s
% 5.90/6.25  % Maximum resident set size: 5376 pages
% 5.90/6.25  % E exiting
%------------------------------------------------------------------------------