TSTP Solution File: SEU382+2 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : SEU382+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n005.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:26:14 EDT 2023

% Result   : Theorem 0.41s 0.90s
% Output   : CNFRefutation 0.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   12 (  10 unt;   0 def)
%            Number of atoms       :   14 (  13 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    6 (   4   ~;   0   |;   2   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   1 con; 0-1 aty)
%            Number of variables   :    8 (   0 sgn;   6   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t4_waybel_7,conjecture,
    ! [X1] : the_carrier(boole_POSet(X1)) = powerset(X1),
    file('/export/starexec/sandbox2/tmp/tmp.yJbqJ7wV3N/E---3.1_22593.p',t4_waybel_7) ).

fof(t4_yellow_1,lemma,
    ! [X1] : boole_POSet(X1) = incl_POSet(powerset(X1)),
    file('/export/starexec/sandbox2/tmp/tmp.yJbqJ7wV3N/E---3.1_22593.p',t4_yellow_1) ).

fof(t1_yellow_1,lemma,
    ! [X1] :
      ( the_carrier(incl_POSet(X1)) = X1
      & the_InternalRel(incl_POSet(X1)) = inclusion_order(X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.yJbqJ7wV3N/E---3.1_22593.p',t1_yellow_1) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X1] : the_carrier(boole_POSet(X1)) = powerset(X1),
    inference(assume_negation,[status(cth)],[t4_waybel_7]) ).

fof(c_0_4,negated_conjecture,
    the_carrier(boole_POSet(esk522_0)) != powerset(esk522_0),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).

fof(c_0_5,lemma,
    ! [X2450] : boole_POSet(X2450) = incl_POSet(powerset(X2450)),
    inference(variable_rename,[status(thm)],[t4_yellow_1]) ).

cnf(c_0_6,negated_conjecture,
    the_carrier(boole_POSet(esk522_0)) != powerset(esk522_0),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,lemma,
    boole_POSet(X1) = incl_POSet(powerset(X1)),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

fof(c_0_8,lemma,
    ! [X2161] :
      ( the_carrier(incl_POSet(X2161)) = X2161
      & the_InternalRel(incl_POSet(X2161)) = inclusion_order(X2161) ),
    inference(variable_rename,[status(thm)],[t1_yellow_1]) ).

cnf(c_0_9,negated_conjecture,
    the_carrier(incl_POSet(powerset(esk522_0))) != powerset(esk522_0),
    inference(rw,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,lemma,
    the_carrier(incl_POSet(X1)) = X1,
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.18  % Problem    : SEU382+2 : TPTP v8.1.2. Released v3.3.0.
% 0.18/0.19  % Command    : run_E %s %d THM
% 0.18/0.39  % Computer : n005.cluster.edu
% 0.18/0.39  % Model    : x86_64 x86_64
% 0.18/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.39  % Memory   : 8042.1875MB
% 0.18/0.39  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.18/0.39  % CPULimit   : 2400
% 0.18/0.39  % WCLimit    : 300
% 0.18/0.39  % DateTime   : Mon Oct  2 09:19:01 EDT 2023
% 0.18/0.39  % CPUTime    : 
% 0.40/0.57  Running first-order theorem proving
% 0.40/0.57  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/tmp/tmp.yJbqJ7wV3N/E---3.1_22593.p
% 0.41/0.90  # Version: 3.1pre001
% 0.41/0.90  # Preprocessing class: FSLMSMSSSSSNFFN.
% 0.41/0.90  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.90  # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.41/0.90  # Starting new_bool_3 with 600s (2) cores
% 0.41/0.90  # Starting new_bool_1 with 600s (2) cores
% 0.41/0.90  # Starting sh5l with 300s (1) cores
% 0.41/0.90  # G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 22672 completed with status 0
% 0.41/0.90  # Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 0.41/0.90  # Preprocessing class: FSLMSMSSSSSNFFN.
% 0.41/0.90  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.90  # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.41/0.90  # No SInE strategy applied
% 0.41/0.90  # Search class: FGHSM-SMLM32-MFFFFFNN
% 0.41/0.90  # Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 0.41/0.90  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 68s (1) cores
% 0.41/0.90  # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 91s (1) cores
% 0.41/0.90  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 68s (1) cores
% 0.41/0.90  # G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 22683 completed with status 0
% 0.41/0.90  # Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 0.41/0.90  # Preprocessing class: FSLMSMSSSSSNFFN.
% 0.41/0.90  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.90  # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 0.41/0.90  # No SInE strategy applied
% 0.41/0.90  # Search class: FGHSM-SMLM32-MFFFFFNN
% 0.41/0.90  # Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 0.41/0.90  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 68s (1) cores
% 0.41/0.90  # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 91s (1) cores
% 0.41/0.90  # Preprocessing time       : 0.054 s
% 0.41/0.90  # Presaturation interreduction done
% 0.41/0.90  
% 0.41/0.90  # Proof found!
% 0.41/0.90  # SZS status Theorem
% 0.41/0.90  # SZS output start CNFRefutation
% See solution above
% 0.41/0.90  # Parsed axioms                        : 843
% 0.41/0.90  # Removed by relevancy pruning/SinE    : 0
% 0.41/0.90  # Initial clauses                      : 3775
% 0.41/0.90  # Removed in clause preprocessing      : 145
% 0.41/0.90  # Initial clauses in saturation        : 3630
% 0.41/0.90  # Processed clauses                    : 48
% 0.41/0.90  # ...of these trivial                  : 0
% 0.41/0.90  # ...subsumed                          : 1
% 0.41/0.90  # ...remaining for further processing  : 47
% 0.41/0.90  # Other redundant clauses eliminated   : 0
% 0.41/0.90  # Clauses deleted for lack of memory   : 0
% 0.41/0.90  # Backward-subsumed                    : 0
% 0.41/0.90  # Backward-rewritten                   : 1
% 0.41/0.90  # Generated clauses                    : 0
% 0.41/0.90  # ...of the previous two non-redundant : 0
% 0.41/0.90  # ...aggressively subsumed             : 0
% 0.41/0.90  # Contextual simplify-reflections      : 0
% 0.41/0.90  # Paramodulations                      : 0
% 0.41/0.90  # Factorizations                       : 0
% 0.41/0.90  # NegExts                              : 0
% 0.41/0.90  # Equation resolutions                 : 0
% 0.41/0.90  # Total rewrite steps                  : 1
% 0.41/0.90  # Propositional unsat checks           : 0
% 0.41/0.90  #    Propositional check models        : 0
% 0.41/0.90  #    Propositional check unsatisfiable : 0
% 0.41/0.90  #    Propositional clauses             : 0
% 0.41/0.90  #    Propositional clauses after purity: 0
% 0.41/0.90  #    Propositional unsat core size     : 0
% 0.41/0.90  #    Propositional preprocessing time  : 0.000
% 0.41/0.90  #    Propositional encoding time       : 0.000
% 0.41/0.90  #    Propositional solver time         : 0.000
% 0.41/0.90  #    Success case prop preproc time    : 0.000
% 0.41/0.90  #    Success case prop encoding time   : 0.000
% 0.41/0.90  #    Success case prop solver time     : 0.000
% 0.41/0.90  # Current number of processed clauses  : 46
% 0.41/0.90  #    Positive orientable unit clauses  : 14
% 0.41/0.90  #    Positive unorientable unit clauses: 0
% 0.41/0.90  #    Negative unit clauses             : 32
% 0.41/0.90  #    Non-unit-clauses                  : 0
% 0.41/0.90  # Current number of unprocessed clauses: 3582
% 0.41/0.90  # ...number of literals in the above   : 16820
% 0.41/0.90  # Current number of archived formulas  : 0
% 0.41/0.90  # Current number of archived clauses   : 11
% 0.41/0.90  # Clause-clause subsumption calls (NU) : 0
% 0.41/0.90  # Rec. Clause-clause subsumption calls : 0
% 0.41/0.90  # Non-unit clause-clause subsumptions  : 0
% 0.41/0.90  # Unit Clause-clause subsumption calls : 262
% 0.41/0.90  # Rewrite failures with RHS unbound    : 0
% 0.41/0.90  # BW rewrite match attempts            : 1
% 0.41/0.90  # BW rewrite match successes           : 1
% 0.41/0.90  # Condensation attempts                : 0
% 0.41/0.90  # Condensation successes               : 0
% 0.41/0.90  # Termbank termtop insertions          : 216297
% 0.41/0.90  
% 0.41/0.90  # -------------------------------------------------
% 0.41/0.90  # User time                : 0.265 s
% 0.41/0.90  # System time              : 0.023 s
% 0.41/0.90  # Total time               : 0.288 s
% 0.41/0.90  # Maximum resident set size: 11880 pages
% 0.41/0.90  
% 0.41/0.90  # -------------------------------------------------
% 0.41/0.90  # User time                : 0.384 s
% 0.41/0.90  # System time              : 0.051 s
% 0.41/0.90  # Total time               : 0.435 s
% 0.41/0.90  # Maximum resident set size: 2888 pages
% 0.41/0.90  % E---3.1 exiting
% 0.41/0.90  % E---3.1 exiting
%------------------------------------------------------------------------------