TSTP Solution File: SWV415+2 by ET---2.0

View Problem - Process Solution

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

% Computer : n012.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:31 EDT 2022

% Result   : Theorem 0.25s 1.43s
% Output   : CNFRefutation 0.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   36 (  24 unt;   0 def)
%            Number of atoms       :   56 (  45 equ)
%            Maximal formula atoms :    6 (   1 avg)
%            Number of connectives :   35 (  15   ~;  14   |;   2   &)
%                                         (   2 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   3 prp; 0-2 aty)
%            Number of functors    :   26 (  26 usr;  18 con; 0-3 aty)
%            Number of variables   :  149 (  47 sgn  72   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co2,conjecture,
    ! [X1,X2,X3,X4] : i(insert_cpq(triple(X1,X2,X3),X4)) = insert_pq(i(triple(X1,X2,X3)),X4),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co2) ).

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/sandbox/benchmark/Axioms/SWV007+3.ax',ax42) ).

fof(ax55,axiom,
    ! [X1,X2,X3,X4,X5] : i(triple(X1,insert_slb(X2,pair(X4,X5)),X3)) = insert_pq(i(triple(X1,X2,X3)),X4),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+4.ax',ax55) ).

fof(big2_induction,axiom,
    ( ( ! [X1,X2,X3,X4] : i(triple(X1,create_slb,X3)) = i(triple(X2,create_slb,X4))
      & ! [X5] :
          ( ! [X6,X7,X8,X9] : i(triple(X6,X5,X8)) = i(triple(X7,X5,X9))
         => ! [X10,X11,X12,X13,X14,X15] : i(triple(X10,insert_slb(X5,pair(X14,X15)),X12)) = i(triple(X11,insert_slb(X5,pair(X14,X15)),X13)) ) )
   => ! [X16,X17,X18,X19,X20] : i(triple(X16,X18,X19)) = i(triple(X17,X18,X20)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',big2_induction) ).

fof(ax54,axiom,
    ! [X1,X2] : i(triple(X1,create_slb,X2)) = create_pq,
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+4.ax',ax54) ).

fof(ax11,axiom,
    ! [X1,X2] : remove_pq(insert_pq(X1,X2),X2) = X1,
    file('/export/starexec/sandbox/benchmark/Axioms/SWV007+1.ax',ax11) ).

fof(c_0_6,negated_conjecture,
    ~ ! [X1,X2,X3,X4] : i(insert_cpq(triple(X1,X2,X3),X4)) = insert_pq(i(triple(X1,X2,X3)),X4),
    inference(assume_negation,[status(cth)],[co2]) ).

fof(c_0_7,plain,
    ( ~ epred2_0
  <=> ! [X5,X4,X3,X2,X1] : i(triple(X1,X2,X3)) = i(triple(X4,X2,X5)) ),
    introduced(definition) ).

fof(c_0_8,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_9,plain,
    ! [X6,X7,X8,X9,X10] : i(triple(X6,insert_slb(X7,pair(X9,X10)),X8)) = insert_pq(i(triple(X6,X7,X8)),X9),
    inference(variable_rename,[status(thm)],[ax55]) ).

fof(c_0_10,plain,
    ! [X26,X27,X28,X29,X36,X37,X38,X39,X40] :
      ( ( i(triple(X26,esk9_0,X28)) = i(triple(X27,esk9_0,X29))
        | i(triple(esk5_0,create_slb,esk7_0)) != i(triple(esk6_0,create_slb,esk8_0))
        | i(triple(X36,X38,X39)) = i(triple(X37,X38,X40)) )
      & ( i(triple(esk10_0,insert_slb(esk9_0,pair(esk14_0,esk15_0)),esk12_0)) != i(triple(esk11_0,insert_slb(esk9_0,pair(esk14_0,esk15_0)),esk13_0))
        | i(triple(esk5_0,create_slb,esk7_0)) != i(triple(esk6_0,create_slb,esk8_0))
        | i(triple(X36,X38,X39)) = i(triple(X37,X38,X40)) ) ),
    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)],[big2_induction])])])])])])]) ).

fof(c_0_11,plain,
    ! [X3,X4] : i(triple(X3,create_slb,X4)) = create_pq,
    inference(variable_rename,[status(thm)],[ax54]) ).

fof(c_0_12,negated_conjecture,
    i(insert_cpq(triple(esk16_0,esk17_0,esk18_0),esk19_0)) != insert_pq(i(triple(esk16_0,esk17_0,esk18_0)),esk19_0),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).

cnf(c_0_13,plain,
    ( i(triple(X1,X2,X3)) = i(triple(X4,X2,X5))
    | epred2_0 ),
    inference(split_equiv,[status(thm)],[c_0_7]) ).

cnf(c_0_14,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_8]) ).

cnf(c_0_15,plain,
    i(triple(X1,insert_slb(X2,pair(X3,X4)),X5)) = insert_pq(i(triple(X1,X2,X5)),X3),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_16,plain,
    ! [X3,X4] : remove_pq(insert_pq(X3,X4),X4) = X3,
    inference(variable_rename,[status(thm)],[ax11]) ).

fof(c_0_17,plain,
    ( ~ epred1_0
  <=> ! [X9,X8,X7,X6] : i(triple(X6,esk9_0,X7)) = i(triple(X8,esk9_0,X9)) ),
    introduced(definition) ).

cnf(c_0_18,plain,
    ( i(triple(X1,X2,X3)) = i(triple(X4,X2,X5))
    | i(triple(X6,esk9_0,X7)) = i(triple(X8,esk9_0,X9))
    | i(triple(esk5_0,create_slb,esk7_0)) != i(triple(esk6_0,create_slb,esk8_0)) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_19,plain,
    i(triple(X1,create_slb,X2)) = create_pq,
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_20,negated_conjecture,
    i(insert_cpq(triple(esk16_0,esk17_0,esk18_0),esk19_0)) != insert_pq(i(triple(esk16_0,esk17_0,esk18_0)),esk19_0),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_21,plain,
    ( insert_pq(i(triple(X1,X2,X3)),X4) = i(insert_cpq(triple(X5,X2,X6),X4))
    | epred2_0 ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).

cnf(c_0_22,plain,
    ( insert_pq(i(triple(X1,X2,X3)),X4) = insert_pq(i(triple(X5,X2,X6)),X4)
    | epred2_0 ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_13]),c_0_15]) ).

cnf(c_0_23,plain,
    remove_pq(insert_pq(X1,X2),X2) = X1,
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_24,plain,
    insert_pq(i(triple(insert_pqp(X1,X2),X3,X4)),X2) = i(insert_cpq(triple(X1,X3,X4),X2)),
    inference(spm,[status(thm)],[c_0_15,c_0_14]) ).

cnf(c_0_25,plain,
    ( ~ epred2_0
    | ~ epred1_0 ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_19])]),c_0_17]),c_0_7]) ).

cnf(c_0_26,negated_conjecture,
    epred2_0,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).

cnf(c_0_27,plain,
    ( i(triple(X1,X2,X3)) = i(triple(X4,X2,X5))
    | i(triple(esk5_0,create_slb,esk7_0)) != i(triple(esk6_0,create_slb,esk8_0))
    | i(triple(esk10_0,insert_slb(esk9_0,pair(esk14_0,esk15_0)),esk12_0)) != i(triple(esk11_0,insert_slb(esk9_0,pair(esk14_0,esk15_0)),esk13_0)) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_28,plain,
    ( i(triple(X1,esk9_0,X2)) = i(triple(X3,esk9_0,X4))
    | epred1_0 ),
    inference(split_equiv,[status(thm)],[c_0_17]) ).

cnf(c_0_29,plain,
    i(triple(insert_pqp(X1,X2),X3,X4)) = remove_pq(i(insert_cpq(triple(X1,X3,X4),X2)),X2),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_30,plain,
    ~ epred1_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).

cnf(c_0_31,plain,
    ( i(triple(X1,X2,X3)) = i(triple(X4,X2,X5))
    | insert_pq(i(triple(esk10_0,esk9_0,esk12_0)),esk14_0) != insert_pq(i(triple(esk11_0,esk9_0,esk13_0)),esk14_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_19]),c_0_19]),c_0_15]),c_0_15])]) ).

cnf(c_0_32,plain,
    remove_pq(i(insert_cpq(triple(X1,esk9_0,X2),X3)),X3) = i(triple(X4,esk9_0,X5)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).

cnf(c_0_33,plain,
    i(triple(X1,X2,X3)) = i(triple(X4,X2,X5)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_32]) ).

cnf(c_0_34,plain,
    insert_pq(i(triple(X1,X2,X3)),X4) = i(insert_cpq(triple(X5,X2,X6),X4)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_14]),c_0_15]) ).

cnf(c_0_35,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_20,c_0_34]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : SWV415+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13  % Command  : run_ET %s %d
% 0.13/0.35  % Computer : n012.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Wed Jun 15 07:37:10 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.25/1.43  # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.25/1.43  # Preprocessing time       : 0.020 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             : 36
% 0.25/1.43  # Proof object clause steps            : 21
% 0.25/1.43  # Proof object formula steps           : 15
% 0.25/1.43  # Proof object conjectures             : 6
% 0.25/1.43  # Proof object clause conjectures      : 3
% 0.25/1.43  # Proof object formula conjectures     : 3
% 0.25/1.43  # Proof object initial clauses used    : 9
% 0.25/1.43  # Proof object initial formulas used   : 6
% 0.25/1.43  # Proof object generating inferences   : 8
% 0.25/1.43  # Proof object simplifying inferences  : 19
% 0.25/1.43  # Training examples: 0 positive, 0 negative
% 0.25/1.43  # Parsed axioms                        : 64
% 0.25/1.43  # Removed by relevancy pruning/SinE    : 0
% 0.25/1.43  # Initial clauses                      : 89
% 0.25/1.43  # Removed in clause preprocessing      : 2
% 0.25/1.43  # Initial clauses in saturation        : 87
% 0.25/1.43  # Processed clauses                    : 2625
% 0.25/1.43  # ...of these trivial                  : 261
% 0.25/1.43  # ...subsumed                          : 1552
% 0.25/1.43  # ...remaining for further processing  : 812
% 0.25/1.43  # Other redundant clauses eliminated   : 4
% 0.25/1.43  # Clauses deleted for lack of memory   : 0
% 0.25/1.43  # Backward-subsumed                    : 8
% 0.25/1.43  # Backward-rewritten                   : 19
% 0.25/1.43  # Generated clauses                    : 39195
% 0.25/1.43  # ...of the previous two non-trivial   : 36758
% 0.25/1.43  # Contextual simplify-reflections      : 45
% 0.25/1.43  # Paramodulations                      : 39046
% 0.25/1.43  # Factorizations                       : 116
% 0.25/1.43  # Equation resolutions                 : 6
% 0.25/1.43  # Current number of processed clauses  : 769
% 0.25/1.43  #    Positive orientable unit clauses  : 158
% 0.25/1.43  #    Positive unorientable unit clauses: 35
% 0.25/1.43  #    Negative unit clauses             : 135
% 0.25/1.43  #    Non-unit-clauses                  : 441
% 0.25/1.43  # Current number of unprocessed clauses: 32820
% 0.25/1.43  # ...number of literals in the above   : 121720
% 0.25/1.43  # Current number of archived formulas  : 0
% 0.25/1.43  # Current number of archived clauses   : 33
% 0.25/1.43  # Clause-clause subsumption calls (NU) : 46485
% 0.25/1.43  # Rec. Clause-clause subsumption calls : 22784
% 0.25/1.43  # Non-unit clause-clause subsumptions  : 172
% 0.25/1.43  # Unit Clause-clause subsumption calls : 22856
% 0.25/1.43  # Rewrite failures with RHS unbound    : 215
% 0.25/1.43  # BW rewrite match attempts            : 2966
% 0.25/1.43  # BW rewrite match successes           : 340
% 0.25/1.43  # Condensation attempts                : 0
% 0.25/1.43  # Condensation successes               : 0
% 0.25/1.43  # Termbank termtop insertions          : 848482
% 0.25/1.43  
% 0.25/1.43  # -------------------------------------------------
% 0.25/1.43  # User time                : 0.656 s
% 0.25/1.43  # System time              : 0.016 s
% 0.25/1.43  # Total time               : 0.672 s
% 0.25/1.43  # Maximum resident set size: 34844 pages
% 0.25/23.42  eprover: CPU time limit exceeded, terminating
% 0.25/23.43  eprover: CPU time limit exceeded, terminating
% 0.25/23.43  eprover: CPU time limit exceeded, terminating
% 0.25/23.44  eprover: Cannot stat file /export/starexec/sandbox/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/sandbox/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/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45  eprover: No such file or directory
% 0.25/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45  eprover: No such file or directory
% 0.25/23.45  eprover: Cannot stat file /export/starexec/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46  eprover: No such file or directory
% 0.25/23.47  eprover: Cannot stat file /export/starexec/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.47  eprover: No such file or directory
% 0.25/23.48  eprover: Cannot stat file /export/starexec/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48  eprover: No such file or directory
% 0.25/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.49  eprover: No such file or directory
% 0.25/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.49  eprover: No such file or directory
% 0.25/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.49  eprover: No such file or directory
% 0.25/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.49  eprover: No such file or directory
% 0.25/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.49  eprover: No such file or directory
% 0.25/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.49  eprover: No such file or directory
% 0.25/23.49  eprover: Cannot stat file /export/starexec/sandbox/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/sandbox/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/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.50  eprover: No such file or directory
%------------------------------------------------------------------------------