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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SWV378+1 : TPTP v8.1.0. Released v3.3.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 : Wed Jul 20 18:16:23 EDT 2022

% Result   : Theorem 0.26s 1.45s
% Output   : CNFRefutation 0.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   35 (  10 unt;   0 def)
%            Number of atoms       :   75 (  13 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   74 (  34   ~;  26   |;   6   &)
%                                         (   2 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   4 usr;   2 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   5 con; 0-3 aty)
%            Number of variables   :   82 (  11 sgn  52   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(l14_co,conjecture,
    ! [X1,X2,X3,X4] :
      ( ~ ok(triple(X1,X2,X3))
     => ~ ok(remove_cpq(triple(X1,X2,X3),X4)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',l14_co) ).

fof(ax41,axiom,
    ! [X1,X2,X3] :
      ( ~ ok(triple(X1,X2,X3))
     => X3 = bad ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax41) ).

fof(ax40,axiom,
    ! [X1,X2] :
      ( ok(triple(X1,X2,bad))
    <=> ~ $true ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax40) ).

fof(ax45,axiom,
    ! [X1,X2,X3,X4] :
      ( ( contains_slb(X2,X4)
        & strictly_less_than(X4,lookup_slb(X2,X4)) )
     => remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax45) ).

fof(ax43,axiom,
    ! [X1,X2,X3,X4] :
      ( ~ contains_slb(X2,X4)
     => remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax43) ).

fof(ax44,axiom,
    ! [X1,X2,X3,X4] :
      ( ( contains_slb(X2,X4)
        & less_than(lookup_slb(X2,X4),X4) )
     => remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax44) ).

fof(stricly_smaller_definition,axiom,
    ! [X1,X2] :
      ( strictly_less_than(X1,X2)
    <=> ( less_than(X1,X2)
        & ~ less_than(X2,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+0.ax',stricly_smaller_definition) ).

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

fof(c_0_8,negated_conjecture,
    ~ ! [X1,X2,X3,X4] :
        ( ~ ok(triple(X1,X2,X3))
       => ~ ok(remove_cpq(triple(X1,X2,X3),X4)) ),
    inference(assume_negation,[status(cth)],[l14_co]) ).

fof(c_0_9,negated_conjecture,
    ( ~ ok(triple(esk1_0,esk2_0,esk3_0))
    & ok(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)) ),
    inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_8])])])])]) ).

fof(c_0_10,plain,
    ! [X4,X5,X6] :
      ( ok(triple(X4,X5,X6))
      | X6 = bad ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax41])])]) ).

fof(c_0_11,plain,
    ! [X3,X4] : ~ ok(triple(X3,X4,bad)),
    inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[ax40])]) ).

fof(c_0_12,plain,
    ! [X5,X6,X7,X8] :
      ( ~ contains_slb(X6,X8)
      | ~ strictly_less_than(X8,lookup_slb(X6,X8))
      | remove_cpq(triple(X5,X6,X7),X8) = triple(remove_pqp(X5,X8),remove_slb(X6,X8),bad) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax45])]) ).

cnf(c_0_13,negated_conjecture,
    ~ ok(triple(esk1_0,esk2_0,esk3_0)),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14,plain,
    ( X1 = bad
    | ok(triple(X2,X3,X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_15,plain,
    ! [X5,X6,X7,X8] :
      ( contains_slb(X6,X8)
      | remove_cpq(triple(X5,X6,X7),X8) = triple(X5,X6,bad) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax43])])]) ).

fof(c_0_16,plain,
    ! [X5,X6,X7,X8] :
      ( ~ contains_slb(X6,X8)
      | ~ less_than(lookup_slb(X6,X8),X8)
      | remove_cpq(triple(X5,X6,X7),X8) = triple(remove_pqp(X5,X8),remove_slb(X6,X8),X7) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax44])]) ).

cnf(c_0_17,plain,
    ~ ok(triple(X1,X2,bad)),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_18,plain,
    ( remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),bad)
    | ~ strictly_less_than(X4,lookup_slb(X2,X4))
    | ~ contains_slb(X2,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_19,negated_conjecture,
    ok(remove_cpq(triple(esk1_0,esk2_0,esk3_0),esk4_0)),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_20,negated_conjecture,
    esk3_0 = bad,
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_21,plain,
    ( remove_cpq(triple(X1,X2,X3),X4) = triple(X1,X2,bad)
    | contains_slb(X2,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

fof(c_0_22,plain,
    ! [X3,X4,X3,X4] :
      ( ( less_than(X3,X4)
        | ~ strictly_less_than(X3,X4) )
      & ( ~ less_than(X4,X3)
        | ~ strictly_less_than(X3,X4) )
      & ( ~ less_than(X3,X4)
        | less_than(X4,X3)
        | strictly_less_than(X3,X4) ) ),
    inference(distribute,[status(thm)],[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)],[stricly_smaller_definition])])])])])]) ).

fof(c_0_23,plain,
    ! [X3,X4] :
      ( less_than(X3,X4)
      | less_than(X4,X3) ),
    inference(variable_rename,[status(thm)],[totality]) ).

cnf(c_0_24,plain,
    ( remove_cpq(triple(X1,X2,X3),X4) = triple(remove_pqp(X1,X4),remove_slb(X2,X4),X3)
    | ~ less_than(lookup_slb(X2,X4),X4)
    | ~ contains_slb(X2,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_25,plain,
    ( ~ ok(remove_cpq(triple(X1,X2,X3),X4))
    | ~ contains_slb(X2,X4)
    | ~ strictly_less_than(X4,lookup_slb(X2,X4)) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_26,negated_conjecture,
    ok(remove_cpq(triple(esk1_0,esk2_0,bad),esk4_0)),
    inference(rw,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_27,negated_conjecture,
    contains_slb(esk2_0,esk4_0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_21]),c_0_17]) ).

cnf(c_0_28,plain,
    ( strictly_less_than(X1,X2)
    | less_than(X2,X1)
    | ~ less_than(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_29,plain,
    ( less_than(X1,X2)
    | less_than(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

cnf(c_0_30,plain,
    ( ~ ok(remove_cpq(triple(X1,X2,bad),X3))
    | ~ contains_slb(X2,X3)
    | ~ less_than(lookup_slb(X2,X3),X3) ),
    inference(spm,[status(thm)],[c_0_17,c_0_24]) ).

cnf(c_0_31,negated_conjecture,
    ~ strictly_less_than(esk4_0,lookup_slb(esk2_0,esk4_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).

cnf(c_0_32,plain,
    ( strictly_less_than(X1,X2)
    | less_than(X2,X1) ),
    inference(csr,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_33,negated_conjecture,
    ~ less_than(lookup_slb(esk2_0,esk4_0),esk4_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_26]),c_0_27])]) ).

cnf(c_0_34,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SWV378+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.14  % Command  : run_ET %s %d
% 0.14/0.36  % Computer : n022.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Wed Jun 15 18:32:32 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.26/1.45  # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.26/1.45  # Preprocessing time       : 0.018 s
% 0.26/1.45  
% 0.26/1.45  # Proof found!
% 0.26/1.45  # SZS status Theorem
% 0.26/1.45  # SZS output start CNFRefutation
% See solution above
% 0.26/1.45  # Proof object total steps             : 35
% 0.26/1.45  # Proof object clause steps            : 18
% 0.26/1.45  # Proof object formula steps           : 17
% 0.26/1.45  # Proof object conjectures             : 11
% 0.26/1.45  # Proof object clause conjectures      : 8
% 0.26/1.45  # Proof object formula conjectures     : 3
% 0.26/1.45  # Proof object initial clauses used    : 9
% 0.26/1.45  # Proof object initial formulas used   : 8
% 0.26/1.45  # Proof object generating inferences   : 7
% 0.26/1.45  # Proof object simplifying inferences  : 8
% 0.26/1.45  # Training examples: 0 positive, 0 negative
% 0.26/1.45  # Parsed axioms                        : 42
% 0.26/1.45  # Removed by relevancy pruning/SinE    : 0
% 0.26/1.45  # Initial clauses                      : 52
% 0.26/1.45  # Removed in clause preprocessing      : 2
% 0.26/1.45  # Initial clauses in saturation        : 50
% 0.26/1.45  # Processed clauses                    : 88
% 0.26/1.45  # ...of these trivial                  : 1
% 0.26/1.45  # ...subsumed                          : 7
% 0.26/1.45  # ...remaining for further processing  : 80
% 0.26/1.45  # Other redundant clauses eliminated   : 3
% 0.26/1.45  # Clauses deleted for lack of memory   : 0
% 0.26/1.45  # Backward-subsumed                    : 0
% 0.26/1.45  # Backward-rewritten                   : 2
% 0.26/1.45  # Generated clauses                    : 205
% 0.26/1.45  # ...of the previous two non-trivial   : 179
% 0.26/1.45  # Contextual simplify-reflections      : 2
% 0.26/1.45  # Paramodulations                      : 195
% 0.26/1.45  # Factorizations                       : 8
% 0.26/1.45  # Equation resolutions                 : 3
% 0.26/1.45  # Current number of processed clauses  : 76
% 0.26/1.45  #    Positive orientable unit clauses  : 17
% 0.26/1.45  #    Positive unorientable unit clauses: 0
% 0.26/1.45  #    Negative unit clauses             : 12
% 0.26/1.45  #    Non-unit-clauses                  : 47
% 0.26/1.45  # Current number of unprocessed clauses: 141
% 0.26/1.45  # ...number of literals in the above   : 494
% 0.26/1.45  # Current number of archived formulas  : 0
% 0.26/1.45  # Current number of archived clauses   : 4
% 0.26/1.45  # Clause-clause subsumption calls (NU) : 217
% 0.26/1.45  # Rec. Clause-clause subsumption calls : 160
% 0.26/1.45  # Non-unit clause-clause subsumptions  : 8
% 0.26/1.45  # Unit Clause-clause subsumption calls : 156
% 0.26/1.45  # Rewrite failures with RHS unbound    : 0
% 0.26/1.45  # BW rewrite match attempts            : 8
% 0.26/1.45  # BW rewrite match successes           : 1
% 0.26/1.45  # Condensation attempts                : 0
% 0.26/1.45  # Condensation successes               : 0
% 0.26/1.45  # Termbank termtop insertions          : 6151
% 0.26/1.45  
% 0.26/1.45  # -------------------------------------------------
% 0.26/1.45  # User time                : 0.021 s
% 0.26/1.45  # System time              : 0.004 s
% 0.26/1.45  # Total time               : 0.025 s
% 0.26/1.45  # Maximum resident set size: 3272 pages
% 0.26/23.45  eprover: CPU time limit exceeded, terminating
% 0.26/23.46  eprover: CPU time limit exceeded, terminating
% 0.26/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.47  eprover: No such file or directory
% 0.26/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.47  eprover: No such file or directory
% 0.26/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.47  eprover: No such file or directory
% 0.26/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.47  eprover: No such file or directory
% 0.26/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.48  eprover: No such file or directory
% 0.26/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.48  eprover: No such file or directory
% 0.26/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.48  eprover: No such file or directory
% 0.26/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.48  eprover: No such file or directory
% 0.26/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.48  eprover: No such file or directory
% 0.26/23.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.49  eprover: No such file or directory
% 0.26/23.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.49  eprover: No such file or directory
% 0.26/23.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.49  eprover: No such file or directory
% 0.26/23.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.49  eprover: No such file or directory
% 0.26/23.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.49  eprover: No such file or directory
% 0.26/23.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.49  eprover: No such file or directory
% 0.26/23.50  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.50  eprover: No such file or directory
% 0.26/23.50  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.50  eprover: No such file or directory
% 0.26/23.50  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.50  eprover: No such file or directory
% 0.26/23.50  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.50  eprover: No such file or directory
% 0.26/23.50  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.50  eprover: No such file or directory
% 0.26/23.51  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.51  eprover: No such file or directory
% 0.26/23.51  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.51  eprover: No such file or directory
%------------------------------------------------------------------------------