TSTP Solution File: CSR069+2 by E---3.1.00

View Problem - Process Solution

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

% Computer : n004.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 : 300s
% WCLimit  : 300s
% DateTime : Sat May  4 07:32:05 EDT 2024

% Result   : Theorem 0.40s 0.62s
% Output   : CNFRefutation 0.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    9 (   3 unt;   0 def)
%            Number of atoms       :   15 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   11 (   5   ~;   2   |;   1   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(query119,conjecture,
    ( mtvisible(c_tptpgeo_member1_mt)
   => borderson(c_georegion_l4_x38_y24,c_georegion_l4_x39_y24) ),
    file('/export/starexec/sandbox/tmp/tmp.Oq1Wx9faV6/E---3.1_29768.p',query119) ).

fof(ax1_463,axiom,
    ( mtvisible(c_tptpgeo_member1_mt)
   => borderson(c_georegion_l4_x38_y24,c_georegion_l4_x39_y24) ),
    file('/export/starexec/sandbox/tmp/tmp.Oq1Wx9faV6/E---3.1_29768.p',ax1_463) ).

fof(c_0_2,negated_conjecture,
    ~ ( mtvisible(c_tptpgeo_member1_mt)
     => borderson(c_georegion_l4_x38_y24,c_georegion_l4_x39_y24) ),
    inference(assume_negation,[status(cth)],[query119]) ).

fof(c_0_3,plain,
    ( ~ mtvisible(c_tptpgeo_member1_mt)
    | borderson(c_georegion_l4_x38_y24,c_georegion_l4_x39_y24) ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_463])]) ).

fof(c_0_4,negated_conjecture,
    ( mtvisible(c_tptpgeo_member1_mt)
    & ~ borderson(c_georegion_l4_x38_y24,c_georegion_l4_x39_y24) ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])]) ).

cnf(c_0_5,plain,
    ( borderson(c_georegion_l4_x38_y24,c_georegion_l4_x39_y24)
    | ~ mtvisible(c_tptpgeo_member1_mt) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,negated_conjecture,
    mtvisible(c_tptpgeo_member1_mt),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    ~ borderson(c_georegion_l4_x38_y24,c_georegion_l4_x39_y24),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6])]),c_0_7]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.17/0.18  % Problem    : CSR069+2 : TPTP v8.1.2. Released v3.4.0.
% 0.17/0.19  % Command    : run_E %s %d THM
% 0.19/0.40  % Computer : n004.cluster.edu
% 0.19/0.40  % Model    : x86_64 x86_64
% 0.19/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.40  % Memory   : 8042.1875MB
% 0.19/0.40  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.19/0.40  % CPULimit   : 300
% 0.19/0.40  % WCLimit    : 300
% 0.19/0.40  % DateTime   : Fri May  3 15:01:23 EDT 2024
% 0.19/0.40  % CPUTime    : 
% 0.40/0.59  Running first-order theorem proving
% 0.40/0.59  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.Oq1Wx9faV6/E---3.1_29768.p
% 0.40/0.62  # Version: 3.1.0
% 0.40/0.62  # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.40/0.62  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.62  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.40/0.62  # Starting new_bool_3 with 600s (2) cores
% 0.40/0.62  # Starting new_bool_1 with 600s (2) cores
% 0.40/0.62  # Starting sh5l with 300s (1) cores
% 0.40/0.62  # new_bool_3 with pid 29847 completed with status 0
% 0.40/0.62  # Result found by new_bool_3
% 0.40/0.62  # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.40/0.62  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.62  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.40/0.62  # Starting new_bool_3 with 600s (2) cores
% 0.40/0.62  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.40/0.62  # Search class: FHUNF-FFSS00-SFFFFFNN
% 0.40/0.62  # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.40/0.62  # Starting SAT001_MinMin_p005000_rr_RG with 361s (1) cores
% 0.40/0.62  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 61s (1) cores
% 0.40/0.62  # SAT001_MinMin_p005000_rr_RG with pid 29850 completed with status 0
% 0.40/0.62  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.40/0.62  # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.40/0.62  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.62  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.40/0.62  # Starting new_bool_3 with 600s (2) cores
% 0.40/0.62  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.40/0.62  # Search class: FHUNF-FFSS00-SFFFFFNN
% 0.40/0.62  # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.40/0.62  # Starting SAT001_MinMin_p005000_rr_RG with 361s (1) cores
% 0.40/0.62  # Preprocessing time       : 0.005 s
% 0.40/0.62  # Presaturation interreduction done
% 0.40/0.62  
% 0.40/0.62  # Proof found!
% 0.40/0.62  # SZS status Theorem
% 0.40/0.62  # SZS output start CNFRefutation
% See solution above
% 0.40/0.62  # Parsed axioms                        : 1132
% 0.40/0.62  # Removed by relevancy pruning/SinE    : 1114
% 0.40/0.62  # Initial clauses                      : 19
% 0.40/0.62  # Removed in clause preprocessing      : 0
% 0.40/0.62  # Initial clauses in saturation        : 19
% 0.40/0.62  # Processed clauses                    : 3
% 0.40/0.62  # ...of these trivial                  : 0
% 0.40/0.62  # ...subsumed                          : 0
% 0.40/0.62  # ...remaining for further processing  : 2
% 0.40/0.62  # Other redundant clauses eliminated   : 0
% 0.40/0.62  # Clauses deleted for lack of memory   : 0
% 0.40/0.62  # Backward-subsumed                    : 0
% 0.40/0.62  # Backward-rewritten                   : 0
% 0.40/0.62  # Generated clauses                    : 0
% 0.40/0.62  # ...of the previous two non-redundant : 0
% 0.40/0.62  # ...aggressively subsumed             : 0
% 0.40/0.62  # Contextual simplify-reflections      : 0
% 0.40/0.62  # Paramodulations                      : 0
% 0.40/0.62  # Factorizations                       : 0
% 0.40/0.62  # NegExts                              : 0
% 0.40/0.62  # Equation resolutions                 : 0
% 0.40/0.62  # Disequality decompositions           : 0
% 0.40/0.62  # Total rewrite steps                  : 1
% 0.40/0.62  # ...of those cached                   : 0
% 0.40/0.62  # Propositional unsat checks           : 0
% 0.40/0.62  #    Propositional check models        : 0
% 0.40/0.62  #    Propositional check unsatisfiable : 0
% 0.40/0.62  #    Propositional clauses             : 0
% 0.40/0.62  #    Propositional clauses after purity: 0
% 0.40/0.62  #    Propositional unsat core size     : 0
% 0.40/0.62  #    Propositional preprocessing time  : 0.000
% 0.40/0.62  #    Propositional encoding time       : 0.000
% 0.40/0.62  #    Propositional solver time         : 0.000
% 0.40/0.62  #    Success case prop preproc time    : 0.000
% 0.40/0.62  #    Success case prop encoding time   : 0.000
% 0.40/0.62  #    Success case prop solver time     : 0.000
% 0.40/0.62  # Current number of processed clauses  : 2
% 0.40/0.62  #    Positive orientable unit clauses  : 1
% 0.40/0.62  #    Positive unorientable unit clauses: 0
% 0.40/0.62  #    Negative unit clauses             : 1
% 0.40/0.62  #    Non-unit-clauses                  : 0
% 0.40/0.62  # Current number of unprocessed clauses: 16
% 0.40/0.62  # ...number of literals in the above   : 32
% 0.40/0.62  # Current number of archived formulas  : 0
% 0.40/0.62  # Current number of archived clauses   : 0
% 0.40/0.62  # Clause-clause subsumption calls (NU) : 0
% 0.40/0.62  # Rec. Clause-clause subsumption calls : 0
% 0.40/0.62  # Non-unit clause-clause subsumptions  : 0
% 0.40/0.62  # Unit Clause-clause subsumption calls : 0
% 0.40/0.62  # Rewrite failures with RHS unbound    : 0
% 0.40/0.62  # BW rewrite match attempts            : 0
% 0.40/0.62  # BW rewrite match successes           : 0
% 0.40/0.62  # Condensation attempts                : 0
% 0.40/0.62  # Condensation successes               : 0
% 0.40/0.62  # Termbank termtop insertions          : 8015
% 0.40/0.62  # Search garbage collected termcells   : 4903
% 0.40/0.62  
% 0.40/0.62  # -------------------------------------------------
% 0.40/0.62  # User time                : 0.009 s
% 0.40/0.62  # System time              : 0.004 s
% 0.40/0.62  # Total time               : 0.013 s
% 0.40/0.62  # Maximum resident set size: 4036 pages
% 0.40/0.62  
% 0.40/0.62  # -------------------------------------------------
% 0.40/0.62  # User time                : 0.028 s
% 0.40/0.62  # System time              : 0.010 s
% 0.40/0.62  # Total time               : 0.038 s
% 0.40/0.62  # Maximum resident set size: 2656 pages
% 0.40/0.62  % E---3.1 exiting
% 0.40/0.63  % E exiting
%------------------------------------------------------------------------------