↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : CSR103+7 : TPTP v9.3.1. Bugfixed v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n013.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 12:16:53 PM UTC 2026

% Result   : Theorem 6.16s 4.48s
% Output   : CNFRefutation 6.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   17 (  10 unt;   0 def)
%            Number of atoms       :   79 (  15 equ)
%            Maximal formula atoms :   45 (   4 avg)
%            Number of connectives :   96 (  34   ~;  40   |;  18   &)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   24 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-3 aty)
%            Number of variables   :   37 (  10 sgn  22   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_from_ALL,conjecture,
    ? [X2341] :
    ! [X2342] : s__instance(X2342,X2341),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_from_ALL) ).

fof(kb_SUMO_32603,axiom,
    ! [X137,X12,X136] :
      ( X12 = s__UnionFn(X136,X137)
    <=> ! [X1138,X34,X1139] :
          ( ( s__instance(X137,s__SetOrClass)
            & s__instance(X12,s__SetOrClass)
            & s__instance(X136,s__SetOrClass) )
         => ( ( s__instance(X1139,X12)
              & s__instance(X34,X137)
              & s__instance(X1138,X136) )
           => ( ( s__instance(X1139,X137)
                | s__instance(X1139,X136) )
              & s__instance(X34,X12)
              & s__instance(X1138,X12) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_32603) ).

fof(kb_SUMO_26635,axiom,
    ! [X1,X15] :
      ( s__subclass(X1,X15)
     => ( s__instance(X15,s__SetOrClass)
        & s__instance(X1,s__SetOrClass) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_26635) ).

fof(kb_SUMO_27515,axiom,
    s__subclass(s__ContentBearingPhysical,s__Physical),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR003+2.ax',kb_SUMO_27515) ).

fof(c_0_4,negated_conjecture,
    ~ ? [X2341] :
      ! [X2342] : s__instance(X2342,X2341),
    inference(assume_negation,[status(cth)],[prove_from_ALL]) ).

fof(c_0_5,plain,
    ! [X2369,X2370,X2371,X2372,X2373,X2374,X2375,X2376,X2377] :
      ( ( X2376 = s__UnionFn(X2377,X2375)
        | ~ s__instance(esk3_3(X2375,X2376,X2377),X2376)
        | ~ s__instance(esk2_3(X2375,X2376,X2377),X2376)
        | ~ s__instance(esk4_3(X2375,X2376,X2377),X2375) )
      & ( X2376 = s__UnionFn(X2377,X2375)
        | ~ s__instance(esk3_3(X2375,X2376,X2377),X2376)
        | ~ s__instance(esk2_3(X2375,X2376,X2377),X2376)
        | ~ s__instance(esk4_3(X2375,X2376,X2377),X2377) )
      & ( X2376 = s__UnionFn(X2377,X2375)
        | s__instance(esk4_3(X2375,X2376,X2377),X2376) )
      & ( X2376 = s__UnionFn(X2377,X2375)
        | s__instance(esk3_3(X2375,X2376,X2377),X2375) )
      & ( X2376 = s__UnionFn(X2377,X2375)
        | s__instance(esk2_3(X2375,X2376,X2377),X2377) )
      & ( X2376 = s__UnionFn(X2377,X2375)
        | s__instance(X2375,s__SetOrClass) )
      & ( X2376 = s__UnionFn(X2377,X2375)
        | s__instance(X2376,s__SetOrClass) )
      & ( X2376 = s__UnionFn(X2377,X2375)
        | s__instance(X2377,s__SetOrClass) )
      & ( X2370 != s__UnionFn(X2371,X2369)
        | ~ s__instance(X2369,s__SetOrClass)
        | ~ s__instance(X2370,s__SetOrClass)
        | ~ s__instance(X2371,s__SetOrClass)
        | ~ s__instance(X2374,X2370)
        | ~ s__instance(X2373,X2369)
        | ~ s__instance(X2372,X2371)
        | s__instance(X2374,X2369)
        | s__instance(X2374,X2371) )
      & ( X2370 != s__UnionFn(X2371,X2369)
        | ~ s__instance(X2369,s__SetOrClass)
        | ~ s__instance(X2370,s__SetOrClass)
        | ~ s__instance(X2371,s__SetOrClass)
        | ~ s__instance(X2374,X2370)
        | ~ s__instance(X2373,X2369)
        | ~ s__instance(X2372,X2371)
        | s__instance(X2373,X2370) )
      & ( X2370 != s__UnionFn(X2371,X2369)
        | ~ s__instance(X2369,s__SetOrClass)
        | ~ s__instance(X2370,s__SetOrClass)
        | ~ s__instance(X2371,s__SetOrClass)
        | ~ s__instance(X2374,X2370)
        | ~ s__instance(X2373,X2369)
        | ~ s__instance(X2372,X2371)
        | s__instance(X2372,X2370) ) ),
    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)],[kb_SUMO_32603])])])])])])]) ).

fof(c_0_6,negated_conjecture,
    ! [X2343] : ~ s__instance(esk1_1(X2343),X2343),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).

cnf(c_0_7,plain,
    ( X2 = s__UnionFn(X3,X1)
    | s__instance(X1,s__SetOrClass) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

fof(c_0_8,plain,
    ! [X2345,X2346] :
      ( ( ~ s__subclass(X2345,X2346)
        | s__instance(X2346,s__SetOrClass) )
      & ( ~ s__subclass(X2345,X2346)
        | s__instance(X2345,s__SetOrClass) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26635])])])]) ).

cnf(c_0_9,negated_conjecture,
    ~ s__instance(esk1_1(X1),X1),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    ( s__instance(X3,s__SetOrClass)
    | X1 = X2 ),
    inference(spm,[status(thm)],[c_0_7,c_0_7]) ).

cnf(c_0_11,plain,
    ( ~ s__subclass(X2,X1)
    | s__instance(X1,s__SetOrClass) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_12,plain,
    s__subclass(s__ContentBearingPhysical,s__Physical),
    inference(split_conjunct,[status(thm)],[kb_SUMO_27515]) ).

cnf(c_0_13,negated_conjecture,
    X1 = X2,
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_14,plain,
    s__instance(s__Physical,s__SetOrClass),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,negated_conjecture,
    ~ s__instance(X1,X2),
    inference(spm,[status(thm)],[c_0_9,c_0_13]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : CSR103+7 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.44  % Computer : n013.cluster.edu
% 0.19/0.44  % Model    : x86_64 x86_64
% 0.19/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44  % Memory   : 8046.5625MB
% 0.19/0.44  % OS       : Linux 6.8.0-71-generic
% 0.19/0.44  % CPULimit : 300
% 0.19/0.44  % WCLimit  : 300
% 0.19/0.44  % DateTime : Mon Sep 21 14:58:50 UTC 2026
% 0.19/0.44  % CPUTime  : 
% 0.19/0.44  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.25/0.51  Running first-order theorem proving
% 0.25/0.51  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
% 6.16/4.48  % Version: 3.5.1
% 6.16/4.48  % Preprocessing class: FMLLSMSLSSSNFFN.
% 6.16/4.48  % Scheduled 4 strats onto 8 cores with 297 seconds (2376 total)
% 6.16/4.48  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1485s (5) cores
% 6.16/4.48  % Starting new_bool_3 with 297s (1) cores
% 6.16/4.48  % Starting new_bool_1 with 297s (1) cores
% 6.16/4.48  % Starting sh5l with 297s (1) cores
% 6.16/4.48  % sh5l with pid 1030260 completed with status 0
% 6.16/4.48  % Result found by sh5l
% 6.16/4.48  % Preprocessing class: FMLLSMSLSSSNFFN.
% 6.16/4.48  % Scheduled 4 strats onto 8 cores with 297 seconds (2376 total)
% 6.16/4.48  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1485s (5) cores
% 6.16/4.48  % Starting new_bool_3 with 297s (1) cores
% 6.16/4.48  % Starting new_bool_1 with 297s (1) cores
% 6.16/4.48  % Starting sh5l with 297s (1) cores
% 6.16/4.48  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 6.16/4.48  % SinE strategy is gf500_gu_R04_F100_L20000
% 6.16/4.48  % Search class: FGHSS-FSLM31-MFFFFFNN
% 6.16/4.48  % partial match(1): FGHSM-FSLM31-MFFFFFNN
% 6.16/4.48  % Scheduled 8 strats onto 1 cores with 297 seconds (297 total)
% 6.16/4.48  % Starting SubtermCWHack with 27s (1) cores
% 6.16/4.48  % SubtermCWHack with pid 1030263 completed with status 0
% 6.16/4.48  % Result found by SubtermCWHack
% 6.16/4.48  % Preprocessing class: FMLLSMSLSSSNFFN.
% 6.16/4.48  % Scheduled 4 strats onto 8 cores with 297 seconds (2376 total)
% 6.16/4.48  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1485s (5) cores
% 6.16/4.48  % Starting new_bool_3 with 297s (1) cores
% 6.16/4.48  % Starting new_bool_1 with 297s (1) cores
% 6.16/4.48  % Starting sh5l with 297s (1) cores
% 6.16/4.48  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 6.16/4.48  % SinE strategy is gf500_gu_R04_F100_L20000
% 6.16/4.48  % Search class: FGHSS-FSLM31-MFFFFFNN
% 6.16/4.48  % partial match(1): FGHSM-FSLM31-MFFFFFNN
% 6.16/4.48  % Scheduled 8 strats onto 1 cores with 297 seconds (297 total)
% 6.16/4.48  % Starting SubtermCWHack with 27s (1) cores
% 6.16/4.48  % Preprocessing time       : 0.038 s
% 6.16/4.48  
% 6.16/4.48  % Proof found!
% 6.16/4.48  % SZS status Theorem
% 6.16/4.48  % SZS output start CNFRefutation
% See solution above
% 6.16/4.48  % Parsed axioms                        : 55587
% 6.16/4.48  % Removed by relevancy pruning/SinE    : 55427
% 6.16/4.48  % Initial clauses                      : 196
% 6.16/4.48  % Removed in clause preprocessing      : 25
% 6.16/4.48  % Initial clauses in saturation        : 171
% 6.16/4.48  % Processed clauses                    : 74
% 6.16/4.48  % ...of these trivial                  : 8
% 6.16/4.48  % ...subsumed                          : 0
% 6.16/4.48  % ...remaining for further processing  : 66
% 6.16/4.48  % Other redundant clauses eliminated   : 1
% 6.16/4.48  % Clauses deleted for lack of memory   : 0
% 6.16/4.48  % Backward-subsumed                    : 16
% 6.16/4.48  % Backward-rewritten                   : 0
% 6.16/4.48  % Generated clauses                    : 446
% 6.16/4.48  % ...of the previous two non-redundant : 414
% 6.16/4.48  % ...aggressively subsumed             : 0
% 6.16/4.48  % Contextual simplify-reflections      : 0
% 6.16/4.48  % Paramodulations                      : 423
% 6.16/4.48  % Factorizations                       : 0
% 6.16/4.48  % NegExts                              : 0
% 6.16/4.48  % Equation resolutions                 : 1
% 6.16/4.48  % Disequality decompositions           : 0
% 6.16/4.48  % Total rewrite steps                  : 16
% 6.16/4.48  % ...of those cached                   : 8
% 6.16/4.48  % Propositional unsat checks           : 0
% 6.16/4.48  %    Propositional check models        : 0
% 6.16/4.48  %    Propositional check unsatisfiable : 0
% 6.16/4.48  %    Propositional clauses             : 0
% 6.16/4.48  %    Propositional clauses after purity: 0
% 6.16/4.48  %    Propositional unsat core size     : 0
% 6.16/4.48  %    Propositional preprocessing time  : 0.000
% 6.16/4.48  %    Propositional encoding time       : 0.000
% 6.16/4.48  %    Propositional solver time         : 0.000
% 6.16/4.48  %    Success case prop preproc time    : 0.000
% 6.16/4.48  %    Success case prop encoding time   : 0.000
% 6.16/4.48  %    Success case prop solver time     : 0.000
% 6.16/4.48  % Current number of processed clauses  : 27
% 6.16/4.48  %    Positive orientable unit clauses  : 23
% 6.16/4.48  %    Positive unorientable unit clauses: 1
% 6.16/4.48  %    Negative unit clauses             : 1
% 6.16/4.48  %    Non-unit-clauses                  : 2
% 6.16/4.48  % Current number of unprocessed clauses: 511
% 6.16/4.48  % ...number of literals in the above   : 1169
% 6.16/4.48  % Current number of archived formulas  : 0
% 6.16/4.48  % Current number of archived clauses   : 38
% 6.16/4.48  % Clause-clause subsumption calls (NU) : 22
% 6.16/4.48  % Rec. Clause-clause subsumption calls : 22
% 6.16/4.48  % Non-unit clause-clause subsumptions  : 3
% 6.16/4.48  % Unit Clause-clause subsumption calls : 134
% 6.16/4.48  % Rewrite failures with RHS unbound    : 66
% 6.16/4.48  % BW rewrite match attempts            : 196
% 6.16/4.48  % BW rewrite match successes           : 58
% 6.16/4.48  % Condensation attempts                : 0
% 6.16/4.48  % Condensation successes               : 0
% 6.16/4.48  % Termbank termtop insertions          : 668565
% 6.16/4.48  % Search garbage collected termcells   : 293736
% 6.16/4.48  
% 6.16/4.48  % -------------------------------------------------
% 6.16/4.48  % User time                : 0.377 s
% 6.16/4.48  % System time              : 0.218 s
% 6.16/4.48  % Total time               : 0.595 s
% 6.16/4.48  % Maximum resident set size: 137016 pages
% 6.16/4.48  
% 6.16/4.48  % -------------------------------------------------
% 6.16/4.48  % User time                : 3.393 s
% 6.16/4.48  % System time              : 0.389 s
% 6.16/4.48  % Total time               : 3.782 s
% 6.16/4.48  % Maximum resident set size: 63744 pages
% 6.16/4.48  % E exiting
%------------------------------------------------------------------------------