TSTP Solution File: SWC364-1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SWC364-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n009.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 : Tue Sep 20 11:57:25 EDT 2022
% Result : Unsatisfiable 0.19s 0.46s
% Output : Proof 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 55
% Syntax : Number of formulae : 108 ( 25 unt; 12 typ; 0 def)
% Number of atoms : 539 ( 93 equ)
% Maximal formula atoms : 24 ( 5 avg)
% Number of connectives : 804 ( 390 ~; 356 |; 0 &)
% ( 58 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of FOOLs : 29 ( 29 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 10 ( 6 >; 4 *; 0 +; 0 <<)
% Number of predicates : 11 ( 8 usr; 2 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 131 ( 118 !; 0 ?; 131 :)
% Comments :
%------------------------------------------------------------------------------
tff(sk4_type,type,
sk4: $i ).
tff(app_type,type,
app: ( $i * $i ) > $i ).
tff(nil_type,type,
nil: $i ).
tff(sk3_type,type,
sk3: $i ).
tff(cons_type,type,
cons: ( $i * $i ) > $i ).
tff(sk5_type,type,
sk5: $i ).
tff(ssList_type,type,
ssList: $i > $o ).
tff(sk2_type,type,
sk2: $i ).
tff(neq_type,type,
neq: ( $i * $i ) > $o ).
tff(ssItem_type,type,
ssItem: $i > $o ).
tff(segmentP_type,type,
segmentP: ( $i * $i ) > $o ).
tff(sk1_type,type,
sk1: $i ).
tff(1,plain,
( ssList(sk2)
<=> ssList(sk4) ),
inference(rewrite,[status(thm)],]) ).
tff(2,plain,
( ssList(sk2)
<=> ssList(sk2) ),
inference(rewrite,[status(thm)],]) ).
tff(3,axiom,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
tff(4,plain,
ssList(sk2),
inference(modus_ponens,[status(thm)],[3,2]) ).
tff(5,plain,
ssList(sk4),
inference(modus_ponens,[status(thm)],[4,1]) ).
tff(6,plain,
^ [U: $i] :
refl(
( ( ~ ssList(U)
| ( app(U,nil) = U ) )
<=> ( ~ ssList(U)
| ( app(U,nil) = U ) ) )),
inference(bind,[status(th)],]) ).
tff(7,plain,
( ! [U: $i] :
( ~ ssList(U)
| ( app(U,nil) = U ) )
<=> ! [U: $i] :
( ~ ssList(U)
| ( app(U,nil) = U ) ) ),
inference(quant_intro,[status(thm)],[6]) ).
tff(8,plain,
( ! [U: $i] :
( ~ ssList(U)
| ( app(U,nil) = U ) )
<=> ! [U: $i] :
( ~ ssList(U)
| ( app(U,nil) = U ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(9,axiom,
! [U: $i] :
( ~ ssList(U)
| ( app(U,nil) = U ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
tff(10,plain,
! [U: $i] :
( ~ ssList(U)
| ( app(U,nil) = U ) ),
inference(modus_ponens,[status(thm)],[9,8]) ).
tff(11,plain,
! [U: $i] :
( ~ ssList(U)
| ( app(U,nil) = U ) ),
inference(skolemize,[status(sab)],[10]) ).
tff(12,plain,
! [U: $i] :
( ~ ssList(U)
| ( app(U,nil) = U ) ),
inference(modus_ponens,[status(thm)],[11,7]) ).
tff(13,plain,
( ( ~ ! [U: $i] :
( ~ ssList(U)
| ( app(U,nil) = U ) )
| ~ ssList(sk4)
| ( app(sk4,nil) = sk4 ) )
<=> ( ~ ! [U: $i] :
( ~ ssList(U)
| ( app(U,nil) = U ) )
| ~ ssList(sk4)
| ( app(sk4,nil) = sk4 ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(14,plain,
( ~ ! [U: $i] :
( ~ ssList(U)
| ( app(U,nil) = U ) )
| ~ ssList(sk4)
| ( app(sk4,nil) = sk4 ) ),
inference(quant_inst,[status(thm)],]) ).
tff(15,plain,
( ~ ! [U: $i] :
( ~ ssList(U)
| ( app(U,nil) = U ) )
| ~ ssList(sk4)
| ( app(sk4,nil) = sk4 ) ),
inference(modus_ponens,[status(thm)],[14,13]) ).
tff(16,plain,
app(sk4,nil) = sk4,
inference(unit_resolution,[status(thm)],[15,12,5]) ).
tff(17,plain,
( ( $false
| ( app(cons(sk5,nil),sk3) = sk4 ) )
<=> ( app(cons(sk5,nil),sk3) = sk4 ) ),
inference(rewrite,[status(thm)],]) ).
tff(18,plain,
( ~ $true
<=> $false ),
inference(rewrite,[status(thm)],]) ).
tff(19,plain,
( neq(sk2,nil)
<=> neq(sk4,nil) ),
inference(rewrite,[status(thm)],]) ).
tff(20,plain,
( neq(sk2,nil)
<=> neq(sk2,nil) ),
inference(rewrite,[status(thm)],]) ).
tff(21,plain,
( ( neq(sk2,nil)
| neq(sk2,nil) )
<=> neq(sk2,nil) ),
inference(rewrite,[status(thm)],]) ).
tff(22,axiom,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
tff(23,plain,
neq(sk2,nil),
inference(modus_ponens,[status(thm)],[22,21]) ).
tff(24,plain,
neq(sk2,nil),
inference(modus_ponens,[status(thm)],[23,20]) ).
tff(25,plain,
neq(sk4,nil),
inference(modus_ponens,[status(thm)],[24,19]) ).
tff(26,plain,
( neq(sk4,nil)
<=> $true ),
inference(iff_true,[status(thm)],[25]) ).
tff(27,plain,
( ~ neq(sk4,nil)
<=> ~ $true ),
inference(monotonicity,[status(thm)],[26]) ).
tff(28,plain,
( ~ neq(sk4,nil)
<=> $false ),
inference(transitivity,[status(thm)],[27,18]) ).
tff(29,plain,
( ( ~ neq(sk4,nil)
| ( app(cons(sk5,nil),sk3) = sk4 ) )
<=> ( $false
| ( app(cons(sk5,nil),sk3) = sk4 ) ) ),
inference(monotonicity,[status(thm)],[28]) ).
tff(30,plain,
( ( ~ neq(sk4,nil)
| ( app(cons(sk5,nil),sk3) = sk4 ) )
<=> ( app(cons(sk5,nil),sk3) = sk4 ) ),
inference(transitivity,[status(thm)],[29,17]) ).
tff(31,plain,
( ( ~ neq(sk4,nil)
| ( app(cons(sk5,nil),sk3) = sk4 ) )
<=> ( ~ neq(sk4,nil)
| ( app(cons(sk5,nil),sk3) = sk4 ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(32,plain,
( ( ( app(cons(sk5,nil),sk3) = sk4 )
| ~ neq(sk4,nil) )
<=> ( ~ neq(sk4,nil)
| ( app(cons(sk5,nil),sk3) = sk4 ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(33,axiom,
( ( app(cons(sk5,nil),sk3) = sk4 )
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
tff(34,plain,
( ~ neq(sk4,nil)
| ( app(cons(sk5,nil),sk3) = sk4 ) ),
inference(modus_ponens,[status(thm)],[33,32]) ).
tff(35,plain,
( ~ neq(sk4,nil)
| ( app(cons(sk5,nil),sk3) = sk4 ) ),
inference(modus_ponens,[status(thm)],[34,31]) ).
tff(36,plain,
app(cons(sk5,nil),sk3) = sk4,
inference(modus_ponens,[status(thm)],[35,30]) ).
tff(37,plain,
app(app(cons(sk5,nil),sk3),nil) = app(sk4,nil),
inference(monotonicity,[status(thm)],[36]) ).
tff(38,plain,
app(app(cons(sk5,nil),sk3),nil) = sk4,
inference(transitivity,[status(thm)],[37,16]) ).
tff(39,plain,
( ( ssItem(sk5)
| $false )
<=> ssItem(sk5) ),
inference(rewrite,[status(thm)],]) ).
tff(40,plain,
( ( ssItem(sk5)
| ~ neq(sk4,nil) )
<=> ( ssItem(sk5)
| $false ) ),
inference(monotonicity,[status(thm)],[28]) ).
tff(41,plain,
( ( ssItem(sk5)
| ~ neq(sk4,nil) )
<=> ssItem(sk5) ),
inference(transitivity,[status(thm)],[40,39]) ).
tff(42,plain,
( ( ssItem(sk5)
| ~ neq(sk4,nil) )
<=> ( ssItem(sk5)
| ~ neq(sk4,nil) ) ),
inference(rewrite,[status(thm)],]) ).
tff(43,axiom,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
tff(44,plain,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
inference(modus_ponens,[status(thm)],[43,42]) ).
tff(45,plain,
ssItem(sk5),
inference(modus_ponens,[status(thm)],[44,41]) ).
tff(46,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(47,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)],[46]) ).
tff(48,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(49,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(50,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)],[49]) ).
tff(51,axiom,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
tff(52,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ),
inference(modus_ponens,[status(thm)],[51,50]) ).
tff(53,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ),
inference(modus_ponens,[status(thm)],[52,48]) ).
tff(54,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ),
inference(skolemize,[status(sab)],[53]) ).
tff(55,plain,
! [V: $i,U: $i] :
( ~ ssItem(U)
| ~ ssList(V)
| ssList(cons(U,V)) ),
inference(modus_ponens,[status(thm)],[54,47]) ).
tff(56,plain,
( ssList(nil)
<=> ssList(nil) ),
inference(rewrite,[status(thm)],]) ).
tff(57,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
tff(58,plain,
ssList(nil),
inference(modus_ponens,[status(thm)],[57,56]) ).
tff(59,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(60,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(61,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)],[60,59]) ).
tff(62,plain,
ssList(cons(sk5,nil)),
inference(unit_resolution,[status(thm)],[61,58,55,45]) ).
tff(63,plain,
( ( $false
| ~ segmentP(sk4,sk3) )
<=> ~ segmentP(sk4,sk3) ),
inference(rewrite,[status(thm)],]) ).
tff(64,plain,
( ( ~ neq(sk4,nil)
| ~ segmentP(sk4,sk3) )
<=> ( $false
| ~ segmentP(sk4,sk3) ) ),
inference(monotonicity,[status(thm)],[28]) ).
tff(65,plain,
( ( ~ neq(sk4,nil)
| ~ segmentP(sk4,sk3) )
<=> ~ segmentP(sk4,sk3) ),
inference(transitivity,[status(thm)],[64,63]) ).
tff(66,plain,
( ( ~ neq(sk4,nil)
| ~ segmentP(sk2,sk1) )
<=> ( ~ neq(sk4,nil)
| ~ segmentP(sk4,sk3) ) ),
inference(rewrite,[status(thm)],]) ).
tff(67,plain,
( ( ~ neq(sk4,nil)
| ~ segmentP(sk2,sk1) )
<=> ( ~ neq(sk4,nil)
| ~ segmentP(sk2,sk1) ) ),
inference(rewrite,[status(thm)],]) ).
tff(68,plain,
( ( ~ segmentP(sk2,sk1)
| ~ neq(sk4,nil) )
<=> ( ~ neq(sk4,nil)
| ~ segmentP(sk2,sk1) ) ),
inference(rewrite,[status(thm)],]) ).
tff(69,axiom,
( ~ segmentP(sk2,sk1)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
tff(70,plain,
( ~ neq(sk4,nil)
| ~ segmentP(sk2,sk1) ),
inference(modus_ponens,[status(thm)],[69,68]) ).
tff(71,plain,
( ~ neq(sk4,nil)
| ~ segmentP(sk2,sk1) ),
inference(modus_ponens,[status(thm)],[70,67]) ).
tff(72,plain,
( ~ neq(sk4,nil)
| ~ segmentP(sk4,sk3) ),
inference(modus_ponens,[status(thm)],[71,66]) ).
tff(73,plain,
~ segmentP(sk4,sk3),
inference(modus_ponens,[status(thm)],[72,65]) ).
tff(74,plain,
( ssList(sk1)
<=> ssList(sk3) ),
inference(rewrite,[status(thm)],]) ).
tff(75,plain,
( ssList(sk1)
<=> ssList(sk1) ),
inference(rewrite,[status(thm)],]) ).
tff(76,axiom,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
tff(77,plain,
ssList(sk1),
inference(modus_ponens,[status(thm)],[76,75]) ).
tff(78,plain,
ssList(sk3),
inference(modus_ponens,[status(thm)],[77,74]) ).
tff(79,plain,
^ [W: $i,V: $i,U: $i,X: $i] :
refl(
( ( ~ ssList(X)
| ~ ssList(U)
| ~ ssList(V)
| segmentP(X,V)
| ~ ssList(W)
| ( app(app(U,V),W) != X ) )
<=> ( ~ ssList(X)
| ~ ssList(U)
| ~ ssList(V)
| segmentP(X,V)
| ~ ssList(W)
| ( app(app(U,V),W) != X ) ) )),
inference(bind,[status(th)],]) ).
tff(80,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(X)
| ~ ssList(U)
| ~ ssList(V)
| segmentP(X,V)
| ~ ssList(W)
| ( app(app(U,V),W) != X ) ) ),
inference(quant_intro,[status(thm)],[79]) ).
tff(81,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(X)
| ~ ssList(U)
| ~ ssList(V)
| segmentP(X,V)
| ~ ssList(W)
| ( app(app(U,V),W) != X ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(82,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(83,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)],[82]) ).
tff(84,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/sandbox2/benchmark/Axioms/SWC001-0.ax',clause173) ).
tff(85,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 ) ),
inference(modus_ponens,[status(thm)],[84,83]) ).
tff(86,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 ) ),
inference(modus_ponens,[status(thm)],[85,81]) ).
tff(87,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 ) ),
inference(skolemize,[status(sab)],[86]) ).
tff(88,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 ) ),
inference(modus_ponens,[status(thm)],[87,80]) ).
tff(89,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 ) )
| segmentP(sk4,sk3)
| ~ ssList(nil)
| ~ ssList(sk3)
| ~ ssList(sk4)
| ~ ssList(cons(sk5,nil))
| ( app(app(cons(sk5,nil),sk3),nil) != sk4 ) )
<=> ( ~ ! [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 ) )
| segmentP(sk4,sk3)
| ~ ssList(nil)
| ~ ssList(sk3)
| ~ ssList(sk4)
| ~ ssList(cons(sk5,nil))
| ( app(app(cons(sk5,nil),sk3),nil) != sk4 ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(90,plain,
( ( ~ ssList(sk4)
| ~ ssList(cons(sk5,nil))
| ~ ssList(sk3)
| segmentP(sk4,sk3)
| ~ ssList(nil)
| ( app(app(cons(sk5,nil),sk3),nil) != sk4 ) )
<=> ( segmentP(sk4,sk3)
| ~ ssList(nil)
| ~ ssList(sk3)
| ~ ssList(sk4)
| ~ ssList(cons(sk5,nil))
| ( app(app(cons(sk5,nil),sk3),nil) != sk4 ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(91,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 ) )
| ~ ssList(sk4)
| ~ ssList(cons(sk5,nil))
| ~ ssList(sk3)
| segmentP(sk4,sk3)
| ~ ssList(nil)
| ( app(app(cons(sk5,nil),sk3),nil) != sk4 ) )
<=> ( ~ ! [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 ) )
| segmentP(sk4,sk3)
| ~ ssList(nil)
| ~ ssList(sk3)
| ~ ssList(sk4)
| ~ ssList(cons(sk5,nil))
| ( app(app(cons(sk5,nil),sk3),nil) != sk4 ) ) ),
inference(monotonicity,[status(thm)],[90]) ).
tff(92,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 ) )
| ~ ssList(sk4)
| ~ ssList(cons(sk5,nil))
| ~ ssList(sk3)
| segmentP(sk4,sk3)
| ~ ssList(nil)
| ( app(app(cons(sk5,nil),sk3),nil) != sk4 ) )
<=> ( ~ ! [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 ) )
| segmentP(sk4,sk3)
| ~ ssList(nil)
| ~ ssList(sk3)
| ~ ssList(sk4)
| ~ ssList(cons(sk5,nil))
| ( app(app(cons(sk5,nil),sk3),nil) != sk4 ) ) ),
inference(transitivity,[status(thm)],[91,89]) ).
tff(93,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 ) )
| ~ ssList(sk4)
| ~ ssList(cons(sk5,nil))
| ~ ssList(sk3)
| segmentP(sk4,sk3)
| ~ ssList(nil)
| ( app(app(cons(sk5,nil),sk3),nil) != sk4 ) ),
inference(quant_inst,[status(thm)],]) ).
tff(94,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 ) )
| segmentP(sk4,sk3)
| ~ ssList(nil)
| ~ ssList(sk3)
| ~ ssList(sk4)
| ~ ssList(cons(sk5,nil))
| ( app(app(cons(sk5,nil),sk3),nil) != sk4 ) ),
inference(modus_ponens,[status(thm)],[93,92]) ).
tff(95,plain,
app(app(cons(sk5,nil),sk3),nil) != sk4,
inference(unit_resolution,[status(thm)],[94,58,88,78,5,73,62]) ).
tff(96,plain,
$false,
inference(unit_resolution,[status(thm)],[95,38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC364-1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.34 % Computer : n009.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 : Sun Sep 4 00:20:20 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.34 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.13/0.34 Usage: tptp [options] [-file:]file
% 0.13/0.34 -h, -? prints this message.
% 0.13/0.34 -smt2 print SMT-LIB2 benchmark.
% 0.13/0.34 -m, -model generate model.
% 0.13/0.34 -p, -proof generate proof.
% 0.13/0.34 -c, -core generate unsat core of named formulas.
% 0.13/0.34 -st, -statistics display statistics.
% 0.13/0.34 -t:timeout set timeout (in second).
% 0.13/0.34 -smt2status display status in smt2 format instead of SZS.
% 0.13/0.34 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.13/0.34 -<param>:<value> configuration parameter and value.
% 0.13/0.34 -o:<output-file> file to place output in.
% 0.19/0.46 % SZS status Unsatisfiable
% 0.19/0.46 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------