TSTP Solution File: CSR063+4 by E---3.1.00

View Problem - Process Solution

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

% Computer : n029.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:13:55 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(ax3_41386,axiom,
    ! [X16,X17] :
      ( disjointwith(X16,X17)
     => disjointwith(X17,X16) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+3.ax',ax3_41386) ).

fof(query213,conjecture,
    ~ disjointwith(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf)),c_tptpcol_16_118949),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query213) ).

fof(ax3_4028,axiom,
    ! [X1] :
      ~ ( collection(X1)
        & individual(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+3.ax',ax3_4028) ).

fof(ax3_7072,axiom,
    ! [X2,X3] :
      ( disjointwith(X2,X3)
     => collection(X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+3.ax',ax3_7072) ).

fof(ax3_23452,axiom,
    individual(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf))),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR002+3.ax',ax3_23452) ).

fof(c_0_5,plain,
    ! [X38,X39] :
      ( ~ disjointwith(X38,X39)
      | disjointwith(X39,X38) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_41386])])]) ).

fof(c_0_6,negated_conjecture,
    disjointwith(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf)),c_tptpcol_16_118949),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[query213])]) ).

fof(c_0_7,plain,
    ! [X50] :
      ( ~ collection(X50)
      | ~ individual(X50) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_4028])])]) ).

fof(c_0_8,plain,
    ! [X27,X28] :
      ( ~ disjointwith(X27,X28)
      | collection(X28) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3_7072])])]) ).

cnf(c_0_9,plain,
    ( disjointwith(X2,X1)
    | ~ disjointwith(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_10,negated_conjecture,
    disjointwith(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf)),c_tptpcol_16_118949),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_11,plain,
    ( ~ collection(X1)
    | ~ individual(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,plain,
    individual(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf))),
    inference(split_conjunct,[status(thm)],[ax3_23452]) ).

cnf(c_0_13,plain,
    ( collection(X2)
    | ~ disjointwith(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_14,negated_conjecture,
    disjointwith(c_tptpcol_16_118949,f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf))),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_15,plain,
    ~ collection(f_urlreferentfn(f_urlfn(s_http_fwsistercitiesorgpdfsmbabanembabane20activity20pages2pdf))),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : CSR063+4 : TPTP v8.2.0. Released v3.4.0.
% 0.07/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n029.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:04:53 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.20/0.47  Running first-order theorem proving
% 0.20/0.47  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/benchmark/theBenchmark.p
% 1.61/1.21  # Version: 3.1.0
% 1.61/1.21  # Preprocessing class: FMLLLMSLSSSNFFN.
% 1.61/1.21  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.61/1.21  # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 1.61/1.21  # Starting new_bool_3 with 300s (1) cores
% 1.61/1.21  # Starting new_bool_1 with 300s (1) cores
% 1.61/1.21  # Starting sh5l with 300s (1) cores
% 1.61/1.21  # new_bool_1 with pid 9742 completed with status 0
% 1.61/1.21  # Result found by new_bool_1
% 1.61/1.21  # Preprocessing class: FMLLLMSLSSSNFFN.
% 1.61/1.21  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.61/1.21  # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 1.61/1.21  # Starting new_bool_3 with 300s (1) cores
% 1.61/1.21  # Starting new_bool_1 with 300s (1) cores
% 1.61/1.21  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.61/1.21  # Search class: FHHSM-FFMM32-SFFFFFNN
% 1.61/1.21  # partial match(1): FGHSM-FFMM32-SFFFFFNN
% 1.61/1.21  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.61/1.21  # Starting G-E--_301_C18_F1_URBAN_S0Y with 139s (1) cores
% 1.61/1.21  # G-E--_301_C18_F1_URBAN_S0Y with pid 9745 completed with status 0
% 1.61/1.21  # Result found by G-E--_301_C18_F1_URBAN_S0Y
% 1.61/1.21  # Preprocessing class: FMLLLMSLSSSNFFN.
% 1.61/1.21  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.61/1.21  # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 1.61/1.21  # Starting new_bool_3 with 300s (1) cores
% 1.61/1.21  # Starting new_bool_1 with 300s (1) cores
% 1.61/1.21  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.61/1.21  # Search class: FHHSM-FFMM32-SFFFFFNN
% 1.61/1.21  # partial match(1): FGHSM-FFMM32-SFFFFFNN
% 1.61/1.21  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.61/1.21  # Starting G-E--_301_C18_F1_URBAN_S0Y with 139s (1) cores
% 1.61/1.21  # Preprocessing time       : 0.012 s
% 1.61/1.21  
% 1.61/1.21  # Proof found!
% 1.61/1.21  # SZS status Theorem
% 1.61/1.21  # SZS output start CNFRefutation
% See solution above
% 1.61/1.21  # Parsed axioms                        : 44217
% 1.61/1.21  # Removed by relevancy pruning/SinE    : 44149
% 1.61/1.21  # Initial clauses                      : 68
% 1.61/1.21  # Removed in clause preprocessing      : 1
% 1.61/1.21  # Initial clauses in saturation        : 67
% 1.61/1.21  # Processed clauses                    : 83
% 1.61/1.21  # ...of these trivial                  : 7
% 1.61/1.21  # ...subsumed                          : 18
% 1.61/1.21  # ...remaining for further processing  : 58
% 1.61/1.21  # Other redundant clauses eliminated   : 2
% 1.61/1.21  # Clauses deleted for lack of memory   : 0
% 1.61/1.21  # Backward-subsumed                    : 1
% 1.61/1.21  # Backward-rewritten                   : 4
% 1.61/1.21  # Generated clauses                    : 76
% 1.61/1.21  # ...of the previous two non-redundant : 62
% 1.61/1.21  # ...aggressively subsumed             : 0
% 1.61/1.21  # Contextual simplify-reflections      : 0
% 1.61/1.21  # Paramodulations                      : 74
% 1.61/1.21  # Factorizations                       : 0
% 1.61/1.21  # NegExts                              : 0
% 1.61/1.21  # Equation resolutions                 : 2
% 1.61/1.21  # Disequality decompositions           : 0
% 1.61/1.21  # Total rewrite steps                  : 16
% 1.61/1.21  # ...of those cached                   : 9
% 1.61/1.21  # Propositional unsat checks           : 0
% 1.61/1.21  #    Propositional check models        : 0
% 1.61/1.21  #    Propositional check unsatisfiable : 0
% 1.61/1.21  #    Propositional clauses             : 0
% 1.61/1.21  #    Propositional clauses after purity: 0
% 1.61/1.21  #    Propositional unsat core size     : 0
% 1.61/1.21  #    Propositional preprocessing time  : 0.000
% 1.61/1.21  #    Propositional encoding time       : 0.000
% 1.61/1.21  #    Propositional solver time         : 0.000
% 1.61/1.21  #    Success case prop preproc time    : 0.000
% 1.61/1.21  #    Success case prop encoding time   : 0.000
% 1.61/1.21  #    Success case prop solver time     : 0.000
% 1.61/1.21  # Current number of processed clauses  : 51
% 1.61/1.21  #    Positive orientable unit clauses  : 24
% 1.61/1.21  #    Positive unorientable unit clauses: 0
% 1.61/1.21  #    Negative unit clauses             : 1
% 1.61/1.21  #    Non-unit-clauses                  : 26
% 1.61/1.21  # Current number of unprocessed clauses: 44
% 1.61/1.21  # ...number of literals in the above   : 67
% 1.61/1.21  # Current number of archived formulas  : 0
% 1.61/1.21  # Current number of archived clauses   : 5
% 1.61/1.21  # Clause-clause subsumption calls (NU) : 100
% 1.61/1.21  # Rec. Clause-clause subsumption calls : 94
% 1.61/1.21  # Non-unit clause-clause subsumptions  : 18
% 1.61/1.21  # Unit Clause-clause subsumption calls : 35
% 1.61/1.21  # Rewrite failures with RHS unbound    : 0
% 1.61/1.21  # BW rewrite match attempts            : 1
% 1.61/1.21  # BW rewrite match successes           : 1
% 1.61/1.21  # Condensation attempts                : 0
% 1.61/1.21  # Condensation successes               : 0
% 1.61/1.21  # Termbank termtop insertions          : 295134
% 1.61/1.21  # Search garbage collected termcells   : 157902
% 1.61/1.21  
% 1.61/1.21  # -------------------------------------------------
% 1.61/1.21  # User time                : 0.159 s
% 1.61/1.21  # System time              : 0.075 s
% 1.61/1.21  # Total time               : 0.234 s
% 1.61/1.21  # Maximum resident set size: 81076 pages
% 1.61/1.21  
% 1.61/1.21  # -------------------------------------------------
% 1.61/1.21  # User time                : 0.591 s
% 1.61/1.21  # System time              : 0.115 s
% 1.61/1.21  # Total time               : 0.706 s
% 1.61/1.21  # Maximum resident set size: 33932 pages
% 1.61/1.21  % E---3.1 exiting
% 1.61/1.21  % E exiting
%------------------------------------------------------------------------------