TSTP Solution File: GEO082+1 by E---3.1

View Problem - Process Solution

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

% Computer : n020.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 17:31:24 EDT 2023

% Result   : Theorem 0.16s 0.54s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   19 (   6 unt;   0 def)
%            Number of atoms       :   52 (  11 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   48 (  15   ~;  20   |;   7   &)
%                                         (   2 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   29 (   0 sgn;  17   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(part_of_defn,axiom,
    ! [X1,X2] :
      ( part_of(X2,X1)
    <=> ! [X3] :
          ( incident_c(X3,X2)
         => incident_c(X3,X1) ) ),
    file('/export/starexec/sandbox/tmp/tmp.hIbyrHrkRB/E---3.1_18316.p',part_of_defn) ).

fof(c9,axiom,
    ! [X1,X2] :
      ( ! [X3] :
          ( incident_c(X3,X1)
        <=> incident_c(X3,X2) )
     => X1 = X2 ),
    file('/export/starexec/sandbox/tmp/tmp.hIbyrHrkRB/E---3.1_18316.p',c9) ).

fof(part_of_antisymmetry,conjecture,
    ! [X2,X4] :
      ( ( part_of(X2,X4)
        & part_of(X4,X2) )
     => X2 = X4 ),
    file('/export/starexec/sandbox/tmp/tmp.hIbyrHrkRB/E---3.1_18316.p',part_of_antisymmetry) ).

fof(c_0_3,plain,
    ! [X10,X11,X12,X13,X14] :
      ( ( ~ part_of(X11,X10)
        | ~ incident_c(X12,X11)
        | incident_c(X12,X10) )
      & ( incident_c(esk3_2(X13,X14),X14)
        | part_of(X14,X13) )
      & ( ~ incident_c(esk3_2(X13,X14),X13)
        | part_of(X14,X13) ) ),
    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)],[part_of_defn])])])])])]) ).

fof(c_0_4,plain,
    ! [X46,X47] :
      ( ( ~ incident_c(esk8_2(X46,X47),X46)
        | ~ incident_c(esk8_2(X46,X47),X47)
        | X46 = X47 )
      & ( incident_c(esk8_2(X46,X47),X46)
        | incident_c(esk8_2(X46,X47),X47)
        | X46 = X47 ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c9])])])]) ).

fof(c_0_5,negated_conjecture,
    ~ ! [X2,X4] :
        ( ( part_of(X2,X4)
          & part_of(X4,X2) )
       => X2 = X4 ),
    inference(assume_negation,[status(cth)],[part_of_antisymmetry]) ).

cnf(c_0_6,plain,
    ( incident_c(X3,X2)
    | ~ part_of(X1,X2)
    | ~ incident_c(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_7,plain,
    ( incident_c(esk8_2(X1,X2),X1)
    | incident_c(esk8_2(X1,X2),X2)
    | X1 = X2 ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

fof(c_0_8,negated_conjecture,
    ( part_of(esk1_0,esk2_0)
    & part_of(esk2_0,esk1_0)
    & esk1_0 != esk2_0 ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).

cnf(c_0_9,plain,
    ( X1 = X2
    | incident_c(esk8_2(X1,X2),X2)
    | incident_c(esk8_2(X1,X2),X3)
    | ~ part_of(X1,X3) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,negated_conjecture,
    part_of(esk2_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    ( esk2_0 = X1
    | incident_c(esk8_2(esk2_0,X1),esk1_0)
    | incident_c(esk8_2(esk2_0,X1),X1) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_12,negated_conjecture,
    esk1_0 != esk2_0,
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,plain,
    ( X1 = X2
    | ~ incident_c(esk8_2(X1,X2),X1)
    | ~ incident_c(esk8_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_14,negated_conjecture,
    incident_c(esk8_2(esk2_0,esk1_0),esk1_0),
    inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_11]),c_0_12]) ).

cnf(c_0_15,negated_conjecture,
    ~ incident_c(esk8_2(esk2_0,esk1_0),esk2_0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_12]) ).

cnf(c_0_16,negated_conjecture,
    ( incident_c(esk8_2(esk2_0,esk1_0),X1)
    | ~ part_of(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_6,c_0_14]) ).

cnf(c_0_17,negated_conjecture,
    part_of(esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_18,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem    : GEO082+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.12  % Command    : run_E %s %d THM
% 0.11/0.32  % Computer : n020.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 2400
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Tue Oct  3 06:21:00 EDT 2023
% 0.11/0.32  % CPUTime    : 
% 0.16/0.44  Running first-order theorem proving
% 0.16/0.44  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.hIbyrHrkRB/E---3.1_18316.p
% 0.16/0.54  # Version: 3.1pre001
% 0.16/0.54  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.54  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.54  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.54  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.54  # Starting new_bool_1 with 300s (1) cores
% 0.16/0.54  # Starting sh5l with 300s (1) cores
% 0.16/0.54  # new_bool_1 with pid 18396 completed with status 0
% 0.16/0.54  # Result found by new_bool_1
% 0.16/0.54  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.54  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.54  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.54  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.54  # Starting new_bool_1 with 300s (1) cores
% 0.16/0.54  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.54  # Search class: FGHSF-FFMF32-SFFFFFNN
% 0.16/0.54  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.54  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.16/0.54  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 18398 completed with status 0
% 0.16/0.54  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.54  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.54  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.54  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.54  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.54  # Starting new_bool_1 with 300s (1) cores
% 0.16/0.54  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.54  # Search class: FGHSF-FFMF32-SFFFFFNN
% 0.16/0.54  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.54  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.16/0.54  # Preprocessing time       : 0.001 s
% 0.16/0.54  # Presaturation interreduction done
% 0.16/0.54  
% 0.16/0.54  # Proof found!
% 0.16/0.54  # SZS status Theorem
% 0.16/0.54  # SZS output start CNFRefutation
% See solution above
% 0.16/0.54  # Parsed axioms                        : 17
% 0.16/0.54  # Removed by relevancy pruning/SinE    : 6
% 0.16/0.54  # Initial clauses                      : 36
% 0.16/0.54  # Removed in clause preprocessing      : 0
% 0.16/0.54  # Initial clauses in saturation        : 36
% 0.16/0.54  # Processed clauses                    : 656
% 0.16/0.54  # ...of these trivial                  : 1
% 0.16/0.54  # ...subsumed                          : 178
% 0.16/0.54  # ...remaining for further processing  : 477
% 0.16/0.54  # Other redundant clauses eliminated   : 3
% 0.16/0.54  # Clauses deleted for lack of memory   : 0
% 0.16/0.54  # Backward-subsumed                    : 8
% 0.16/0.54  # Backward-rewritten                   : 22
% 0.16/0.54  # Generated clauses                    : 4856
% 0.16/0.54  # ...of the previous two non-redundant : 4781
% 0.16/0.54  # ...aggressively subsumed             : 0
% 0.16/0.54  # Contextual simplify-reflections      : 0
% 0.16/0.54  # Paramodulations                      : 4835
% 0.16/0.54  # Factorizations                       : 18
% 0.16/0.54  # NegExts                              : 0
% 0.16/0.54  # Equation resolutions                 : 3
% 0.16/0.54  # Total rewrite steps                  : 83
% 0.16/0.54  # Propositional unsat checks           : 0
% 0.16/0.54  #    Propositional check models        : 0
% 0.16/0.54  #    Propositional check unsatisfiable : 0
% 0.16/0.54  #    Propositional clauses             : 0
% 0.16/0.54  #    Propositional clauses after purity: 0
% 0.16/0.54  #    Propositional unsat core size     : 0
% 0.16/0.54  #    Propositional preprocessing time  : 0.000
% 0.16/0.54  #    Propositional encoding time       : 0.000
% 0.16/0.54  #    Propositional solver time         : 0.000
% 0.16/0.54  #    Success case prop preproc time    : 0.000
% 0.16/0.54  #    Success case prop encoding time   : 0.000
% 0.16/0.54  #    Success case prop solver time     : 0.000
% 0.16/0.54  # Current number of processed clauses  : 408
% 0.16/0.54  #    Positive orientable unit clauses  : 87
% 0.16/0.54  #    Positive unorientable unit clauses: 0
% 0.16/0.54  #    Negative unit clauses             : 2
% 0.16/0.54  #    Non-unit-clauses                  : 319
% 0.16/0.54  # Current number of unprocessed clauses: 4139
% 0.16/0.54  # ...number of literals in the above   : 14034
% 0.16/0.54  # Current number of archived formulas  : 0
% 0.16/0.54  # Current number of archived clauses   : 66
% 0.16/0.54  # Clause-clause subsumption calls (NU) : 11796
% 0.16/0.54  # Rec. Clause-clause subsumption calls : 8407
% 0.16/0.54  # Non-unit clause-clause subsumptions  : 186
% 0.16/0.54  # Unit Clause-clause subsumption calls : 258
% 0.16/0.54  # Rewrite failures with RHS unbound    : 0
% 0.16/0.54  # BW rewrite match attempts            : 878
% 0.16/0.54  # BW rewrite match successes           : 22
% 0.16/0.54  # Condensation attempts                : 0
% 0.16/0.54  # Condensation successes               : 0
% 0.16/0.54  # Termbank termtop insertions          : 93067
% 0.16/0.54  
% 0.16/0.54  # -------------------------------------------------
% 0.16/0.54  # User time                : 0.084 s
% 0.16/0.54  # System time              : 0.003 s
% 0.16/0.54  # Total time               : 0.087 s
% 0.16/0.54  # Maximum resident set size: 1852 pages
% 0.16/0.54  
% 0.16/0.54  # -------------------------------------------------
% 0.16/0.54  # User time                : 0.085 s
% 0.16/0.54  # System time              : 0.005 s
% 0.16/0.54  # Total time               : 0.091 s
% 0.16/0.54  # Maximum resident set size: 1696 pages
% 0.16/0.54  % E---3.1 exiting
% 0.16/0.54  % E---3.1 exiting
%------------------------------------------------------------------------------