TSTP Solution File: SET027+4 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : SET027+4 : TPTP v8.1.2. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n025.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 19:18:03 EDT 2023

% Result   : Timeout 0.27s 300.34s
% Output   : None 
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   16 (   4 unt;   0 def)
%            Number of atoms       :   38 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   34 (  12   ~;  12   |;   6   &)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   25 (   0 sgn;  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(thI03,conjecture,
    ! [X1,X2,X6] :
      ( ( subset(X1,X2)
        & subset(X2,X6) )
     => subset(X1,X6) ),
    file('/export/starexec/sandbox/tmp/tmp.XZQ9U7ghHe/E---3.1_19274.p',thI03) ).

fof(subset,axiom,
    ! [X1,X2] :
      ( subset(X1,X2)
    <=> ! [X3] :
          ( member(X3,X1)
         => member(X3,X2) ) ),
    file('/export/starexec/sandbox/tmp/tmp.XZQ9U7ghHe/E---3.1_19274.p',subset) ).

fof(c_0_2,negated_conjecture,
    ~ ! [X1,X2,X6] :
        ( ( subset(X1,X2)
          & subset(X2,X6) )
       => subset(X1,X6) ),
    inference(assume_negation,[status(cth)],[thI03]) ).

fof(c_0_3,plain,
    ! [X10,X11,X12,X13,X14] :
      ( ( ~ subset(X10,X11)
        | ~ member(X12,X10)
        | member(X12,X11) )
      & ( member(esk4_2(X13,X14),X13)
        | subset(X13,X14) )
      & ( ~ member(esk4_2(X13,X14),X14)
        | subset(X13,X14) ) ),
    inference(distribute,[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)],[subset])])])])])]) ).

fof(c_0_4,negated_conjecture,
    ( subset(esk1_0,esk2_0)
    & subset(esk2_0,esk3_0)
    & ~ subset(esk1_0,esk3_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).

cnf(c_0_5,plain,
    ( member(X3,X2)
    | ~ subset(X1,X2)
    | ~ member(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,negated_conjecture,
    subset(esk2_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    subset(esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,plain,
    ( subset(X1,X2)
    | ~ member(esk4_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_9,negated_conjecture,
    ( member(X1,esk3_0)
    | ~ member(X1,esk2_0) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    ( member(X1,esk2_0)
    | ~ member(X1,esk1_0) ),
    inference(spm,[status(thm)],[c_0_5,c_0_7]) ).

cnf(c_0_11,plain,
    ( member(esk4_2(X1,X2),X1)
    | subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_12,negated_conjecture,
    ( subset(X1,esk3_0)
    | ~ member(esk4_2(X1,esk3_0),esk2_0) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,negated_conjecture,
    ( member(esk4_2(esk1_0,X1),esk2_0)
    | subset(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,negated_conjecture,
    ~ subset(esk1_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_15,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem    : SET027+4 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.11  % Command    : run_E %s %d THM
% 0.10/0.32  % Computer : n025.cluster.edu
% 0.10/0.32  % Model    : x86_64 x86_64
% 0.10/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32  % Memory   : 8042.1875MB
% 0.10/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32  % CPULimit   : 2400
% 0.10/0.32  % WCLimit    : 300
% 0.10/0.32  % DateTime   : Mon Oct  2 17:11:51 EDT 2023
% 0.10/0.32  % CPUTime    : 
% 0.16/0.42  Running first-order theorem proving
% 0.16/0.42  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/tmp/tmp.XZQ9U7ghHe/E---3.1_19274.p
% 0.27/300.34  # Version: 3.1pre001
% 0.27/300.34  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/300.34  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/300.34  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/300.34  # Starting new_bool_3 with 300s (1) cores
% 0.27/300.34  # Starting new_bool_1 with 300s (1) cores
% 0.27/300.34  # Starting sh5l with 300s (1) cores
% 0.27/300.34  # new_bool_3 with pid 19525 completed with status 0
% 0.27/300.34  # Result found by new_bool_3
% 0.27/300.34  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/300.34  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/300.34  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/300.34  # Starting new_bool_3 with 300s (1) cores
% 0.27/300.34  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.27/300.34  # Search class: FGUNF-FFSF22-SFFFFFNN
% 0.27/300.34  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.27/300.34  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.27/300.34  # SAT001_MinMin_p005000_rr_RG with pid 19529 completed with status 0
% 0.27/300.34  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.27/300.34  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/300.34  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/300.34  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/300.34  # Starting new_bool_3 with 300s (1) cores
% 0.27/300.34  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.27/300.34  # Search class: FGUNF-FFSF22-SFFFFFNN
% 0.27/300.34  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.27/300.34  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.27/300.34  # Preprocessing time       : 0.001 s
% 0.27/300.34  # Presaturation interreduction done
% 0.27/300.34  
% 0.27/300.34  # Proof found!
% 0.27/300.34  # SZS status Theorem
% 0.27/300.34  # SZS output start CNFRefutation
% See solution above
% 0.27/300.34  # Parsed axioms                        : 12
% 0.27/300.34  # Removed by relevancy pruning/SinE    : 10
% 0.27/300.34  # Initial clauses                      : 6
% 0.27/300.34  # Removed in clause preprocessing      : 0
% 0.27/300.34  # Initial clauses in saturation        : 6
% 0.27/300.34  # Processed clauses                    : 17
% 0.27/300.34  # ...of these trivial                  : 0
% 0.27/300.34  # ...subsumed                          : 0
% 0.27/300.34  # ...remaining for further processing  : 17
% 0.27/300.34  # Other redundant clauses eliminated   : 0
% 0.27/300.34  # Clauses deleted for lack of memory   : 0
% 0.27/300.34  # Backward-subsumed                    : 0
% 0.27/300.34  # Backward-rewritten                   : 0
% 0.27/300.34  # Generated clauses                    : 9
% 0.27/300.34  # ...of the previous two non-redundant : 5
% 0.27/300.34  # ...aggressively subsumed             : 0
% 0.27/300.34  # Contextual simplify-reflections      : 0
% 0.27/300.34  # Paramodulations                      : 9
% 0.27/300.34  # Factorizations                       : 0
% 0.27/300.34  # NegExts                              : 0
% 0.27/300.34  # Equation resolutions                 : 0
% 0.27/300.34  # Total rewrite steps                  : 2
% 0.27/300.34  # Propositional unsat checks           : 0
% 0.27/300.34  #    Propositional check models        : 0
% 0.27/300.34  #    Propositional check unsatisfiable : 0
% 0.27/300.34  #    Propositional clauses             : 0
% 0.27/300.34  #    Propositional clauses after purity: 0
% 0.27/300.34  #    Propositional unsat core size     : 0
% 0.27/300.34  #    Propositional preprocessing time  : 0.000
% 0.27/300.34  #    Propositional encoding time       : 0.000
% 0.27/300.34  #    Propositional solver time         : 0.000
% 0.27/300.34  #    Success case prop preproc time    : 0.000
% 0.27/300.34  #    Success case prop encoding time   : 0.000
% 0.27/300.34  #    Success case prop solver time     : 0.000
% 0.27/300.34  # Current number of processed clauses  : 11
% 0.27/300.34  #    Positive orientable unit clauses  : 3
% 0.27/300.34  #    Positive unorientable unit clauses: 0
% 0.27/300.34  #    Negative unit clauses             : 1
% 0.27/300.34  #    Non-unit-clauses                  : 7
% 0.27/300.34  # Current number of unprocessed clauses: 0
% 0.27/300.34  # ...number of literals in the above   : 0
% 0.27/300.34  # Current number of archived formulas  : 0
% 0.27/300.34  # Current number of archived clauses   : 6
% 0.27/300.34  # Clause-clause subsumption calls (NU) : 6
% 0.27/300.34  # Rec. Clause-clause subsumption calls : 6
% 0.27/300.34  # Non-unit clause-clause subsumptions  : 0
% 0.27/300.34  # Unit Clause-clause subsumption calls : 2
% 0.27/300.34  # Rewrite failures with RHS unbound    : 0
% 0.27/300.34  # BW rewrite match attempts            : 5
% 0.27/300.34  # BW rewrite match successes           : 0
% 0.27/300.34  # Condensation attempts                : 0
% 0.27/300.34  # Condensation successes               : 0
% 0.27/300.34  # Termbank termtop insertions          : 524
% 0.27/300.34  
% 0.27/300.34  # -------------------------------------------------
% 0.27/300.34  # User time                : 0.003 s
% 0.27/300.34  # System time              : 0.001 s
% 0.27/300.34  # Total time               : 0.004 s
% 0.27/300.34  # Maximum resident set size: 1760 pages
% 0.27/300.34  
% 0.27/300.34  # -------------------------------------------------
% 0.27/300.34  # User time                : 0.003 s
% 0.27/300.34  # System time              : 0.003 s
% 0.27/300.34  # Total time               : 0.006 s
% 0.27/300.34  # Maximum resident set size: 1684 pages
% 0.27/300.34  % E---3.1 exiting
% 0.27/300.35  % E---3.1 exiting
%------------------------------------------------------------------------------