%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : SWC124-1 : TPTP v9.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_E %s %d THM
% Computer : n010.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:30:14 AM UTC 2025
% Result : Unsatisfiable 10.42s 10.65s
% Output : Proof 10.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 51
% Syntax : Number of formulae : 127 ( 45 unt; 0 typ; 0 def)
% Number of atoms : 689 ( 134 equ)
% Maximal formula atoms : 20 ( 5 avg)
% Number of connectives : 1006 ( 489 ~; 442 |; 0 &)
% ( 75 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of FOOLs : 45 ( 45 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 : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 187 ( 168 !; 0 ?; 187 :)
% Comments :
%------------------------------------------------------------------------------
tff(neq_type,type,
neq: ( $i * $i ) > $o ).
tff(nil_type,type,
nil: $i ).
tff(sk2_type,type,
sk2: $i ).
tff(sk3_type,type,
sk3: $i ).
tff(sk1_type,type,
sk1: $i ).
tff(segmentP_type,type,
segmentP: ( $i * $i ) > $o ).
tff(app_type,type,
app: ( $i * $i ) > $i ).
tff(sk5_type,type,
sk5: $i ).
tff(sk4_type,type,
sk4: $i ).
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,
( neq(sk3,nil)
<=> neq(sk1,nil) ),
inference(monotonicity,[status(thm)],[4]) ).
tff(6,plain,
( neq(sk1,nil)
<=> neq(sk3,nil) ),
inference(symmetry,[status(thm)],[5]) ).
tff(7,plain,
( ~ neq(sk1,nil)
<=> ~ neq(sk3,nil) ),
inference(monotonicity,[status(thm)],[6]) ).
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,
sk4 = sk2,
inference(symmetry,[status(thm)],[10]) ).
tff(12,plain,
( ( app(sk3,sk5) = sk4 )
<=> ( app(sk3,sk5) = sk4 ) ),
inference(rewrite,[status(thm)],[]) ).
tff(13,axiom,
app(sk3,sk5) = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
tff(14,plain,
app(sk3,sk5) = sk4,
inference(modus_ponens,[status(thm)],[13,12]) ).
tff(15,plain,
( ssList(sk3)
<=> ssList(sk3) ),
inference(rewrite,[status(thm)],[]) ).
tff(16,axiom,
ssList(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_3) ).
tff(17,plain,
ssList(sk3),
inference(modus_ponens,[status(thm)],[16,15]) ).
tff(18,plain,
^ [U: $i] :
refl(( ( ~ ssList(U)
| ( app(nil,U) = U ) )
<=> ( ~ ssList(U)
| ( app(nil,U) = U ) ) )),
inference(bind,[status(th)],[]) ).
tff(19,plain,
( ! [U: $i] :
( ~ ssList(U)
| ( app(nil,U) = U ) )
<=> ! [U: $i] :
( ~ ssList(U)
| ( app(nil,U) = U ) ) ),
inference(quant_intro,[status(thm)],[18]) ).
tff(20,plain,
( ! [U: $i] :
( ~ ssList(U)
| ( app(nil,U) = U ) )
<=> ! [U: $i] :
( ~ ssList(U)
| ( app(nil,U) = U ) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(21,axiom,
! [U: $i] :
( ~ ssList(U)
| ( app(nil,U) = U ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
tff(22,plain,
! [U: $i] :
( ~ ssList(U)
| ( app(nil,U) = U ) ),
inference(modus_ponens,[status(thm)],[21,20]) ).
tff(23,plain,
! [U: $i] :
( ~ ssList(U)
| ( app(nil,U) = U ) ),
inference(skolemize,[status(sab)],[22]) ).
tff(24,plain,
! [U: $i] :
( ~ ssList(U)
| ( app(nil,U) = U ) ),
inference(modus_ponens,[status(thm)],[23,19]) ).
tff(25,plain,
( ( ~ ! [U: $i] :
( ~ ssList(U)
| ( app(nil,U) = U ) )
| ~ ssList(sk3)
| ( app(nil,sk3) = sk3 ) )
<=> ( ~ ! [U: $i] :
( ~ ssList(U)
| ( app(nil,U) = U ) )
| ~ ssList(sk3)
| ( app(nil,sk3) = sk3 ) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(26,plain,
( ~ ! [U: $i] :
( ~ ssList(U)
| ( app(nil,U) = U ) )
| ~ ssList(sk3)
| ( app(nil,sk3) = sk3 ) ),
inference(quant_inst,[status(thm)],[]) ).
tff(27,plain,
( ~ ! [U: $i] :
( ~ ssList(U)
| ( app(nil,U) = U ) )
| ~ ssList(sk3)
| ( app(nil,sk3) = sk3 ) ),
inference(modus_ponens,[status(thm)],[26,25]) ).
tff(28,plain,
app(nil,sk3) = sk3,
inference(unit_resolution,[status(thm)],[27,24,17]) ).
tff(29,plain,
app(app(nil,sk3),sk5) = app(sk3,sk5),
inference(monotonicity,[status(thm)],[28]) ).
tff(30,plain,
app(app(nil,sk3),sk5) = sk2,
inference(transitivity,[status(thm)],[29,14,11]) ).
tff(31,plain,
( segmentP(app(app(nil,sk3),sk5),sk3)
<=> segmentP(sk2,sk1) ),
inference(monotonicity,[status(thm)],[30,4]) ).
tff(32,plain,
app(app(nil,sk3),sk5) = sk4,
inference(transitivity,[status(thm)],[29,14]) ).
tff(33,plain,
( ssList(app(app(nil,sk3),sk5))
<=> ssList(sk4) ),
inference(monotonicity,[status(thm)],[32]) ).
tff(34,plain,
( ssList(sk4)
<=> ssList(app(app(nil,sk3),sk5)) ),
inference(symmetry,[status(thm)],[33]) ).
tff(35,plain,
( ssList(sk4)
<=> ssList(sk4) ),
inference(rewrite,[status(thm)],[]) ).
tff(36,axiom,
ssList(sk4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_4) ).
tff(37,plain,
ssList(sk4),
inference(modus_ponens,[status(thm)],[36,35]) ).
tff(38,plain,
ssList(app(app(nil,sk3),sk5)),
inference(modus_ponens,[status(thm)],[37,34]) ).
tff(39,plain,
( ssList(sk5)
<=> ssList(sk5) ),
inference(rewrite,[status(thm)],[]) ).
tff(40,axiom,
ssList(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
tff(41,plain,
ssList(sk5),
inference(modus_ponens,[status(thm)],[40,39]) ).
tff(42,plain,
^ [W: $i,V: $i,U: $i] :
refl(( ( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ~ ssList(app(app(U,V),W))
| segmentP(app(app(U,V),W),V) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ~ ssList(app(app(U,V),W))
| segmentP(app(app(U,V),W),V) ) )),
inference(bind,[status(th)],[]) ).
tff(43,plain,
( ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ~ ssList(app(app(U,V),W))
| segmentP(app(app(U,V),W),V) )
<=> ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ~ ssList(app(app(U,V),W))
| segmentP(app(app(U,V),W),V) ) ),
inference(quant_intro,[status(thm)],[42]) ).
tff(44,plain,
( ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ~ ssList(app(app(U,V),W))
| segmentP(app(app(U,V),W),V) )
<=> ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ~ ssList(app(app(U,V),W))
| segmentP(app(app(U,V),W),V) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(45,plain,
^ [W: $i,V: $i,U: $i] :
rewrite(( ( ~ ssList(app(app(U,V),W))
| ~ ssList(U)
| ~ ssList(V)
| segmentP(app(app(U,V),W),V)
| ~ ssList(W) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ~ ssList(app(app(U,V),W))
| segmentP(app(app(U,V),W),V) ) )),
inference(bind,[status(th)],[]) ).
tff(46,plain,
( ! [W: $i,V: $i,U: $i] :
( ~ ssList(app(app(U,V),W))
| ~ ssList(U)
| ~ ssList(V)
| segmentP(app(app(U,V),W),V)
| ~ ssList(W) )
<=> ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ~ ssList(app(app(U,V),W))
| segmentP(app(app(U,V),W),V) ) ),
inference(quant_intro,[status(thm)],[45]) ).
tff(47,plain,
( ! [W: $i,V: $i,U: $i,X: $i] :
( ~ ssList(app(app(U,V),W))
| ~ ssList(U)
| ~ ssList(V)
| segmentP(app(app(U,V),W),V)
| ~ ssList(W) )
<=> ! [W: $i,V: $i,U: $i] :
( ~ ssList(app(app(U,V),W))
| ~ ssList(U)
| ~ ssList(V)
| segmentP(app(app(U,V),W),V)
| ~ ssList(W) ) ),
inference(elim_unused_vars,[status(thm)],[]) ).
tff(48,plain,
( ! [W: $i,V: $i,U: $i,X: $i] :
( ~ ssList(X)
| ~ ssList(U)
| ~ ssList(V)
| segmentP(X,V)
| ~ ssList(W)
| ( app(app(U,V),W) != X ) )
<=> ! [W: $i,V: $i,U: $i,X: $i] :
( ~ ssList(app(app(U,V),W))
| ~ ssList(U)
| ~ ssList(V)
| segmentP(app(app(U,V),W),V)
| ~ ssList(W) ) ),
inference(destructive_equality_resolution,[status(thm)],[]) ).
tff(49,plain,
( ! [W: $i,V: $i,U: $i,X: $i] :
( ~ ssList(X)
| ~ ssList(U)
| ~ ssList(V)
| segmentP(X,V)
| ~ ssList(W)
| ( app(app(U,V),W) != X ) )
<=> ! [W: $i,V: $i,U: $i] :
( ~ ssList(app(app(U,V),W))
| ~ ssList(U)
| ~ ssList(V)
| segmentP(app(app(U,V),W),V)
| ~ ssList(W) ) ),
inference(transitivity,[status(thm)],[48,47]) ).
tff(50,plain,
( ! [W: $i,V: $i,U: $i,X: $i] :
( ~ ssList(X)
| ~ ssList(U)
| ~ ssList(V)
| segmentP(X,V)
| ~ ssList(W)
| ( app(app(U,V),W) != X ) )
<=> ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ~ ssList(app(app(U,V),W))
| segmentP(app(app(U,V),W),V) ) ),
inference(transitivity,[status(thm)],[49,46]) ).
tff(51,plain,
^ [W: $i,V: $i,U: $i,X: $i] :
trans(monotonicity(trans(monotonicity(trans(monotonicity(trans(monotonicity(rewrite(( ( ( app(app(U,V),W) != X )
| ~ ssList(W) )
<=> ( ~ ssList(W)
| ( app(app(U,V),W) != X ) ) )),
( ( ( app(app(U,V),W) != X )
| ~ ssList(W)
| ~ ssList(U) )
<=> ( ~ ssList(W)
| ( app(app(U,V),W) != X )
| ~ ssList(U) ) )),
rewrite(( ( ~ ssList(W)
| ( app(app(U,V),W) != X )
| ~ ssList(U) )
<=> ( ~ ssList(U)
| ~ ssList(W)
| ( app(app(U,V),W) != X ) ) )),
( ( ( app(app(U,V),W) != X )
| ~ ssList(W)
| ~ ssList(U) )
<=> ( ~ ssList(U)
| ~ ssList(W)
| ( app(app(U,V),W) != X ) ) )),
( ( ( app(app(U,V),W) != X )
| ~ ssList(W)
| ~ ssList(U)
| ~ ssList(V) )
<=> ( ~ ssList(U)
| ~ ssList(W)
| ( app(app(U,V),W) != X )
| ~ ssList(V) ) )),
rewrite(( ( ~ ssList(U)
| ~ ssList(W)
| ( app(app(U,V),W) != X )
| ~ ssList(V) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(U,V),W) != X ) ) )),
( ( ( app(app(U,V),W) != X )
| ~ ssList(W)
| ~ ssList(U)
| ~ ssList(V) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(U,V),W) != X ) ) )),
( ( ( app(app(U,V),W) != X )
| ~ ssList(W)
| ~ ssList(U)
| ~ ssList(V)
| ~ ssList(X) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(U,V),W) != X )
| ~ ssList(X) ) )),
rewrite(( ( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(U,V),W) != X )
| ~ ssList(X) )
<=> ( ~ ssList(X)
| ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(U,V),W) != X ) ) )),
( ( ( app(app(U,V),W) != X )
| ~ ssList(W)
| ~ ssList(U)
| ~ ssList(V)
| ~ ssList(X) )
<=> ( ~ ssList(X)
| ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(U,V),W) != X ) ) )),
( ( ( app(app(U,V),W) != X )
| ~ ssList(W)
| ~ ssList(U)
| ~ ssList(V)
| ~ ssList(X)
| segmentP(X,V) )
<=> ( ~ ssList(X)
| ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(U,V),W) != X )
| segmentP(X,V) ) )),
rewrite(( ( ~ ssList(X)
| ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ( app(app(U,V),W) != X )
| segmentP(X,V) )
<=> ( ~ ssList(X)
| ~ ssList(U)
| ~ ssList(V)
| segmentP(X,V)
| ~ ssList(W)
| ( app(app(U,V),W) != X ) ) )),
( ( ( app(app(U,V),W) != X )
| ~ ssList(W)
| ~ ssList(U)
| ~ ssList(V)
| ~ ssList(X)
| segmentP(X,V) )
<=> ( ~ ssList(X)
| ~ ssList(U)
| ~ ssList(V)
| segmentP(X,V)
| ~ ssList(W)
| ( app(app(U,V),W) != X ) ) )),
inference(bind,[status(th)],[]) ).
tff(52,plain,
( ! [W: $i,V: $i,U: $i,X: $i] :
( ( app(app(U,V),W) != X )
| ~ ssList(W)
| ~ ssList(U)
| ~ ssList(V)
| ~ ssList(X)
| segmentP(X,V) )
<=> ! [W: $i,V: $i,U: $i,X: $i] :
( ~ ssList(X)
| ~ ssList(U)
| ~ ssList(V)
| segmentP(X,V)
| ~ ssList(W)
| ( app(app(U,V),W) != X ) ) ),
inference(quant_intro,[status(thm)],[51]) ).
tff(53,plain,
( ! [W: $i,V: $i,U: $i,X: $i] :
( ( app(app(U,V),W) != X )
| ~ ssList(W)
| ~ ssList(U)
| ~ ssList(V)
| ~ ssList(X)
| segmentP(X,V) )
<=> ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ~ ssList(app(app(U,V),W))
| segmentP(app(app(U,V),W),V) ) ),
inference(transitivity,[status(thm)],[52,50]) ).
tff(54,axiom,
! [W: $i,V: $i,U: $i,X: $i] :
( ( app(app(U,V),W) != X )
| ~ ssList(W)
| ~ ssList(U)
| ~ ssList(V)
| ~ ssList(X)
| segmentP(X,V) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause173) ).
tff(55,plain,
! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ~ ssList(app(app(U,V),W))
| segmentP(app(app(U,V),W),V) ),
inference(modus_ponens,[status(thm)],[54,53]) ).
tff(56,plain,
! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ~ ssList(app(app(U,V),W))
| segmentP(app(app(U,V),W),V) ),
inference(modus_ponens,[status(thm)],[55,44]) ).
tff(57,plain,
! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ~ ssList(app(app(U,V),W))
| segmentP(app(app(U,V),W),V) ),
inference(skolemize,[status(sab)],[56]) ).
tff(58,plain,
! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ~ ssList(app(app(U,V),W))
| segmentP(app(app(U,V),W),V) ),
inference(modus_ponens,[status(thm)],[57,43]) ).
tff(59,plain,
( ssList(nil)
<=> ssList(nil) ),
inference(rewrite,[status(thm)],[]) ).
tff(60,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
tff(61,plain,
ssList(nil),
inference(modus_ponens,[status(thm)],[60,59]) ).
tff(62,plain,
( ( ~ ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ~ ssList(app(app(U,V),W))
| segmentP(app(app(U,V),W),V) )
| ~ ssList(nil)
| ~ ssList(sk3)
| ~ ssList(sk5)
| ~ ssList(app(app(nil,sk3),sk5))
| segmentP(app(app(nil,sk3),sk5),sk3) )
<=> ( ~ ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ~ ssList(app(app(U,V),W))
| segmentP(app(app(U,V),W),V) )
| ~ ssList(nil)
| ~ ssList(sk3)
| ~ ssList(sk5)
| ~ ssList(app(app(nil,sk3),sk5))
| segmentP(app(app(nil,sk3),sk5),sk3) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(63,plain,
( ~ ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ~ ssList(app(app(U,V),W))
| segmentP(app(app(U,V),W),V) )
| ~ ssList(nil)
| ~ ssList(sk3)
| ~ ssList(sk5)
| ~ ssList(app(app(nil,sk3),sk5))
| segmentP(app(app(nil,sk3),sk5),sk3) ),
inference(quant_inst,[status(thm)],[]) ).
tff(64,plain,
( ~ ! [W: $i,V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ~ ssList(W)
| ~ ssList(app(app(U,V),W))
| segmentP(app(app(U,V),W),V) )
| ~ ssList(nil)
| ~ ssList(sk3)
| ~ ssList(sk5)
| ~ ssList(app(app(nil,sk3),sk5))
| segmentP(app(app(nil,sk3),sk5),sk3) ),
inference(modus_ponens,[status(thm)],[63,62]) ).
tff(65,plain,
( ~ ssList(app(app(nil,sk3),sk5))
| segmentP(app(app(nil,sk3),sk5),sk3) ),
inference(unit_resolution,[status(thm)],[64,61,58,17,41]) ).
tff(66,plain,
segmentP(app(app(nil,sk3),sk5),sk3),
inference(unit_resolution,[status(thm)],[65,38]) ).
tff(67,plain,
segmentP(sk2,sk1),
inference(modus_ponens,[status(thm)],[66,31]) ).
tff(68,plain,
( ( ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) )
<=> ( ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(69,axiom,
( ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
tff(70,plain,
( ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ),
inference(modus_ponens,[status(thm)],[69,68]) ).
tff(71,plain,
~ neq(sk1,nil),
inference(unit_resolution,[status(thm)],[70,67]) ).
tff(72,plain,
~ neq(sk3,nil),
inference(modus_ponens,[status(thm)],[71,7]) ).
tff(73,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(74,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)],[73]) ).
tff(75,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(76,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(77,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)],[76]) ).
tff(78,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(79,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) ),
inference(modus_ponens,[status(thm)],[78,77]) ).
tff(80,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) ),
inference(modus_ponens,[status(thm)],[79,75]) ).
tff(81,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) ),
inference(skolemize,[status(sab)],[80]) ).
tff(82,plain,
! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( V = U )
| neq(V,U) ),
inference(modus_ponens,[status(thm)],[81,74]) ).
tff(83,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(84,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(85,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)],[84,83]) ).
tff(86,plain,
( ( sk3 = nil )
| neq(sk3,nil) ),
inference(unit_resolution,[status(thm)],[85,61,82,17]) ).
tff(87,plain,
sk3 = nil,
inference(unit_resolution,[status(thm)],[86,72]) ).
tff(88,plain,
nil = sk3,
inference(symmetry,[status(thm)],[87]) ).
tff(89,plain,
( ( sk3 = nil )
<=> ( nil = sk3 ) ),
inference(commutativity,[status(thm)],[]) ).
tff(90,plain,
nil = sk3,
inference(modus_ponens,[status(thm)],[87,89]) ).
tff(91,plain,
( ( ( nil != sk3 )
| ( nil = sk4 ) )
<=> ( ( nil != sk3 )
| ( nil = sk4 ) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(92,plain,
( ( ( nil = sk4 )
| ( nil != sk3 ) )
<=> ( ( nil != sk3 )
| ( nil = sk4 ) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(93,axiom,
( ( nil = sk4 )
| ( nil != sk3 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
tff(94,plain,
( ( nil != sk3 )
| ( nil = sk4 ) ),
inference(modus_ponens,[status(thm)],[93,92]) ).
tff(95,plain,
( ( nil != sk3 )
| ( nil = sk4 ) ),
inference(modus_ponens,[status(thm)],[94,91]) ).
tff(96,plain,
nil = sk4,
inference(unit_resolution,[status(thm)],[95,90]) ).
tff(97,plain,
sk4 = nil,
inference(symmetry,[status(thm)],[96]) ).
tff(98,plain,
sk2 = sk3,
inference(transitivity,[status(thm)],[10,97,88]) ).
tff(99,plain,
( neq(sk2,nil)
<=> neq(sk3,sk3) ),
inference(monotonicity,[status(thm)],[98,88]) ).
tff(100,plain,
( neq(sk3,sk3)
<=> neq(sk2,nil) ),
inference(symmetry,[status(thm)],[99]) ).
tff(101,plain,
( ~ neq(sk3,sk3)
<=> ~ neq(sk2,nil) ),
inference(monotonicity,[status(thm)],[100]) ).
tff(102,plain,
^ [V: $i] :
refl(( ( ~ ssList(V)
| ~ neq(V,V) )
<=> ( ~ ssList(V)
| ~ neq(V,V) ) )),
inference(bind,[status(th)],[]) ).
tff(103,plain,
( ! [V: $i] :
( ~ ssList(V)
| ~ neq(V,V) )
<=> ! [V: $i] :
( ~ ssList(V)
| ~ neq(V,V) ) ),
inference(quant_intro,[status(thm)],[102]) ).
tff(104,plain,
( ! [V: $i] :
( ~ ssList(V)
| ~ neq(V,V) )
<=> ! [V: $i] :
( ~ ssList(V)
| ~ neq(V,V) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(105,plain,
^ [V: $i] :
rewrite(( ( ~ neq(V,V)
| ~ ssList(V)
| ~ ssList(V) )
<=> ( ~ ssList(V)
| ~ neq(V,V) ) )),
inference(bind,[status(th)],[]) ).
tff(106,plain,
( ! [V: $i] :
( ~ neq(V,V)
| ~ ssList(V)
| ~ ssList(V) )
<=> ! [V: $i] :
( ~ ssList(V)
| ~ neq(V,V) ) ),
inference(quant_intro,[status(thm)],[105]) ).
tff(107,plain,
( ! [V: $i,U: $i] :
( ~ neq(V,V)
| ~ ssList(V)
| ~ ssList(V) )
<=> ! [V: $i] :
( ~ neq(V,V)
| ~ ssList(V)
| ~ ssList(V) ) ),
inference(elim_unused_vars,[status(thm)],[]) ).
tff(108,plain,
( ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( U != V )
| ~ neq(U,V) )
<=> ! [V: $i,U: $i] :
( ~ neq(V,V)
| ~ ssList(V)
| ~ ssList(V) ) ),
inference(destructive_equality_resolution,[status(thm)],[]) ).
tff(109,plain,
( ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( U != V )
| ~ neq(U,V) )
<=> ! [V: $i] :
( ~ neq(V,V)
| ~ ssList(V)
| ~ ssList(V) ) ),
inference(transitivity,[status(thm)],[108,107]) ).
tff(110,plain,
( ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( U != V )
| ~ neq(U,V) )
<=> ! [V: $i] :
( ~ ssList(V)
| ~ neq(V,V) ) ),
inference(transitivity,[status(thm)],[109,106]) ).
tff(111,plain,
^ [V: $i,U: $i] :
trans(monotonicity(rewrite(( ( ( U != V )
| ~ neq(U,V)
| ~ ssList(V) )
<=> ( ~ ssList(V)
| ( U != V )
| ~ neq(U,V) ) )),
( ( ( U != V )
| ~ neq(U,V)
| ~ ssList(V)
| ~ ssList(U) )
<=> ( ~ ssList(V)
| ( U != V )
| ~ neq(U,V)
| ~ ssList(U) ) )),
rewrite(( ( ~ ssList(V)
| ( U != V )
| ~ neq(U,V)
| ~ ssList(U) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| ( U != V )
| ~ neq(U,V) ) )),
( ( ( U != V )
| ~ neq(U,V)
| ~ ssList(V)
| ~ ssList(U) )
<=> ( ~ ssList(U)
| ~ ssList(V)
| ( U != V )
| ~ neq(U,V) ) )),
inference(bind,[status(th)],[]) ).
tff(112,plain,
( ! [V: $i,U: $i] :
( ( U != V )
| ~ neq(U,V)
| ~ ssList(V)
| ~ ssList(U) )
<=> ! [V: $i,U: $i] :
( ~ ssList(U)
| ~ ssList(V)
| ( U != V )
| ~ neq(U,V) ) ),
inference(quant_intro,[status(thm)],[111]) ).
tff(113,plain,
( ! [V: $i,U: $i] :
( ( U != V )
| ~ neq(U,V)
| ~ ssList(V)
| ~ ssList(U) )
<=> ! [V: $i] :
( ~ ssList(V)
| ~ neq(V,V) ) ),
inference(transitivity,[status(thm)],[112,110]) ).
tff(114,axiom,
! [V: $i,U: $i] :
( ( U != V )
| ~ neq(U,V)
| ~ ssList(V)
| ~ ssList(U) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause115) ).
tff(115,plain,
! [V: $i] :
( ~ ssList(V)
| ~ neq(V,V) ),
inference(modus_ponens,[status(thm)],[114,113]) ).
tff(116,plain,
! [V: $i] :
( ~ ssList(V)
| ~ neq(V,V) ),
inference(modus_ponens,[status(thm)],[115,104]) ).
tff(117,plain,
! [V: $i] :
( ~ ssList(V)
| ~ neq(V,V) ),
inference(skolemize,[status(sab)],[116]) ).
tff(118,plain,
! [V: $i] :
( ~ ssList(V)
| ~ neq(V,V) ),
inference(modus_ponens,[status(thm)],[117,103]) ).
tff(119,plain,
( ( ~ ! [V: $i] :
( ~ ssList(V)
| ~ neq(V,V) )
| ~ ssList(sk3)
| ~ neq(sk3,sk3) )
<=> ( ~ ! [V: $i] :
( ~ ssList(V)
| ~ neq(V,V) )
| ~ ssList(sk3)
| ~ neq(sk3,sk3) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(120,plain,
( ~ ! [V: $i] :
( ~ ssList(V)
| ~ neq(V,V) )
| ~ ssList(sk3)
| ~ neq(sk3,sk3) ),
inference(quant_inst,[status(thm)],[]) ).
tff(121,plain,
( ~ ! [V: $i] :
( ~ ssList(V)
| ~ neq(V,V) )
| ~ ssList(sk3)
| ~ neq(sk3,sk3) ),
inference(modus_ponens,[status(thm)],[120,119]) ).
tff(122,plain,
~ neq(sk3,sk3),
inference(unit_resolution,[status(thm)],[121,118,17]) ).
tff(123,plain,
~ neq(sk2,nil),
inference(modus_ponens,[status(thm)],[122,101]) ).
tff(124,plain,
( neq(sk2,nil)
<=> neq(sk2,nil) ),
inference(rewrite,[status(thm)],[]) ).
tff(125,axiom,
neq(sk2,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
tff(126,plain,
neq(sk2,nil),
inference(modus_ponens,[status(thm)],[125,124]) ).
tff(127,plain,
$false,
inference(unit_resolution,[status(thm)],[126,123]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.15 % Problem : SWC124-1 : TPTP v9.0.0. Released v2.4.0.
% 0.10/0.15 % Command : run_E %s %d THM
% 0.12/0.37 % Computer : n010.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8042.1875MB
% 0.12/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Fri Jun 20 08:26:57 EDT 2025
% 0.12/0.37 % CPUTime :
% 10.42/10.65 % SZS status Unsatisfiable
% 10.42/10.65 % SZS output start Proof
% See solution above
% 10.42/10.70 % E exiting
%------------------------------------------------------------------------------