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

View Problem - Process Solution

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

% Computer : n005.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:26 EDT 2022

% Result   : Theorem 0.25s 1.42s
% Output   : CNFRefutation 0.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   24 (  10 unt;   0 def)
%            Number of atoms       :   52 (   3 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   51 (  23   ~;  18   |;   4   &)
%                                         (   2 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :   12 (  12 usr;   5 con; 0-3 aty)
%            Number of variables   :   76 (  13 sgn  41   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(ax37,axiom,
    ! [X1,X2,X3,X4,X5] :
      ( less_than(X5,X4)
     => ( check_cpq(triple(X1,insert_slb(X2,pair(X4,X5)),X3))
      <=> check_cpq(triple(X1,X2,X3)) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax37) ).

fof(ax42,axiom,
    ! [X1,X2,X3,X4] : insert_cpq(triple(X1,X2,X3),X4) = triple(insert_pqp(X1,X4),insert_slb(X2,pair(X4,bottom)),X3),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax42) ).

fof(bottom_smallest,axiom,
    ! [X1] : less_than(bottom,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',bottom_smallest) ).

fof(l26_li4142,lemma,
    ! [X1,X2,X3] :
      ( check_cpq(triple(X1,X2,X3))
    <=> ! [X4,X5] :
          ( pair_in_list(X2,X4,X5)
         => less_than(X5,X4) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l26_li4142) ).

fof(l26_co,conjecture,
    ! [X1,X2,X3] :
      ( ~ check_cpq(triple(X1,X2,X3))
     => ! [X4] : ~ check_cpq(insert_cpq(triple(X1,X2,X3),X4)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l26_co) ).

fof(c_0_5,plain,
    ! [X6,X7,X8,X9,X10] :
      ( ( ~ check_cpq(triple(X6,insert_slb(X7,pair(X9,X10)),X8))
        | check_cpq(triple(X6,X7,X8))
        | ~ less_than(X10,X9) )
      & ( ~ check_cpq(triple(X6,X7,X8))
        | check_cpq(triple(X6,insert_slb(X7,pair(X9,X10)),X8))
        | ~ less_than(X10,X9) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax37])])]) ).

fof(c_0_6,plain,
    ! [X5,X6,X7,X8] : insert_cpq(triple(X5,X6,X7),X8) = triple(insert_pqp(X5,X8),insert_slb(X6,pair(X8,bottom)),X7),
    inference(variable_rename,[status(thm)],[ax42]) ).

fof(c_0_7,plain,
    ! [X2] : less_than(bottom,X2),
    inference(variable_rename,[status(thm)],[bottom_smallest]) ).

fof(c_0_8,lemma,
    ! [X6,X7,X8,X9,X10,X6,X7,X8] :
      ( ( ~ check_cpq(triple(X6,X7,X8))
        | ~ pair_in_list(X7,X9,X10)
        | less_than(X10,X9) )
      & ( pair_in_list(X7,esk1_2(X6,X7),esk2_2(X6,X7))
        | check_cpq(triple(X6,X7,X8)) )
      & ( ~ less_than(esk2_2(X6,X7),esk1_2(X6,X7))
        | check_cpq(triple(X6,X7,X8)) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l26_li4142])])])])])])]) ).

cnf(c_0_9,plain,
    ( check_cpq(triple(X3,X4,X5))
    | ~ less_than(X1,X2)
    | ~ check_cpq(triple(X3,insert_slb(X4,pair(X2,X1)),X5)) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_10,plain,
    insert_cpq(triple(X1,X2,X3),X4) = triple(insert_pqp(X1,X4),insert_slb(X2,pair(X4,bottom)),X3),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_11,plain,
    less_than(bottom,X1),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_12,negated_conjecture,
    ~ ! [X1,X2,X3] :
        ( ~ check_cpq(triple(X1,X2,X3))
       => ! [X4] : ~ check_cpq(insert_cpq(triple(X1,X2,X3),X4)) ),
    inference(assume_negation,[status(cth)],[l26_co]) ).

cnf(c_0_13,lemma,
    ( less_than(X1,X2)
    | ~ pair_in_list(X3,X2,X1)
    | ~ check_cpq(triple(X4,X3,X5)) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_14,plain,
    ( check_cpq(triple(insert_pqp(X1,X2),X3,X4))
    | ~ check_cpq(insert_cpq(triple(X1,X3,X4),X2)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).

fof(c_0_15,negated_conjecture,
    ( ~ check_cpq(triple(esk3_0,esk4_0,esk5_0))
    & check_cpq(insert_cpq(triple(esk3_0,esk4_0,esk5_0),esk6_0)) ),
    inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_12])])])])])]) ).

cnf(c_0_16,lemma,
    ( less_than(X1,X2)
    | ~ check_cpq(insert_cpq(triple(X3,X4,X5),X6))
    | ~ pair_in_list(X4,X2,X1) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,negated_conjecture,
    check_cpq(insert_cpq(triple(esk3_0,esk4_0,esk5_0),esk6_0)),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_18,negated_conjecture,
    ( less_than(X1,X2)
    | ~ pair_in_list(esk4_0,X2,X1) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_19,lemma,
    ( check_cpq(triple(X1,X2,X3))
    | pair_in_list(X2,esk1_2(X1,X2),esk2_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_20,lemma,
    ( check_cpq(triple(X1,X2,X3))
    | ~ less_than(esk2_2(X1,X2),esk1_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_21,negated_conjecture,
    ~ check_cpq(triple(esk3_0,esk4_0,esk5_0)),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_22,lemma,
    check_cpq(triple(X1,esk4_0,X2)),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).

cnf(c_0_23,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : SWV390+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.14  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n005.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 21:50:39 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.25/1.42  # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.25/1.42  # Preprocessing time       : 0.017 s
% 0.25/1.42  
% 0.25/1.42  # Proof found!
% 0.25/1.42  # SZS status Theorem
% 0.25/1.42  # SZS output start CNFRefutation
% See solution above
% 0.25/1.42  # Proof object total steps             : 24
% 0.25/1.42  # Proof object clause steps            : 13
% 0.25/1.42  # Proof object formula steps           : 11
% 0.25/1.42  # Proof object conjectures             : 7
% 0.25/1.42  # Proof object clause conjectures      : 4
% 0.25/1.42  # Proof object formula conjectures     : 3
% 0.25/1.42  # Proof object initial clauses used    : 8
% 0.25/1.42  # Proof object initial formulas used   : 5
% 0.25/1.42  # Proof object generating inferences   : 4
% 0.25/1.42  # Proof object simplifying inferences  : 5
% 0.25/1.42  # Training examples: 0 positive, 0 negative
% 0.25/1.42  # Parsed axioms                        : 43
% 0.25/1.42  # Removed by relevancy pruning/SinE    : 0
% 0.25/1.42  # Initial clauses                      : 55
% 0.25/1.42  # Removed in clause preprocessing      : 2
% 0.25/1.42  # Initial clauses in saturation        : 53
% 0.25/1.42  # Processed clauses                    : 915
% 0.25/1.42  # ...of these trivial                  : 99
% 0.25/1.42  # ...subsumed                          : 456
% 0.25/1.42  # ...remaining for further processing  : 360
% 0.25/1.42  # Other redundant clauses eliminated   : 3
% 0.25/1.42  # Clauses deleted for lack of memory   : 0
% 0.25/1.42  # Backward-subsumed                    : 1
% 0.25/1.42  # Backward-rewritten                   : 3
% 0.25/1.42  # Generated clauses                    : 8501
% 0.25/1.42  # ...of the previous two non-trivial   : 7640
% 0.25/1.42  # Contextual simplify-reflections      : 17
% 0.25/1.42  # Paramodulations                      : 8477
% 0.25/1.42  # Factorizations                       : 16
% 0.25/1.42  # Equation resolutions                 : 9
% 0.25/1.42  # Current number of processed clauses  : 354
% 0.25/1.42  #    Positive orientable unit clauses  : 78
% 0.25/1.42  #    Positive unorientable unit clauses: 13
% 0.25/1.42  #    Negative unit clauses             : 52
% 0.25/1.42  #    Non-unit-clauses                  : 211
% 0.25/1.42  # Current number of unprocessed clauses: 6739
% 0.25/1.42  # ...number of literals in the above   : 27470
% 0.25/1.42  # Current number of archived formulas  : 0
% 0.25/1.42  # Current number of archived clauses   : 6
% 0.25/1.42  # Clause-clause subsumption calls (NU) : 5961
% 0.25/1.42  # Rec. Clause-clause subsumption calls : 2302
% 0.25/1.42  # Non-unit clause-clause subsumptions  : 57
% 0.25/1.42  # Unit Clause-clause subsumption calls : 3714
% 0.25/1.42  # Rewrite failures with RHS unbound    : 140
% 0.25/1.42  # BW rewrite match attempts            : 507
% 0.25/1.42  # BW rewrite match successes           : 43
% 0.25/1.42  # Condensation attempts                : 0
% 0.25/1.42  # Condensation successes               : 0
% 0.25/1.42  # Termbank termtop insertions          : 199218
% 0.25/1.42  
% 0.25/1.42  # -------------------------------------------------
% 0.25/1.42  # User time                : 0.159 s
% 0.25/1.42  # System time              : 0.014 s
% 0.25/1.42  # Total time               : 0.174 s
% 0.25/1.42  # Maximum resident set size: 10672 pages
% 0.25/23.41  eprover: CPU time limit exceeded, terminating
% 0.25/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.43  eprover: No such file or directory
% 0.25/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.43  eprover: No such file or directory
% 0.25/23.44  eprover: eprover: CPU time limit exceeded, terminating
% 0.25/23.44  Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.44  eprover: No such file or directory
% 0.25/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.44  eprover: No such file or directory
% 0.25/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45  eprover: No such file or directory
% 0.25/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45  eprover: No such file or directory
% 0.25/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46  eprover: No such file or directory
% 0.25/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46  eprover: No such file or directory
% 0.25/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46  eprover: No such file or directory
% 0.25/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47  eprover: No such file or directory
% 0.25/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.47  eprover: No such file or directory
% 0.25/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.47  eprover: No such file or directory
% 0.25/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47  eprover: No such file or directory
% 0.25/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48  eprover: No such file or directory
% 0.25/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.48  eprover: No such file or directory
% 0.25/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48  eprover: No such file or directory
% 0.25/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.48  eprover: No such file or directory
% 0.25/23.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.49  eprover: No such file or directory
% 0.25/23.50  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.50  eprover: No such file or directory
% 0.25/23.50  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.50  eprover: No such file or directory
% 0.25/23.51  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.51  eprover: No such file or directory
% 0.25/23.51  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.51  eprover: No such file or directory
%------------------------------------------------------------------------------