%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : SWC417-1 : TPTP v9.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_E %s %d THM
% Computer : n001.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:31:11 AM UTC 2025
% Result : Unsatisfiable 0.20s 0.47s
% Output : Proof 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 53
% Syntax : Number of formulae : 119 ( 36 unt; 0 typ; 0 def)
% Number of atoms : 690 ( 200 equ)
% Maximal formula atoms : 24 ( 5 avg)
% Number of connectives : 1072 ( 533 ~; 481 |; 0 &)
% ( 58 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of FOOLs : 32 ( 32 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 : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 186 ( 168 !; 0 ?; 186 :)
% Comments :
%------------------------------------------------------------------------------
tff(sk1_type,type,
sk1: $i ).
tff(app_type,type,
app: ( $i * $i ) > $i ).
tff(nil_type,type,
nil: $i ).
tff(cons_type,type,
cons: ( $i * $i ) > $i ).
tff(sk5_type,type,
sk5: $i ).
tff(sk6_type,type,
sk6: $i ).
tff(sk3_type,type,
sk3: $i ).
tff(ssList_type,type,
ssList: $i > $o ).
tff(neq_type,type,
neq: ( $i * $i ) > $o ).
tff(sk4_type,type,
sk4: $i ).
tff(sk2_type,type,
sk2: $i ).
tff(ssItem_type,type,
ssItem: $i > $o ).
tff(1,plain,
( ( sk1 = sk3 )
<=> ( sk1 = sk3 ) ),
inference(rewrite,[status(thm)],[]) ).
tff(2,axiom,
sk1 = sk3,
file('/export/starexec/sandbox2/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,
( ssList(sk3)
<=> ssList(sk3) ),
inference(rewrite,[status(thm)],[]) ).
tff(6,axiom,
ssList(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_3) ).
tff(7,plain,
ssList(sk3),
inference(modus_ponens,[status(thm)],[6,5]) ).
tff(8,plain,
^ [U: $i] :
refl(( ( ~ ssList(U)
| ( app(U,nil) = U ) )
<=> ( ~ ssList(U)
| ( app(U,nil) = U ) ) )),
inference(bind,[status(th)],[]) ).
tff(9,plain,
( ! [U: $i] :
( ~ ssList(U)
| ( app(U,nil) = U ) )
<=> ! [U: $i] :
( ~ ssList(U)
| ( app(U,nil) = U ) ) ),
inference(quant_intro,[status(thm)],[8]) ).
tff(10,plain,
( ! [U: $i] :
( ~ ssList(U)
| ( app(U,nil) = U ) )
<=> ! [U: $i] :
( ~ ssList(U)
| ( app(U,nil) = U ) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(11,axiom,
! [U: $i] :
( ~ ssList(U)
| ( app(U,nil) = U ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
tff(12,plain,
! [U: $i] :
( ~ ssList(U)
| ( app(U,nil) = U ) ),
inference(modus_ponens,[status(thm)],[11,10]) ).
tff(13,plain,
! [U: $i] :
( ~ ssList(U)
| ( app(U,nil) = U ) ),
inference(skolemize,[status(sab)],[12]) ).
tff(14,plain,
! [U: $i] :
( ~ ssList(U)
| ( app(U,nil) = U ) ),
inference(modus_ponens,[status(thm)],[13,9]) ).
tff(15,plain,
( ( ~ ! [U: $i] :
( ~ ssList(U)
| ( app(U,nil) = U ) )
| ~ ssList(sk3)
| ( app(sk3,nil) = sk3 ) )
<=> ( ~ ! [U: $i] :
( ~ ssList(U)
| ( app(U,nil) = U ) )
| ~ ssList(sk3)
| ( app(sk3,nil) = sk3 ) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(16,plain,
( ~ ! [U: $i] :
( ~ ssList(U)
| ( app(U,nil) = U ) )
| ~ ssList(sk3)
| ( app(sk3,nil) = sk3 ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(17,plain,
( ~ ! [U: $i] :
( ~ ssList(U)
| ( app(U,nil) = U ) )
| ~ ssList(sk3)
| ( app(sk3,nil) = sk3 ) ),
inference(modus_ponens,[status(thm)],[16,15]) ).
tff(18,plain,
app(sk3,nil) = sk3,
inference(unit_resolution,[status(thm)],[17,14,7]) ).
tff(19,plain,
( ( sk2 = sk4 )
<=> ( sk2 = sk4 ) ),
inference(rewrite,[status(thm)],[]) ).
tff(20,axiom,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
tff(21,plain,
sk2 = sk4,
inference(modus_ponens,[status(thm)],[20,19]) ).
tff(22,plain,
( neq(sk2,nil)
<=> neq(sk4,nil) ),
inference(monotonicity,[status(thm)],[21]) ).
tff(23,plain,
( neq(sk2,nil)
<=> neq(sk2,nil) ),
inference(rewrite,[status(thm)],[]) ).
tff(24,plain,
( ( neq(sk2,nil)
| neq(sk2,nil) )
<=> neq(sk2,nil) ),
inference(rewrite,[status(thm)],[]) ).
tff(25,axiom,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
tff(26,plain,
neq(sk2,nil),
inference(modus_ponens,[status(thm)],[25,24]) ).
tff(27,plain,
neq(sk2,nil),
inference(modus_ponens,[status(thm)],[26,23]) ).
tff(28,plain,
neq(sk4,nil),
inference(modus_ponens,[status(thm)],[27,22]) ).
tff(29,plain,
( ( ~ neq(sk4,nil)
| ( app(sk6,cons(sk5,nil)) = sk3 ) )
<=> ( ~ neq(sk4,nil)
| ( app(sk6,cons(sk5,nil)) = sk3 ) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(30,plain,
( ( ( app(sk6,cons(sk5,nil)) = sk3 )
| ~ neq(sk4,nil) )
<=> ( ~ neq(sk4,nil)
| ( app(sk6,cons(sk5,nil)) = sk3 ) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(31,axiom,
( ( app(sk6,cons(sk5,nil)) = sk3 )
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
tff(32,plain,
( ~ neq(sk4,nil)
| ( app(sk6,cons(sk5,nil)) = sk3 ) ),
inference(modus_ponens,[status(thm)],[31,30]) ).
tff(33,plain,
( ~ neq(sk4,nil)
| ( app(sk6,cons(sk5,nil)) = sk3 ) ),
inference(modus_ponens,[status(thm)],[32,29]) ).
tff(34,plain,
app(sk6,cons(sk5,nil)) = sk3,
inference(unit_resolution,[status(thm)],[33,28]) ).
tff(35,plain,
app(app(sk6,cons(sk5,nil)),nil) = app(sk3,nil),
inference(monotonicity,[status(thm)],[34]) ).
tff(36,plain,
app(app(sk6,cons(sk5,nil)),nil) = sk1,
inference(transitivity,[status(thm)],[35,18,4]) ).
tff(37,plain,
sk4 = sk2,
inference(symmetry,[status(thm)],[21]) ).
tff(38,plain,
( ssList(sk4)
<=> ssList(sk4) ),
inference(rewrite,[status(thm)],[]) ).
tff(39,axiom,
ssList(sk4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_4) ).
tff(40,plain,
ssList(sk4),
inference(modus_ponens,[status(thm)],[39,38]) ).
tff(41,plain,
^ [U: $i] :
refl(( ( ~ ssList(U)
| ( app(nil,U) = U ) )
<=> ( ~ ssList(U)
| ( app(nil,U) = U ) ) )),
inference(bind,[status(th)],[]) ).
tff(42,plain,
( ! [U: $i] :
( ~ ssList(U)
| ( app(nil,U) = U ) )
<=> ! [U: $i] :
( ~ ssList(U)
| ( app(nil,U) = U ) ) ),
inference(quant_intro,[status(thm)],[41]) ).
tff(43,plain,
( ! [U: $i] :
( ~ ssList(U)
| ( app(nil,U) = U ) )
<=> ! [U: $i] :
( ~ ssList(U)
| ( app(nil,U) = U ) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(44,axiom,
! [U: $i] :
( ~ ssList(U)
| ( app(nil,U) = U ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
tff(45,plain,
! [U: $i] :
( ~ ssList(U)
| ( app(nil,U) = U ) ),
inference(modus_ponens,[status(thm)],[44,43]) ).
tff(46,plain,
! [U: $i] :
( ~ ssList(U)
| ( app(nil,U) = U ) ),
inference(skolemize,[status(sab)],[45]) ).
tff(47,plain,
! [U: $i] :
( ~ ssList(U)
| ( app(nil,U) = U ) ),
inference(modus_ponens,[status(thm)],[46,42]) ).
tff(48,plain,
( ( ~ ! [U: $i] :
( ~ ssList(U)
| ( app(nil,U) = U ) )
| ~ ssList(sk4)
| ( app(nil,sk4) = sk4 ) )
<=> ( ~ ! [U: $i] :
( ~ ssList(U)
| ( app(nil,U) = U ) )
| ~ ssList(sk4)
| ( app(nil,sk4) = sk4 ) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(49,plain,
( ~ ! [U: $i] :
( ~ ssList(U)
| ( app(nil,U) = U ) )
| ~ ssList(sk4)
| ( app(nil,sk4) = sk4 ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(50,plain,
( ~ ! [U: $i] :
( ~ ssList(U)
| ( app(nil,U) = U ) )
| ~ ssList(sk4)
| ( app(nil,sk4) = sk4 ) ),
inference(modus_ponens,[status(thm)],[49,48]) ).
tff(51,plain,
app(nil,sk4) = sk4,
inference(unit_resolution,[status(thm)],[50,47,40]) ).
tff(52,plain,
( ( ~ neq(sk4,nil)
| ( app(cons(sk5,nil),sk6) = sk4 ) )
<=> ( ~ neq(sk4,nil)
| ( app(cons(sk5,nil),sk6) = sk4 ) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(53,plain,
( ( ( app(cons(sk5,nil),sk6) = sk4 )
| ~ neq(sk4,nil) )
<=> ( ~ neq(sk4,nil)
| ( app(cons(sk5,nil),sk6) = sk4 ) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(54,axiom,
( ( app(cons(sk5,nil),sk6) = sk4 )
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
tff(55,plain,
( ~ neq(sk4,nil)
| ( app(cons(sk5,nil),sk6) = sk4 ) ),
inference(modus_ponens,[status(thm)],[54,53]) ).
tff(56,plain,
( ~ neq(sk4,nil)
| ( app(cons(sk5,nil),sk6) = sk4 ) ),
inference(modus_ponens,[status(thm)],[55,52]) ).
tff(57,plain,
app(cons(sk5,nil),sk6) = sk4,
inference(unit_resolution,[status(thm)],[56,28]) ).
tff(58,plain,
app(nil,app(cons(sk5,nil),sk6)) = app(nil,sk4),
inference(monotonicity,[status(thm)],[57]) ).
tff(59,plain,
( ( ssItem(sk5)
| ~ neq(sk4,nil) )
<=> ( ssItem(sk5)
| ~ neq(sk4,nil) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(60,axiom,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
tff(61,plain,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
inference(modus_ponens,[status(thm)],[60,59]) ).
tff(62,plain,
ssItem(sk5),
inference(unit_resolution,[status(thm)],[61,28]) ).
tff(63,plain,
^ [V: $i,U: $i] :
refl(( ( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) )
<=> ( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ) )),
inference(bind,[status(th)],[]) ).
tff(64,plain,
( ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) )
<=> ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ) ),
inference(quant_intro,[status(thm)],[63]) ).
tff(65,plain,
( ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) )
<=> ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(66,plain,
^ [V: $i,U: $i] :
rewrite(( ( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) )
<=> ( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ) )),
inference(bind,[status(th)],[]) ).
tff(67,plain,
( ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) )
<=> ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ) ),
inference(quant_intro,[status(thm)],[66]) ).
tff(68,axiom,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
tff(69,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ),
inference(modus_ponens,[status(thm)],[68,67]) ).
tff(70,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ),
inference(modus_ponens,[status(thm)],[69,65]) ).
tff(71,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ),
inference(skolemize,[status(sab)],[70]) ).
tff(72,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ),
inference(modus_ponens,[status(thm)],[71,64]) ).
tff(73,plain,
( ssList(nil)
<=> ssList(nil) ),
inference(rewrite,[status(thm)],[]) ).
tff(74,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
tff(75,plain,
ssList(nil),
inference(modus_ponens,[status(thm)],[74,73]) ).
tff(76,plain,
( ( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) )
| ~ ssItem(sk5)
| ~ ssList(nil)
| ssList(cons(sk5,nil)) )
<=> ( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) )
| ~ ssItem(sk5)
| ~ ssList(nil)
| ssList(cons(sk5,nil)) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(77,plain,
( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) )
| ~ ssItem(sk5)
| ~ ssList(nil)
| ssList(cons(sk5,nil)) ),
inference(quant_inst,[status(thm)],[]) ).
tff(78,plain,
( ~ ! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) )
| ~ ssItem(sk5)
| ~ ssList(nil)
| ssList(cons(sk5,nil)) ),
inference(modus_ponens,[status(thm)],[77,76]) ).
tff(79,plain,
ssList(cons(sk5,nil)),
inference(unit_resolution,[status(thm)],[78,75,72,62]) ).
tff(80,plain,
( ( ssList(sk6)
| ~ neq(sk4,nil) )
<=> ( ssList(sk6)
| ~ neq(sk4,nil) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(81,axiom,
( ssList(sk6)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
tff(82,plain,
( ssList(sk6)
| ~ neq(sk4,nil) ),
inference(modus_ponens,[status(thm)],[81,80]) ).
tff(83,plain,
ssList(sk6),
inference(unit_resolution,[status(thm)],[82,28]) ).
tff(84,plain,
^ [W: $i,V: $i,U: $i] :
refl(( ( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) ) )),
inference(bind,[status(th)],[]) ).
tff(85,plain,
( ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) )
<=> ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) ) ),
inference(quant_intro,[status(thm)],[84]) ).
tff(86,plain,
( ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) )
<=> ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(87,plain,
^ [W: $i,V: $i,U: $i] :
trans(monotonicity(rewrite(( ( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W) ) )),
( ( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) ) )),
rewrite(( ( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) ) )),
( ( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) ) )),
inference(bind,[status(th)],[]) ).
tff(88,plain,
( ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) )
<=> ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) ) ),
inference(quant_intro,[status(thm)],[87]) ).
tff(89,axiom,
! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause149) ).
tff(90,plain,
! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) ),
inference(modus_ponens,[status(thm)],[89,88]) ).
tff(91,plain,
! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) ),
inference(modus_ponens,[status(thm)],[90,86]) ).
tff(92,plain,
! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) ),
inference(skolemize,[status(sab)],[91]) ).
tff(93,plain,
! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) ),
inference(modus_ponens,[status(thm)],[92,85]) ).
tff(94,plain,
( ( ~ ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) )
| ~ ssList(nil)
| ~ ssList(sk6)
| ~ ssList(cons(sk5,nil))
| ( app(app(nil,cons(sk5,nil)),sk6) = app(nil,app(cons(sk5,nil),sk6)) ) )
<=> ( ~ ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) )
| ~ ssList(nil)
| ~ ssList(sk6)
| ~ ssList(cons(sk5,nil))
| ( app(app(nil,cons(sk5,nil)),sk6) = app(nil,app(cons(sk5,nil),sk6)) ) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(95,plain,
( ( ~ ssList(sk6)
| ~ ssList(cons(sk5,nil))
| ~ ssList(nil)
| ( app(app(nil,cons(sk5,nil)),sk6) = app(nil,app(cons(sk5,nil),sk6)) ) )
<=> ( ~ ssList(nil)
| ~ ssList(sk6)
| ~ ssList(cons(sk5,nil))
| ( app(app(nil,cons(sk5,nil)),sk6) = app(nil,app(cons(sk5,nil),sk6)) ) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(96,plain,
( ( ~ ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) )
| ~ ssList(sk6)
| ~ ssList(cons(sk5,nil))
| ~ ssList(nil)
| ( app(app(nil,cons(sk5,nil)),sk6) = app(nil,app(cons(sk5,nil),sk6)) ) )
<=> ( ~ ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) )
| ~ ssList(nil)
| ~ ssList(sk6)
| ~ ssList(cons(sk5,nil))
| ( app(app(nil,cons(sk5,nil)),sk6) = app(nil,app(cons(sk5,nil),sk6)) ) ) ),
inference(monotonicity,[status(thm)],[95]) ).
tff(97,plain,
( ( ~ ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) )
| ~ ssList(sk6)
| ~ ssList(cons(sk5,nil))
| ~ ssList(nil)
| ( app(app(nil,cons(sk5,nil)),sk6) = app(nil,app(cons(sk5,nil),sk6)) ) )
<=> ( ~ ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) )
| ~ ssList(nil)
| ~ ssList(sk6)
| ~ ssList(cons(sk5,nil))
| ( app(app(nil,cons(sk5,nil)),sk6) = app(nil,app(cons(sk5,nil),sk6)) ) ) ),
inference(transitivity,[status(thm)],[96,94]) ).
tff(98,plain,
( ~ ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) )
| ~ ssList(sk6)
| ~ ssList(cons(sk5,nil))
| ~ ssList(nil)
| ( app(app(nil,cons(sk5,nil)),sk6) = app(nil,app(cons(sk5,nil),sk6)) ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(99,plain,
( ~ ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(W,V),U) = app(W,app(V,U)) ) )
| ~ ssList(nil)
| ~ ssList(sk6)
| ~ ssList(cons(sk5,nil))
| ( app(app(nil,cons(sk5,nil)),sk6) = app(nil,app(cons(sk5,nil),sk6)) ) ),
inference(modus_ponens,[status(thm)],[98,97]) ).
tff(100,plain,
app(app(nil,cons(sk5,nil)),sk6) = app(nil,app(cons(sk5,nil),sk6)),
inference(unit_resolution,[status(thm)],[99,75,93,83,79]) ).
tff(101,plain,
app(app(nil,cons(sk5,nil)),sk6) = sk2,
inference(transitivity,[status(thm)],[100,58,51,37]) ).
tff(102,plain,
^ [B: $i,A: $i,C: $i] :
refl(( ( ~ ssList(C)
| ~ neq(sk4,nil)
| ~ ssItem(A)
| ~ ssList(B)
| ( app(app(C,cons(A,nil)),B) != sk1 )
| ( app(app(B,cons(A,nil)),C) != sk2 ) )
<=> ( ~ ssList(C)
| ~ neq(sk4,nil)
| ~ ssItem(A)
| ~ ssList(B)
| ( app(app(C,cons(A,nil)),B) != sk1 )
| ( app(app(B,cons(A,nil)),C) != sk2 ) ) )),
inference(bind,[status(th)],[]) ).
tff(103,plain,
( ! [B: $i,A: $i,C: $i] :
( ~ ssList(C)
| ~ neq(sk4,nil)
| ~ ssItem(A)
| ~ ssList(B)
| ( app(app(C,cons(A,nil)),B) != sk1 )
| ( app(app(B,cons(A,nil)),C) != sk2 ) )
<=> ! [B: $i,A: $i,C: $i] :
( ~ ssList(C)
| ~ neq(sk4,nil)
| ~ ssItem(A)
| ~ ssList(B)
| ( app(app(C,cons(A,nil)),B) != sk1 )
| ( app(app(B,cons(A,nil)),C) != sk2 ) ) ),
inference(quant_intro,[status(thm)],[102]) ).
tff(104,plain,
( ! [B: $i,A: $i,C: $i] :
( ~ ssList(C)
| ~ neq(sk4,nil)
| ~ ssItem(A)
| ~ ssList(B)
| ( app(app(C,cons(A,nil)),B) != sk1 )
| ( app(app(B,cons(A,nil)),C) != sk2 ) )
<=> ! [B: $i,A: $i,C: $i] :
( ~ ssList(C)
| ~ neq(sk4,nil)
| ~ ssItem(A)
| ~ ssList(B)
| ( app(app(C,cons(A,nil)),B) != sk1 )
| ( app(app(B,cons(A,nil)),C) != sk2 ) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(105,plain,
^ [B: $i,A: $i,C: $i] :
trans(monotonicity(trans(monotonicity(trans(monotonicity(rewrite(( ( ~ ssItem(A)
| ~ ssList(B)
| ~ ssList(C) )
<=> ( ~ ssList(C)
| ~ ssItem(A)
| ~ ssList(B) ) )),
( ( ~ ssItem(A)
| ~ ssList(B)
| ~ ssList(C)
| ( app(app(B,cons(A,nil)),C) != sk2 ) )
<=> ( ~ ssList(C)
| ~ ssItem(A)
| ~ ssList(B)
| ( app(app(B,cons(A,nil)),C) != sk2 ) ) )),
rewrite(( ( ~ ssList(C)
| ~ ssItem(A)
| ~ ssList(B)
| ( app(app(B,cons(A,nil)),C) != sk2 ) )
<=> ( ~ ssList(C)
| ~ ssItem(A)
| ~ ssList(B)
| ( app(app(B,cons(A,nil)),C) != sk2 ) ) )),
( ( ~ ssItem(A)
| ~ ssList(B)
| ~ ssList(C)
| ( app(app(B,cons(A,nil)),C) != sk2 ) )
<=> ( ~ ssList(C)
| ~ ssItem(A)
| ~ ssList(B)
| ( app(app(B,cons(A,nil)),C) != sk2 ) ) )),
( ( ~ ssItem(A)
| ~ ssList(B)
| ~ ssList(C)
| ( app(app(B,cons(A,nil)),C) != sk2 )
| ( app(app(C,cons(A,nil)),B) != sk1 ) )
<=> ( ~ ssList(C)
| ~ ssItem(A)
| ~ ssList(B)
| ( app(app(B,cons(A,nil)),C) != sk2 )
| ( app(app(C,cons(A,nil)),B) != sk1 ) ) )),
rewrite(( ( ~ ssList(C)
| ~ ssItem(A)
| ~ ssList(B)
| ( app(app(B,cons(A,nil)),C) != sk2 )
| ( app(app(C,cons(A,nil)),B) != sk1 ) )
<=> ( ~ ssList(C)
| ~ ssItem(A)
| ~ ssList(B)
| ( app(app(C,cons(A,nil)),B) != sk1 )
| ( app(app(B,cons(A,nil)),C) != sk2 ) ) )),
( ( ~ ssItem(A)
| ~ ssList(B)
| ~ ssList(C)
| ( app(app(B,cons(A,nil)),C) != sk2 )
| ( app(app(C,cons(A,nil)),B) != sk1 ) )
<=> ( ~ ssList(C)
| ~ ssItem(A)
| ~ ssList(B)
| ( app(app(C,cons(A,nil)),B) != sk1 )
| ( app(app(B,cons(A,nil)),C) != sk2 ) ) )),
( ( ~ ssItem(A)
| ~ ssList(B)
| ~ ssList(C)
| ( app(app(B,cons(A,nil)),C) != sk2 )
| ( app(app(C,cons(A,nil)),B) != sk1 )
| ~ neq(sk4,nil) )
<=> ( ~ ssList(C)
| ~ ssItem(A)
| ~ ssList(B)
| ( app(app(C,cons(A,nil)),B) != sk1 )
| ( app(app(B,cons(A,nil)),C) != sk2 )
| ~ neq(sk4,nil) ) )),
rewrite(( ( ~ ssList(C)
| ~ ssItem(A)
| ~ ssList(B)
| ( app(app(C,cons(A,nil)),B) != sk1 )
| ( app(app(B,cons(A,nil)),C) != sk2 )
| ~ neq(sk4,nil) )
<=> ( ~ ssList(C)
| ~ neq(sk4,nil)
| ~ ssItem(A)
| ~ ssList(B)
| ( app(app(C,cons(A,nil)),B) != sk1 )
| ( app(app(B,cons(A,nil)),C) != sk2 ) ) )),
( ( ~ ssItem(A)
| ~ ssList(B)
| ~ ssList(C)
| ( app(app(B,cons(A,nil)),C) != sk2 )
| ( app(app(C,cons(A,nil)),B) != sk1 )
| ~ neq(sk4,nil) )
<=> ( ~ ssList(C)
| ~ neq(sk4,nil)
| ~ ssItem(A)
| ~ ssList(B)
| ( app(app(C,cons(A,nil)),B) != sk1 )
| ( app(app(B,cons(A,nil)),C) != sk2 ) ) )),
inference(bind,[status(th)],[]) ).
tff(106,plain,
( ! [B: $i,A: $i,C: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ~ ssList(C)
| ( app(app(B,cons(A,nil)),C) != sk2 )
| ( app(app(C,cons(A,nil)),B) != sk1 )
| ~ neq(sk4,nil) )
<=> ! [B: $i,A: $i,C: $i] :
( ~ ssList(C)
| ~ neq(sk4,nil)
| ~ ssItem(A)
| ~ ssList(B)
| ( app(app(C,cons(A,nil)),B) != sk1 )
| ( app(app(B,cons(A,nil)),C) != sk2 ) ) ),
inference(quant_intro,[status(thm)],[105]) ).
tff(107,axiom,
! [B: $i,A: $i,C: $i] :
( ~ ssItem(A)
| ~ ssList(B)
| ~ ssList(C)
| ( app(app(B,cons(A,nil)),C) != sk2 )
| ( app(app(C,cons(A,nil)),B) != sk1 )
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
tff(108,plain,
! [B: $i,A: $i,C: $i] :
( ~ ssList(C)
| ~ neq(sk4,nil)
| ~ ssItem(A)
| ~ ssList(B)
| ( app(app(C,cons(A,nil)),B) != sk1 )
| ( app(app(B,cons(A,nil)),C) != sk2 ) ),
inference(modus_ponens,[status(thm)],[107,106]) ).
tff(109,plain,
! [B: $i,A: $i,C: $i] :
( ~ ssList(C)
| ~ neq(sk4,nil)
| ~ ssItem(A)
| ~ ssList(B)
| ( app(app(C,cons(A,nil)),B) != sk1 )
| ( app(app(B,cons(A,nil)),C) != sk2 ) ),
inference(modus_ponens,[status(thm)],[108,104]) ).
tff(110,plain,
! [B: $i,A: $i,C: $i] :
( ~ ssList(C)
| ~ neq(sk4,nil)
| ~ ssItem(A)
| ~ ssList(B)
| ( app(app(C,cons(A,nil)),B) != sk1 )
| ( app(app(B,cons(A,nil)),C) != sk2 ) ),
inference(skolemize,[status(sab)],[109]) ).
tff(111,plain,
! [B: $i,A: $i,C: $i] :
( ~ ssList(C)
| ~ neq(sk4,nil)
| ~ ssItem(A)
| ~ ssList(B)
| ( app(app(C,cons(A,nil)),B) != sk1 )
| ( app(app(B,cons(A,nil)),C) != sk2 ) ),
inference(modus_ponens,[status(thm)],[110,103]) ).
tff(112,plain,
( ( ~ ! [B: $i,A: $i,C: $i] :
( ~ ssList(C)
| ~ neq(sk4,nil)
| ~ ssItem(A)
| ~ ssList(B)
| ( app(app(C,cons(A,nil)),B) != sk1 )
| ( app(app(B,cons(A,nil)),C) != sk2 ) )
| ~ neq(sk4,nil)
| ~ ssList(nil)
| ~ ssItem(sk5)
| ~ ssList(sk6)
| ( app(app(sk6,cons(sk5,nil)),nil) != sk1 )
| ( app(app(nil,cons(sk5,nil)),sk6) != sk2 ) )
<=> ( ~ ! [B: $i,A: $i,C: $i] :
( ~ ssList(C)
| ~ neq(sk4,nil)
| ~ ssItem(A)
| ~ ssList(B)
| ( app(app(C,cons(A,nil)),B) != sk1 )
| ( app(app(B,cons(A,nil)),C) != sk2 ) )
| ~ neq(sk4,nil)
| ~ ssList(nil)
| ~ ssItem(sk5)
| ~ ssList(sk6)
| ( app(app(sk6,cons(sk5,nil)),nil) != sk1 )
| ( app(app(nil,cons(sk5,nil)),sk6) != sk2 ) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(113,plain,
( ( ~ ssList(sk6)
| ~ neq(sk4,nil)
| ~ ssItem(sk5)
| ~ ssList(nil)
| ( app(app(sk6,cons(sk5,nil)),nil) != sk1 )
| ( app(app(nil,cons(sk5,nil)),sk6) != sk2 ) )
<=> ( ~ neq(sk4,nil)
| ~ ssList(nil)
| ~ ssItem(sk5)
| ~ ssList(sk6)
| ( app(app(sk6,cons(sk5,nil)),nil) != sk1 )
| ( app(app(nil,cons(sk5,nil)),sk6) != sk2 ) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(114,plain,
( ( ~ ! [B: $i,A: $i,C: $i] :
( ~ ssList(C)
| ~ neq(sk4,nil)
| ~ ssItem(A)
| ~ ssList(B)
| ( app(app(C,cons(A,nil)),B) != sk1 )
| ( app(app(B,cons(A,nil)),C) != sk2 ) )
| ~ ssList(sk6)
| ~ neq(sk4,nil)
| ~ ssItem(sk5)
| ~ ssList(nil)
| ( app(app(sk6,cons(sk5,nil)),nil) != sk1 )
| ( app(app(nil,cons(sk5,nil)),sk6) != sk2 ) )
<=> ( ~ ! [B: $i,A: $i,C: $i] :
( ~ ssList(C)
| ~ neq(sk4,nil)
| ~ ssItem(A)
| ~ ssList(B)
| ( app(app(C,cons(A,nil)),B) != sk1 )
| ( app(app(B,cons(A,nil)),C) != sk2 ) )
| ~ neq(sk4,nil)
| ~ ssList(nil)
| ~ ssItem(sk5)
| ~ ssList(sk6)
| ( app(app(sk6,cons(sk5,nil)),nil) != sk1 )
| ( app(app(nil,cons(sk5,nil)),sk6) != sk2 ) ) ),
inference(monotonicity,[status(thm)],[113]) ).
tff(115,plain,
( ( ~ ! [B: $i,A: $i,C: $i] :
( ~ ssList(C)
| ~ neq(sk4,nil)
| ~ ssItem(A)
| ~ ssList(B)
| ( app(app(C,cons(A,nil)),B) != sk1 )
| ( app(app(B,cons(A,nil)),C) != sk2 ) )
| ~ ssList(sk6)
| ~ neq(sk4,nil)
| ~ ssItem(sk5)
| ~ ssList(nil)
| ( app(app(sk6,cons(sk5,nil)),nil) != sk1 )
| ( app(app(nil,cons(sk5,nil)),sk6) != sk2 ) )
<=> ( ~ ! [B: $i,A: $i,C: $i] :
( ~ ssList(C)
| ~ neq(sk4,nil)
| ~ ssItem(A)
| ~ ssList(B)
| ( app(app(C,cons(A,nil)),B) != sk1 )
| ( app(app(B,cons(A,nil)),C) != sk2 ) )
| ~ neq(sk4,nil)
| ~ ssList(nil)
| ~ ssItem(sk5)
| ~ ssList(sk6)
| ( app(app(sk6,cons(sk5,nil)),nil) != sk1 )
| ( app(app(nil,cons(sk5,nil)),sk6) != sk2 ) ) ),
inference(transitivity,[status(thm)],[114,112]) ).
tff(116,plain,
( ~ ! [B: $i,A: $i,C: $i] :
( ~ ssList(C)
| ~ neq(sk4,nil)
| ~ ssItem(A)
| ~ ssList(B)
| ( app(app(C,cons(A,nil)),B) != sk1 )
| ( app(app(B,cons(A,nil)),C) != sk2 ) )
| ~ ssList(sk6)
| ~ neq(sk4,nil)
| ~ ssItem(sk5)
| ~ ssList(nil)
| ( app(app(sk6,cons(sk5,nil)),nil) != sk1 )
| ( app(app(nil,cons(sk5,nil)),sk6) != sk2 ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(117,plain,
( ~ ! [B: $i,A: $i,C: $i] :
( ~ ssList(C)
| ~ neq(sk4,nil)
| ~ ssItem(A)
| ~ ssList(B)
| ( app(app(C,cons(A,nil)),B) != sk1 )
| ( app(app(B,cons(A,nil)),C) != sk2 ) )
| ~ neq(sk4,nil)
| ~ ssList(nil)
| ~ ssItem(sk5)
| ~ ssList(sk6)
| ( app(app(sk6,cons(sk5,nil)),nil) != sk1 )
| ( app(app(nil,cons(sk5,nil)),sk6) != sk2 ) ),
inference(modus_ponens,[status(thm)],[116,115]) ).
tff(118,plain,
( ( app(app(sk6,cons(sk5,nil)),nil) != sk1 )
| ( app(app(nil,cons(sk5,nil)),sk6) != sk2 ) ),
inference(unit_resolution,[status(thm)],[117,75,28,62,83,111]) ).
tff(119,plain,
$false,
inference(unit_resolution,[status(thm)],[118,101,36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC417-1 : TPTP v9.0.0. Released v2.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n001.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri Jun 20 09:21:20 EDT 2025
% 0.13/0.34 % CPUTime :
% 0.20/0.47 % SZS status Unsatisfiable
% 0.20/0.47 % SZS output start Proof
% See solution above
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------