%------------------------------------------------------------------------------
% File : LisaST---0.9
% Problem : SEV570+1 : TPTP v9.3.1. Released v9.1.0.
% Transfm : none
% Format : tptp:raw
% Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n017.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:55 AM UTC 2026
% Result : Theorem 61.40s 13.48s
% Output : CNFRefutation 61.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 7
% Syntax : Number of formulae : 65 ( 19 unt; 0 def)
% Number of atoms : 146 ( 55 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 113 ( 32 ~; 77 |; 0 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 7 ( 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 : 84 ( 10 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(subq_def,axiom,
! [X0,X1] :
( subq(X0,X1)
<=> ! [X2] :
( mem(X2,X0)
=> mem(X2,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_1216_1152,conjecture,
~ subq(u(a(s(n(s(n(e)))),u(n(e),n(s(n(e))))),s(a(s(n(e)),n(n(e))))),a(s(u(n(e),n(s(n(e))))),a(s(n(e)),n(n(e))))) ).
fof(negated_conjecture,negated_conjecture,
~ ~ subq(u(a(s(n(s(n(e)))),u(n(e),n(s(n(e))))),s(a(s(n(e)),n(n(e))))),a(s(u(n(e),n(s(n(e))))),a(s(n(e)),n(n(e))))),
inference(negate_conjecture,[status(cth)],[nsubq_1216_1152]) ).
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(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(n(s(n(e)))),u(n(e),n(s(n(e))))),s(a(s(n(e)),n(n(e))))),a(s(u(n(e),n(s(n(e))))),a(s(n(e)),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,
( ~ mem(X2,X0)
| mem(X2,a(X0,X1)) ),
inference(superposition,[status(thm)],[c16,c11]) ).
cnf(d10,plain,
( ~ mem(X1,X0)
| mem(X1,n(X0)) ),
inference(superposition,[status(thm)],[c17,d9]) ).
cnf(d11,plain,
( subq(X0,u(X1,X2))
| ~ mem(sK3(X0,u(X1,X2)),X1) ),
inference(resolution,[status(thm)],[c11,c2]) ).
cnf(d12,plain,
( subq(X0,u(X0,X1))
| subq(X0,u(X0,X1)) ),
inference(resolution,[status(thm)],[d11,c1]) ).
cnf(d13,plain,
subq(X0,a(X0,X1)),
inference(superposition,[status(thm)],[c16,d12]) ).
cnf(d14,plain,
mem(X0,a(s(X0),X1)),
inference(resolution,[status(thm)],[d13,d1]) ).
cnf(d15,plain,
subq(a(a(s(n(s(n(e)))),u(n(e),n(s(n(e))))),a(s(n(e)),n(n(e)))),a(s(u(n(e),n(s(n(e))))),a(s(n(e)),n(n(e))))),
inference(demodulation,[status(thm)],[c79,c16]) ).
cnf(d16,plain,
( mem(X0,X3)
| ~ subq(u(X1,X2),X3)
| ~ mem(X0,X1) ),
inference(resolution,[status(thm)],[c11,c0]) ).
cnf(d17,plain,
( ~ mem(X3,X0)
| mem(X3,X2)
| ~ subq(a(X0,X1),X2) ),
inference(superposition,[status(thm)],[c16,d16]) ).
cnf(d18,plain,
( ~ mem(X0,a(s(n(s(n(e)))),u(n(e),n(s(n(e))))))
| mem(X0,a(s(u(n(e),n(s(n(e))))),a(s(n(e)),n(n(e))))) ),
inference(resolution,[status(thm)],[d17,d15]) ).
cnf(d19,plain,
( mem(X0,s(a(s(n(e)),n(n(e)))))
| mem(X0,s(u(n(e),n(s(n(e))))))
| ~ mem(X0,a(s(n(s(n(e)))),u(n(e),n(s(n(e)))))) ),
inference(resolution,[status(thm)],[d18,d7]) ).
cnf(d20,plain,
( mem(n(s(n(e))),s(a(s(n(e)),n(n(e)))))
| mem(n(s(n(e))),s(u(n(e),n(s(n(e)))))) ),
inference(resolution,[status(thm)],[d19,d14]) ).
cnf(d21,plain,
( n(s(n(e))) = a(s(n(e)),n(n(e)))
| mem(n(s(n(e))),s(u(n(e),n(s(n(e)))))) ),
inference(resolution,[status(thm)],[d20,c8]) ).
cnf(d22,plain,
( n(s(n(e))) = u(n(e),n(s(n(e))))
| n(s(n(e))) = a(s(n(e)),n(n(e))) ),
inference(resolution,[status(thm)],[d21,c8]) ).
cnf(d23,plain,
( n(s(n(e))) = u(n(e),n(s(n(e))))
| mem(n(n(e)),n(s(n(e)))) ),
inference(superposition,[status(thm)],[d22,d5]) ).
cnf(d24,plain,
( n(s(n(e))) = u(n(e),n(s(n(e))))
| mem(n(n(e)),s(s(n(e))))
| mem(n(n(e)),s(n(e))) ),
inference(resolution,[status(thm)],[d8,d23]) ).
cnf(d25,plain,
( n(n(e)) = s(n(e))
| mem(n(n(e)),s(n(e)))
| n(s(n(e))) = u(n(e),n(s(n(e)))) ),
inference(resolution,[status(thm)],[d24,c8]) ).
cnf(d26,plain,
( n(n(e)) = n(e)
| n(n(e)) = s(n(e))
| n(s(n(e))) = u(n(e),n(s(n(e)))) ),
inference(resolution,[status(thm)],[d25,c8]) ).
cnf(d27,plain,
( n(n(e)) = n(e)
| n(n(e)) = s(n(e))
| ~ mem(X0,n(e))
| mem(X0,n(s(n(e)))) ),
inference(superposition,[status(thm)],[d26,c11]) ).
cnf(d28,plain,
( mem(X0,s(s(n(e))))
| mem(X0,s(n(e)))
| ~ mem(X0,n(e))
| n(n(e)) = n(e)
| n(n(e)) = s(n(e)) ),
inference(resolution,[status(thm)],[d27,d8]) ).
cnf(d29,plain,
( X0 = s(n(e))
| ~ mem(X0,n(e))
| mem(X0,s(n(e)))
| n(n(e)) = n(e)
| n(n(e)) = s(n(e)) ),
inference(resolution,[status(thm)],[d28,c8]) ).
cnf(d30,plain,
( X0 = n(e)
| ~ mem(X0,n(e))
| n(n(e)) = n(e)
| n(n(e)) = s(n(e))
| X0 = s(n(e)) ),
inference(resolution,[status(thm)],[d29,c8]) ).
cnf(d31,plain,
( n(n(e)) = n(e)
| n(n(e)) = s(n(e))
| e = n(e)
| e = s(n(e)) ),
inference(resolution,[status(thm)],[d30,d6]) ).
cnf(d32,plain,
( n(n(e)) = n(e)
| e = n(e)
| e = s(n(e))
| X0 = n(e)
| ~ mem(X0,n(n(e))) ),
inference(superposition,[status(thm)],[d31,c8]) ).
cnf(d33,plain,
( ~ mem(X0,n(e))
| n(n(e)) = n(e)
| e = n(e)
| e = s(n(e))
| X0 = n(e) ),
inference(resolution,[status(thm)],[d32,d10]) ).
cnf(d34,plain,
( n(n(e)) = n(e)
| e = n(e)
| e = s(n(e))
| e = n(e) ),
inference(resolution,[status(thm)],[d33,d6]) ).
cnf(d35,plain,
( n(n(e)) = n(e)
| e = n(e)
| mem(n(e),e) ),
inference(superposition,[status(thm)],[d34,d0]) ).
cnf(d36,plain,
( n(n(e)) = n(e)
| e = n(e) ),
inference(resolution,[status(thm)],[c7,d35]) ).
cnf(d37,plain,
( e = n(e)
| mem(n(e),n(e)) ),
inference(superposition,[status(thm)],[d36,d6]) ).
cnf(d38,plain,
( mem(n(e),s(e))
| mem(n(e),e)
| e = n(e) ),
inference(resolution,[status(thm)],[d37,d8]) ).
cnf(d39,plain,
( mem(n(e),s(e))
| e = n(e) ),
inference(resolution,[status(thm)],[c7,d38]) ).
cnf(d40,plain,
( n(e) = e
| e = n(e) ),
inference(resolution,[status(thm)],[d39,c8]) ).
cnf(d41,plain,
( n(e) = e
| mem(e,e) ),
inference(superposition,[status(thm)],[d40,d6]) ).
cnf(d42,plain,
n(e) = e,
inference(resolution,[status(thm)],[c7,d41]) ).
cnf(d43,plain,
mem(e,e),
inference(superposition,[status(thm)],[d42,d6]) ).
cnf(d44,plain,
$false,
inference(resolution,[status(thm)],[c7,d43]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEV570+1 : TPTP v9.3.1. Released v9.1.0.
% 0.00/0.03 % Command : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/5.59 % Computer : n017.cluster.edu
% 0.12/5.59 % Model : x86_64 x86_64
% 0.12/5.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.59 % Memory : 8046.5625MB
% 0.12/5.59 % OS : Linux 6.8.0-71-generic
% 0.12/5.59 % CPULimit : 300
% 0.12/5.59 % WCLimit : 300
% 0.12/5.59 % DateTime : Sat Sep 26 11:13:25 UTC 2026
% 0.12/5.60 % CPUTime :
% 0.12/5.60 Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 61.40/13.48 % SZS status Theorem for theBenchmark.p
% 61.40/13.48 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------