TSTP Solution File: CSR037+2 by E-SAT---3.1.00

View Problem - Process Solution

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

% Computer : n014.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 : Mon May 20 19:17:24 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(query87,conjecture,
    ( mtvisible(c_tptpgeo_member7_mt)
   => geographicalsubregions(c_georegion_l2_x5_y8,c_georegion_l4_x45_y72) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query87) ).

fof(ax1_188,axiom,
    ( mtvisible(c_tptpgeo_member7_mt)
   => geographicalsubregions(c_georegion_l3_x15_y24,c_georegion_l4_x45_y72) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_188) ).

fof(ax1_1041,axiom,
    ! [X13,X14,X19] :
      ( ( geographicalsubregions(X13,X14)
        & geographicalsubregions(X14,X19) )
     => geographicalsubregions(X13,X19) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_1041) ).

fof(ax1_276,axiom,
    ( mtvisible(c_tptpgeo_member7_mt)
   => geographicalsubregions(c_georegion_l2_x5_y8,c_georegion_l3_x15_y24) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+1.ax',ax1_276) ).

fof(c_0_4,negated_conjecture,
    ~ ( mtvisible(c_tptpgeo_member7_mt)
     => geographicalsubregions(c_georegion_l2_x5_y8,c_georegion_l4_x45_y72) ),
    inference(assume_negation,[status(cth)],[query87]) ).

fof(c_0_5,plain,
    ( ~ mtvisible(c_tptpgeo_member7_mt)
    | geographicalsubregions(c_georegion_l3_x15_y24,c_georegion_l4_x45_y72) ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_188])]) ).

fof(c_0_6,negated_conjecture,
    ( mtvisible(c_tptpgeo_member7_mt)
    & ~ geographicalsubregions(c_georegion_l2_x5_y8,c_georegion_l4_x45_y72) ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).

fof(c_0_7,plain,
    ! [X22,X23,X24] :
      ( ~ geographicalsubregions(X22,X23)
      | ~ geographicalsubregions(X23,X24)
      | geographicalsubregions(X22,X24) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_1041])])]) ).

cnf(c_0_8,plain,
    ( geographicalsubregions(c_georegion_l3_x15_y24,c_georegion_l4_x45_y72)
    | ~ mtvisible(c_tptpgeo_member7_mt) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,negated_conjecture,
    mtvisible(c_tptpgeo_member7_mt),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

fof(c_0_10,plain,
    ( ~ mtvisible(c_tptpgeo_member7_mt)
    | geographicalsubregions(c_georegion_l2_x5_y8,c_georegion_l3_x15_y24) ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1_276])]) ).

cnf(c_0_11,plain,
    ( geographicalsubregions(X1,X3)
    | ~ geographicalsubregions(X1,X2)
    | ~ geographicalsubregions(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,plain,
    geographicalsubregions(c_georegion_l3_x15_y24,c_georegion_l4_x45_y72),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]) ).

cnf(c_0_13,plain,
    ( geographicalsubregions(c_georegion_l2_x5_y8,c_georegion_l3_x15_y24)
    | ~ mtvisible(c_tptpgeo_member7_mt) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_14,negated_conjecture,
    ~ geographicalsubregions(c_georegion_l2_x5_y8,c_georegion_l4_x45_y72),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_15,plain,
    ( geographicalsubregions(X1,c_georegion_l4_x45_y72)
    | ~ geographicalsubregions(X1,c_georegion_l3_x15_y24) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,plain,
    geographicalsubregions(c_georegion_l2_x5_y8,c_georegion_l3_x15_y24),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_9])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : CSR037+2 : TPTP v8.2.0. Released v3.4.0.
% 0.07/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n014.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Sun May 19 01:51:08 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.20/0.48  Running first-order model finding
% 0.20/0.48  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.51  # Version: 3.1.0
% 0.20/0.51  # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.20/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.20/0.51  # Starting new_bool_3 with 600s (2) cores
% 0.20/0.51  # Starting new_bool_1 with 600s (2) cores
% 0.20/0.51  # Starting sh5l with 300s (1) cores
% 0.20/0.51  # new_bool_3 with pid 26797 completed with status 0
% 0.20/0.51  # Result found by new_bool_3
% 0.20/0.51  # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.20/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.20/0.51  # Starting new_bool_3 with 600s (2) cores
% 0.20/0.51  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51  # Search class: FHUNF-FFSF00-SFFFFFNN
% 0.20/0.51  # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.20/0.51  # Starting SAT001_MinMin_p005000_rr_RG with 361s (1) cores
% 0.20/0.51  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 61s (1) cores
% 0.20/0.51  # SAT001_MinMin_p005000_rr_RG with pid 26802 completed with status 0
% 0.20/0.51  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.51  # Preprocessing class: FMLMSMSLSSSNFFN.
% 0.20/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.20/0.51  # Starting new_bool_3 with 600s (2) cores
% 0.20/0.51  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51  # Search class: FHUNF-FFSF00-SFFFFFNN
% 0.20/0.51  # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.20/0.51  # Starting SAT001_MinMin_p005000_rr_RG with 361s (1) cores
% 0.20/0.51  # Preprocessing time       : 0.002 s
% 0.20/0.51  # Presaturation interreduction done
% 0.20/0.51  
% 0.20/0.51  # Proof found!
% 0.20/0.51  # SZS status Theorem
% 0.20/0.51  # SZS output start CNFRefutation
% See solution above
% 0.20/0.51  # Parsed axioms                        : 1132
% 0.20/0.51  # Removed by relevancy pruning/SinE    : 1126
% 0.20/0.51  # Initial clauses                      : 7
% 0.20/0.51  # Removed in clause preprocessing      : 0
% 0.20/0.51  # Initial clauses in saturation        : 7
% 0.20/0.51  # Processed clauses                    : 15
% 0.20/0.51  # ...of these trivial                  : 0
% 0.20/0.51  # ...subsumed                          : 0
% 0.20/0.51  # ...remaining for further processing  : 15
% 0.20/0.51  # Other redundant clauses eliminated   : 0
% 0.20/0.51  # Clauses deleted for lack of memory   : 0
% 0.20/0.51  # Backward-subsumed                    : 0
% 0.20/0.51  # Backward-rewritten                   : 0
% 0.20/0.51  # Generated clauses                    : 4
% 0.20/0.51  # ...of the previous two non-redundant : 2
% 0.20/0.51  # ...aggressively subsumed             : 0
% 0.20/0.51  # Contextual simplify-reflections      : 0
% 0.20/0.51  # Paramodulations                      : 4
% 0.20/0.51  # Factorizations                       : 0
% 0.20/0.51  # NegExts                              : 0
% 0.20/0.51  # Equation resolutions                 : 0
% 0.20/0.51  # Disequality decompositions           : 0
% 0.20/0.51  # Total rewrite steps                  : 3
% 0.20/0.51  # ...of those cached                   : 1
% 0.20/0.51  # Propositional unsat checks           : 0
% 0.20/0.51  #    Propositional check models        : 0
% 0.20/0.51  #    Propositional check unsatisfiable : 0
% 0.20/0.51  #    Propositional clauses             : 0
% 0.20/0.51  #    Propositional clauses after purity: 0
% 0.20/0.51  #    Propositional unsat core size     : 0
% 0.20/0.51  #    Propositional preprocessing time  : 0.000
% 0.20/0.51  #    Propositional encoding time       : 0.000
% 0.20/0.51  #    Propositional solver time         : 0.000
% 0.20/0.51  #    Success case prop preproc time    : 0.000
% 0.20/0.51  #    Success case prop encoding time   : 0.000
% 0.20/0.51  #    Success case prop solver time     : 0.000
% 0.20/0.51  # Current number of processed clauses  : 8
% 0.20/0.51  #    Positive orientable unit clauses  : 3
% 0.20/0.51  #    Positive unorientable unit clauses: 0
% 0.20/0.51  #    Negative unit clauses             : 1
% 0.20/0.51  #    Non-unit-clauses                  : 4
% 0.20/0.51  # Current number of unprocessed clauses: 1
% 0.20/0.51  # ...number of literals in the above   : 2
% 0.20/0.51  # Current number of archived formulas  : 0
% 0.20/0.51  # Current number of archived clauses   : 7
% 0.20/0.51  # Clause-clause subsumption calls (NU) : 0
% 0.20/0.51  # Rec. Clause-clause subsumption calls : 0
% 0.20/0.51  # Non-unit clause-clause subsumptions  : 0
% 0.20/0.51  # Unit Clause-clause subsumption calls : 0
% 0.20/0.51  # Rewrite failures with RHS unbound    : 0
% 0.20/0.51  # BW rewrite match attempts            : 0
% 0.20/0.51  # BW rewrite match successes           : 0
% 0.20/0.51  # Condensation attempts                : 0
% 0.20/0.51  # Condensation successes               : 0
% 0.20/0.51  # Termbank termtop insertions          : 7661
% 0.20/0.51  # Search garbage collected termcells   : 4864
% 0.20/0.51  
% 0.20/0.51  # -------------------------------------------------
% 0.20/0.51  # User time                : 0.005 s
% 0.20/0.51  # System time              : 0.006 s
% 0.20/0.51  # Total time               : 0.011 s
% 0.20/0.51  # Maximum resident set size: 4040 pages
% 0.20/0.51  
% 0.20/0.51  # -------------------------------------------------
% 0.20/0.51  # User time                : 0.021 s
% 0.20/0.51  # System time              : 0.013 s
% 0.20/0.51  # Total time               : 0.034 s
% 0.20/0.51  # Maximum resident set size: 2656 pages
% 0.20/0.51  % E---3.1 exiting
%------------------------------------------------------------------------------