↑ Up

E---3.5.1.THM-CRf.s

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

% Result   : Theorem 220.17s 72.74s
% Output   : CNFRefutation 220.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   36 (  12 unt;   0 def)
%            Number of atoms       :  117 (   0 equ)
%            Maximal formula atoms :   20 (   3 avg)
%            Number of connectives :  134 (  53   ~;  58   |;  17   &)
%                                         (   4 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-2 aty)
%            Number of variables   :   65 (   4 sgn  34   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(owl_prop_inverseof_ext,axiom,
    ! [X4,X7] :
      ( iext(uri_owl_inverseOf,X4,X7)
     => ( ip(X7)
        & ip(X4) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWB001+0.ax',owl_prop_inverseof_ext) ).

fof(conclusion_rdfbased_sem_inv_trans,conjecture,
    iext(uri_owl_equivalentProperty,uri_ex_p3,uri_ex_p1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conclusion_rdfbased_sem_inv_trans) ).

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/sandbox/benchmark/Axioms/SWB001+0.ax',owl_eqdis_equivalentproperty) ).

fof(premise_rdfbased_sem_inv_trans,axiom,
    ( iext(uri_owl_inverseOf,uri_ex_p2,uri_ex_p1)
    & iext(uri_owl_inverseOf,uri_ex_p3,uri_ex_p2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_rdfbased_sem_inv_trans) ).

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

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

fof(c_0_6,plain,
    ! [X81,X82] :
      ( ( ~ iext(uri_owl_inverseOf,X81,X82)
        | ip(X82) )
      & ( ~ iext(uri_owl_inverseOf,X81,X82)
        | ip(X81) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_prop_inverseof_ext])])])]) ).

fof(c_0_7,negated_conjecture,
    ~ iext(uri_owl_equivalentProperty,uri_ex_p3,uri_ex_p1),
    inference(assume_negation,[status(cth)],[conclusion_rdfbased_sem_inv_trans]) ).

fof(c_0_8,plain,
    ! [X47,X48,X49,X50,X51,X52,X53,X54] :
      ( ( iext(uri_owl_equivalentProperty,X53,X54)
        | ~ ip(X54)
        | ~ ip(X53)
        | iext(X54,esk1_2(X53,X54),esk2_2(X53,X54))
        | iext(X53,esk1_2(X53,X54),esk2_2(X53,X54)) )
      & ( iext(uri_owl_equivalentProperty,X53,X54)
        | ~ ip(X54)
        | ~ ip(X53)
        | ~ iext(X54,esk1_2(X53,X54),esk2_2(X53,X54))
        | ~ iext(X53,esk1_2(X53,X54),esk2_2(X53,X54)) )
      & ( ~ iext(uri_owl_equivalentProperty,X47,X48)
        | iext(X47,X51,X52)
        | ~ iext(X48,X51,X52) )
      & ( ~ iext(uri_owl_equivalentProperty,X47,X48)
        | iext(X48,X49,X50)
        | ~ iext(X47,X49,X50) )
      & ( ~ iext(uri_owl_equivalentProperty,X47,X48)
        | ip(X48) )
      & ( ~ iext(uri_owl_equivalentProperty,X47,X48)
        | ip(X47) ) ),
    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_9,plain,
    ( ~ iext(uri_owl_inverseOf,X2,X1)
    | ip(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    iext(uri_owl_inverseOf,uri_ex_p2,uri_ex_p1),
    inference(split_conjunct,[status(thm)],[premise_rdfbased_sem_inv_trans]) ).

fof(c_0_11,negated_conjecture,
    ~ iext(uri_owl_equivalentProperty,uri_ex_p3,uri_ex_p1),
    inference(fof_simplification,[status(thm)],[c_0_7]) ).

fof(c_0_12,plain,
    ! [X83,X84,X85,X86,X87,X88,X89,X90] :
      ( ( iext(uri_owl_inverseOf,X89,X90)
        | ~ ip(X90)
        | ~ ip(X89)
        | iext(X90,esk8_2(X89,X90),esk7_2(X89,X90))
        | iext(X89,esk7_2(X89,X90),esk8_2(X89,X90)) )
      & ( iext(uri_owl_inverseOf,X89,X90)
        | ~ ip(X90)
        | ~ ip(X89)
        | ~ iext(X90,esk8_2(X89,X90),esk7_2(X89,X90))
        | ~ iext(X89,esk7_2(X89,X90),esk8_2(X89,X90)) )
      & ( ~ iext(uri_owl_inverseOf,X83,X84)
        | iext(X83,X87,X88)
        | ~ iext(X84,X88,X87) )
      & ( ~ iext(uri_owl_inverseOf,X83,X84)
        | iext(X84,X86,X85)
        | ~ iext(X83,X85,X86) )
      & ( ~ iext(uri_owl_inverseOf,X83,X84)
        | ip(X84) )
      & ( ~ iext(uri_owl_inverseOf,X83,X84)
        | ip(X83) ) ),
    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_inv])])])])])])]) ).

cnf(c_0_13,plain,
    ( ~ ip(X2)
    | ~ ip(X1)
    | iext(uri_owl_equivalentProperty,X1,X2)
    | iext(X2,esk1_2(X1,X2),esk2_2(X1,X2))
    | iext(X1,esk1_2(X1,X2),esk2_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_14,plain,
    ip(uri_ex_p1),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_15,plain,
    ( ~ iext(uri_owl_inverseOf,X1,X2)
    | ip(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_16,plain,
    iext(uri_owl_inverseOf,uri_ex_p3,uri_ex_p2),
    inference(split_conjunct,[status(thm)],[premise_rdfbased_sem_inv_trans]) ).

fof(c_0_17,negated_conjecture,
    ~ iext(uri_owl_equivalentProperty,uri_ex_p3,uri_ex_p1),
    inference(fof_nnf,[status(thm)],[c_0_11]) ).

fof(c_0_18,plain,
    ! [X42,X43,X44] :
      ( ip(X43)
      | ~ iext(X43,X42,X44) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[simple_iext_property])])]) ).

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

cnf(c_0_20,plain,
    ( ~ ip(X1)
    | iext(uri_owl_equivalentProperty,X1,uri_ex_p1)
    | iext(X1,esk1_2(X1,uri_ex_p1),esk2_2(X1,uri_ex_p1))
    | iext(uri_ex_p1,esk1_2(X1,uri_ex_p1),esk2_2(X1,uri_ex_p1)) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_21,plain,
    ip(uri_ex_p3),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_22,negated_conjecture,
    ~ iext(uri_owl_equivalentProperty,uri_ex_p3,uri_ex_p1),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

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

cnf(c_0_24,plain,
    ( ~ ip(X2)
    | ~ ip(X1)
    | ~ iext(X2,esk1_2(X1,X2),esk2_2(X1,X2))
    | ~ iext(X1,esk1_2(X1,X2),esk2_2(X1,X2))
    | iext(uri_owl_equivalentProperty,X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

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

cnf(c_0_26,plain,
    ( ~ iext(uri_ex_p1,X2,X1)
    | iext(uri_ex_p2,X1,X2) ),
    inference(spm,[status(thm)],[c_0_19,c_0_10]) ).

cnf(c_0_27,plain,
    ( iext(uri_ex_p1,esk1_2(uri_ex_p3,uri_ex_p1),esk2_2(uri_ex_p3,uri_ex_p1))
    | iext(uri_ex_p3,esk1_2(uri_ex_p3,uri_ex_p1),esk2_2(uri_ex_p3,uri_ex_p1)) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).

cnf(c_0_28,plain,
    ( ~ iext(uri_ex_p3,X2,X1)
    | iext(uri_ex_p2,X1,X2) ),
    inference(spm,[status(thm)],[c_0_23,c_0_16]) ).

cnf(c_0_29,plain,
    ( ~ iext(X1,esk1_2(X1,X2),esk2_2(X1,X2))
    | ~ iext(X2,esk1_2(X1,X2),esk2_2(X1,X2))
    | iext(uri_owl_equivalentProperty,X1,X2) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_24,c_0_25]),c_0_25]) ).

cnf(c_0_30,plain,
    ( ~ iext(uri_ex_p2,X2,X1)
    | iext(uri_ex_p1,X1,X2) ),
    inference(spm,[status(thm)],[c_0_23,c_0_10]) ).

cnf(c_0_31,plain,
    ( ~ iext(uri_ex_p2,X2,X1)
    | iext(uri_ex_p3,X1,X2) ),
    inference(spm,[status(thm)],[c_0_19,c_0_16]) ).

cnf(c_0_32,plain,
    iext(uri_ex_p2,esk2_2(uri_ex_p3,uri_ex_p1),esk1_2(uri_ex_p3,uri_ex_p1)),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).

cnf(c_0_33,plain,
    ( ~ iext(X1,esk1_2(X1,uri_ex_p1),esk2_2(X1,uri_ex_p1))
    | ~ iext(uri_ex_p2,esk2_2(X1,uri_ex_p1),esk1_2(X1,uri_ex_p1))
    | iext(uri_owl_equivalentProperty,X1,uri_ex_p1) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_34,plain,
    iext(uri_ex_p3,esk1_2(uri_ex_p3,uri_ex_p1),esk2_2(uri_ex_p3,uri_ex_p1)),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_35,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_32]),c_0_34])]),c_0_22]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWB067+1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.35  % Computer : n014.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Mon Sep 21 07:45:04 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.35  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.39  Running first-order theorem proving
% 0.13/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
% 220.17/72.74  % Version: 3.5.1
% 220.17/72.74  % Preprocessing class: FSLMSMSLSSSNFFN.
% 220.17/72.74  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 220.17/72.74  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 220.17/72.74  % Starting new_bool_3 with 600s (2) cores
% 220.17/72.74  % Starting new_bool_1 with 600s (2) cores
% 220.17/72.74  % Starting sh5l with 300s (1) cores
% 220.17/72.74  % new_bool_1 with pid 3560534 completed with status 9
% 220.17/72.74  % new_bool_3 with pid 3560533 completed with status 9
% 220.17/72.74  % sh5l with pid 3560535 completed with status 0
% 220.17/72.74  % Result found by sh5l
% 220.17/72.74  % Preprocessing class: FSLMSMSLSSSNFFN.
% 220.17/72.74  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 220.17/72.74  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 220.17/72.74  % Starting new_bool_3 with 600s (2) cores
% 220.17/72.74  % Starting new_bool_1 with 600s (2) cores
% 220.17/72.74  % Starting sh5l with 300s (1) cores
% 220.17/72.74  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 220.17/72.74  % SinE strategy is gf500_gu_R04_F100_L20000
% 220.17/72.74  % Search class: FGHSF-FSLM33-SFFFFFNN
% 220.17/72.74  % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 220.17/72.74  % Starting SubtermCWHack with 28s (1) cores
% 220.17/72.74  % SubtermCWHack with pid 3560546 completed with status 8
% 220.17/72.74  % Starting sh5l with 31s (1) cores
% 220.17/72.74  % sh5l with pid 3560600 completed with status 8
% 220.17/72.74  % Starting G-E--_302_C18_F1_URBAN_S0Y with 28s (1) cores
% 220.17/72.74  % G-E--_302_C18_F1_URBAN_S0Y with pid 3561022 completed with status 0
% 220.17/72.74  % Result found by G-E--_302_C18_F1_URBAN_S0Y
% 220.17/72.74  % Preprocessing class: FSLMSMSLSSSNFFN.
% 220.17/72.74  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 220.17/72.74  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 220.17/72.74  % Starting new_bool_3 with 600s (2) cores
% 220.17/72.74  % Starting new_bool_1 with 600s (2) cores
% 220.17/72.74  % Starting sh5l with 300s (1) cores
% 220.17/72.74  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 220.17/72.74  % SinE strategy is gf500_gu_R04_F100_L20000
% 220.17/72.74  % Search class: FGHSF-FSLM33-SFFFFFNN
% 220.17/72.74  % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 220.17/72.74  % Starting SubtermCWHack with 28s (1) cores
% 220.17/72.74  % SubtermCWHack with pid 3560546 completed with status 8
% 220.17/72.74  % Starting sh5l with 31s (1) cores
% 220.17/72.74  % sh5l with pid 3560600 completed with status 8
% 220.17/72.74  % Starting G-E--_302_C18_F1_URBAN_S0Y with 28s (1) cores
% 220.17/72.74  % Preprocessing time       : 0.029 s
% 220.17/72.74  
% 220.17/72.74  % Proof found!
% 220.17/72.74  % SZS status Theorem
% 220.17/72.74  % SZS output start CNFRefutation
% See solution above
% 220.17/72.74  % Parsed axioms                        : 560
% 220.17/72.74  % Removed by relevancy pruning/SinE    : 330
% 220.17/72.74  % Initial clauses                      : 627
% 220.17/72.74  % Removed in clause preprocessing      : 0
% 220.17/72.74  % Initial clauses in saturation        : 627
% 220.17/72.74  % Processed clauses                    : 5956
% 220.17/72.74  % ...of these trivial                  : 237
% 220.17/72.74  % ...subsumed                          : 1339
% 220.17/72.74  % ...remaining for further processing  : 4380
% 220.17/72.74  % Other redundant clauses eliminated   : 8
% 220.17/72.74  % Clauses deleted for lack of memory   : 0
% 220.17/72.74  % Backward-subsumed                    : 29
% 220.17/72.74  % Backward-rewritten                   : 56
% 220.17/72.74  % Generated clauses                    : 239259
% 220.17/72.74  % ...of the previous two non-redundant : 235715
% 220.17/72.74  % ...aggressively subsumed             : 0
% 220.17/72.74  % Contextual simplify-reflections      : 52
% 220.17/72.74  % Paramodulations                      : 239251
% 220.17/72.74  % Factorizations                       : 0
% 220.17/72.74  % NegExts                              : 0
% 220.17/72.74  % Equation resolutions                 : 8
% 220.17/72.74  % Disequality decompositions           : 0
% 220.17/72.74  % Total rewrite steps                  : 29928
% 220.17/72.74  % ...of those cached                   : 29341
% 220.17/72.74  % Propositional unsat checks           : 0
% 220.17/72.74  %    Propositional check models        : 0
% 220.17/72.74  %    Propositional check unsatisfiable : 0
% 220.17/72.74  %    Propositional clauses             : 0
% 220.17/72.74  %    Propositional clauses after purity: 0
% 220.17/72.74  %    Propositional unsat core size     : 0
% 220.17/72.74  %    Propositional preprocessing time  : 0.000
% 220.17/72.74  %    Propositional encoding time       : 0.000
% 220.17/72.74  %    Propositional solver time         : 0.000
% 220.17/72.74  %    Success case prop preproc time    : 0.000
% 220.17/72.74  %    Success case prop encoding time   : 0.000
% 220.17/72.74  %    Success case prop solver time     : 0.000
% 220.17/72.74  % Current number of processed clauses  : 4287
% 220.17/72.74  %    Positive orientable unit clauses  : 453
% 220.17/72.74  %    Positive unorientable unit clauses: 0
% 220.17/72.74  %    Negative unit clauses             : 1
% 220.17/72.74  %    Non-unit-clauses                  : 3833
% 220.17/72.74  % Current number of unprocessed clauses: 229903
% 220.17/72.74  % ...number of literals in the above   : 3093927
% 220.17/72.74  % Current number of archived formulas  : 0
% 220.17/72.74  % Current number of archived clauses   : 85
% 220.17/72.74  % Clause-clause subsumption calls (NU) : 4968384
% 220.17/72.74  % Rec. Clause-clause subsumption calls : 290776
% 220.17/72.74  % Non-unit clause-clause subsumptions  : 1419
% 220.17/72.74  % Unit Clause-clause subsumption calls : 56491
% 220.17/72.74  % Rewrite failures with RHS unbound    : 0
% 220.17/72.74  % BW rewrite match attempts            : 215
% 220.17/72.74  % BW rewrite match successes           : 2
% 220.17/72.74  % Condensation attempts                : 0
% 220.17/72.74  % Condensation successes               : 0
% 220.17/72.74  % Termbank termtop insertions          : 10242515
% 220.17/72.74  % Search garbage collected termcells   : 12053
% 220.17/72.74  
% 220.17/72.74  % -------------------------------------------------
% 220.17/72.74  % User time                : 70.185 s
% 220.17/72.74  % System time              : 1.667 s
% 220.17/72.74  % Total time               : 71.852 s
% 220.17/72.74  % Maximum resident set size: 5920 pages
% 220.17/72.74  
% 220.17/72.74  % -------------------------------------------------
% 220.17/72.74  % User time                : 74.206 s
% 220.17/72.74  % System time              : 1.795 s
% 220.17/72.74  % Total time               : 76.001 s
% 220.17/72.74  % Maximum resident set size: 5376 pages
% 220.17/72.74  % E exiting
%------------------------------------------------------------------------------