↑ Up

E-SAT---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : SEU373+2 : TPTP v9.3.1. Released v3.3.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:29:09 PM UTC 2026

% Result   : Theorem 0.34s 0.72s
% Output   : CNFRefutation 0.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   27 (   7 unt;   0 def)
%            Number of atoms       :  105 (   3 equ)
%            Maximal formula atoms :   16 (   3 avg)
%            Number of connectives :  130 (  52   ~;  49   |;  10   &)
%                                         (   2 <=>;  17  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-4 aty)
%            Number of variables   :   47 (   0 sgn  30   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(d8_yellow_6,axiom,
    ! [X1] :
      ( one_sorted_str(X1)
     => ! [X2] :
          ( net_str(X2,X1)
         => ! [X3] :
              ( net_str(X3,X1)
             => ( subnetstr(X3,X1,X2)
              <=> ( the_mapping(X1,X3) = relation_dom_restr_as_relation_of(the_carrier(X2),the_carrier(X1),the_mapping(X1,X2),the_carrier(X3))
                  & subrelstr(X3,X2) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d8_yellow_6) ).

fof(dt_m1_yellow_6,axiom,
    ! [X1,X2] :
      ( ( net_str(X2,X1)
        & one_sorted_str(X1) )
     => ! [X3] :
          ( subnetstr(X3,X1,X2)
         => net_str(X3,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_m1_yellow_6) ).

fof(t19_yellow_6,conjecture,
    ! [X1] :
      ( one_sorted_str(X1)
     => ! [X2] :
          ( net_str(X2,X1)
         => ! [X3] :
              ( subnetstr(X3,X1,X2)
             => subset(the_carrier(X3),the_carrier(X2)) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t19_yellow_6) ).

fof(d13_yellow_0,axiom,
    ! [X1] :
      ( rel_str(X1)
     => ! [X2] :
          ( rel_str(X2)
         => ( subrelstr(X2,X1)
          <=> ( subset(the_InternalRel(X2),the_InternalRel(X1))
              & subset(the_carrier(X2),the_carrier(X1)) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d13_yellow_0) ).

fof(dt_m1_yellow_0,axiom,
    ! [X1] :
      ( rel_str(X1)
     => ! [X2] :
          ( subrelstr(X2,X1)
         => rel_str(X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_m1_yellow_0) ).

fof(dt_l1_waybel_0,axiom,
    ! [X1] :
      ( one_sorted_str(X1)
     => ! [X2] :
          ( net_str(X2,X1)
         => rel_str(X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_l1_waybel_0) ).

fof(c_0_6,plain,
    ! [X51,X52,X53] :
      ( ( ~ one_sorted_str(X51)
        | ~ net_str(X52,X51)
        | ~ net_str(X53,X51)
        | subnetstr(X53,X51,X52)
        | the_mapping(X51,X53) != relation_dom_restr_as_relation_of(the_carrier(X52),the_carrier(X51),the_mapping(X51,X52),the_carrier(X53))
        | ~ subrelstr(X53,X52) )
      & ( ~ one_sorted_str(X51)
        | ~ net_str(X52,X51)
        | ~ net_str(X53,X51)
        | ~ subnetstr(X53,X51,X52)
        | the_mapping(X51,X53) = relation_dom_restr_as_relation_of(the_carrier(X52),the_carrier(X51),the_mapping(X51,X52),the_carrier(X53)) )
      & ( ~ one_sorted_str(X51)
        | ~ net_str(X52,X51)
        | ~ net_str(X53,X51)
        | ~ subnetstr(X53,X51,X52)
        | subrelstr(X53,X52) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d8_yellow_6])])])])]) ).

fof(c_0_7,plain,
    ! [X54,X55,X56] :
      ( net_str(X56,X54)
      | ~ subnetstr(X56,X54,X55)
      | ~ net_str(X55,X54)
      | ~ one_sorted_str(X54) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m1_yellow_6])])])]) ).

fof(c_0_8,negated_conjecture,
    ~ ! [X1] :
        ( one_sorted_str(X1)
       => ! [X2] :
            ( net_str(X2,X1)
           => ! [X3] :
                ( subnetstr(X3,X1,X2)
               => subset(the_carrier(X3),the_carrier(X2)) ) ) ),
    inference(assume_negation,[status(cth)],[t19_yellow_6]) ).

fof(c_0_9,plain,
    ! [X189,X190] :
      ( ( ~ rel_str(X189)
        | ~ rel_str(X190)
        | subrelstr(X190,X189)
        | ~ subset(the_InternalRel(X190),the_InternalRel(X189))
        | ~ subset(the_carrier(X190),the_carrier(X189)) )
      & ( ~ rel_str(X189)
        | ~ rel_str(X190)
        | ~ subrelstr(X190,X189)
        | subset(the_InternalRel(X190),the_InternalRel(X189)) )
      & ( ~ rel_str(X189)
        | ~ rel_str(X190)
        | ~ subrelstr(X190,X189)
        | subset(the_carrier(X190),the_carrier(X189)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d13_yellow_0])])])])]) ).

fof(c_0_10,plain,
    ! [X191,X192] :
      ( rel_str(X192)
      | ~ subrelstr(X192,X191)
      | ~ rel_str(X191) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m1_yellow_0])])])]) ).

cnf(c_0_11,plain,
    ( ~ one_sorted_str(X3)
    | ~ net_str(X2,X3)
    | ~ net_str(X1,X3)
    | ~ subnetstr(X1,X3,X2)
    | subrelstr(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_12,plain,
    ( ~ subnetstr(X3,X1,X2)
    | ~ net_str(X2,X1)
    | ~ one_sorted_str(X1)
    | net_str(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_13,negated_conjecture,
    ( ~ subset(the_carrier(esk3_0),the_carrier(esk2_0))
    & subnetstr(esk3_0,esk1_0,esk2_0)
    & net_str(esk2_0,esk1_0)
    & one_sorted_str(esk1_0) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).

fof(c_0_14,plain,
    ! [X60,X61] :
      ( rel_str(X61)
      | ~ net_str(X61,X60)
      | ~ one_sorted_str(X60) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_waybel_0])])])]) ).

cnf(c_0_15,plain,
    ( ~ rel_str(X2)
    | ~ rel_str(X1)
    | ~ subrelstr(X1,X2)
    | subset(the_carrier(X1),the_carrier(X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_16,plain,
    ( ~ subrelstr(X2,X1)
    | ~ rel_str(X1)
    | rel_str(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_17,plain,
    ( ~ one_sorted_str(X3)
    | ~ net_str(X2,X3)
    | ~ subnetstr(X1,X3,X2)
    | subrelstr(X1,X2) ),
    inference(csr,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_18,negated_conjecture,
    subnetstr(esk3_0,esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_19,negated_conjecture,
    net_str(esk2_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_20,negated_conjecture,
    one_sorted_str(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_21,plain,
    ( ~ net_str(X2,X1)
    | ~ one_sorted_str(X1)
    | rel_str(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_22,plain,
    ( ~ rel_str(X2)
    | ~ subrelstr(X1,X2)
    | subset(the_carrier(X1),the_carrier(X2)) ),
    inference(csr,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_23,negated_conjecture,
    subrelstr(esk3_0,esk2_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]) ).

cnf(c_0_24,negated_conjecture,
    rel_str(esk2_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_19]),c_0_20])]) ).

cnf(c_0_25,negated_conjecture,
    ~ subset(the_carrier(esk3_0),the_carrier(esk2_0)),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_26,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),c_0_25]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SEU373+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.21/0.46  % Computer : n015.cluster.edu
% 0.21/0.46  % Model    : x86_64 x86_64
% 0.21/0.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.46  % Memory   : 8046.5625MB
% 0.21/0.46  % OS       : Linux 6.8.0-71-generic
% 0.21/0.46  % CPULimit : 300
% 0.21/0.46  % WCLimit  : 300
% 0.21/0.46  % DateTime : Mon Sep 21 06:20:20 UTC 2026
% 0.21/0.46  % CPUTime  : 
% 0.21/0.46  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.52  Running first-order theorem proving
% 0.24/0.52  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
% 0.34/0.72  % Version: 3.5.1
% 0.34/0.72  % Preprocessing class: FSLMSMSSSSSNFFN.
% 0.34/0.72  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/0.72  % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.34/0.72  % Starting new_bool_3 with 600s (2) cores
% 0.34/0.72  % Starting new_bool_1 with 600s (2) cores
% 0.34/0.72  % Starting sh5l with 300s (1) cores
% 0.34/0.72  % new_bool_1 with pid 743357 completed with status 0
% 0.34/0.72  % Result found by new_bool_1
% 0.34/0.72  % Preprocessing class: FSLMSMSSSSSNFFN.
% 0.34/0.72  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/0.72  % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.34/0.72  % Starting new_bool_3 with 600s (2) cores
% 0.34/0.72  % Starting new_bool_1 with 600s (2) cores
% 0.34/0.72  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.34/0.72  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.34/0.72  % Search class: FGHSM-FSLM32-SFFFFFNN
% 0.34/0.72  % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 0.34/0.72  % Starting SubtermCWHack with 55s (1) cores
% 0.34/0.72  % Starting new_bool_1 with 61s (1) cores
% 0.34/0.72  % SubtermCWHack with pid 743359 completed with status 0
% 0.34/0.72  % Result found by SubtermCWHack
% 0.34/0.72  % Preprocessing class: FSLMSMSSSSSNFFN.
% 0.34/0.72  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/0.72  % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.34/0.72  % Starting new_bool_3 with 600s (2) cores
% 0.34/0.72  % Starting new_bool_1 with 600s (2) cores
% 0.34/0.72  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.34/0.72  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.34/0.72  % Search class: FGHSM-FSLM32-SFFFFFNN
% 0.34/0.72  % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 0.34/0.72  % Starting SubtermCWHack with 55s (1) cores
% 0.34/0.72  % Preprocessing time       : 0.009 s
% 0.34/0.72  
% 0.34/0.72  % Proof found!
% 0.34/0.72  % SZS status Theorem
% 0.34/0.72  % SZS output start CNFRefutation
% See solution above
% 0.34/0.72  % Parsed axioms                        : 764
% 0.34/0.72  % Removed by relevancy pruning/SinE    : 650
% 0.34/0.72  % Initial clauses                      : 324
% 0.34/0.72  % Removed in clause preprocessing      : 4
% 0.34/0.72  % Initial clauses in saturation        : 320
% 0.34/0.72  % Processed clauses                    : 958
% 0.34/0.72  % ...of these trivial                  : 8
% 0.34/0.72  % ...subsumed                          : 487
% 0.34/0.72  % ...remaining for further processing  : 463
% 0.34/0.72  % Other redundant clauses eliminated   : 33
% 0.34/0.72  % Clauses deleted for lack of memory   : 0
% 0.34/0.72  % Backward-subsumed                    : 10
% 0.34/0.72  % Backward-rewritten                   : 19
% 0.34/0.72  % Generated clauses                    : 3320
% 0.34/0.72  % ...of the previous two non-redundant : 2160
% 0.34/0.72  % ...aggressively subsumed             : 0
% 0.34/0.72  % Contextual simplify-reflections      : 3
% 0.34/0.72  % Paramodulations                      : 3280
% 0.34/0.72  % Factorizations                       : 2
% 0.34/0.72  % NegExts                              : 0
% 0.34/0.72  % Equation resolutions                 : 35
% 0.34/0.72  % Disequality decompositions           : 0
% 0.34/0.72  % Total rewrite steps                  : 1835
% 0.34/0.72  % ...of those cached                   : 1732
% 0.34/0.72  % Propositional unsat checks           : 0
% 0.34/0.72  %    Propositional check models        : 0
% 0.34/0.72  %    Propositional check unsatisfiable : 0
% 0.34/0.72  %    Propositional clauses             : 0
% 0.34/0.72  %    Propositional clauses after purity: 0
% 0.34/0.72  %    Propositional unsat core size     : 0
% 0.34/0.72  %    Propositional preprocessing time  : 0.000
% 0.34/0.72  %    Propositional encoding time       : 0.000
% 0.34/0.72  %    Propositional solver time         : 0.000
% 0.34/0.72  %    Success case prop preproc time    : 0.000
% 0.34/0.72  %    Success case prop encoding time   : 0.000
% 0.34/0.72  %    Success case prop solver time     : 0.000
% 0.34/0.72  % Current number of processed clauses  : 421
% 0.34/0.72  %    Positive orientable unit clauses  : 96
% 0.34/0.72  %    Positive unorientable unit clauses: 0
% 0.34/0.72  %    Negative unit clauses             : 20
% 0.34/0.72  %    Non-unit-clauses                  : 305
% 0.34/0.72  % Current number of unprocessed clauses: 1465
% 0.34/0.72  % ...number of literals in the above   : 4728
% 0.34/0.72  % Current number of archived formulas  : 0
% 0.34/0.72  % Current number of archived clauses   : 32
% 0.34/0.72  % Clause-clause subsumption calls (NU) : 28262
% 0.34/0.72  % Rec. Clause-clause subsumption calls : 20653
% 0.34/0.72  % Non-unit clause-clause subsumptions  : 366
% 0.34/0.72  % Unit Clause-clause subsumption calls : 1129
% 0.34/0.72  % Rewrite failures with RHS unbound    : 0
% 0.34/0.72  % BW rewrite match attempts            : 44
% 0.34/0.72  % BW rewrite match successes           : 14
% 0.34/0.72  % Condensation attempts                : 0
% 0.34/0.72  % Condensation successes               : 0
% 0.34/0.72  % Termbank termtop insertions          : 63981
% 0.34/0.72  % Search garbage collected termcells   : 10238
% 0.34/0.72  
% 0.34/0.72  % -------------------------------------------------
% 0.34/0.72  % User time                : 0.112 s
% 0.34/0.72  % System time              : 0.017 s
% 0.34/0.72  % Total time               : 0.129 s
% 0.34/0.72  % Maximum resident set size: 5468 pages
% 0.34/0.72  
% 0.34/0.72  % -------------------------------------------------
% 0.34/0.72  % User time                : 0.251 s
% 0.34/0.72  % System time              : 0.034 s
% 0.34/0.72  % Total time               : 0.285 s
% 0.34/0.72  % Maximum resident set size: 5888 pages
% 0.34/0.72  % E exiting
%------------------------------------------------------------------------------