↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SEV569+1 : TPTP v9.3.1. Released v9.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n019.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun Sep 27 08:48:54 AM UTC 2026

% Result   : Theorem 25.59s 8.59s
% Output   : CNFRefutation 25.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   38
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   75 (  19 unt;   0 def)
%            Number of atoms       :  230 ( 104 equ)
%            Maximal formula atoms :    6 (   3 avg)
%            Number of connectives :  192 (  37   ~; 149   |;   0   &)
%                                         (   3 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   1 con; 0-2 aty)
%            Number of variables   :   88 (   8 sgn  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(subq_def,axiom,
    ! [X0,X1] :
      ( subq(X0,X1)
    <=> ! [X2] :
          ( mem(X2,X0)
         => mem(X2,X1) ) ) ).

fof(setext,axiom,
    ! [X0,X1] :
      ( subq(X0,X1)
     => ( subq(X1,X0)
       => X0 = X1 ) ) ).

fof(e_ax,axiom,
    ! [X0] : ~ mem(X0,e) ).

fof(s_ax,axiom,
    ! [X0,X1] :
      ( mem(X0,s(X1))
    <=> X0 = X1 ) ).

fof(u_ax,axiom,
    ! [X0,X1,X2] :
      ( mem(X0,u(X1,X2))
    <=> ( mem(X0,X2)
        | mem(X0,X1) ) ) ).

fof(a_def,axiom,
    ! [X0,X1] : a(X0,X1) = u(X0,s(X1)) ).

fof(n_def,axiom,
    ! [X0] : n(X0) = a(X0,X0) ).

fof(nsubq_2762_2760,conjecture,
    ~ subq(u(a(s(u(n(e),n(s(n(e))))),a(n(e),n(n(e)))),u(a(s(n(e)),n(n(e))),a(s(n(s(n(e)))),n(n(n(e)))))),u(a(s(u(n(e),n(s(n(e))))),a(n(e),n(n(e)))),u(s(n(n(e))),a(s(n(s(n(e)))),n(n(n(e))))))) ).

fof(negated_conjecture,negated_conjecture,
    ~ ~ subq(u(a(s(u(n(e),n(s(n(e))))),a(n(e),n(n(e)))),u(a(s(n(e)),n(n(e))),a(s(n(s(n(e)))),n(n(n(e)))))),u(a(s(u(n(e),n(s(n(e))))),a(n(e),n(n(e)))),u(s(n(n(e))),a(s(n(s(n(e)))),n(n(n(e))))))),
    inference(negate_conjecture,[status(cth)],[nsubq_2762_2760]) ).

cnf(c0,plain,
    ( mem(X2,X1)
    | ~ mem(X2,X0)
    | ~ subq(X0,X1) ),
    inference(clausification,[status(esa)],[subq_def]) ).

cnf(c1,plain,
    ( mem(sK3(X0,X1),X0)
    | subq(X0,X1) ),
    inference(clausification,[status(esa)],[subq_def]) ).

cnf(c2,plain,
    ( ~ mem(sK3(X0,X1),X1)
    | subq(X0,X1) ),
    inference(clausification,[status(esa)],[subq_def]) ).

cnf(c3,plain,
    ( X0 = X1
    | ~ subq(X1,X0)
    | ~ subq(X0,X1) ),
    inference(clausification,[status(esa)],[setext]) ).

cnf(c7,plain,
    ~ mem(X0,e),
    inference(clausification,[status(esa)],[e_ax]) ).

cnf(c8,plain,
    ( X0 = X1
    | ~ mem(X0,s(X1)) ),
    inference(clausification,[status(esa)],[s_ax]) ).

cnf(c9,plain,
    ( X0 != X1
    | mem(X0,s(X1)) ),
    inference(clausification,[status(esa)],[s_ax]) ).

cnf(c10,plain,
    ( mem(X0,X2)
    | mem(X0,X1)
    | ~ mem(X0,u(X1,X2)) ),
    inference(clausification,[status(esa)],[u_ax]) ).

cnf(c11,plain,
    ( ~ mem(X0,X1)
    | mem(X0,u(X1,X2)) ),
    inference(clausification,[status(esa)],[u_ax]) ).

cnf(c12,plain,
    ( ~ mem(X0,X2)
    | mem(X0,u(X1,X2)) ),
    inference(clausification,[status(esa)],[u_ax]) ).

cnf(c16,plain,
    a(X0,X1) = u(X0,s(X1)),
    inference(clausification,[status(esa)],[a_def]) ).

cnf(c17,plain,
    n(X0) = a(X0,X0),
    inference(clausification,[status(esa)],[n_def]) ).

cnf(c79,plain,
    subq(u(a(s(u(n(e),n(s(n(e))))),a(n(e),n(n(e)))),u(a(s(n(e)),n(n(e))),a(s(n(s(n(e)))),n(n(n(e)))))),u(a(s(u(n(e),n(s(n(e))))),a(n(e),n(n(e)))),u(s(n(n(e))),a(s(n(s(n(e)))),n(n(n(e))))))),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    mem(X0,s(X0)),
    inference(equality_resolution,[status(thm)],[c9]) ).

cnf(d1,plain,
    ( mem(X0,X1)
    | ~ subq(s(X0),X1) ),
    inference(resolution,[status(thm)],[d0,c0]) ).

cnf(d2,plain,
    ( subq(X0,u(X1,X2))
    | ~ mem(sK3(X0,u(X1,X2)),X2) ),
    inference(resolution,[status(thm)],[c12,c2]) ).

cnf(d3,plain,
    ( subq(X0,u(X1,X0))
    | subq(X0,u(X1,X0)) ),
    inference(resolution,[status(thm)],[d2,c1]) ).

cnf(d4,plain,
    mem(X0,u(X1,s(X0))),
    inference(resolution,[status(thm)],[d3,d1]) ).

cnf(d5,plain,
    mem(X1,a(X0,X1)),
    inference(demodulation,[status(thm)],[d4,c16]) ).

cnf(d6,plain,
    mem(X0,n(X0)),
    inference(superposition,[status(thm)],[c17,d5]) ).

cnf(d7,plain,
    ( mem(X2,X0)
    | mem(X2,s(X1))
    | ~ mem(X2,a(X0,X1)) ),
    inference(superposition,[status(thm)],[c16,c10]) ).

cnf(d8,plain,
    ( mem(X1,s(X0))
    | mem(X1,X0)
    | ~ mem(X1,n(X0)) ),
    inference(superposition,[status(thm)],[c17,d7]) ).

cnf(d9,plain,
    ( subq(X0,u(X1,X2))
    | ~ mem(sK3(X0,u(X1,X2)),X1) ),
    inference(resolution,[status(thm)],[c11,c2]) ).

cnf(d10,plain,
    ( subq(X0,u(X0,X1))
    | subq(X0,u(X0,X1)) ),
    inference(resolution,[status(thm)],[d9,c1]) ).

cnf(d11,plain,
    subq(X0,a(X0,X1)),
    inference(superposition,[status(thm)],[c16,d10]) ).

cnf(d12,plain,
    subq(X0,n(X0)),
    inference(superposition,[status(thm)],[c17,d11]) ).

cnf(d13,plain,
    ( ~ subq(n(X0),X0)
    | X0 = n(X0) ),
    inference(resolution,[status(thm)],[d12,c3]) ).

cnf(d14,plain,
    mem(X0,n(s(X0))),
    inference(resolution,[status(thm)],[d12,d1]) ).

cnf(d15,plain,
    ( ~ mem(X2,X0)
    | mem(X2,a(X0,X1)) ),
    inference(superposition,[status(thm)],[c16,c11]) ).

cnf(d16,plain,
    ( mem(X0,X3)
    | ~ subq(u(X2,X1),X3)
    | ~ mem(X0,X1) ),
    inference(resolution,[status(thm)],[c12,c0]) ).

cnf(d17,plain,
    ( ~ mem(X0,u(a(s(n(e)),n(n(e))),a(s(n(s(n(e)))),n(n(n(e))))))
    | mem(X0,u(a(s(u(n(e),n(s(n(e))))),a(n(e),n(n(e)))),u(s(n(n(e))),a(s(n(s(n(e)))),n(n(n(e))))))) ),
    inference(resolution,[status(thm)],[d16,c79]) ).

cnf(d18,plain,
    ( mem(X0,a(s(u(n(e),n(s(n(e))))),a(n(e),n(n(e)))))
    | mem(X0,u(s(n(n(e))),a(s(n(s(n(e)))),n(n(n(e))))))
    | ~ mem(X0,u(a(s(n(e)),n(n(e))),a(s(n(s(n(e)))),n(n(n(e)))))) ),
    inference(resolution,[status(thm)],[d17,c10]) ).

cnf(d19,plain,
    ( ~ mem(X0,a(s(n(e)),n(n(e))))
    | mem(X0,a(s(u(n(e),n(s(n(e))))),a(n(e),n(n(e)))))
    | mem(X0,u(s(n(n(e))),a(s(n(s(n(e)))),n(n(n(e)))))) ),
    inference(resolution,[status(thm)],[d18,c11]) ).

cnf(d20,plain,
    ( mem(X0,s(a(n(e),n(n(e)))))
    | mem(X0,s(u(n(e),n(s(n(e))))))
    | ~ mem(X0,a(s(n(e)),n(n(e))))
    | mem(X0,u(s(n(n(e))),a(s(n(s(n(e)))),n(n(n(e)))))) ),
    inference(resolution,[status(thm)],[d19,d7]) ).

cnf(d21,plain,
    ( mem(X0,s(n(n(e))))
    | mem(X0,a(s(n(s(n(e)))),n(n(n(e)))))
    | ~ mem(X0,a(s(n(e)),n(n(e))))
    | mem(X0,s(a(n(e),n(n(e)))))
    | mem(X0,s(u(n(e),n(s(n(e)))))) ),
    inference(resolution,[status(thm)],[d20,c10]) ).

cnf(d22,plain,
    ( mem(X0,s(n(n(n(e)))))
    | mem(X0,s(n(s(n(e)))))
    | ~ mem(X0,a(s(n(e)),n(n(e))))
    | mem(X0,s(n(n(e))))
    | mem(X0,s(a(n(e),n(n(e)))))
    | mem(X0,s(u(n(e),n(s(n(e)))))) ),
    inference(resolution,[status(thm)],[d21,d7]) ).

cnf(d23,plain,
    ( X0 = u(n(e),n(s(n(e))))
    | ~ mem(X0,a(s(n(e)),n(n(e))))
    | mem(X0,s(n(n(n(e)))))
    | mem(X0,s(n(n(e))))
    | mem(X0,s(n(s(n(e)))))
    | mem(X0,s(a(n(e),n(n(e))))) ),
    inference(resolution,[status(thm)],[d22,c8]) ).

cnf(d24,plain,
    ( ~ mem(X0,s(n(e)))
    | mem(X0,s(n(n(n(e)))))
    | mem(X0,s(n(n(e))))
    | mem(X0,s(n(s(n(e)))))
    | mem(X0,s(a(n(e),n(n(e)))))
    | X0 = u(n(e),n(s(n(e)))) ),
    inference(resolution,[status(thm)],[d23,d15]) ).

cnf(d25,plain,
    ( X0 = a(n(e),n(n(e)))
    | mem(X0,s(n(n(n(e)))))
    | mem(X0,s(n(n(e))))
    | mem(X0,s(n(s(n(e)))))
    | ~ mem(X0,s(n(e)))
    | X0 = u(n(e),n(s(n(e)))) ),
    inference(resolution,[status(thm)],[d24,c8]) ).

cnf(d26,plain,
    ( X0 = n(s(n(e)))
    | mem(X0,s(n(n(n(e)))))
    | mem(X0,s(n(n(e))))
    | ~ mem(X0,s(n(e)))
    | X0 = a(n(e),n(n(e)))
    | X0 = u(n(e),n(s(n(e)))) ),
    inference(resolution,[status(thm)],[d25,c8]) ).

cnf(d27,plain,
    ( X0 = n(n(n(e)))
    | mem(X0,s(n(n(e))))
    | ~ mem(X0,s(n(e)))
    | X0 = n(s(n(e)))
    | X0 = a(n(e),n(n(e)))
    | X0 = u(n(e),n(s(n(e)))) ),
    inference(resolution,[status(thm)],[d26,c8]) ).

cnf(d28,plain,
    ( X0 = n(n(e))
    | ~ mem(X0,s(n(e)))
    | X0 = n(n(n(e)))
    | X0 = n(s(n(e)))
    | X0 = a(n(e),n(n(e)))
    | X0 = u(n(e),n(s(n(e)))) ),
    inference(resolution,[status(thm)],[d27,c8]) ).

cnf(d29,plain,
    ( n(e) = n(n(n(e)))
    | n(e) = n(n(e))
    | n(e) = n(s(n(e)))
    | n(e) = a(n(e),n(n(e)))
    | n(e) = u(n(e),n(s(n(e)))) ),
    inference(resolution,[status(thm)],[d28,d0]) ).

cnf(d30,plain,
    ( n(e) = n(n(n(e)))
    | n(e) = n(n(e))
    | n(e) = n(s(n(e)))
    | n(e) = a(n(e),n(n(e)))
    | ~ mem(X0,n(s(n(e))))
    | mem(X0,n(e)) ),
    inference(superposition,[status(thm)],[d29,c12]) ).

cnf(d31,plain,
    ( mem(n(e),n(e))
    | n(e) = n(n(n(e)))
    | n(e) = n(n(e))
    | n(e) = n(s(n(e)))
    | n(e) = a(n(e),n(n(e))) ),
    inference(resolution,[status(thm)],[d30,d14]) ).

cnf(d32,plain,
    ( n(e) = n(n(n(e)))
    | n(e) = n(n(e))
    | n(e) = n(s(n(e)))
    | n(e) = a(n(e),n(n(e)))
    | mem(n(e),s(e))
    | mem(n(e),e) ),
    inference(resolution,[status(thm)],[d8,d31]) ).

cnf(d33,plain,
    ( mem(n(e),s(e))
    | n(e) = n(n(n(e)))
    | n(e) = n(n(e))
    | n(e) = n(s(n(e)))
    | n(e) = a(n(e),n(n(e))) ),
    inference(resolution,[status(thm)],[c7,d32]) ).

cnf(d34,plain,
    ( n(e) = e
    | n(e) = n(n(n(e)))
    | n(e) = n(n(e))
    | n(e) = n(s(n(e)))
    | n(e) = a(n(e),n(n(e))) ),
    inference(resolution,[status(thm)],[d33,c8]) ).

cnf(d35,plain,
    ( n(e) = n(n(n(e)))
    | n(e) = n(n(e))
    | n(e) = n(s(n(e)))
    | n(e) = e
    | mem(n(n(e)),n(e)) ),
    inference(superposition,[status(thm)],[d34,d5]) ).

cnf(d36,plain,
    ( mem(n(n(e)),s(e))
    | mem(n(n(e)),e)
    | n(e) = n(n(n(e)))
    | n(e) = n(n(e))
    | n(e) = n(s(n(e)))
    | n(e) = e ),
    inference(resolution,[status(thm)],[d35,d8]) ).

cnf(d37,plain,
    ( mem(n(n(e)),s(e))
    | n(e) = n(n(n(e)))
    | n(e) = n(n(e))
    | n(e) = n(s(n(e)))
    | n(e) = e ),
    inference(resolution,[status(thm)],[c7,d36]) ).

cnf(d38,plain,
    ( n(n(e)) = e
    | n(e) = n(n(n(e)))
    | n(e) = n(n(e))
    | n(e) = n(s(n(e)))
    | n(e) = e ),
    inference(resolution,[status(thm)],[d37,c8]) ).

cnf(d39,plain,
    ( n(n(e)) = e
    | n(e) = n(n(n(e)))
    | n(e) = n(n(e))
    | n(e) = e
    | mem(n(e),n(e)) ),
    inference(superposition,[status(thm)],[d38,d14]) ).

cnf(d40,plain,
    ( mem(n(e),s(e))
    | mem(n(e),e)
    | n(n(e)) = e
    | n(e) = n(n(n(e)))
    | n(e) = n(n(e))
    | n(e) = e ),
    inference(resolution,[status(thm)],[d39,d8]) ).

cnf(d41,plain,
    ( mem(n(e),s(e))
    | n(n(e)) = e
    | n(e) = n(n(n(e)))
    | n(e) = n(n(e))
    | n(e) = e ),
    inference(resolution,[status(thm)],[c7,d40]) ).

cnf(d42,plain,
    ( n(e) = e
    | n(n(e)) = e
    | n(e) = n(n(n(e)))
    | n(e) = n(n(e))
    | n(e) = e ),
    inference(resolution,[status(thm)],[d41,c8]) ).

cnf(d43,plain,
    ( n(n(e)) = e
    | n(e) = n(n(e))
    | n(e) = e
    | subq(n(n(e)),n(e)) ),
    inference(superposition,[status(thm)],[d42,d12]) ).

cnf(d44,plain,
    ( n(e) = n(n(e))
    | n(n(e)) = e
    | n(e) = n(n(e))
    | n(e) = e ),
    inference(resolution,[status(thm)],[d43,d13]) ).

cnf(d45,plain,
    ( n(n(e)) = e
    | n(e) = e
    | mem(n(e),n(e)) ),
    inference(superposition,[status(thm)],[d44,d6]) ).

cnf(d46,plain,
    ( mem(n(e),s(e))
    | mem(n(e),e)
    | n(n(e)) = e
    | n(e) = e ),
    inference(resolution,[status(thm)],[d45,d8]) ).

cnf(d47,plain,
    ( mem(n(e),s(e))
    | n(n(e)) = e
    | n(e) = e ),
    inference(resolution,[status(thm)],[c7,d46]) ).

cnf(d48,plain,
    ( n(e) = e
    | n(n(e)) = e
    | n(e) = e ),
    inference(resolution,[status(thm)],[d47,c8]) ).

cnf(d49,plain,
    ( n(e) = e
    | mem(n(e),e) ),
    inference(superposition,[status(thm)],[d48,d6]) ).

cnf(d50,plain,
    n(e) = e,
    inference(resolution,[status(thm)],[c7,d49]) ).

cnf(d51,plain,
    mem(e,e),
    inference(superposition,[status(thm)],[d50,d6]) ).

cnf(d52,plain,
    $false,
    inference(resolution,[status(thm)],[c7,d51]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEV569+1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/5.38  % Computer : n019.cluster.edu
% 0.09/5.38  % Model    : x86_64 x86_64
% 0.09/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.38  % Memory   : 8046.5625MB
% 0.09/5.38  % OS       : Linux 6.8.0-71-generic
% 0.09/5.38  % CPULimit : 300
% 0.09/5.38  % WCLimit  : 300
% 0.09/5.38  % DateTime : Sat Sep 26 11:18:11 UTC 2026
% 0.09/5.38  % CPUTime  : 
% 0.09/5.38  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 25.59/8.59  % SZS status Theorem for theBenchmark.p
% 25.59/8.59  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------