↑ Up

E-SAT---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : SWB031+2 : 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 : n018.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:39:21 PM UTC 2026

% Result   : Unsatisfiable 0.15s 5.55s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   30 (  18 unt;   0 def)
%            Number of atoms       :  102 (   9 equ)
%            Maximal formula atoms :   26 (   3 avg)
%            Number of connectives :  119 (  47   ~;  46   |;  20   &)
%                                         (   5 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :   12 (  12 usr;  10 con; 0-3 aty)
%            Number of variables   :   47 (  10 sgn  25   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(owl_class_thing_ext,axiom,
    ! [X1] :
      ( icext(uri_owl_Thing,X1)
    <=> ir(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',owl_class_thing_ext) ).

fof(simple_ir,axiom,
    ! [X1] : ir(X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',simple_ir) ).

fof(owl_enum_class_001,axiom,
    ! [X2,X3,X4] :
      ( ( iext(uri_rdf_rest,X3,uri_rdf_nil)
        & iext(uri_rdf_first,X3,X4) )
     => ( iext(uri_owl_oneOf,X2,X3)
      <=> ( ! [X1] :
              ( icext(X2,X1)
            <=> X1 = X4 )
          & ic(X2) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',owl_enum_class_001) ).

fof(testcase_premise_fullish_031_Large_Universe,axiom,
    ? [X7,X8] :
      ( iext(uri_rdf_rest,X8,uri_rdf_nil)
      & iext(uri_rdf_first,X8,uri_ex_w)
      & iext(uri_owl_oneOf,X7,X8)
      & iext(uri_owl_equivalentClass,uri_owl_Thing,X7) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_premise_fullish_031_Large_Universe) ).

fof(owl_eqdis_equivalentclass,axiom,
    ! [X5,X6] :
      ( iext(uri_owl_equivalentClass,X5,X6)
    <=> ( ! [X1] :
            ( icext(X5,X1)
          <=> icext(X6,X1) )
        & ic(X6)
        & ic(X5) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',owl_eqdis_equivalentclass) ).

fof(owl_class_nothing_ext,axiom,
    ! [X1] : ~ icext(uri_owl_Nothing,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',owl_class_nothing_ext) ).

fof(c_0_6,plain,
    ! [X10] :
      ( ( icext(uri_owl_Thing,X10)
        | ~ ir(X10) )
      & ( ir(X10)
        | ~ icext(uri_owl_Thing,X10) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_class_thing_ext])])]) ).

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

fof(c_0_8,plain,
    ! [X12,X13,X14,X15,X16] :
      ( ( ~ iext(uri_rdf_rest,X13,uri_rdf_nil)
        | ~ iext(uri_rdf_first,X13,X14)
        | iext(uri_owl_oneOf,X12,X13)
        | ~ ic(X12)
        | esk1_3(X12,X13,X14) = X14
        | icext(X12,esk1_3(X12,X13,X14)) )
      & ( ~ iext(uri_rdf_rest,X13,uri_rdf_nil)
        | ~ iext(uri_rdf_first,X13,X14)
        | iext(uri_owl_oneOf,X12,X13)
        | ~ ic(X12)
        | esk1_3(X12,X13,X14) != X14
        | ~ icext(X12,esk1_3(X12,X13,X14)) )
      & ( ~ iext(uri_rdf_rest,X13,uri_rdf_nil)
        | ~ iext(uri_rdf_first,X13,X14)
        | ~ iext(uri_owl_oneOf,X12,X13)
        | icext(X12,X16)
        | X16 != X14 )
      & ( ~ iext(uri_rdf_rest,X13,uri_rdf_nil)
        | ~ iext(uri_rdf_first,X13,X14)
        | ~ iext(uri_owl_oneOf,X12,X13)
        | X15 = X14
        | ~ icext(X12,X15) )
      & ( ~ iext(uri_rdf_rest,X13,uri_rdf_nil)
        | ~ iext(uri_rdf_first,X13,X14)
        | ~ iext(uri_owl_oneOf,X12,X13)
        | ic(X12) ) ),
    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_enum_class_001])])])])])])]) ).

fof(c_0_9,plain,
    ( iext(uri_rdf_rest,esk4_0,uri_rdf_nil)
    & iext(uri_rdf_first,esk4_0,uri_ex_w)
    & iext(uri_owl_oneOf,esk3_0,esk4_0)
    & iext(uri_owl_equivalentClass,uri_owl_Thing,esk3_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[testcase_premise_fullish_031_Large_Universe])]) ).

fof(c_0_10,plain,
    ! [X18,X19,X20,X21,X22,X23] :
      ( ( iext(uri_owl_equivalentClass,X22,X23)
        | ~ ic(X23)
        | ~ ic(X22)
        | icext(X23,esk2_2(X22,X23))
        | icext(X22,esk2_2(X22,X23)) )
      & ( iext(uri_owl_equivalentClass,X22,X23)
        | ~ ic(X23)
        | ~ ic(X22)
        | ~ icext(X23,esk2_2(X22,X23))
        | ~ icext(X22,esk2_2(X22,X23)) )
      & ( ~ iext(uri_owl_equivalentClass,X18,X19)
        | icext(X18,X21)
        | ~ icext(X19,X21) )
      & ( ~ iext(uri_owl_equivalentClass,X18,X19)
        | icext(X19,X20)
        | ~ icext(X18,X20) )
      & ( ~ iext(uri_owl_equivalentClass,X18,X19)
        | ic(X19) )
      & ( ~ iext(uri_owl_equivalentClass,X18,X19)
        | ic(X18) ) ),
    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_equivalentclass])])])])])])]) ).

cnf(c_0_11,plain,
    ( ~ ir(X1)
    | icext(uri_owl_Thing,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_12,plain,
    ir(X1),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_13,plain,
    ( ~ iext(uri_rdf_rest,X4,uri_rdf_nil)
    | ~ iext(uri_rdf_first,X4,X3)
    | ~ iext(uri_owl_oneOf,X1,X4)
    | ~ icext(X1,X2)
    | X2 = X3 ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_14,plain,
    iext(uri_rdf_first,esk4_0,uri_ex_w),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

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

cnf(c_0_16,plain,
    ( ~ iext(uri_owl_equivalentClass,X1,X3)
    | ~ icext(X1,X2)
    | icext(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_17,plain,
    iext(uri_owl_equivalentClass,uri_owl_Thing,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_18,plain,
    icext(uri_owl_Thing,X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]) ).

fof(c_0_19,plain,
    ! [X1] : ~ icext(uri_owl_Nothing,X1),
    inference(fof_simplification,[status(thm)],[owl_class_nothing_ext]) ).

cnf(c_0_20,plain,
    ( ~ icext(X2,X1)
    | ~ iext(uri_owl_oneOf,X2,esk4_0)
    | X1 = uri_ex_w ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).

cnf(c_0_21,plain,
    icext(esk3_0,X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).

cnf(c_0_22,plain,
    iext(uri_owl_oneOf,esk3_0,esk4_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_23,plain,
    ! [X11] : ~ icext(uri_owl_Nothing,X11),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_19])]) ).

cnf(c_0_24,plain,
    X1 = uri_ex_w,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).

cnf(c_0_25,plain,
    ~ icext(uri_owl_Nothing,X1),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

cnf(c_0_26,plain,
    X1 = X2,
    inference(spm,[status(thm)],[c_0_24,c_0_24]) ).

cnf(c_0_27,plain,
    ~ icext(uri_ex_w,X1),
    inference(rw,[status(thm)],[c_0_25,c_0_24]) ).

cnf(c_0_28,plain,
    icext(X1,X2),
    inference(spm,[status(thm)],[c_0_21,c_0_26]) ).

cnf(c_0_29,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWB031+2 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/5.38  % Computer : n018.cluster.edu
% 0.11/5.38  % Model    : x86_64 x86_64
% 0.11/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38  % Memory   : 8046.5625MB
% 0.11/5.38  % OS       : Linux 6.8.0-71-generic
% 0.11/5.38  % CPULimit : 300
% 0.11/5.38  % WCLimit  : 300
% 0.11/5.38  % DateTime : Mon Sep 21 07:44:49 UTC 2026
% 0.11/5.38  % CPUTime  : 
% 0.11/5.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/5.45  Running first-order theorem proving
% 0.15/5.45  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.15/5.55  % Version: 3.5.1
% 0.15/5.55  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/5.55  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.55  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/5.55  % Starting new_bool_3 with 300s (1) cores
% 0.15/5.55  % Starting new_bool_1 with 300s (1) cores
% 0.15/5.55  % Starting sh5l with 300s (1) cores
% 0.15/5.55  % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1370355 completed with status 0
% 0.15/5.55  % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.15/5.55  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/5.55  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.55  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/5.55  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.55  % No SInE strategy applied
% 0.15/5.55  % Search class: FGUSF-FFSS32-SFFFFFNN
% 0.15/5.55  % partial match(1): FGUSF-FFSF32-SFFFFFNN
% 0.15/5.55  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.55  % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.55  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.15/5.55  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.15/5.55  % Starting new_bool_3 with 136s (1) cores
% 0.15/5.55  % Starting new_bool_1 with 136s (1) cores
% 0.15/5.55  % SubtermCWHack with pid 1370374 completed with status 0
% 0.15/5.55  % Result found by SubtermCWHack
% 0.15/5.55  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/5.55  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.55  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/5.55  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.55  % No SInE strategy applied
% 0.15/5.55  % Search class: FGUSF-FFSS32-SFFFFFNN
% 0.15/5.55  % partial match(1): FGUSF-FFSF32-SFFFFFNN
% 0.15/5.55  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.55  % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.55  % Preprocessing time       : 0.002 s
% 0.15/5.55  
% 0.15/5.55  % Proof found!
% 0.15/5.55  % SZS status Unsatisfiable
% 0.15/5.55  % SZS output start CNFRefutation
% See solution above
% 0.15/5.55  % Parsed axioms                        : 6
% 0.15/5.55  % Removed by relevancy pruning/SinE    : 0
% 0.15/5.55  % Initial clauses                      : 19
% 0.15/5.55  % Removed in clause preprocessing      : 2
% 0.15/5.55  % Initial clauses in saturation        : 17
% 0.15/5.55  % Processed clauses                    : 34
% 0.15/5.55  % ...of these trivial                  : 0
% 0.15/5.55  % ...subsumed                          : 1
% 0.15/5.55  % ...remaining for further processing  : 33
% 0.15/5.55  % Other redundant clauses eliminated   : 1
% 0.15/5.55  % Clauses deleted for lack of memory   : 0
% 0.15/5.55  % Backward-subsumed                    : 4
% 0.15/5.55  % Backward-rewritten                   : 18
% 0.15/5.55  % Generated clauses                    : 103
% 0.15/5.55  % ...of the previous two non-redundant : 92
% 0.15/5.55  % ...aggressively subsumed             : 0
% 0.15/5.55  % Contextual simplify-reflections      : 0
% 0.15/5.55  % Paramodulations                      : 102
% 0.15/5.55  % Factorizations                       : 0
% 0.15/5.55  % NegExts                              : 0
% 0.15/5.55  % Equation resolutions                 : 1
% 0.15/5.55  % Disequality decompositions           : 0
% 0.15/5.55  % Total rewrite steps                  : 56
% 0.15/5.55  % ...of those cached                   : 33
% 0.15/5.55  % Propositional unsat checks           : 0
% 0.15/5.55  %    Propositional check models        : 0
% 0.15/5.55  %    Propositional check unsatisfiable : 0
% 0.15/5.55  %    Propositional clauses             : 0
% 0.15/5.55  %    Propositional clauses after purity: 0
% 0.15/5.55  %    Propositional unsat core size     : 0
% 0.15/5.55  %    Propositional preprocessing time  : 0.000
% 0.15/5.55  %    Propositional encoding time       : 0.000
% 0.15/5.55  %    Propositional solver time         : 0.000
% 0.15/5.55  %    Success case prop preproc time    : 0.000
% 0.15/5.55  %    Success case prop encoding time   : 0.000
% 0.15/5.55  %    Success case prop solver time     : 0.000
% 0.15/5.55  % Current number of processed clauses  : 10
% 0.15/5.55  %    Positive orientable unit clauses  : 9
% 0.15/5.55  %    Positive unorientable unit clauses: 1
% 0.15/5.55  %    Negative unit clauses             : 0
% 0.15/5.55  %    Non-unit-clauses                  : 0
% 0.15/5.55  % Current number of unprocessed clauses: 69
% 0.15/5.55  % ...number of literals in the above   : 119
% 0.15/5.55  % Current number of archived formulas  : 0
% 0.15/5.55  % Current number of archived clauses   : 23
% 0.15/5.55  % Clause-clause subsumption calls (NU) : 52
% 0.15/5.55  % Rec. Clause-clause subsumption calls : 27
% 0.15/5.55  % Non-unit clause-clause subsumptions  : 0
% 0.15/5.55  % Unit Clause-clause subsumption calls : 74
% 0.15/5.55  % Rewrite failures with RHS unbound    : 49
% 0.15/5.55  % BW rewrite match attempts            : 143
% 0.15/5.55  % BW rewrite match successes           : 41
% 0.15/5.55  % Condensation attempts                : 0
% 0.15/5.55  % Condensation successes               : 0
% 0.15/5.55  % Termbank termtop insertions          : 1975
% 0.15/5.55  % Search garbage collected termcells   : 331
% 0.15/5.55  
% 0.15/5.55  % -------------------------------------------------
% 0.15/5.55  % User time                : 0.010 s
% 0.15/5.55  % System time              : 0.006 s
% 0.15/5.55  % Total time               : 0.016 s
% 0.15/5.55  % Maximum resident set size: 3584 pages
% 0.15/5.55  
% 0.15/5.55  % -------------------------------------------------
% 0.15/5.55  % User time                : 0.029 s
% 0.15/5.55  % System time              : 0.018 s
% 0.15/5.55  % Total time               : 0.047 s
% 0.15/5.55  % Maximum resident set size: 4608 pages
% 0.15/5.55  % E exiting
%------------------------------------------------------------------------------