TSTP Solution File: SWV395+1 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SWV395+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% 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  : 600s
% DateTime : Wed Jul 20 18:16:27 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(l31_co,conjecture,
    ! [X1,X2,X3,X4] :
      ( ( pair_in_list(create_slb,X3,X4)
        & strictly_less_than(X3,X4)
        & ok(remove_cpq(triple(X1,create_slb,X2),X3)) )
     => pair_in_list(remove_slb(create_slb,X3),X3,X4) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l31_co) ).

fof(ax22,axiom,
    ! [X1,X2] : ~ pair_in_list(create_slb,X1,X2),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+2.ax',ax22) ).

fof(c_0_2,negated_conjecture,
    ~ ! [X1,X2,X3,X4] :
        ( ( pair_in_list(create_slb,X3,X4)
          & strictly_less_than(X3,X4)
          & ok(remove_cpq(triple(X1,create_slb,X2),X3)) )
       => pair_in_list(remove_slb(create_slb,X3),X3,X4) ),
    inference(assume_negation,[status(cth)],[l31_co]) ).

fof(c_0_3,negated_conjecture,
    ( pair_in_list(create_slb,esk3_0,esk4_0)
    & strictly_less_than(esk3_0,esk4_0)
    & ok(remove_cpq(triple(esk1_0,create_slb,esk2_0),esk3_0))
    & ~ pair_in_list(remove_slb(create_slb,esk3_0),esk3_0,esk4_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).

fof(c_0_4,plain,
    ! [X3,X4] : ~ pair_in_list(create_slb,X3,X4),
    inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[ax22])]) ).

cnf(c_0_5,negated_conjecture,
    pair_in_list(create_slb,esk3_0,esk4_0),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,plain,
    ~ pair_in_list(create_slb,X1,X2),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SWV395+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n004.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  : 600
% 0.13/0.34  % DateTime : Tue Jun 14 17:38:54 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.24/1.42  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42  # Preprocessing time       : 0.017 s
% 0.24/1.42  
% 0.24/1.42  # Proof found!
% 0.24/1.42  # SZS status Theorem
% 0.24/1.42  # SZS output start CNFRefutation
% See solution above
% 0.24/1.42  # Proof object total steps             : 8
% 0.24/1.42  # Proof object clause steps            : 3
% 0.24/1.42  # Proof object formula steps           : 5
% 0.24/1.42  # Proof object conjectures             : 5
% 0.24/1.42  # Proof object clause conjectures      : 2
% 0.24/1.42  # Proof object formula conjectures     : 3
% 0.24/1.42  # Proof object initial clauses used    : 2
% 0.24/1.42  # Proof object initial formulas used   : 2
% 0.24/1.42  # Proof object generating inferences   : 0
% 0.24/1.42  # Proof object simplifying inferences  : 1
% 0.24/1.42  # Training examples: 0 positive, 0 negative
% 0.24/1.42  # Parsed axioms                        : 42
% 0.24/1.42  # Removed by relevancy pruning/SinE    : 21
% 0.24/1.42  # Initial clauses                      : 31
% 0.24/1.42  # Removed in clause preprocessing      : 0
% 0.24/1.42  # Initial clauses in saturation        : 31
% 0.24/1.42  # Processed clauses                    : 13
% 0.24/1.42  # ...of these trivial                  : 0
% 0.24/1.42  # ...subsumed                          : 0
% 0.24/1.42  # ...remaining for further processing  : 13
% 0.24/1.42  # Other redundant clauses eliminated   : 0
% 0.24/1.42  # Clauses deleted for lack of memory   : 0
% 0.24/1.42  # Backward-subsumed                    : 0
% 0.24/1.42  # Backward-rewritten                   : 0
% 0.24/1.42  # Generated clauses                    : 4
% 0.24/1.42  # ...of the previous two non-trivial   : 1
% 0.24/1.42  # Contextual simplify-reflections      : 0
% 0.24/1.42  # Paramodulations                      : 1
% 0.24/1.42  # Factorizations                       : 2
% 0.24/1.42  # Equation resolutions                 : 0
% 0.24/1.42  # Current number of processed clauses  : 12
% 0.24/1.42  #    Positive orientable unit clauses  : 6
% 0.24/1.42  #    Positive unorientable unit clauses: 0
% 0.24/1.42  #    Negative unit clauses             : 3
% 0.24/1.42  #    Non-unit-clauses                  : 3
% 0.24/1.42  # Current number of unprocessed clauses: 19
% 0.24/1.42  # ...number of literals in the above   : 42
% 0.24/1.42  # Current number of archived formulas  : 0
% 0.24/1.42  # Current number of archived clauses   : 1
% 0.24/1.42  # Clause-clause subsumption calls (NU) : 0
% 0.24/1.42  # Rec. Clause-clause subsumption calls : 0
% 0.24/1.42  # Non-unit clause-clause subsumptions  : 0
% 0.24/1.42  # Unit Clause-clause subsumption calls : 2
% 0.24/1.42  # Rewrite failures with RHS unbound    : 0
% 0.24/1.42  # BW rewrite match attempts            : 0
% 0.24/1.42  # BW rewrite match successes           : 0
% 0.24/1.42  # Condensation attempts                : 0
% 0.24/1.42  # Condensation successes               : 0
% 0.24/1.42  # Termbank termtop insertions          : 1907
% 0.24/1.42  
% 0.24/1.42  # -------------------------------------------------
% 0.24/1.42  # User time                : 0.013 s
% 0.24/1.42  # System time              : 0.005 s
% 0.24/1.42  # Total time               : 0.018 s
% 0.24/1.42  # Maximum resident set size: 2772 pages
%------------------------------------------------------------------------------