TSTP Solution File: SWB002+4 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SWB002+4 : TPTP v8.1.0. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n022.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  : 600s
% DateTime : Tue Jul 19 19:01:53 EDT 2022

% Result   : Theorem 0.25s 1.43s
% Output   : CNFRefutation 0.25s
% 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   |;   4   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :    9 (   0 sgn   2   !;   5   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(testcase_conclusion_fullish_002_Existential_Blank_Nodes,conjecture,
    ? [X11,X12] :
      ( iext(uri_ex_p,X11,X12)
      & iext(uri_ex_q,X12,X11) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',testcase_conclusion_fullish_002_Existential_Blank_Nodes) ).

fof(testcase_premise_fullish_002_Existential_Blank_Nodes,axiom,
    ? [X13] :
      ( iext(uri_ex_p,uri_ex_s,X13)
      & iext(uri_ex_q,X13,uri_ex_s) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',testcase_premise_fullish_002_Existential_Blank_Nodes) ).

fof(c_0_2,negated_conjecture,
    ~ ? [X11,X12] :
        ( iext(uri_ex_p,X11,X12)
        & iext(uri_ex_q,X12,X11) ),
    inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_002_Existential_Blank_Nodes]) ).

fof(c_0_3,negated_conjecture,
    ! [X13,X14] :
      ( ~ iext(uri_ex_p,X13,X14)
      | ~ iext(uri_ex_q,X14,X13) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])]) ).

fof(c_0_4,plain,
    ( iext(uri_ex_p,uri_ex_s,esk1_0)
    & iext(uri_ex_q,esk1_0,uri_ex_s) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[testcase_premise_fullish_002_Existential_Blank_Nodes])]) ).

cnf(c_0_5,negated_conjecture,
    ( ~ iext(uri_ex_q,X1,X2)
    | ~ iext(uri_ex_p,X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,plain,
    iext(uri_ex_q,esk1_0,uri_ex_s),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,plain,
    iext(uri_ex_p,uri_ex_s,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SWB002+4 : TPTP v8.1.0. Released v5.2.0.
% 0.07/0.13  % Command  : run_ET %s %d
% 0.14/0.34  % Computer : n022.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Wed Jun  1 12:17:37 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.25/1.43  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.43  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.43  # Preprocessing time       : 0.015 s
% 0.25/1.43  
% 0.25/1.43  # Failure: Out of unprocessed clauses!
% 0.25/1.43  # OLD status GaveUp
% 0.25/1.43  # Parsed axioms                        : 82
% 0.25/1.43  # Removed by relevancy pruning/SinE    : 81
% 0.25/1.43  # Initial clauses                      : 1
% 0.25/1.43  # Removed in clause preprocessing      : 0
% 0.25/1.43  # Initial clauses in saturation        : 1
% 0.25/1.43  # Processed clauses                    : 1
% 0.25/1.43  # ...of these trivial                  : 0
% 0.25/1.43  # ...subsumed                          : 0
% 0.25/1.43  # ...remaining for further processing  : 1
% 0.25/1.43  # Other redundant clauses eliminated   : 0
% 0.25/1.43  # Clauses deleted for lack of memory   : 0
% 0.25/1.43  # Backward-subsumed                    : 0
% 0.25/1.43  # Backward-rewritten                   : 0
% 0.25/1.43  # Generated clauses                    : 0
% 0.25/1.43  # ...of the previous two non-trivial   : 0
% 0.25/1.43  # Contextual simplify-reflections      : 0
% 0.25/1.43  # Paramodulations                      : 0
% 0.25/1.43  # Factorizations                       : 0
% 0.25/1.43  # Equation resolutions                 : 0
% 0.25/1.43  # Current number of processed clauses  : 1
% 0.25/1.43  #    Positive orientable unit clauses  : 0
% 0.25/1.43  #    Positive unorientable unit clauses: 0
% 0.25/1.43  #    Negative unit clauses             : 0
% 0.25/1.43  #    Non-unit-clauses                  : 1
% 0.25/1.43  # Current number of unprocessed clauses: 0
% 0.25/1.43  # ...number of literals in the above   : 0
% 0.25/1.43  # Current number of archived formulas  : 0
% 0.25/1.43  # Current number of archived clauses   : 0
% 0.25/1.43  # Clause-clause subsumption calls (NU) : 0
% 0.25/1.43  # Rec. Clause-clause subsumption calls : 0
% 0.25/1.43  # Non-unit clause-clause subsumptions  : 0
% 0.25/1.43  # Unit Clause-clause subsumption calls : 0
% 0.25/1.43  # Rewrite failures with RHS unbound    : 0
% 0.25/1.43  # BW rewrite match attempts            : 0
% 0.25/1.43  # BW rewrite match successes           : 0
% 0.25/1.43  # Condensation attempts                : 0
% 0.25/1.43  # Condensation successes               : 0
% 0.25/1.43  # Termbank termtop insertions          : 575
% 0.25/1.43  
% 0.25/1.43  # -------------------------------------------------
% 0.25/1.43  # User time                : 0.012 s
% 0.25/1.43  # System time              : 0.003 s
% 0.25/1.43  # Total time               : 0.015 s
% 0.25/1.43  # Maximum resident set size: 2748 pages
% 0.25/1.43  # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.25/1.43  # Preprocessing time       : 0.017 s
% 0.25/1.43  
% 0.25/1.43  # Proof found!
% 0.25/1.43  # SZS status Theorem
% 0.25/1.43  # SZS output start CNFRefutation
% See solution above
% 0.25/1.43  # Proof object total steps             : 9
% 0.25/1.43  # Proof object clause steps            : 4
% 0.25/1.43  # Proof object formula steps           : 5
% 0.25/1.43  # Proof object conjectures             : 5
% 0.25/1.43  # Proof object clause conjectures      : 2
% 0.25/1.43  # Proof object formula conjectures     : 3
% 0.25/1.43  # Proof object initial clauses used    : 3
% 0.25/1.43  # Proof object initial formulas used   : 2
% 0.25/1.43  # Proof object generating inferences   : 1
% 0.25/1.43  # Proof object simplifying inferences  : 2
% 0.25/1.43  # Training examples: 0 positive, 0 negative
% 0.25/1.43  # Parsed axioms                        : 82
% 0.25/1.43  # Removed by relevancy pruning/SinE    : 0
% 0.25/1.43  # Initial clauses                      : 92
% 0.25/1.43  # Removed in clause preprocessing      : 3
% 0.25/1.43  # Initial clauses in saturation        : 89
% 0.25/1.43  # Processed clauses                    : 5
% 0.25/1.43  # ...of these trivial                  : 0
% 0.25/1.43  # ...subsumed                          : 0
% 0.25/1.43  # ...remaining for further processing  : 5
% 0.25/1.43  # Other redundant clauses eliminated   : 0
% 0.25/1.43  # Clauses deleted for lack of memory   : 0
% 0.25/1.43  # Backward-subsumed                    : 0
% 0.25/1.43  # Backward-rewritten                   : 0
% 0.25/1.43  # Generated clauses                    : 1
% 0.25/1.43  # ...of the previous two non-trivial   : 0
% 0.25/1.43  # Contextual simplify-reflections      : 0
% 0.25/1.43  # Paramodulations                      : 1
% 0.25/1.43  # Factorizations                       : 0
% 0.25/1.43  # Equation resolutions                 : 0
% 0.25/1.43  # Current number of processed clauses  : 5
% 0.25/1.43  #    Positive orientable unit clauses  : 3
% 0.25/1.43  #    Positive unorientable unit clauses: 0
% 0.25/1.43  #    Negative unit clauses             : 0
% 0.25/1.43  #    Non-unit-clauses                  : 2
% 0.25/1.43  # Current number of unprocessed clauses: 84
% 0.25/1.43  # ...number of literals in the above   : 113
% 0.25/1.43  # Current number of archived formulas  : 0
% 0.25/1.43  # Current number of archived clauses   : 1
% 0.25/1.43  # Clause-clause subsumption calls (NU) : 0
% 0.25/1.43  # Rec. Clause-clause subsumption calls : 0
% 0.25/1.43  # Non-unit clause-clause subsumptions  : 0
% 0.25/1.43  # Unit Clause-clause subsumption calls : 0
% 0.25/1.43  # Rewrite failures with RHS unbound    : 0
% 0.25/1.43  # BW rewrite match attempts            : 0
% 0.25/1.43  # BW rewrite match successes           : 0
% 0.25/1.43  # Condensation attempts                : 0
% 0.25/1.43  # Condensation successes               : 0
% 0.25/1.43  # Termbank termtop insertions          : 2864
% 0.25/1.43  
% 0.25/1.43  # -------------------------------------------------
% 0.25/1.43  # User time                : 0.015 s
% 0.25/1.43  # System time              : 0.002 s
% 0.25/1.43  # Total time               : 0.017 s
% 0.25/1.43  # Maximum resident set size: 3004 pages
%------------------------------------------------------------------------------