%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : SWC019-1 : TPTP v9.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_E %s %d THM
% Computer : n003.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 : 300s
% DateTime : Sat Jun 21 05:29:56 AM UTC 2025
% Result : Unsatisfiable 0.19s 0.43s
% Output : Proof 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 31
% Syntax : Number of formulae : 81 ( 29 unt; 0 typ; 0 def)
% Number of atoms : 346 ( 74 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 468 ( 220 ~; 209 |; 0 &)
% ( 39 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 17 ( 17 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 64 ( 57 !; 0 ?; 64 :)
% Comments :
%------------------------------------------------------------------------------
tff(sk2_type,type,
sk2: $i ).
tff(nil_type,type,
nil: $i ).
tff(sk3_type,type,
sk3: $i ).
tff(sk1_type,type,
sk1: $i ).
tff(sk4_type,type,
sk4: $i ).
tff(neq_type,type,
neq: ( $i * $i ) > $o ).
tff(frontsegP_type,type,
frontsegP: ( $i * $i ) > $o ).
tff(ssList_type,type,
ssList: $i > $o ).
tff(1,plain,
( ( sk1 = sk3 )
<=> ( sk1 = sk3 ) ),
inference(rewrite,[status(thm)],[]) ).
tff(2,axiom,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
tff(3,plain,
sk1 = sk3,
inference(modus_ponens,[status(thm)],[2,1]) ).
tff(4,plain,
sk3 = sk1,
inference(symmetry,[status(thm)],[3]) ).
tff(5,plain,
( ( sk4 = sk3 )
<=> ( sk4 = sk3 ) ),
inference(rewrite,[status(thm)],[]) ).
tff(6,axiom,
sk4 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
tff(7,plain,
sk4 = sk3,
inference(modus_ponens,[status(thm)],[6,5]) ).
tff(8,plain,
( ( sk2 = sk4 )
<=> ( sk2 = sk4 ) ),
inference(rewrite,[status(thm)],[]) ).
tff(9,axiom,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
tff(10,plain,
sk2 = sk4,
inference(modus_ponens,[status(thm)],[9,8]) ).
tff(11,plain,
sk2 = sk1,
inference(transitivity,[status(thm)],[10,7,4]) ).
tff(12,plain,
( ( nil = sk2 )
<=> ( nil = sk1 ) ),
inference(monotonicity,[status(thm)],[11]) ).
tff(13,plain,
( ( nil = sk1 )
<=> ( nil = sk2 ) ),
inference(symmetry,[status(thm)],[12]) ).
tff(14,plain,
( ( sk1 = nil )
<=> ( nil = sk1 ) ),
inference(commutativity,[status(thm)],[]) ).
tff(15,plain,
( ( sk3 = nil )
<=> ( sk1 = nil ) ),
inference(monotonicity,[status(thm)],[4]) ).
tff(16,plain,
( ( sk3 = nil )
<=> ( nil = sk1 ) ),
inference(transitivity,[status(thm)],[15,14]) ).
tff(17,plain,
( ( sk3 = nil )
<=> ( nil = sk2 ) ),
inference(transitivity,[status(thm)],[16,13]) ).
tff(18,plain,
sk4 = sk2,
inference(symmetry,[status(thm)],[10]) ).
tff(19,plain,
sk3 = sk4,
inference(symmetry,[status(thm)],[7]) ).
tff(20,plain,
sk1 = sk2,
inference(transitivity,[status(thm)],[3,19,18]) ).
tff(21,plain,
( frontsegP(sk1,sk3)
<=> frontsegP(sk2,sk3) ),
inference(monotonicity,[status(thm)],[20]) ).
tff(22,plain,
( frontsegP(sk2,sk3)
<=> frontsegP(sk1,sk3) ),
inference(symmetry,[status(thm)],[21]) ).
tff(23,plain,
sk3 = sk2,
inference(transitivity,[status(thm)],[19,18]) ).
tff(24,plain,
( frontsegP(sk3,sk3)
<=> frontsegP(sk2,sk3) ),
inference(monotonicity,[status(thm)],[23]) ).
tff(25,plain,
( frontsegP(sk3,sk3)
<=> frontsegP(sk1,sk3) ),
inference(transitivity,[status(thm)],[24,22]) ).
tff(26,plain,
( ssList(sk3)
<=> ssList(sk3) ),
inference(rewrite,[status(thm)],[]) ).
tff(27,axiom,
ssList(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_3) ).
tff(28,plain,
ssList(sk3),
inference(modus_ponens,[status(thm)],[27,26]) ).
tff(29,plain,
^ [U: $i] :
refl(( ( ~ ssList(U)
| frontsegP(U,U) )
<=> ( ~ ssList(U)
| frontsegP(U,U) ) )),
inference(bind,[status(th)],[]) ).
tff(30,plain,
( ! [U: $i] :
( ~ ssList(U)
| frontsegP(U,U) )
<=> ! [U: $i] :
( ~ ssList(U)
| frontsegP(U,U) ) ),
inference(quant_intro,[status(thm)],[29]) ).
tff(31,plain,
( ! [U: $i] :
( ~ ssList(U)
| frontsegP(U,U) )
<=> ! [U: $i] :
( ~ ssList(U)
| frontsegP(U,U) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(32,axiom,
! [U: $i] :
( ~ ssList(U)
| frontsegP(U,U) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause61) ).
tff(33,plain,
! [U: $i] :
( ~ ssList(U)
| frontsegP(U,U) ),
inference(modus_ponens,[status(thm)],[32,31]) ).
tff(34,plain,
! [U: $i] :
( ~ ssList(U)
| frontsegP(U,U) ),
inference(skolemize,[status(sab)],[33]) ).
tff(35,plain,
! [U: $i] :
( ~ ssList(U)
| frontsegP(U,U) ),
inference(modus_ponens,[status(thm)],[34,30]) ).
tff(36,plain,
( ( ~ ! [U: $i] :
( ~ ssList(U)
| frontsegP(U,U) )
| ~ ssList(sk3)
| frontsegP(sk3,sk3) )
<=> ( ~ ! [U: $i] :
( ~ ssList(U)
| frontsegP(U,U) )
| ~ ssList(sk3)
| frontsegP(sk3,sk3) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(37,plain,
( ~ ! [U: $i] :
( ~ ssList(U)
| frontsegP(U,U) )
| ~ ssList(sk3)
| frontsegP(sk3,sk3) ),
inference(quant_inst,[status(thm)],[]) ).
tff(38,plain,
( ~ ! [U: $i] :
( ~ ssList(U)
| frontsegP(U,U) )
| ~ ssList(sk3)
| frontsegP(sk3,sk3) ),
inference(modus_ponens,[status(thm)],[37,36]) ).
tff(39,plain,
frontsegP(sk3,sk3),
inference(unit_resolution,[status(thm)],[38,35,28]) ).
tff(40,plain,
frontsegP(sk1,sk3),
inference(modus_ponens,[status(thm)],[39,25]) ).
tff(41,plain,
frontsegP(sk2,sk3),
inference(modus_ponens,[status(thm)],[39,24]) ).
tff(42,plain,
^ [A: $i] :
refl(( ( ~ ssList(A)
| ~ frontsegP(sk2,A)
| ~ neq(A,nil)
| ~ frontsegP(sk1,A) )
<=> ( ~ ssList(A)
| ~ frontsegP(sk2,A)
| ~ neq(A,nil)
| ~ frontsegP(sk1,A) ) )),
inference(bind,[status(th)],[]) ).
tff(43,plain,
( ! [A: $i] :
( ~ ssList(A)
| ~ frontsegP(sk2,A)
| ~ neq(A,nil)
| ~ frontsegP(sk1,A) )
<=> ! [A: $i] :
( ~ ssList(A)
| ~ frontsegP(sk2,A)
| ~ neq(A,nil)
| ~ frontsegP(sk1,A) ) ),
inference(quant_intro,[status(thm)],[42]) ).
tff(44,plain,
( ! [A: $i] :
( ~ ssList(A)
| ~ frontsegP(sk2,A)
| ~ neq(A,nil)
| ~ frontsegP(sk1,A) )
<=> ! [A: $i] :
( ~ ssList(A)
| ~ frontsegP(sk2,A)
| ~ neq(A,nil)
| ~ frontsegP(sk1,A) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(45,plain,
^ [A: $i] :
trans(monotonicity(rewrite(( ( ~ ssList(A)
| ~ neq(A,nil)
| ~ frontsegP(sk2,A) )
<=> ( ~ ssList(A)
| ~ frontsegP(sk2,A)
| ~ neq(A,nil) ) )),
( ( ~ ssList(A)
| ~ neq(A,nil)
| ~ frontsegP(sk2,A)
| ~ frontsegP(sk1,A) )
<=> ( ~ ssList(A)
| ~ frontsegP(sk2,A)
| ~ neq(A,nil)
| ~ frontsegP(sk1,A) ) )),
rewrite(( ( ~ ssList(A)
| ~ frontsegP(sk2,A)
| ~ neq(A,nil)
| ~ frontsegP(sk1,A) )
<=> ( ~ ssList(A)
| ~ frontsegP(sk2,A)
| ~ neq(A,nil)
| ~ frontsegP(sk1,A) ) )),
( ( ~ ssList(A)
| ~ neq(A,nil)
| ~ frontsegP(sk2,A)
| ~ frontsegP(sk1,A) )
<=> ( ~ ssList(A)
| ~ frontsegP(sk2,A)
| ~ neq(A,nil)
| ~ frontsegP(sk1,A) ) )),
inference(bind,[status(th)],[]) ).
tff(46,plain,
( ! [A: $i] :
( ~ ssList(A)
| ~ neq(A,nil)
| ~ frontsegP(sk2,A)
| ~ frontsegP(sk1,A) )
<=> ! [A: $i] :
( ~ ssList(A)
| ~ frontsegP(sk2,A)
| ~ neq(A,nil)
| ~ frontsegP(sk1,A) ) ),
inference(quant_intro,[status(thm)],[45]) ).
tff(47,axiom,
! [A: $i] :
( ~ ssList(A)
| ~ neq(A,nil)
| ~ frontsegP(sk2,A)
| ~ frontsegP(sk1,A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
tff(48,plain,
! [A: $i] :
( ~ ssList(A)
| ~ frontsegP(sk2,A)
| ~ neq(A,nil)
| ~ frontsegP(sk1,A) ),
inference(modus_ponens,[status(thm)],[47,46]) ).
tff(49,plain,
! [A: $i] :
( ~ ssList(A)
| ~ frontsegP(sk2,A)
| ~ neq(A,nil)
| ~ frontsegP(sk1,A) ),
inference(modus_ponens,[status(thm)],[48,44]) ).
tff(50,plain,
! [A: $i] :
( ~ ssList(A)
| ~ frontsegP(sk2,A)
| ~ neq(A,nil)
| ~ frontsegP(sk1,A) ),
inference(skolemize,[status(sab)],[49]) ).
tff(51,plain,
! [A: $i] :
( ~ ssList(A)
| ~ frontsegP(sk2,A)
| ~ neq(A,nil)
| ~ frontsegP(sk1,A) ),
inference(modus_ponens,[status(thm)],[50,43]) ).
tff(52,plain,
( ( ~ ! [A: $i] :
( ~ ssList(A)
| ~ frontsegP(sk2,A)
| ~ neq(A,nil)
| ~ frontsegP(sk1,A) )
| ~ ssList(sk3)
| ~ frontsegP(sk2,sk3)
| ~ neq(sk3,nil)
| ~ frontsegP(sk1,sk3) )
<=> ( ~ ! [A: $i] :
( ~ ssList(A)
| ~ frontsegP(sk2,A)
| ~ neq(A,nil)
| ~ frontsegP(sk1,A) )
| ~ ssList(sk3)
| ~ frontsegP(sk2,sk3)
| ~ neq(sk3,nil)
| ~ frontsegP(sk1,sk3) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(53,plain,
( ~ ! [A: $i] :
( ~ ssList(A)
| ~ frontsegP(sk2,A)
| ~ neq(A,nil)
| ~ frontsegP(sk1,A) )
| ~ ssList(sk3)
| ~ frontsegP(sk2,sk3)
| ~ neq(sk3,nil)
| ~ frontsegP(sk1,sk3) ),
inference(quant_inst,[status(thm)],[]) ).
tff(54,plain,
( ~ ! [A: $i] :
( ~ ssList(A)
| ~ frontsegP(sk2,A)
| ~ neq(A,nil)
| ~ frontsegP(sk1,A) )
| ~ ssList(sk3)
| ~ frontsegP(sk2,sk3)
| ~ neq(sk3,nil)
| ~ frontsegP(sk1,sk3) ),
inference(modus_ponens,[status(thm)],[53,52]) ).
tff(55,plain,
( ~ frontsegP(sk2,sk3)
| ~ neq(sk3,nil)
| ~ frontsegP(sk1,sk3) ),
inference(unit_resolution,[status(thm)],[54,28,51]) ).
tff(56,plain,
~ neq(sk3,nil),
inference(unit_resolution,[status(thm)],[55,41,40]) ).
tff(57,plain,
^ [V: $i,U: $i] :
refl(( ( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) ) )),
inference(bind,[status(th)],[]) ).
tff(58,plain,
( ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) )
<=> ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) ) ),
inference(quant_intro,[status(thm)],[57]) ).
tff(59,plain,
( ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) )
<=> ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(60,plain,
^ [V: $i,U: $i] :
trans(monotonicity(rewrite(( ( ~ ssList(U)
| ~ ssList(V)
| neq(V,U) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| neq(V,U) ) )),
( ( ~ ssList(U)
| ~ ssList(V)
| neq(V,U)
| ( V = U ) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| neq(V,U)
| ( V = U ) ) )),
rewrite(( ( ~ ssList(U)
| ~ ssList(V)
| neq(V,U)
| ( V = U ) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) ) )),
( ( ~ ssList(U)
| ~ ssList(V)
| neq(V,U)
| ( V = U ) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) ) )),
inference(bind,[status(th)],[]) ).
tff(61,plain,
( ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| neq(V,U)
| ( V = U ) )
<=> ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) ) ),
inference(quant_intro,[status(thm)],[60]) ).
tff(62,axiom,
! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| neq(V,U)
| ( V = U ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
tff(63,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) ),
inference(modus_ponens,[status(thm)],[62,61]) ).
tff(64,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) ),
inference(modus_ponens,[status(thm)],[63,59]) ).
tff(65,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) ),
inference(skolemize,[status(sab)],[64]) ).
tff(66,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) ),
inference(modus_ponens,[status(thm)],[65,58]) ).
tff(67,plain,
( ssList(nil)
<=> ssList(nil) ),
inference(rewrite,[status(thm)],[]) ).
tff(68,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
tff(69,plain,
ssList(nil),
inference(modus_ponens,[status(thm)],[68,67]) ).
tff(70,plain,
( ( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) )
| ~ ssList(nil)
| ~ ssList(sk3)
| ( sk3 = nil )
| neq(sk3,nil) )
<=> ( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) )
| ~ ssList(nil)
| ~ ssList(sk3)
| ( sk3 = nil )
| neq(sk3,nil) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(71,plain,
( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) )
| ~ ssList(nil)
| ~ ssList(sk3)
| ( sk3 = nil )
| neq(sk3,nil) ),
inference(quant_inst,[status(thm)],[]) ).
tff(72,plain,
( ~ ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) )
| ~ ssList(nil)
| ~ ssList(sk3)
| ( sk3 = nil )
| neq(sk3,nil) ),
inference(modus_ponens,[status(thm)],[71,70]) ).
tff(73,plain,
sk3 = nil,
inference(unit_resolution,[status(thm)],[72,69,66,28,56]) ).
tff(74,plain,
nil = sk2,
inference(modus_ponens,[status(thm)],[73,17]) ).
tff(75,plain,
nil = sk1,
inference(modus_ponens,[status(thm)],[73,16]) ).
tff(76,plain,
( ( ( nil != sk1 )
| ( nil != sk2 ) )
<=> ( ( nil != sk1 )
| ( nil != sk2 ) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(77,plain,
( ( ( nil != sk2 )
| ( nil != sk1 ) )
<=> ( ( nil != sk1 )
| ( nil != sk2 ) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(78,axiom,
( ( nil != sk2 )
| ( nil != sk1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
tff(79,plain,
( ( nil != sk1 )
| ( nil != sk2 ) ),
inference(modus_ponens,[status(thm)],[78,77]) ).
tff(80,plain,
( ( nil != sk1 )
| ( nil != sk2 ) ),
inference(modus_ponens,[status(thm)],[79,76]) ).
tff(81,plain,
$false,
inference(unit_resolution,[status(thm)],[80,75,74]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC019-1 : TPTP v9.0.0. Released v2.4.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n003.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri Jun 20 08:00:54 EDT 2025
% 0.12/0.33 % CPUTime :
% 0.19/0.43 % SZS status Unsatisfiable
% 0.19/0.43 % SZS output start Proof
% See solution above
% 0.19/0.45 % E exiting
%------------------------------------------------------------------------------