↑ Up

E---3.5.1.THM-CRf.s

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

% Result   : Theorem 11.82s 2.06s
% Output   : CNFRefutation 11.82s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   34 (  14 unt;   0 def)
%            Number of atoms       :  104 (   0 equ)
%            Maximal formula atoms :   15 (   3 avg)
%            Number of connectives :  113 (  43   ~;  40   |;  21   &)
%                                         (   3 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   46 (   1 sgn  27   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(owl_bool_complementof_class,axiom,
    ! [X11,X5] :
      ( iext(uri_owl_complementOf,X11,X5)
     => ( ! [X4] :
            ( icext(X11,X4)
          <=> ~ icext(X5,X4) )
        & ic(X5)
        & ic(X11) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWB001+0.ax',owl_bool_complementof_class) ).

fof(conclusion_rdfbased_sem_bool_tollens,conjecture,
    iext(uri_rdfs_subClassOf,uri_ex_n2,uri_ex_n1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conclusion_rdfbased_sem_bool_tollens) ).

fof(owl_prop_complementof_ext,axiom,
    ! [X4,X7] :
      ( iext(uri_owl_complementOf,X4,X7)
     => ( ic(X7)
        & ic(X4) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWB001+0.ax',owl_prop_complementof_ext) ).

fof(owl_rdfsext_subclassof,axiom,
    ! [X13,X15] :
      ( iext(uri_rdfs_subClassOf,X13,X15)
    <=> ( ! [X4] :
            ( icext(X13,X4)
           => icext(X15,X4) )
        & ic(X15)
        & ic(X13) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWB001+0.ax',owl_rdfsext_subclassof) ).

fof(premise_rdfbased_sem_bool_tollens,axiom,
    ( iext(uri_rdfs_subClassOf,uri_ex_c1,uri_ex_c2)
    & iext(uri_owl_complementOf,uri_ex_n1,uri_ex_c1)
    & iext(uri_owl_complementOf,uri_ex_n2,uri_ex_c2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_rdfbased_sem_bool_tollens) ).

fof(rdfs_subclassof_main,axiom,
    ! [X5,X6] :
      ( iext(uri_rdfs_subClassOf,X5,X6)
     => ( ! [X4] :
            ( icext(X5,X4)
           => icext(X6,X4) )
        & ic(X6)
        & ic(X5) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWB001+0.ax',rdfs_subclassof_main) ).

fof(c_0_6,plain,
    ! [X11,X5] :
      ( iext(uri_owl_complementOf,X11,X5)
     => ( ! [X4] :
            ( icext(X11,X4)
          <=> ~ icext(X5,X4) )
        & ic(X5)
        & ic(X11) ) ),
    inference(fof_simplification,[status(thm)],[owl_bool_complementof_class]) ).

fof(c_0_7,negated_conjecture,
    ~ iext(uri_rdfs_subClassOf,uri_ex_n2,uri_ex_n1),
    inference(assume_negation,[status(cth)],[conclusion_rdfbased_sem_bool_tollens]) ).

fof(c_0_8,plain,
    ! [X252,X253,X254] :
      ( ( ~ iext(uri_owl_complementOf,X252,X253)
        | icext(X252,X254)
        | icext(X253,X254) )
      & ( ~ iext(uri_owl_complementOf,X252,X253)
        | ~ icext(X253,X254)
        | ~ icext(X252,X254) )
      & ( ~ iext(uri_owl_complementOf,X252,X253)
        | ic(X253) )
      & ( ~ iext(uri_owl_complementOf,X252,X253)
        | ic(X252) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])]) ).

fof(c_0_9,plain,
    ! [X164,X165] :
      ( ( ~ iext(uri_owl_complementOf,X164,X165)
        | ic(X165) )
      & ( ~ iext(uri_owl_complementOf,X164,X165)
        | ic(X164) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_prop_complementof_ext])])])]) ).

fof(c_0_10,negated_conjecture,
    ~ iext(uri_rdfs_subClassOf,uri_ex_n2,uri_ex_n1),
    inference(fof_simplification,[status(thm)],[c_0_7]) ).

fof(c_0_11,plain,
    ! [X767,X768,X769,X770,X771] :
      ( ( iext(uri_rdfs_subClassOf,X770,X771)
        | ~ ic(X771)
        | ~ ic(X770)
        | ~ icext(X771,esk109_2(X770,X771)) )
      & ( iext(uri_rdfs_subClassOf,X770,X771)
        | ~ ic(X771)
        | ~ ic(X770)
        | icext(X770,esk109_2(X770,X771)) )
      & ( ~ iext(uri_rdfs_subClassOf,X767,X768)
        | icext(X768,X769)
        | ~ icext(X767,X769) )
      & ( ~ iext(uri_rdfs_subClassOf,X767,X768)
        | ic(X768) )
      & ( ~ iext(uri_rdfs_subClassOf,X767,X768)
        | ic(X767) ) ),
    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_rdfsext_subclassof])])])])])])]) ).

cnf(c_0_12,plain,
    ( ~ iext(uri_owl_complementOf,X3,X1)
    | icext(X3,X2)
    | icext(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,plain,
    iext(uri_owl_complementOf,uri_ex_n1,uri_ex_c1),
    inference(split_conjunct,[status(thm)],[premise_rdfbased_sem_bool_tollens]) ).

cnf(c_0_14,plain,
    ( ~ iext(uri_owl_complementOf,X1,X2)
    | ic(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_15,plain,
    ! [X64,X65,X66] :
      ( ( ~ iext(uri_rdfs_subClassOf,X64,X65)
        | icext(X65,X66)
        | ~ icext(X64,X66) )
      & ( ~ iext(uri_rdfs_subClassOf,X64,X65)
        | ic(X65) )
      & ( ~ iext(uri_rdfs_subClassOf,X64,X65)
        | ic(X64) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdfs_subclassof_main])])])])]) ).

fof(c_0_16,negated_conjecture,
    ~ iext(uri_rdfs_subClassOf,uri_ex_n2,uri_ex_n1),
    inference(fof_nnf,[status(thm)],[c_0_10]) ).

cnf(c_0_17,plain,
    ( ~ ic(X1)
    | ~ ic(X2)
    | ~ icext(X1,esk109_2(X2,X1))
    | iext(uri_rdfs_subClassOf,X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_18,plain,
    ( icext(uri_ex_c1,X1)
    | icext(uri_ex_n1,X1) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_19,plain,
    ic(uri_ex_n1),
    inference(spm,[status(thm)],[c_0_14,c_0_13]) ).

cnf(c_0_20,plain,
    iext(uri_owl_complementOf,uri_ex_n2,uri_ex_c2),
    inference(split_conjunct,[status(thm)],[premise_rdfbased_sem_bool_tollens]) ).

cnf(c_0_21,plain,
    ( ~ iext(uri_rdfs_subClassOf,X1,X3)
    | ~ icext(X1,X2)
    | icext(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_22,plain,
    iext(uri_rdfs_subClassOf,uri_ex_c1,uri_ex_c2),
    inference(split_conjunct,[status(thm)],[premise_rdfbased_sem_bool_tollens]) ).

cnf(c_0_23,negated_conjecture,
    ~ iext(uri_rdfs_subClassOf,uri_ex_n2,uri_ex_n1),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_24,plain,
    ( ~ ic(X1)
    | iext(uri_rdfs_subClassOf,X1,uri_ex_n1)
    | icext(uri_ex_c1,esk109_2(X1,uri_ex_n1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).

cnf(c_0_25,plain,
    ic(uri_ex_n2),
    inference(spm,[status(thm)],[c_0_14,c_0_20]) ).

cnf(c_0_26,plain,
    ( ~ iext(uri_owl_complementOf,X1,X3)
    | ~ icext(X3,X2)
    | ~ icext(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_27,plain,
    ( ~ icext(uri_ex_c1,X1)
    | icext(uri_ex_c2,X1) ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_28,negated_conjecture,
    icext(uri_ex_c1,esk109_2(uri_ex_n2,uri_ex_n1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).

cnf(c_0_29,plain,
    ( ~ ic(X2)
    | ~ ic(X1)
    | iext(uri_rdfs_subClassOf,X1,X2)
    | icext(X1,esk109_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_30,plain,
    ( ~ icext(uri_ex_n2,X1)
    | ~ icext(uri_ex_c2,X1) ),
    inference(spm,[status(thm)],[c_0_26,c_0_20]) ).

cnf(c_0_31,negated_conjecture,
    icext(uri_ex_c2,esk109_2(uri_ex_n2,uri_ex_n1)),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_32,negated_conjecture,
    icext(uri_ex_n2,esk109_2(uri_ex_n2,uri_ex_n1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_29]),c_0_19]),c_0_25])]) ).

cnf(c_0_33,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWB040+1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36  % Computer : n017.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 21 07:38:43 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.40  Running first-order theorem proving
% 0.10/0.40  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
% 11.82/2.06  % Version: 3.5.1
% 11.82/2.06  % Preprocessing class: FSLMSMSLSSSNFFN.
% 11.82/2.06  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.82/2.06  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 11.82/2.06  % Starting new_bool_3 with 600s (2) cores
% 11.82/2.06  % Starting new_bool_1 with 600s (2) cores
% 11.82/2.06  % Starting sh5l with 300s (1) cores
% 11.82/2.06  % G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 1805363 completed with status 0
% 11.82/2.06  % Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 11.82/2.06  % Preprocessing class: FSLMSMSLSSSNFFN.
% 11.82/2.06  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.82/2.06  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 11.82/2.06  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 11.82/2.06  % No SInE strategy applied
% 11.82/2.06  % Search class: FGHSM-SMLM33-SFFFFFNN
% 11.82/2.06  % partial match(1): FGHSM-SMLM33-DFFFFFNN
% 11.82/2.06  % Scheduled 7 strats onto 3 cores with 900 seconds (900 total)
% 11.82/2.06  % Starting SubtermCWHack with 82s (1) cores
% 11.82/2.06  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 91s (1) cores
% 11.82/2.06  % Starting U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 82s (1) cores
% 11.82/2.06  % G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 1805377 completed with status 0
% 11.82/2.06  % Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 11.82/2.06  % Preprocessing class: FSLMSMSLSSSNFFN.
% 11.82/2.06  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.82/2.06  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 11.82/2.06  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 11.82/2.06  % No SInE strategy applied
% 11.82/2.06  % Search class: FGHSM-SMLM33-SFFFFFNN
% 11.82/2.06  % partial match(1): FGHSM-SMLM33-DFFFFFNN
% 11.82/2.06  % Scheduled 7 strats onto 3 cores with 900 seconds (900 total)
% 11.82/2.06  % Starting SubtermCWHack with 82s (1) cores
% 11.82/2.06  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 91s (1) cores
% 11.82/2.06  % Preprocessing time       : 0.019 s
% 11.82/2.06  
% 11.82/2.06  % Proof found!
% 11.82/2.06  % SZS status Theorem
% 11.82/2.06  % SZS output start CNFRefutation
% See solution above
% 11.82/2.06  % Parsed axioms                        : 560
% 11.82/2.06  % Removed by relevancy pruning/SinE    : 0
% 11.82/2.06  % Initial clauses                      : 1270
% 11.82/2.06  % Removed in clause preprocessing      : 111
% 11.82/2.06  % Initial clauses in saturation        : 1159
% 11.82/2.06  % Processed clauses                    : 10573
% 11.82/2.06  % ...of these trivial                  : 1548
% 11.82/2.06  % ...subsumed                          : 3857
% 11.82/2.06  % ...remaining for further processing  : 5168
% 11.82/2.06  % Other redundant clauses eliminated   : 16
% 11.82/2.06  % Clauses deleted for lack of memory   : 0
% 11.82/2.06  % Backward-subsumed                    : 39
% 11.82/2.06  % Backward-rewritten                   : 32
% 11.82/2.06  % Generated clauses                    : 29152
% 11.82/2.06  % ...of the previous two non-redundant : 22461
% 11.82/2.06  % ...aggressively subsumed             : 0
% 11.82/2.06  % Contextual simplify-reflections      : 42
% 11.82/2.06  % Paramodulations                      : 29134
% 11.82/2.06  % Factorizations                       : 2
% 11.82/2.06  % NegExts                              : 0
% 11.82/2.06  % Equation resolutions                 : 16
% 11.82/2.06  % Disequality decompositions           : 0
% 11.82/2.06  % Total rewrite steps                  : 21706
% 11.82/2.06  % ...of those cached                   : 20285
% 11.82/2.06  % Propositional unsat checks           : 0
% 11.82/2.06  %    Propositional check models        : 0
% 11.82/2.06  %    Propositional check unsatisfiable : 0
% 11.82/2.06  %    Propositional clauses             : 0
% 11.82/2.06  %    Propositional clauses after purity: 0
% 11.82/2.06  %    Propositional unsat core size     : 0
% 11.82/2.06  %    Propositional preprocessing time  : 0.000
% 11.82/2.06  %    Propositional encoding time       : 0.000
% 11.82/2.06  %    Propositional solver time         : 0.000
% 11.82/2.06  %    Success case prop preproc time    : 0.000
% 11.82/2.06  %    Success case prop encoding time   : 0.000
% 11.82/2.06  %    Success case prop solver time     : 0.000
% 11.82/2.06  % Current number of processed clauses  : 5081
% 11.82/2.06  %    Positive orientable unit clauses  : 2279
% 11.82/2.06  %    Positive unorientable unit clauses: 0
% 11.82/2.06  %    Negative unit clauses             : 9
% 11.82/2.06  %    Non-unit-clauses                  : 2793
% 11.82/2.06  % Current number of unprocessed clauses: 13037
% 11.82/2.06  % ...number of literals in the above   : 61946
% 11.82/2.06  % Current number of archived formulas  : 0
% 11.82/2.06  % Current number of archived clauses   : 72
% 11.82/2.06  % Clause-clause subsumption calls (NU) : 1621547
% 11.82/2.06  % Rec. Clause-clause subsumption calls : 889917
% 11.82/2.06  % Non-unit clause-clause subsumptions  : 3917
% 11.82/2.06  % Unit Clause-clause subsumption calls : 506061
% 11.82/2.06  % Rewrite failures with RHS unbound    : 0
% 11.82/2.06  % BW rewrite match attempts            : 1571
% 11.82/2.06  % BW rewrite match successes           : 1
% 11.82/2.06  % Condensation attempts                : 0
% 11.82/2.06  % Condensation successes               : 0
% 11.82/2.06  % Termbank termtop insertions          : 500328
% 11.82/2.06  % Search garbage collected termcells   : 19088
% 11.82/2.06  
% 11.82/2.06  % -------------------------------------------------
% 11.82/2.06  % User time                : 1.413 s
% 11.82/2.06  % System time              : 0.047 s
% 11.82/2.06  % Total time               : 1.460 s
% 11.82/2.06  % Maximum resident set size: 7508 pages
% 11.82/2.06  
% 11.82/2.06  % -------------------------------------------------
% 11.82/2.06  % User time                : 4.252 s
% 11.82/2.06  % System time              : 0.158 s
% 11.82/2.06  % Total time               : 4.410 s
% 11.82/2.06  % Maximum resident set size: 5376 pages
% 11.82/2.06  % E exiting
%------------------------------------------------------------------------------