TSTP Solution File: CSR103+3 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : CSR103+3 : TPTP v8.1.2. Bugfixed v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n017.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:35 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(prove_from_ALL,conjecture,
    ! [X2341] : s__instance(X2341,s__Entity),
    file('/export/starexec/sandbox2/tmp/tmp.85dTfSCn19/E---3.1_13451.p',prove_from_ALL) ).

fof(kb_SUMO_27371,axiom,
    ! [X857] : s__instance(X857,s__Entity),
    file('/export/starexec/sandbox2/tmp/tmp.85dTfSCn19/E---3.1_13451.p',kb_SUMO_27371) ).

fof(c_0_2,negated_conjecture,
    ~ ! [X2341] : s__instance(X2341,s__Entity),
    inference(assume_negation,[status(cth)],[prove_from_ALL]) ).

fof(c_0_3,negated_conjecture,
    ~ s__instance(esk1_0,s__Entity),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).

fof(c_0_4,plain,
    ! [X2343] : s__instance(X2343,s__Entity),
    inference(variable_rename,[status(thm)],[kb_SUMO_27371]) ).

cnf(c_0_5,negated_conjecture,
    ~ s__instance(esk1_0,s__Entity),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,plain,
    s__instance(X1,s__Entity),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 104.13/104.32  % Problem    : CSR103+3 : TPTP v8.1.2. Bugfixed v7.3.0.
% 104.13/104.35  % Command    : run_E %s %d THM
% 104.22/104.56  % Computer : n017.cluster.edu
% 104.22/104.56  % Model    : x86_64 x86_64
% 104.22/104.56  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 104.22/104.56  % Memory   : 8042.1875MB
% 104.22/104.56  % OS       : Linux 3.10.0-693.el7.x86_64
% 104.22/104.56  % CPULimit   : 300
% 104.22/104.56  % WCLimit    : 300
% 104.22/104.56  % DateTime   : Fri May  3 14:28:37 EDT 2024
% 104.22/104.56  % CPUTime    : 
% 247.70/248.07  Running first-order theorem proving
% 247.70/248.07  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.85dTfSCn19/E---3.1_13451.p
% 252.68/251.09  # Version: 3.1.0
% 252.68/251.09  # Preprocessing class: FLLLSMSLSSSNFFN.
% 252.68/251.09  # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 252.68/251.09  # Starting G-E--_300_C01_S5PRR_S00 with 1490s (5) cores
% 252.68/251.09  # Starting new_bool_3 with 298s (1) cores
% 252.68/251.09  # Starting new_bool_1 with 298s (1) cores
% 252.68/251.09  # Starting sh5l with 298s (1) cores
% 252.68/251.09  # new_bool_3 with pid 14450 completed with status 0
% 252.68/251.09  # Result found by new_bool_3
% 252.68/251.09  # Preprocessing class: FLLLSMSLSSSNFFN.
% 252.68/251.09  # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 252.68/251.09  # Starting G-E--_300_C01_S5PRR_S00 with 1490s (5) cores
% 252.68/251.09  # Starting new_bool_3 with 298s (1) cores
% 252.68/251.09  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 252.68/251.09  # Search class: FHUSF-FFSM00-SFFFFFNN
% 252.68/251.09  # partial match(1): FHUNF-FFSM00-SFFFFFNN
% 252.68/251.09  # Scheduled 5 strats onto 1 cores with 298 seconds (298 total)
% 252.68/251.09  # Starting SAT001_MinMin_p005000_rr_RG with 179s (1) cores
% 252.68/251.09  # SAT001_MinMin_p005000_rr_RG with pid 14453 completed with status 0
% 252.68/251.09  # Result found by SAT001_MinMin_p005000_rr_RG
% 252.68/251.09  # Preprocessing class: FLLLSMSLSSSNFFN.
% 252.68/251.09  # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 252.68/251.09  # Starting G-E--_300_C01_S5PRR_S00 with 1490s (5) cores
% 252.68/251.09  # Starting new_bool_3 with 298s (1) cores
% 252.68/251.09  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 252.68/251.09  # Search class: FHUSF-FFSM00-SFFFFFNN
% 252.68/251.09  # partial match(1): FHUNF-FFSM00-SFFFFFNN
% 252.68/251.09  # Scheduled 5 strats onto 1 cores with 298 seconds (298 total)
% 252.68/251.09  # Starting SAT001_MinMin_p005000_rr_RG with 179s (1) cores
% 252.68/251.09  # Preprocessing time       : 0.022 s
% 252.68/251.09  # Presaturation interreduction done
% 252.68/251.09  
% 252.68/251.09  # Proof found!
% 252.68/251.09  # SZS status Theorem
% 252.68/251.09  # SZS output start CNFRefutation
% See solution above
% 252.68/251.09  # Parsed axioms                        : 145102
% 252.68/251.09  # Removed by relevancy pruning/SinE    : 145086
% 252.68/251.09  # Initial clauses                      : 19
% 252.68/251.09  # Removed in clause preprocessing      : 4
% 252.68/251.09  # Initial clauses in saturation        : 15
% 252.68/251.09  # Processed clauses                    : 4
% 252.68/251.09  # ...of these trivial                  : 0
% 252.68/251.09  # ...subsumed                          : 0
% 252.68/251.09  # ...remaining for further processing  : 4
% 252.68/251.09  # Other redundant clauses eliminated   : 0
% 252.68/251.09  # Clauses deleted for lack of memory   : 0
% 252.68/251.09  # Backward-subsumed                    : 0
% 252.68/251.09  # Backward-rewritten                   : 3
% 252.68/251.09  # Generated clauses                    : 0
% 252.68/251.09  # ...of the previous two non-redundant : 0
% 252.68/251.09  # ...aggressively subsumed             : 0
% 252.68/251.09  # Contextual simplify-reflections      : 0
% 252.68/251.09  # Paramodulations                      : 0
% 252.68/251.09  # Factorizations                       : 0
% 252.68/251.09  # NegExts                              : 0
% 252.68/251.09  # Equation resolutions                 : 0
% 252.68/251.09  # Disequality decompositions           : 0
% 252.68/251.09  # Total rewrite steps                  : 2
% 252.68/251.09  # ...of those cached                   : 0
% 252.68/251.09  # Propositional unsat checks           : 0
% 252.68/251.09  #    Propositional check models        : 0
% 252.68/251.09  #    Propositional check unsatisfiable : 0
% 252.68/251.09  #    Propositional clauses             : 0
% 252.68/251.09  #    Propositional clauses after purity: 0
% 252.68/251.09  #    Propositional unsat core size     : 0
% 252.68/251.09  #    Propositional preprocessing time  : 0.000
% 252.68/251.09  #    Propositional encoding time       : 0.000
% 252.68/251.09  #    Propositional solver time         : 0.000
% 252.68/251.09  #    Success case prop preproc time    : 0.000
% 252.68/251.09  #    Success case prop encoding time   : 0.000
% 252.68/251.09  #    Success case prop solver time     : 0.000
% 252.68/251.09  # Current number of processed clauses  : 1
% 252.68/251.09  #    Positive orientable unit clauses  : 1
% 252.68/251.09  #    Positive unorientable unit clauses: 0
% 252.68/251.09  #    Negative unit clauses             : 0
% 252.68/251.09  #    Non-unit-clauses                  : 0
% 252.68/251.09  # Current number of unprocessed clauses: 11
% 252.68/251.09  # ...number of literals in the above   : 27
% 252.68/251.09  # Current number of archived formulas  : 0
% 252.68/251.09  # Current number of archived clauses   : 3
% 252.68/251.09  # Clause-clause subsumption calls (NU) : 0
% 252.68/251.09  # Rec. Clause-clause subsumption calls : 0
% 252.68/251.09  # Non-unit clause-clause subsumptions  : 0
% 252.68/251.09  # Unit Clause-clause subsumption calls : 0
% 252.68/251.09  # Rewrite failures with RHS unbound    : 0
% 252.68/251.09  # BW rewrite match attempts            : 3
% 252.68/251.09  # BW rewrite match successes           : 3
% 252.68/251.09  # Condensation attempts                : 0
% 252.68/251.09  # Condensation successes               : 0
% 252.68/251.09  # Termbank termtop insertions          : 1007077
% 252.68/251.09  # Search garbage collected termcells   : 459636
% 252.68/251.09  
% 252.68/251.09  # -------------------------------------------------
% 252.68/251.09  # User time                : 0.358 s
% 252.68/251.09  # System time              : 0.115 s
% 252.68/251.09  # Total time               : 0.473 s
% 252.68/251.09  # Maximum resident set size: 174924 pages
% 252.68/251.09  
% 252.68/251.09  # -------------------------------------------------
% 252.68/251.09  # User time                : 2.641 s
% 252.68/251.09  # System time              : 0.213 s
% 252.68/251.09  # Total time               : 2.854 s
% 252.68/251.09  # Maximum resident set size: 100324 pages
% 252.68/251.09  % E---3.1 exiting
% 252.68/251.10  % E exiting
%------------------------------------------------------------------------------