TSTP Solution File: SWW101+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWW101+1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n029.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 : 0s
% DateTime : Wed Jul 20 23:20:54 EDT 2022
% Result : Theorem 0.87s 1.24s
% Output : Refutation 0.87s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWW101+1 : TPTP v8.1.0. Released v5.2.0.
% 0.10/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n029.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 % DateTime : Sun Jun 5 03:12:33 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.73/1.09 *** allocated 10000 integers for termspace/termends
% 0.73/1.09 *** allocated 10000 integers for clauses
% 0.73/1.09 *** allocated 10000 integers for justifications
% 0.73/1.09 Bliksem 1.12
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 Automatic Strategy Selection
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 Clauses:
% 0.73/1.09
% 0.73/1.09 { ! bool( X ), X = false, X = true }.
% 0.73/1.09 { ! X = false, bool( X ) }.
% 0.73/1.09 { ! X = true, bool( X ) }.
% 0.73/1.09 { ! true = false }.
% 0.73/1.09 { ! true = err }.
% 0.73/1.09 { ! false = err }.
% 0.73/1.09 { d( true ) }.
% 0.73/1.09 { d( false ) }.
% 0.73/1.09 { d( err ) }.
% 0.73/1.09 { ! forallprefers( X, Y ), alpha1( X, Y ), alpha3( X, Y ) }.
% 0.73/1.09 { ! alpha1( X, Y ), forallprefers( X, Y ) }.
% 0.73/1.09 { ! alpha3( X, Y ), forallprefers( X, Y ) }.
% 0.73/1.09 { ! alpha3( X, Y ), alpha5( X, Y ), alpha7( X, Y ) }.
% 0.73/1.09 { ! alpha5( X, Y ), alpha3( X, Y ) }.
% 0.73/1.09 { ! alpha7( X, Y ), alpha3( X, Y ) }.
% 0.73/1.09 { ! alpha7( X, Y ), X = false }.
% 0.73/1.09 { ! alpha7( X, Y ), Y = true }.
% 0.73/1.09 { ! X = false, ! Y = true, alpha7( X, Y ) }.
% 0.73/1.09 { ! alpha5( X, Y ), d( X ) }.
% 0.73/1.09 { ! alpha5( X, Y ), alpha8( X, Y ) }.
% 0.73/1.09 { ! d( X ), ! alpha8( X, Y ), alpha5( X, Y ) }.
% 0.73/1.09 { ! alpha8( X, Y ), d( Y ) }.
% 0.73/1.09 { ! alpha8( X, Y ), alpha11( X, Y ) }.
% 0.73/1.09 { ! d( Y ), ! alpha11( X, Y ), alpha8( X, Y ) }.
% 0.73/1.09 { ! alpha11( X, Y ), ! bool( X ) }.
% 0.73/1.09 { ! alpha11( X, Y ), bool( Y ) }.
% 0.73/1.09 { bool( X ), ! bool( Y ), alpha11( X, Y ) }.
% 0.73/1.09 { ! alpha1( X, Y ), ! d( X ) }.
% 0.73/1.09 { ! alpha1( X, Y ), d( Y ) }.
% 0.73/1.09 { d( X ), ! d( Y ), alpha1( X, Y ) }.
% 0.73/1.09 { ! existsprefers( X, Y ), alpha2( X, Y ), alpha4( X, Y ) }.
% 0.73/1.09 { ! alpha2( X, Y ), existsprefers( X, Y ) }.
% 0.73/1.09 { ! alpha4( X, Y ), existsprefers( X, Y ) }.
% 0.73/1.09 { ! alpha4( X, Y ), alpha6( X, Y ), alpha9( X, Y ) }.
% 0.73/1.09 { ! alpha6( X, Y ), alpha4( X, Y ) }.
% 0.73/1.09 { ! alpha9( X, Y ), alpha4( X, Y ) }.
% 0.73/1.09 { ! alpha9( X, Y ), X = true }.
% 0.73/1.09 { ! alpha9( X, Y ), Y = false }.
% 0.73/1.09 { ! X = true, ! Y = false, alpha9( X, Y ) }.
% 0.73/1.09 { ! alpha6( X, Y ), d( X ) }.
% 0.73/1.09 { ! alpha6( X, Y ), alpha10( X, Y ) }.
% 0.73/1.09 { ! d( X ), ! alpha10( X, Y ), alpha6( X, Y ) }.
% 0.73/1.09 { ! alpha10( X, Y ), d( Y ) }.
% 0.73/1.09 { ! alpha10( X, Y ), alpha12( X, Y ) }.
% 0.73/1.09 { ! d( Y ), ! alpha12( X, Y ), alpha10( X, Y ) }.
% 0.73/1.09 { ! alpha12( X, Y ), ! bool( X ) }.
% 0.73/1.09 { ! alpha12( X, Y ), bool( Y ) }.
% 0.73/1.09 { bool( X ), ! bool( Y ), alpha12( X, Y ) }.
% 0.73/1.09 { ! alpha2( X, Y ), ! d( X ) }.
% 0.73/1.09 { ! alpha2( X, Y ), d( Y ) }.
% 0.73/1.09 { d( X ), ! d( Y ), alpha2( X, Y ) }.
% 0.73/1.09 { alpha13( X ), ! d( X ) }.
% 0.73/1.09 { alpha13( X ), phi( X ) = err }.
% 0.73/1.09 { ! alpha13( X ), d( X ) }.
% 0.73/1.09 { ! alpha13( X ), phi( X ) = X }.
% 0.73/1.09 { ! d( X ), ! phi( X ) = X, alpha13( X ) }.
% 0.73/1.09 { ! prop( X ) = true, bool( X ) }.
% 0.73/1.09 { ! bool( X ), prop( X ) = true }.
% 0.73/1.09 { ! prop( X ) = false, ! bool( X ) }.
% 0.73/1.09 { bool( X ), prop( X ) = false }.
% 0.73/1.09 { bool( X ), impl( X, Y ) = phi( X ) }.
% 0.73/1.09 { ! bool( X ), bool( Y ), impl( X, Y ) = phi( Y ) }.
% 0.73/1.09 { ! bool( X ), impl( false, X ) = true }.
% 0.73/1.09 { ! bool( X ), impl( true, X ) = X }.
% 0.73/1.09 { bool( X ), lazy_impl( X, Y ) = phi( X ) }.
% 0.73/1.09 { lazy_impl( false, X ) = true }.
% 0.73/1.09 { lazy_impl( true, X ) = phi( X ) }.
% 0.73/1.09 { bool( X ), and1( X, Y ) = phi( X ) }.
% 0.73/1.09 { ! bool( X ), bool( Y ), and1( X, Y ) = phi( Y ) }.
% 0.73/1.09 { ! bool( X ), and1( false, X ) = false }.
% 0.73/1.09 { ! bool( X ), and1( true, X ) = X }.
% 0.73/1.09 { f1( X, Y, Z ) = lazy_impl( prop( Z ), impl( impl( X, impl( Y, Z ) ), Z )
% 0.73/1.09 ) }.
% 0.73/1.09 { and2( X, Y ) = phi( f1( X, Y, skol1( X, Y ) ) ) }.
% 0.73/1.09 { ! forallprefers( f1( X, Y, Z ), f1( X, Y, skol1( X, Y ) ) ) }.
% 0.73/1.09 { bool( X ), lazy_and1( X, Y ) = phi( X ) }.
% 0.73/1.09 { lazy_and1( false, X ) = false }.
% 0.73/1.09 { lazy_and1( true, X ) = phi( X ) }.
% 0.73/1.09 { f2( X, Y, Z ) = lazy_impl( prop( Z ), impl( lazy_impl( X, impl( Y, Z ) )
% 0.73/1.09 , Z ) ) }.
% 0.73/1.09 { lazy_and2( X, Y ) = phi( f2( X, Y, skol2( X, Y ) ) ) }.
% 0.73/1.09 { ! forallprefers( f2( X, Y, Z ), f2( X, Y, skol2( X, Y ) ) ) }.
% 0.73/1.09 { bool( X ), or1( X, Y ) = phi( X ) }.
% 0.73/1.09 { ! bool( X ), bool( Y ), or1( X, Y ) = phi( Y ) }.
% 0.73/1.09 { ! bool( X ), or1( true, X ) = true }.
% 0.73/1.09 { ! bool( X ), or1( false, X ) = X }.
% 0.73/1.09 { f3( X, Y, Z ) = lazy_impl( prop( Z ), impl( impl( X, Z ), impl( impl( Y,
% 0.73/1.09 Z ), Z ) ) ) }.
% 0.73/1.09 { or2( X, Y ) = phi( f3( X, Y, skol3( X, Y ) ) ) }.
% 0.73/1.09 { ! forallprefers( f3( X, Y, Z ), f3( X, Y, skol3( X, Y ) ) ) }.
% 0.73/1.09 { exists1( X ) = phi( apply( X, skol4( X ) ) ) }.
% 0.73/1.09 { ! existsprefers( apply( X, Y ), apply( X, skol4( X ) ) ) }.
% 0.73/1.09 { f4( X, Y, Z ) = impl( apply( X, Y ), Z ) }.
% 0.73/1.09 { f5( X, Y ) = phi( f4( X, skol5( X, Y ), Y ) ) }.
% 0.73/1.09 { ! forallprefers( f4( X, Z, Y ), f4( X, skol5( X, Y ), Y ) ) }.
% 0.73/1.09 { f6( X, Y ) = lazy_impl( prop( Y ), impl( f5( X, Y ), Y ) ) }.
% 0.87/1.24 { exists2( X ) = phi( f6( X, skol6( X ) ) ) }.
% 0.87/1.24 { ! forallprefers( f6( X, Y ), f6( X, skol6( X ) ) ) }.
% 0.87/1.24 { false1 = false }.
% 0.87/1.24 { f7( X ) = lazy_impl( prop( X ), X ) }.
% 0.87/1.24 { false2 = phi( f7( skol7 ) ) }.
% 0.87/1.24 { ! forallprefers( f7( X ), f7( skol7 ) ) }.
% 0.87/1.24 { bool( X ), not1( X ) = phi( X ) }.
% 0.87/1.24 { not1( false ) = true }.
% 0.87/1.24 { not1( true ) = false }.
% 0.87/1.24 { not2( X ) = impl( X, false2 ) }.
% 0.87/1.24 { ! false1 = false2 }.
% 0.87/1.24
% 0.87/1.24 percentage equality = 0.306878, percentage horn = 0.805825
% 0.87/1.24 This is a problem with some equality
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 Options Used:
% 0.87/1.24
% 0.87/1.24 useres = 1
% 0.87/1.24 useparamod = 1
% 0.87/1.24 useeqrefl = 1
% 0.87/1.24 useeqfact = 1
% 0.87/1.24 usefactor = 1
% 0.87/1.24 usesimpsplitting = 0
% 0.87/1.24 usesimpdemod = 5
% 0.87/1.24 usesimpres = 3
% 0.87/1.24
% 0.87/1.24 resimpinuse = 1000
% 0.87/1.24 resimpclauses = 20000
% 0.87/1.24 substype = eqrewr
% 0.87/1.24 backwardsubs = 1
% 0.87/1.24 selectoldest = 5
% 0.87/1.24
% 0.87/1.24 litorderings [0] = split
% 0.87/1.24 litorderings [1] = extend the termordering, first sorting on arguments
% 0.87/1.24
% 0.87/1.24 termordering = kbo
% 0.87/1.24
% 0.87/1.24 litapriori = 0
% 0.87/1.24 termapriori = 1
% 0.87/1.24 litaposteriori = 0
% 0.87/1.24 termaposteriori = 0
% 0.87/1.24 demodaposteriori = 0
% 0.87/1.24 ordereqreflfact = 0
% 0.87/1.24
% 0.87/1.24 litselect = negord
% 0.87/1.24
% 0.87/1.24 maxweight = 15
% 0.87/1.24 maxdepth = 30000
% 0.87/1.24 maxlength = 115
% 0.87/1.24 maxnrvars = 195
% 0.87/1.24 excuselevel = 1
% 0.87/1.24 increasemaxweight = 1
% 0.87/1.24
% 0.87/1.24 maxselected = 10000000
% 0.87/1.24 maxnrclauses = 10000000
% 0.87/1.24
% 0.87/1.24 showgenerated = 0
% 0.87/1.24 showkept = 0
% 0.87/1.24 showselected = 0
% 0.87/1.24 showdeleted = 0
% 0.87/1.24 showresimp = 1
% 0.87/1.24 showstatus = 2000
% 0.87/1.24
% 0.87/1.24 prologoutput = 0
% 0.87/1.24 nrgoals = 5000000
% 0.87/1.24 totalproof = 1
% 0.87/1.24
% 0.87/1.24 Symbols occurring in the translation:
% 0.87/1.24
% 0.87/1.24 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.87/1.24 . [1, 2] (w:1, o:39, a:1, s:1, b:0),
% 0.87/1.24 ! [4, 1] (w:0, o:22, a:1, s:1, b:0),
% 0.87/1.24 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.87/1.24 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.87/1.24 bool [36, 1] (w:1, o:28, a:1, s:1, b:0),
% 0.87/1.24 false [37, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.87/1.24 true [38, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.87/1.24 err [39, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.87/1.24 d [40, 1] (w:1, o:29, a:1, s:1, b:0),
% 0.87/1.24 forallprefers [42, 2] (w:1, o:64, a:1, s:1, b:0),
% 0.87/1.24 existsprefers [43, 2] (w:1, o:63, a:1, s:1, b:0),
% 0.87/1.24 phi [44, 1] (w:1, o:30, a:1, s:1, b:0),
% 0.87/1.24 prop [45, 1] (w:1, o:31, a:1, s:1, b:0),
% 0.87/1.24 impl [48, 2] (w:1, o:65, a:1, s:1, b:0),
% 0.87/1.24 lazy_impl [49, 2] (w:1, o:66, a:1, s:1, b:0),
% 0.87/1.24 and1 [50, 2] (w:1, o:67, a:1, s:1, b:0),
% 0.87/1.24 f1 [54, 3] (w:1, o:92, a:1, s:1, b:0),
% 0.87/1.24 and2 [55, 2] (w:1, o:68, a:1, s:1, b:0),
% 0.87/1.24 lazy_and1 [57, 2] (w:1, o:69, a:1, s:1, b:0),
% 0.87/1.24 f2 [58, 3] (w:1, o:93, a:1, s:1, b:0),
% 0.87/1.24 lazy_and2 [59, 2] (w:1, o:70, a:1, s:1, b:0),
% 0.87/1.24 or1 [60, 2] (w:1, o:71, a:1, s:1, b:0),
% 0.87/1.24 f3 [61, 3] (w:1, o:94, a:1, s:1, b:0),
% 0.87/1.24 or2 [62, 2] (w:1, o:72, a:1, s:1, b:0),
% 0.87/1.24 exists1 [63, 1] (w:1, o:32, a:1, s:1, b:0),
% 0.87/1.24 apply [64, 2] (w:1, o:73, a:1, s:1, b:0),
% 0.87/1.24 f4 [66, 3] (w:1, o:95, a:1, s:1, b:0),
% 0.87/1.24 f5 [67, 2] (w:1, o:74, a:1, s:1, b:0),
% 0.87/1.24 f6 [68, 2] (w:1, o:75, a:1, s:1, b:0),
% 0.87/1.24 exists2 [69, 1] (w:1, o:33, a:1, s:1, b:0),
% 0.87/1.24 false1 [70, 0] (w:1, o:20, a:1, s:1, b:0),
% 0.87/1.24 f7 [71, 1] (w:1, o:34, a:1, s:1, b:0),
% 0.87/1.24 false2 [72, 0] (w:1, o:21, a:1, s:1, b:0),
% 0.87/1.24 not1 [74, 1] (w:1, o:35, a:1, s:1, b:0),
% 0.87/1.24 not2 [75, 1] (w:1, o:36, a:1, s:1, b:0),
% 0.87/1.24 alpha1 [76, 2] (w:1, o:76, a:1, s:1, b:1),
% 0.87/1.24 alpha2 [77, 2] (w:1, o:80, a:1, s:1, b:1),
% 0.87/1.24 alpha3 [78, 2] (w:1, o:81, a:1, s:1, b:1),
% 0.87/1.24 alpha4 [79, 2] (w:1, o:82, a:1, s:1, b:1),
% 0.87/1.24 alpha5 [80, 2] (w:1, o:83, a:1, s:1, b:1),
% 0.87/1.24 alpha6 [81, 2] (w:1, o:84, a:1, s:1, b:1),
% 0.87/1.24 alpha7 [82, 2] (w:1, o:85, a:1, s:1, b:1),
% 0.87/1.24 alpha8 [83, 2] (w:1, o:86, a:1, s:1, b:1),
% 0.87/1.24 alpha9 [84, 2] (w:1, o:87, a:1, s:1, b:1),
% 0.87/1.24 alpha10 [85, 2] (w:1, o:77, a:1, s:1, b:1),
% 0.87/1.24 alpha11 [86, 2] (w:1, o:78, a:1, s:1, b:1),
% 0.87/1.24 alpha12 [87, 2] (w:1, o:79, a:1, s:1, b:1),
% 0.87/1.24 alpha13 [88, 1] (w:1, o:27, a:1, s:1, b:1),
% 0.87/1.24 skol1 [89, 2] (w:1, o:88, a:1, s:1, b:1),
% 0.87/1.24 skol2 [90, 2] (w:1, o:89, a:1, s:1, b:1),
% 0.87/1.24 skol3 [91, 2] (w:1, o:90, a:1, s:1, b:1),
% 0.87/1.24 skol4 [92, 1] (w:1, o:37, a:1, s:1, b:1),
% 0.87/1.24 skol5 [93, 2] (w:1, o:91, a:1, s:1, b:1),
% 0.87/1.24 skol6 [94, 1] (w:1, o:38, a:1, s:1, b:1),
% 0.87/1.24 skol7 [95, 0] (w:1, o:9, a:1, s:1, b:1).
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 Starting Search:
% 0.87/1.24
% 0.87/1.24 *** allocated 15000 integers for clauses
% 0.87/1.24 *** allocated 22500 integers for clauses
% 0.87/1.24 *** allocated 33750 integers for clauses
% 0.87/1.24 *** allocated 50625 integers for clauses
% 0.87/1.24 *** allocated 15000 integers for termspace/termends
% 0.87/1.24 Resimplifying inuse:
% 0.87/1.24 Done
% 0.87/1.24
% 0.87/1.24 *** allocated 75937 integers for clauses
% 0.87/1.24 *** allocated 22500 integers for termspace/termends
% 0.87/1.24 *** allocated 113905 integers for clauses
% 0.87/1.24
% 0.87/1.24 Intermediate Status:
% 0.87/1.24 Generated: 4900
% 0.87/1.24 Kept: 2007
% 0.87/1.24 Inuse: 323
% 0.87/1.24 Deleted: 5
% 0.87/1.24 Deletedinuse: 2
% 0.87/1.24
% 0.87/1.24 Resimplifying inuse:
% 0.87/1.24 Done
% 0.87/1.24
% 0.87/1.24 *** allocated 33750 integers for termspace/termends
% 0.87/1.24 *** allocated 170857 integers for clauses
% 0.87/1.24
% 0.87/1.24 Bliksems!, er is een bewijs:
% 0.87/1.24 % SZS status Theorem
% 0.87/1.24 % SZS output start Refutation
% 0.87/1.24
% 0.87/1.24 (0) {G0,W8,D2,L3,V1,M3} I { ! bool( X ), X = false, X = true }.
% 0.87/1.24 (1) {G0,W5,D2,L2,V1,M2} I { ! X = false, bool( X ) }.
% 0.87/1.24 (2) {G0,W5,D2,L2,V1,M2} I { ! X = true, bool( X ) }.
% 0.87/1.24 (6) {G0,W2,D2,L1,V0,M1} I { d( true ) }.
% 0.87/1.24 (7) {G0,W2,D2,L1,V0,M1} I { d( false ) }.
% 0.87/1.24 (11) {G0,W6,D2,L2,V2,M2} I { ! alpha3( X, Y ), forallprefers( X, Y ) }.
% 0.87/1.24 (14) {G0,W6,D2,L2,V2,M2} I { ! alpha7( X, Y ), alpha3( X, Y ) }.
% 0.87/1.24 (17) {G0,W9,D2,L3,V2,M3} I { ! X = false, ! Y = true, alpha7( X, Y ) }.
% 0.87/1.24 (36) {G0,W6,D2,L2,V2,M2} I { ! alpha9( X, Y ), X = true }.
% 0.87/1.24 (38) {G0,W9,D2,L3,V2,M3} I { ! X = true, ! Y = false, alpha9( X, Y ) }.
% 0.87/1.24 (51) {G0,W4,D2,L2,V1,M2} I { alpha13( X ), ! d( X ) }.
% 0.87/1.24 (54) {G0,W6,D3,L2,V1,M2} I { ! alpha13( X ), phi( X ) ==> X }.
% 0.87/1.24 (56) {G0,W6,D3,L2,V1,M2} I { ! bool( X ), prop( X ) ==> true }.
% 0.87/1.24 (57) {G0,W6,D3,L2,V1,M2} I { bool( X ), prop( X ) ==> false }.
% 0.87/1.24 (63) {G0,W5,D3,L1,V1,M1} I { lazy_impl( false, X ) ==> true }.
% 0.87/1.24 (64) {G0,W6,D3,L1,V1,M1} I { lazy_impl( true, X ) ==> phi( X ) }.
% 0.87/1.24 (93) {G0,W3,D2,L1,V0,M1} I { false1 ==> false }.
% 0.87/1.24 (94) {G0,W7,D4,L1,V1,M1} I { lazy_impl( prop( X ), X ) ==> f7( X ) }.
% 0.87/1.24 (95) {G0,W5,D4,L1,V0,M1} I { phi( f7( skol7 ) ) ==> false2 }.
% 0.87/1.24 (96) {G0,W5,D3,L1,V1,M1} I { ! forallprefers( f7( X ), f7( skol7 ) ) }.
% 0.87/1.24 (101) {G1,W3,D2,L1,V0,M1} I;d(93) { ! false2 ==> false }.
% 0.87/1.24 (102) {G1,W2,D2,L1,V0,M1} Q(1) { bool( false ) }.
% 0.87/1.24 (103) {G1,W2,D2,L1,V0,M1} Q(2) { bool( true ) }.
% 0.87/1.24 (105) {G1,W6,D2,L2,V1,M2} Q(17) { ! X = false, alpha7( X, true ) }.
% 0.87/1.24 (106) {G2,W3,D2,L1,V0,M1} Q(105) { alpha7( false, true ) }.
% 0.87/1.24 (135) {G1,W2,D2,L1,V0,M1} R(51,6) { alpha13( true ) }.
% 0.87/1.24 (136) {G1,W2,D2,L1,V0,M1} R(51,7) { alpha13( false ) }.
% 0.87/1.24 (164) {G3,W3,D2,L1,V0,M1} R(14,106) { alpha3( false, true ) }.
% 0.87/1.24 (165) {G4,W3,D2,L1,V0,M1} R(164,11) { forallprefers( false, true ) }.
% 0.87/1.24 (978) {G2,W4,D3,L1,V0,M1} R(54,136) { phi( false ) ==> false }.
% 0.87/1.24 (979) {G2,W4,D3,L1,V0,M1} R(54,135) { phi( true ) ==> true }.
% 0.87/1.24 (1033) {G2,W4,D3,L1,V0,M1} R(56,102) { prop( false ) ==> true }.
% 0.87/1.24 (1034) {G2,W4,D3,L1,V0,M1} R(56,103) { prop( true ) ==> true }.
% 0.87/1.24 (2211) {G3,W4,D3,L1,V0,M1} P(1034,94);d(64);d(979) { f7( true ) ==> true
% 0.87/1.24 }.
% 0.87/1.24 (2212) {G3,W4,D3,L1,V0,M1} P(1033,94);d(64);d(978) { f7( false ) ==> false
% 0.87/1.24 }.
% 0.87/1.24 (2222) {G4,W4,D3,L1,V0,M1} P(2212,96) { ! forallprefers( false, f7( skol7 )
% 0.87/1.24 ) }.
% 0.87/1.24 (2229) {G5,W4,D3,L1,V1,M1} P(36,2222);r(165) { ! alpha9( f7( skol7 ), X )
% 0.87/1.24 }.
% 0.87/1.24 (2240) {G5,W5,D2,L2,V0,M2} P(0,2222);d(2211);r(165) { ! bool( skol7 ),
% 0.87/1.24 skol7 ==> false }.
% 0.87/1.24 (2275) {G6,W7,D3,L2,V1,M2} R(2229,38) { ! f7( skol7 ) ==> true, ! X = false
% 0.87/1.24 }.
% 0.87/1.24 (2277) {G7,W4,D3,L1,V0,M1} Q(2275) { ! f7( skol7 ) ==> true }.
% 0.87/1.24 (2319) {G6,W5,D2,L2,V0,M2} P(2240,95);d(2212);d(978) { ! bool( skol7 ),
% 0.87/1.24 false2 ==> false }.
% 0.87/1.24 (2381) {G7,W2,D2,L1,V0,M1} S(2319);r(101) { ! bool( skol7 ) }.
% 0.87/1.24 (2393) {G8,W4,D3,L1,V0,M1} R(2381,57) { prop( skol7 ) ==> false }.
% 0.87/1.24 (2691) {G9,W4,D3,L1,V0,M1} P(2393,94);d(63) { f7( skol7 ) ==> true }.
% 0.87/1.24 (2696) {G10,W0,D0,L0,V0,M0} S(2691);r(2277) { }.
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 % SZS output end Refutation
% 0.87/1.24 found a proof!
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 Unprocessed initial clauses:
% 0.87/1.24
% 0.87/1.24 (2698) {G0,W8,D2,L3,V1,M3} { ! bool( X ), X = false, X = true }.
% 0.87/1.24 (2699) {G0,W5,D2,L2,V1,M2} { ! X = false, bool( X ) }.
% 0.87/1.24 (2700) {G0,W5,D2,L2,V1,M2} { ! X = true, bool( X ) }.
% 0.87/1.24 (2701) {G0,W3,D2,L1,V0,M1} { ! true = false }.
% 0.87/1.24 (2702) {G0,W3,D2,L1,V0,M1} { ! true = err }.
% 0.87/1.24 (2703) {G0,W3,D2,L1,V0,M1} { ! false = err }.
% 0.87/1.24 (2704) {G0,W2,D2,L1,V0,M1} { d( true ) }.
% 0.87/1.24 (2705) {G0,W2,D2,L1,V0,M1} { d( false ) }.
% 0.87/1.24 (2706) {G0,W2,D2,L1,V0,M1} { d( err ) }.
% 0.87/1.24 (2707) {G0,W9,D2,L3,V2,M3} { ! forallprefers( X, Y ), alpha1( X, Y ),
% 0.87/1.24 alpha3( X, Y ) }.
% 0.87/1.24 (2708) {G0,W6,D2,L2,V2,M2} { ! alpha1( X, Y ), forallprefers( X, Y ) }.
% 0.87/1.24 (2709) {G0,W6,D2,L2,V2,M2} { ! alpha3( X, Y ), forallprefers( X, Y ) }.
% 0.87/1.24 (2710) {G0,W9,D2,L3,V2,M3} { ! alpha3( X, Y ), alpha5( X, Y ), alpha7( X,
% 0.87/1.24 Y ) }.
% 0.87/1.24 (2711) {G0,W6,D2,L2,V2,M2} { ! alpha5( X, Y ), alpha3( X, Y ) }.
% 0.87/1.24 (2712) {G0,W6,D2,L2,V2,M2} { ! alpha7( X, Y ), alpha3( X, Y ) }.
% 0.87/1.24 (2713) {G0,W6,D2,L2,V2,M2} { ! alpha7( X, Y ), X = false }.
% 0.87/1.24 (2714) {G0,W6,D2,L2,V2,M2} { ! alpha7( X, Y ), Y = true }.
% 0.87/1.24 (2715) {G0,W9,D2,L3,V2,M3} { ! X = false, ! Y = true, alpha7( X, Y ) }.
% 0.87/1.24 (2716) {G0,W5,D2,L2,V2,M2} { ! alpha5( X, Y ), d( X ) }.
% 0.87/1.24 (2717) {G0,W6,D2,L2,V2,M2} { ! alpha5( X, Y ), alpha8( X, Y ) }.
% 0.87/1.24 (2718) {G0,W8,D2,L3,V2,M3} { ! d( X ), ! alpha8( X, Y ), alpha5( X, Y )
% 0.87/1.24 }.
% 0.87/1.24 (2719) {G0,W5,D2,L2,V2,M2} { ! alpha8( X, Y ), d( Y ) }.
% 0.87/1.24 (2720) {G0,W6,D2,L2,V2,M2} { ! alpha8( X, Y ), alpha11( X, Y ) }.
% 0.87/1.24 (2721) {G0,W8,D2,L3,V2,M3} { ! d( Y ), ! alpha11( X, Y ), alpha8( X, Y )
% 0.87/1.24 }.
% 0.87/1.24 (2722) {G0,W5,D2,L2,V2,M2} { ! alpha11( X, Y ), ! bool( X ) }.
% 0.87/1.24 (2723) {G0,W5,D2,L2,V2,M2} { ! alpha11( X, Y ), bool( Y ) }.
% 0.87/1.24 (2724) {G0,W7,D2,L3,V2,M3} { bool( X ), ! bool( Y ), alpha11( X, Y ) }.
% 0.87/1.24 (2725) {G0,W5,D2,L2,V2,M2} { ! alpha1( X, Y ), ! d( X ) }.
% 0.87/1.24 (2726) {G0,W5,D2,L2,V2,M2} { ! alpha1( X, Y ), d( Y ) }.
% 0.87/1.24 (2727) {G0,W7,D2,L3,V2,M3} { d( X ), ! d( Y ), alpha1( X, Y ) }.
% 0.87/1.24 (2728) {G0,W9,D2,L3,V2,M3} { ! existsprefers( X, Y ), alpha2( X, Y ),
% 0.87/1.24 alpha4( X, Y ) }.
% 0.87/1.24 (2729) {G0,W6,D2,L2,V2,M2} { ! alpha2( X, Y ), existsprefers( X, Y ) }.
% 0.87/1.24 (2730) {G0,W6,D2,L2,V2,M2} { ! alpha4( X, Y ), existsprefers( X, Y ) }.
% 0.87/1.24 (2731) {G0,W9,D2,L3,V2,M3} { ! alpha4( X, Y ), alpha6( X, Y ), alpha9( X,
% 0.87/1.24 Y ) }.
% 0.87/1.24 (2732) {G0,W6,D2,L2,V2,M2} { ! alpha6( X, Y ), alpha4( X, Y ) }.
% 0.87/1.24 (2733) {G0,W6,D2,L2,V2,M2} { ! alpha9( X, Y ), alpha4( X, Y ) }.
% 0.87/1.24 (2734) {G0,W6,D2,L2,V2,M2} { ! alpha9( X, Y ), X = true }.
% 0.87/1.24 (2735) {G0,W6,D2,L2,V2,M2} { ! alpha9( X, Y ), Y = false }.
% 0.87/1.24 (2736) {G0,W9,D2,L3,V2,M3} { ! X = true, ! Y = false, alpha9( X, Y ) }.
% 0.87/1.24 (2737) {G0,W5,D2,L2,V2,M2} { ! alpha6( X, Y ), d( X ) }.
% 0.87/1.24 (2738) {G0,W6,D2,L2,V2,M2} { ! alpha6( X, Y ), alpha10( X, Y ) }.
% 0.87/1.24 (2739) {G0,W8,D2,L3,V2,M3} { ! d( X ), ! alpha10( X, Y ), alpha6( X, Y )
% 0.87/1.24 }.
% 0.87/1.24 (2740) {G0,W5,D2,L2,V2,M2} { ! alpha10( X, Y ), d( Y ) }.
% 0.87/1.24 (2741) {G0,W6,D2,L2,V2,M2} { ! alpha10( X, Y ), alpha12( X, Y ) }.
% 0.87/1.24 (2742) {G0,W8,D2,L3,V2,M3} { ! d( Y ), ! alpha12( X, Y ), alpha10( X, Y )
% 0.87/1.24 }.
% 0.87/1.24 (2743) {G0,W5,D2,L2,V2,M2} { ! alpha12( X, Y ), ! bool( X ) }.
% 0.87/1.24 (2744) {G0,W5,D2,L2,V2,M2} { ! alpha12( X, Y ), bool( Y ) }.
% 0.87/1.24 (2745) {G0,W7,D2,L3,V2,M3} { bool( X ), ! bool( Y ), alpha12( X, Y ) }.
% 0.87/1.24 (2746) {G0,W5,D2,L2,V2,M2} { ! alpha2( X, Y ), ! d( X ) }.
% 0.87/1.24 (2747) {G0,W5,D2,L2,V2,M2} { ! alpha2( X, Y ), d( Y ) }.
% 0.87/1.24 (2748) {G0,W7,D2,L3,V2,M3} { d( X ), ! d( Y ), alpha2( X, Y ) }.
% 0.87/1.24 (2749) {G0,W4,D2,L2,V1,M2} { alpha13( X ), ! d( X ) }.
% 0.87/1.24 (2750) {G0,W6,D3,L2,V1,M2} { alpha13( X ), phi( X ) = err }.
% 0.87/1.24 (2751) {G0,W4,D2,L2,V1,M2} { ! alpha13( X ), d( X ) }.
% 0.87/1.24 (2752) {G0,W6,D3,L2,V1,M2} { ! alpha13( X ), phi( X ) = X }.
% 0.87/1.24 (2753) {G0,W8,D3,L3,V1,M3} { ! d( X ), ! phi( X ) = X, alpha13( X ) }.
% 0.87/1.24 (2754) {G0,W6,D3,L2,V1,M2} { ! prop( X ) = true, bool( X ) }.
% 0.87/1.24 (2755) {G0,W6,D3,L2,V1,M2} { ! bool( X ), prop( X ) = true }.
% 0.87/1.24 (2756) {G0,W6,D3,L2,V1,M2} { ! prop( X ) = false, ! bool( X ) }.
% 0.87/1.24 (2757) {G0,W6,D3,L2,V1,M2} { bool( X ), prop( X ) = false }.
% 0.87/1.24 (2758) {G0,W8,D3,L2,V2,M2} { bool( X ), impl( X, Y ) = phi( X ) }.
% 0.87/1.24 (2759) {G0,W10,D3,L3,V2,M3} { ! bool( X ), bool( Y ), impl( X, Y ) = phi(
% 0.87/1.24 Y ) }.
% 0.87/1.24 (2760) {G0,W7,D3,L2,V1,M2} { ! bool( X ), impl( false, X ) = true }.
% 0.87/1.24 (2761) {G0,W7,D3,L2,V1,M2} { ! bool( X ), impl( true, X ) = X }.
% 0.87/1.24 (2762) {G0,W8,D3,L2,V2,M2} { bool( X ), lazy_impl( X, Y ) = phi( X ) }.
% 0.87/1.24 (2763) {G0,W5,D3,L1,V1,M1} { lazy_impl( false, X ) = true }.
% 0.87/1.24 (2764) {G0,W6,D3,L1,V1,M1} { lazy_impl( true, X ) = phi( X ) }.
% 0.87/1.24 (2765) {G0,W8,D3,L2,V2,M2} { bool( X ), and1( X, Y ) = phi( X ) }.
% 0.87/1.24 (2766) {G0,W10,D3,L3,V2,M3} { ! bool( X ), bool( Y ), and1( X, Y ) = phi(
% 0.87/1.24 Y ) }.
% 0.87/1.24 (2767) {G0,W7,D3,L2,V1,M2} { ! bool( X ), and1( false, X ) = false }.
% 0.87/1.24 (2768) {G0,W7,D3,L2,V1,M2} { ! bool( X ), and1( true, X ) = X }.
% 0.87/1.24 (2769) {G0,W15,D6,L1,V3,M1} { f1( X, Y, Z ) = lazy_impl( prop( Z ), impl(
% 0.87/1.24 impl( X, impl( Y, Z ) ), Z ) ) }.
% 0.87/1.24 (2770) {G0,W11,D5,L1,V2,M1} { and2( X, Y ) = phi( f1( X, Y, skol1( X, Y )
% 0.87/1.24 ) ) }.
% 0.87/1.24 (2771) {G0,W11,D4,L1,V3,M1} { ! forallprefers( f1( X, Y, Z ), f1( X, Y,
% 0.87/1.24 skol1( X, Y ) ) ) }.
% 0.87/1.24 (2772) {G0,W8,D3,L2,V2,M2} { bool( X ), lazy_and1( X, Y ) = phi( X ) }.
% 0.87/1.24 (2773) {G0,W5,D3,L1,V1,M1} { lazy_and1( false, X ) = false }.
% 0.87/1.24 (2774) {G0,W6,D3,L1,V1,M1} { lazy_and1( true, X ) = phi( X ) }.
% 0.87/1.24 (2775) {G0,W15,D6,L1,V3,M1} { f2( X, Y, Z ) = lazy_impl( prop( Z ), impl(
% 0.87/1.24 lazy_impl( X, impl( Y, Z ) ), Z ) ) }.
% 0.87/1.24 (2776) {G0,W11,D5,L1,V2,M1} { lazy_and2( X, Y ) = phi( f2( X, Y, skol2( X
% 0.87/1.24 , Y ) ) ) }.
% 0.87/1.24 (2777) {G0,W11,D4,L1,V3,M1} { ! forallprefers( f2( X, Y, Z ), f2( X, Y,
% 0.87/1.24 skol2( X, Y ) ) ) }.
% 0.87/1.24 (2778) {G0,W8,D3,L2,V2,M2} { bool( X ), or1( X, Y ) = phi( X ) }.
% 0.87/1.24 (2779) {G0,W10,D3,L3,V2,M3} { ! bool( X ), bool( Y ), or1( X, Y ) = phi( Y
% 0.87/1.24 ) }.
% 0.87/1.24 (2780) {G0,W7,D3,L2,V1,M2} { ! bool( X ), or1( true, X ) = true }.
% 0.87/1.24 (2781) {G0,W7,D3,L2,V1,M2} { ! bool( X ), or1( false, X ) = X }.
% 0.87/1.24 (2782) {G0,W17,D6,L1,V3,M1} { f3( X, Y, Z ) = lazy_impl( prop( Z ), impl(
% 0.87/1.24 impl( X, Z ), impl( impl( Y, Z ), Z ) ) ) }.
% 0.87/1.24 (2783) {G0,W11,D5,L1,V2,M1} { or2( X, Y ) = phi( f3( X, Y, skol3( X, Y ) )
% 0.87/1.24 ) }.
% 0.87/1.24 (2784) {G0,W11,D4,L1,V3,M1} { ! forallprefers( f3( X, Y, Z ), f3( X, Y,
% 0.87/1.24 skol3( X, Y ) ) ) }.
% 0.87/1.24 (2785) {G0,W8,D5,L1,V1,M1} { exists1( X ) = phi( apply( X, skol4( X ) ) )
% 0.87/1.24 }.
% 0.87/1.24 (2786) {G0,W8,D4,L1,V2,M1} { ! existsprefers( apply( X, Y ), apply( X,
% 0.87/1.24 skol4( X ) ) ) }.
% 0.87/1.24 (2787) {G0,W10,D4,L1,V3,M1} { f4( X, Y, Z ) = impl( apply( X, Y ), Z ) }.
% 0.87/1.24 (2788) {G0,W11,D5,L1,V2,M1} { f5( X, Y ) = phi( f4( X, skol5( X, Y ), Y )
% 0.87/1.24 ) }.
% 0.87/1.24 (2789) {G0,W11,D4,L1,V3,M1} { ! forallprefers( f4( X, Z, Y ), f4( X, skol5
% 0.87/1.24 ( X, Y ), Y ) ) }.
% 0.87/1.24 (2790) {G0,W12,D5,L1,V2,M1} { f6( X, Y ) = lazy_impl( prop( Y ), impl( f5
% 0.87/1.24 ( X, Y ), Y ) ) }.
% 0.87/1.24 (2791) {G0,W8,D5,L1,V1,M1} { exists2( X ) = phi( f6( X, skol6( X ) ) ) }.
% 0.87/1.24 (2792) {G0,W8,D4,L1,V2,M1} { ! forallprefers( f6( X, Y ), f6( X, skol6( X
% 0.87/1.24 ) ) ) }.
% 0.87/1.24 (2793) {G0,W3,D2,L1,V0,M1} { false1 = false }.
% 0.87/1.24 (2794) {G0,W7,D4,L1,V1,M1} { f7( X ) = lazy_impl( prop( X ), X ) }.
% 0.87/1.24 (2795) {G0,W5,D4,L1,V0,M1} { false2 = phi( f7( skol7 ) ) }.
% 0.87/1.24 (2796) {G0,W5,D3,L1,V1,M1} { ! forallprefers( f7( X ), f7( skol7 ) ) }.
% 0.87/1.24 (2797) {G0,W7,D3,L2,V1,M2} { bool( X ), not1( X ) = phi( X ) }.
% 0.87/1.24 (2798) {G0,W4,D3,L1,V0,M1} { not1( false ) = true }.
% 0.87/1.24 (2799) {G0,W4,D3,L1,V0,M1} { not1( true ) = false }.
% 0.87/1.24 (2800) {G0,W6,D3,L1,V1,M1} { not2( X ) = impl( X, false2 ) }.
% 0.87/1.24 (2801) {G0,W3,D2,L1,V0,M1} { ! false1 = false2 }.
% 0.87/1.24
% 0.87/1.24
% 0.87/1.24 Total Proof:
% 0.87/1.24
% 0.87/1.24 subsumption: (0) {G0,W8,D2,L3,V1,M3} I { ! bool( X ), X = false, X = true
% 0.87/1.24 }.
% 0.87/1.24 parent0: (2698) {G0,W8,D2,L3,V1,M3} { ! bool( X ), X = false, X = true }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := X
% 0.87/1.24 end
% 0.87/1.24 permutation0:
% 0.87/1.24 0 ==> 0
% 0.87/1.24 1 ==> 1
% 0.87/1.24 2 ==> 2
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 subsumption: (1) {G0,W5,D2,L2,V1,M2} I { ! X = false, bool( X ) }.
% 0.87/1.24 parent0: (2699) {G0,W5,D2,L2,V1,M2} { ! X = false, bool( X ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := X
% 0.87/1.24 end
% 0.87/1.24 permutation0:
% 0.87/1.24 0 ==> 0
% 0.87/1.24 1 ==> 1
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 subsumption: (2) {G0,W5,D2,L2,V1,M2} I { ! X = true, bool( X ) }.
% 0.87/1.24 parent0: (2700) {G0,W5,D2,L2,V1,M2} { ! X = true, bool( X ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := X
% 0.87/1.24 end
% 0.87/1.24 permutation0:
% 0.87/1.24 0 ==> 0
% 0.87/1.24 1 ==> 1
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 subsumption: (6) {G0,W2,D2,L1,V0,M1} I { d( true ) }.
% 0.87/1.24 parent0: (2704) {G0,W2,D2,L1,V0,M1} { d( true ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 end
% 0.87/1.24 permutation0:
% 0.87/1.24 0 ==> 0
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 subsumption: (7) {G0,W2,D2,L1,V0,M1} I { d( false ) }.
% 0.87/1.24 parent0: (2705) {G0,W2,D2,L1,V0,M1} { d( false ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 end
% 0.87/1.24 permutation0:
% 0.87/1.24 0 ==> 0
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 subsumption: (11) {G0,W6,D2,L2,V2,M2} I { ! alpha3( X, Y ), forallprefers(
% 0.87/1.24 X, Y ) }.
% 0.87/1.24 parent0: (2709) {G0,W6,D2,L2,V2,M2} { ! alpha3( X, Y ), forallprefers( X,
% 0.87/1.24 Y ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := X
% 0.87/1.24 Y := Y
% 0.87/1.24 end
% 0.87/1.24 permutation0:
% 0.87/1.24 0 ==> 0
% 0.87/1.24 1 ==> 1
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 subsumption: (14) {G0,W6,D2,L2,V2,M2} I { ! alpha7( X, Y ), alpha3( X, Y )
% 0.87/1.24 }.
% 0.87/1.24 parent0: (2712) {G0,W6,D2,L2,V2,M2} { ! alpha7( X, Y ), alpha3( X, Y ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := X
% 0.87/1.24 Y := Y
% 0.87/1.24 end
% 0.87/1.24 permutation0:
% 0.87/1.24 0 ==> 0
% 0.87/1.24 1 ==> 1
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 subsumption: (17) {G0,W9,D2,L3,V2,M3} I { ! X = false, ! Y = true, alpha7(
% 0.87/1.24 X, Y ) }.
% 0.87/1.24 parent0: (2715) {G0,W9,D2,L3,V2,M3} { ! X = false, ! Y = true, alpha7( X,
% 0.87/1.24 Y ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := X
% 0.87/1.24 Y := Y
% 0.87/1.24 end
% 0.87/1.24 permutation0:
% 0.87/1.24 0 ==> 0
% 0.87/1.24 1 ==> 1
% 0.87/1.24 2 ==> 2
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 subsumption: (36) {G0,W6,D2,L2,V2,M2} I { ! alpha9( X, Y ), X = true }.
% 0.87/1.24 parent0: (2734) {G0,W6,D2,L2,V2,M2} { ! alpha9( X, Y ), X = true }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := X
% 0.87/1.24 Y := Y
% 0.87/1.24 end
% 0.87/1.24 permutation0:
% 0.87/1.24 0 ==> 0
% 0.87/1.24 1 ==> 1
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 subsumption: (38) {G0,W9,D2,L3,V2,M3} I { ! X = true, ! Y = false, alpha9(
% 0.87/1.24 X, Y ) }.
% 0.87/1.24 parent0: (2736) {G0,W9,D2,L3,V2,M3} { ! X = true, ! Y = false, alpha9( X,
% 0.87/1.24 Y ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := X
% 0.87/1.24 Y := Y
% 0.87/1.24 end
% 0.87/1.24 permutation0:
% 0.87/1.24 0 ==> 0
% 0.87/1.24 1 ==> 1
% 0.87/1.24 2 ==> 2
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 subsumption: (51) {G0,W4,D2,L2,V1,M2} I { alpha13( X ), ! d( X ) }.
% 0.87/1.24 parent0: (2749) {G0,W4,D2,L2,V1,M2} { alpha13( X ), ! d( X ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := X
% 0.87/1.24 end
% 0.87/1.24 permutation0:
% 0.87/1.24 0 ==> 0
% 0.87/1.24 1 ==> 1
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 subsumption: (54) {G0,W6,D3,L2,V1,M2} I { ! alpha13( X ), phi( X ) ==> X
% 0.87/1.24 }.
% 0.87/1.24 parent0: (2752) {G0,W6,D3,L2,V1,M2} { ! alpha13( X ), phi( X ) = X }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := X
% 0.87/1.24 end
% 0.87/1.24 permutation0:
% 0.87/1.24 0 ==> 0
% 0.87/1.24 1 ==> 1
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 subsumption: (56) {G0,W6,D3,L2,V1,M2} I { ! bool( X ), prop( X ) ==> true
% 0.87/1.24 }.
% 0.87/1.24 parent0: (2755) {G0,W6,D3,L2,V1,M2} { ! bool( X ), prop( X ) = true }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := X
% 0.87/1.24 end
% 0.87/1.24 permutation0:
% 0.87/1.24 0 ==> 0
% 0.87/1.24 1 ==> 1
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 subsumption: (57) {G0,W6,D3,L2,V1,M2} I { bool( X ), prop( X ) ==> false
% 0.87/1.24 }.
% 0.87/1.24 parent0: (2757) {G0,W6,D3,L2,V1,M2} { bool( X ), prop( X ) = false }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := X
% 0.87/1.24 end
% 0.87/1.24 permutation0:
% 0.87/1.24 0 ==> 0
% 0.87/1.24 1 ==> 1
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 subsumption: (63) {G0,W5,D3,L1,V1,M1} I { lazy_impl( false, X ) ==> true
% 0.87/1.24 }.
% 0.87/1.24 parent0: (2763) {G0,W5,D3,L1,V1,M1} { lazy_impl( false, X ) = true }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := X
% 0.87/1.24 end
% 0.87/1.24 permutation0:
% 0.87/1.24 0 ==> 0
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 subsumption: (64) {G0,W6,D3,L1,V1,M1} I { lazy_impl( true, X ) ==> phi( X )
% 0.87/1.24 }.
% 0.87/1.24 parent0: (2764) {G0,W6,D3,L1,V1,M1} { lazy_impl( true, X ) = phi( X ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := X
% 0.87/1.24 end
% 0.87/1.24 permutation0:
% 0.87/1.24 0 ==> 0
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 subsumption: (93) {G0,W3,D2,L1,V0,M1} I { false1 ==> false }.
% 0.87/1.24 parent0: (2793) {G0,W3,D2,L1,V0,M1} { false1 = false }.
% 0.87/1.24 substitution0:
% 0.87/1.24 end
% 0.87/1.24 permutation0:
% 0.87/1.24 0 ==> 0
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 *** allocated 50625 integers for termspace/termends
% 0.87/1.24 eqswap: (3190) {G0,W7,D4,L1,V1,M1} { lazy_impl( prop( X ), X ) = f7( X )
% 0.87/1.24 }.
% 0.87/1.24 parent0[0]: (2794) {G0,W7,D4,L1,V1,M1} { f7( X ) = lazy_impl( prop( X ), X
% 0.87/1.24 ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := X
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 subsumption: (94) {G0,W7,D4,L1,V1,M1} I { lazy_impl( prop( X ), X ) ==> f7
% 0.87/1.24 ( X ) }.
% 0.87/1.24 parent0: (3190) {G0,W7,D4,L1,V1,M1} { lazy_impl( prop( X ), X ) = f7( X )
% 0.87/1.24 }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := X
% 0.87/1.24 end
% 0.87/1.24 permutation0:
% 0.87/1.24 0 ==> 0
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 eqswap: (3251) {G0,W5,D4,L1,V0,M1} { phi( f7( skol7 ) ) = false2 }.
% 0.87/1.24 parent0[0]: (2795) {G0,W5,D4,L1,V0,M1} { false2 = phi( f7( skol7 ) ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 subsumption: (95) {G0,W5,D4,L1,V0,M1} I { phi( f7( skol7 ) ) ==> false2 }.
% 0.87/1.24 parent0: (3251) {G0,W5,D4,L1,V0,M1} { phi( f7( skol7 ) ) = false2 }.
% 0.87/1.24 substitution0:
% 0.87/1.24 end
% 0.87/1.24 permutation0:
% 0.87/1.24 0 ==> 0
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 subsumption: (96) {G0,W5,D3,L1,V1,M1} I { ! forallprefers( f7( X ), f7(
% 0.87/1.24 skol7 ) ) }.
% 0.87/1.24 parent0: (2796) {G0,W5,D3,L1,V1,M1} { ! forallprefers( f7( X ), f7( skol7
% 0.87/1.24 ) ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := X
% 0.87/1.24 end
% 0.87/1.24 permutation0:
% 0.87/1.24 0 ==> 0
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 paramod: (3485) {G1,W3,D2,L1,V0,M1} { ! false = false2 }.
% 0.87/1.24 parent0[0]: (93) {G0,W3,D2,L1,V0,M1} I { false1 ==> false }.
% 0.87/1.24 parent1[0; 2]: (2801) {G0,W3,D2,L1,V0,M1} { ! false1 = false2 }.
% 0.87/1.24 substitution0:
% 0.87/1.24 end
% 0.87/1.24 substitution1:
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 eqswap: (3486) {G1,W3,D2,L1,V0,M1} { ! false2 = false }.
% 0.87/1.24 parent0[0]: (3485) {G1,W3,D2,L1,V0,M1} { ! false = false2 }.
% 0.87/1.24 substitution0:
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 subsumption: (101) {G1,W3,D2,L1,V0,M1} I;d(93) { ! false2 ==> false }.
% 0.87/1.24 parent0: (3486) {G1,W3,D2,L1,V0,M1} { ! false2 = false }.
% 0.87/1.24 substitution0:
% 0.87/1.24 end
% 0.87/1.24 permutation0:
% 0.87/1.24 0 ==> 0
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 eqswap: (3487) {G0,W5,D2,L2,V1,M2} { ! false = X, bool( X ) }.
% 0.87/1.24 parent0[0]: (1) {G0,W5,D2,L2,V1,M2} I { ! X = false, bool( X ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := X
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 eqrefl: (3488) {G0,W2,D2,L1,V0,M1} { bool( false ) }.
% 0.87/1.24 parent0[0]: (3487) {G0,W5,D2,L2,V1,M2} { ! false = X, bool( X ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := false
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 subsumption: (102) {G1,W2,D2,L1,V0,M1} Q(1) { bool( false ) }.
% 0.87/1.24 parent0: (3488) {G0,W2,D2,L1,V0,M1} { bool( false ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 end
% 0.87/1.24 permutation0:
% 0.87/1.24 0 ==> 0
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 eqswap: (3489) {G0,W5,D2,L2,V1,M2} { ! true = X, bool( X ) }.
% 0.87/1.24 parent0[0]: (2) {G0,W5,D2,L2,V1,M2} I { ! X = true, bool( X ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := X
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 eqrefl: (3490) {G0,W2,D2,L1,V0,M1} { bool( true ) }.
% 0.87/1.24 parent0[0]: (3489) {G0,W5,D2,L2,V1,M2} { ! true = X, bool( X ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := true
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 subsumption: (103) {G1,W2,D2,L1,V0,M1} Q(2) { bool( true ) }.
% 0.87/1.24 parent0: (3490) {G0,W2,D2,L1,V0,M1} { bool( true ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 end
% 0.87/1.24 permutation0:
% 0.87/1.24 0 ==> 0
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 eqswap: (3491) {G0,W9,D2,L3,V2,M3} { ! false = X, ! Y = true, alpha7( X, Y
% 0.87/1.24 ) }.
% 0.87/1.24 parent0[0]: (17) {G0,W9,D2,L3,V2,M3} I { ! X = false, ! Y = true, alpha7( X
% 0.87/1.24 , Y ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := X
% 0.87/1.24 Y := Y
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 eqrefl: (3495) {G0,W6,D2,L2,V1,M2} { ! false = X, alpha7( X, true ) }.
% 0.87/1.24 parent0[1]: (3491) {G0,W9,D2,L3,V2,M3} { ! false = X, ! Y = true, alpha7(
% 0.87/1.24 X, Y ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := X
% 0.87/1.24 Y := true
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 eqswap: (3496) {G0,W6,D2,L2,V1,M2} { ! X = false, alpha7( X, true ) }.
% 0.87/1.24 parent0[0]: (3495) {G0,W6,D2,L2,V1,M2} { ! false = X, alpha7( X, true )
% 0.87/1.24 }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := X
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 subsumption: (105) {G1,W6,D2,L2,V1,M2} Q(17) { ! X = false, alpha7( X, true
% 0.87/1.24 ) }.
% 0.87/1.24 parent0: (3496) {G0,W6,D2,L2,V1,M2} { ! X = false, alpha7( X, true ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := X
% 0.87/1.24 end
% 0.87/1.24 permutation0:
% 0.87/1.24 0 ==> 0
% 0.87/1.24 1 ==> 1
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 eqswap: (3498) {G1,W6,D2,L2,V1,M2} { ! false = X, alpha7( X, true ) }.
% 0.87/1.24 parent0[0]: (105) {G1,W6,D2,L2,V1,M2} Q(17) { ! X = false, alpha7( X, true
% 0.87/1.24 ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := X
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 eqrefl: (3499) {G0,W3,D2,L1,V0,M1} { alpha7( false, true ) }.
% 0.87/1.24 parent0[0]: (3498) {G1,W6,D2,L2,V1,M2} { ! false = X, alpha7( X, true )
% 0.87/1.24 }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := false
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 subsumption: (106) {G2,W3,D2,L1,V0,M1} Q(105) { alpha7( false, true ) }.
% 0.87/1.24 parent0: (3499) {G0,W3,D2,L1,V0,M1} { alpha7( false, true ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 end
% 0.87/1.24 permutation0:
% 0.87/1.24 0 ==> 0
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 resolution: (3500) {G1,W2,D2,L1,V0,M1} { alpha13( true ) }.
% 0.87/1.24 parent0[1]: (51) {G0,W4,D2,L2,V1,M2} I { alpha13( X ), ! d( X ) }.
% 0.87/1.24 parent1[0]: (6) {G0,W2,D2,L1,V0,M1} I { d( true ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := true
% 0.87/1.24 end
% 0.87/1.24 substitution1:
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 subsumption: (135) {G1,W2,D2,L1,V0,M1} R(51,6) { alpha13( true ) }.
% 0.87/1.24 parent0: (3500) {G1,W2,D2,L1,V0,M1} { alpha13( true ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 end
% 0.87/1.24 permutation0:
% 0.87/1.24 0 ==> 0
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 resolution: (3501) {G1,W2,D2,L1,V0,M1} { alpha13( false ) }.
% 0.87/1.24 parent0[1]: (51) {G0,W4,D2,L2,V1,M2} I { alpha13( X ), ! d( X ) }.
% 0.87/1.24 parent1[0]: (7) {G0,W2,D2,L1,V0,M1} I { d( false ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := false
% 0.87/1.24 end
% 0.87/1.24 substitution1:
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 subsumption: (136) {G1,W2,D2,L1,V0,M1} R(51,7) { alpha13( false ) }.
% 0.87/1.24 parent0: (3501) {G1,W2,D2,L1,V0,M1} { alpha13( false ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 end
% 0.87/1.24 permutation0:
% 0.87/1.24 0 ==> 0
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 resolution: (3502) {G1,W3,D2,L1,V0,M1} { alpha3( false, true ) }.
% 0.87/1.24 parent0[0]: (14) {G0,W6,D2,L2,V2,M2} I { ! alpha7( X, Y ), alpha3( X, Y )
% 0.87/1.24 }.
% 0.87/1.24 parent1[0]: (106) {G2,W3,D2,L1,V0,M1} Q(105) { alpha7( false, true ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := false
% 0.87/1.24 Y := true
% 0.87/1.24 end
% 0.87/1.24 substitution1:
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 subsumption: (164) {G3,W3,D2,L1,V0,M1} R(14,106) { alpha3( false, true )
% 0.87/1.24 }.
% 0.87/1.24 parent0: (3502) {G1,W3,D2,L1,V0,M1} { alpha3( false, true ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 end
% 0.87/1.24 permutation0:
% 0.87/1.24 0 ==> 0
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 resolution: (3503) {G1,W3,D2,L1,V0,M1} { forallprefers( false, true ) }.
% 0.87/1.24 parent0[0]: (11) {G0,W6,D2,L2,V2,M2} I { ! alpha3( X, Y ), forallprefers( X
% 0.87/1.24 , Y ) }.
% 0.87/1.24 parent1[0]: (164) {G3,W3,D2,L1,V0,M1} R(14,106) { alpha3( false, true ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := false
% 0.87/1.24 Y := true
% 0.87/1.24 end
% 0.87/1.24 substitution1:
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 subsumption: (165) {G4,W3,D2,L1,V0,M1} R(164,11) { forallprefers( false,
% 0.87/1.24 true ) }.
% 0.87/1.24 parent0: (3503) {G1,W3,D2,L1,V0,M1} { forallprefers( false, true ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 end
% 0.87/1.24 permutation0:
% 0.87/1.24 0 ==> 0
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 eqswap: (3504) {G0,W6,D3,L2,V1,M2} { X ==> phi( X ), ! alpha13( X ) }.
% 0.87/1.24 parent0[1]: (54) {G0,W6,D3,L2,V1,M2} I { ! alpha13( X ), phi( X ) ==> X }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := X
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 resolution: (3505) {G1,W4,D3,L1,V0,M1} { false ==> phi( false ) }.
% 0.87/1.24 parent0[1]: (3504) {G0,W6,D3,L2,V1,M2} { X ==> phi( X ), ! alpha13( X )
% 0.87/1.24 }.
% 0.87/1.24 parent1[0]: (136) {G1,W2,D2,L1,V0,M1} R(51,7) { alpha13( false ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := false
% 0.87/1.24 end
% 0.87/1.24 substitution1:
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 eqswap: (3506) {G1,W4,D3,L1,V0,M1} { phi( false ) ==> false }.
% 0.87/1.24 parent0[0]: (3505) {G1,W4,D3,L1,V0,M1} { false ==> phi( false ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 subsumption: (978) {G2,W4,D3,L1,V0,M1} R(54,136) { phi( false ) ==> false
% 0.87/1.24 }.
% 0.87/1.24 parent0: (3506) {G1,W4,D3,L1,V0,M1} { phi( false ) ==> false }.
% 0.87/1.24 substitution0:
% 0.87/1.24 end
% 0.87/1.24 permutation0:
% 0.87/1.24 0 ==> 0
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 eqswap: (3507) {G0,W6,D3,L2,V1,M2} { X ==> phi( X ), ! alpha13( X ) }.
% 0.87/1.24 parent0[1]: (54) {G0,W6,D3,L2,V1,M2} I { ! alpha13( X ), phi( X ) ==> X }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := X
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 resolution: (3508) {G1,W4,D3,L1,V0,M1} { true ==> phi( true ) }.
% 0.87/1.24 parent0[1]: (3507) {G0,W6,D3,L2,V1,M2} { X ==> phi( X ), ! alpha13( X )
% 0.87/1.24 }.
% 0.87/1.24 parent1[0]: (135) {G1,W2,D2,L1,V0,M1} R(51,6) { alpha13( true ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := true
% 0.87/1.24 end
% 0.87/1.24 substitution1:
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 eqswap: (3509) {G1,W4,D3,L1,V0,M1} { phi( true ) ==> true }.
% 0.87/1.24 parent0[0]: (3508) {G1,W4,D3,L1,V0,M1} { true ==> phi( true ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 subsumption: (979) {G2,W4,D3,L1,V0,M1} R(54,135) { phi( true ) ==> true }.
% 0.87/1.24 parent0: (3509) {G1,W4,D3,L1,V0,M1} { phi( true ) ==> true }.
% 0.87/1.24 substitution0:
% 0.87/1.24 end
% 0.87/1.24 permutation0:
% 0.87/1.24 0 ==> 0
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 eqswap: (3510) {G0,W6,D3,L2,V1,M2} { true ==> prop( X ), ! bool( X ) }.
% 0.87/1.24 parent0[1]: (56) {G0,W6,D3,L2,V1,M2} I { ! bool( X ), prop( X ) ==> true
% 0.87/1.24 }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := X
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 resolution: (3511) {G1,W4,D3,L1,V0,M1} { true ==> prop( false ) }.
% 0.87/1.24 parent0[1]: (3510) {G0,W6,D3,L2,V1,M2} { true ==> prop( X ), ! bool( X )
% 0.87/1.24 }.
% 0.87/1.24 parent1[0]: (102) {G1,W2,D2,L1,V0,M1} Q(1) { bool( false ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := false
% 0.87/1.24 end
% 0.87/1.24 substitution1:
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 eqswap: (3512) {G1,W4,D3,L1,V0,M1} { prop( false ) ==> true }.
% 0.87/1.24 parent0[0]: (3511) {G1,W4,D3,L1,V0,M1} { true ==> prop( false ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 subsumption: (1033) {G2,W4,D3,L1,V0,M1} R(56,102) { prop( false ) ==> true
% 0.87/1.24 }.
% 0.87/1.24 parent0: (3512) {G1,W4,D3,L1,V0,M1} { prop( false ) ==> true }.
% 0.87/1.24 substitution0:
% 0.87/1.24 end
% 0.87/1.24 permutation0:
% 0.87/1.24 0 ==> 0
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 eqswap: (3513) {G0,W6,D3,L2,V1,M2} { true ==> prop( X ), ! bool( X ) }.
% 0.87/1.24 parent0[1]: (56) {G0,W6,D3,L2,V1,M2} I { ! bool( X ), prop( X ) ==> true
% 0.87/1.24 }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := X
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 resolution: (3514) {G1,W4,D3,L1,V0,M1} { true ==> prop( true ) }.
% 0.87/1.24 parent0[1]: (3513) {G0,W6,D3,L2,V1,M2} { true ==> prop( X ), ! bool( X )
% 0.87/1.24 }.
% 0.87/1.24 parent1[0]: (103) {G1,W2,D2,L1,V0,M1} Q(2) { bool( true ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := true
% 0.87/1.24 end
% 0.87/1.24 substitution1:
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 eqswap: (3515) {G1,W4,D3,L1,V0,M1} { prop( true ) ==> true }.
% 0.87/1.24 parent0[0]: (3514) {G1,W4,D3,L1,V0,M1} { true ==> prop( true ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 subsumption: (1034) {G2,W4,D3,L1,V0,M1} R(56,103) { prop( true ) ==> true
% 0.87/1.24 }.
% 0.87/1.24 parent0: (3515) {G1,W4,D3,L1,V0,M1} { prop( true ) ==> true }.
% 0.87/1.24 substitution0:
% 0.87/1.24 end
% 0.87/1.24 permutation0:
% 0.87/1.24 0 ==> 0
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 eqswap: (3517) {G0,W7,D4,L1,V1,M1} { f7( X ) ==> lazy_impl( prop( X ), X )
% 0.87/1.24 }.
% 0.87/1.24 parent0[0]: (94) {G0,W7,D4,L1,V1,M1} I { lazy_impl( prop( X ), X ) ==> f7(
% 0.87/1.24 X ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := X
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 paramod: (3520) {G1,W6,D3,L1,V0,M1} { f7( true ) ==> lazy_impl( true, true
% 0.87/1.24 ) }.
% 0.87/1.24 parent0[0]: (1034) {G2,W4,D3,L1,V0,M1} R(56,103) { prop( true ) ==> true
% 0.87/1.24 }.
% 0.87/1.24 parent1[0; 4]: (3517) {G0,W7,D4,L1,V1,M1} { f7( X ) ==> lazy_impl( prop( X
% 0.87/1.24 ), X ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 end
% 0.87/1.24 substitution1:
% 0.87/1.24 X := true
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 paramod: (3521) {G1,W5,D3,L1,V0,M1} { f7( true ) ==> phi( true ) }.
% 0.87/1.24 parent0[0]: (64) {G0,W6,D3,L1,V1,M1} I { lazy_impl( true, X ) ==> phi( X )
% 0.87/1.24 }.
% 0.87/1.24 parent1[0; 3]: (3520) {G1,W6,D3,L1,V0,M1} { f7( true ) ==> lazy_impl( true
% 0.87/1.24 , true ) }.
% 0.87/1.24 substitution0:
% 0.87/1.24 X := true
% 0.87/1.24 end
% 0.87/1.24 substitution1:
% 0.87/1.24 end
% 0.87/1.24
% 0.87/1.24 paramod: (3522) {G2,W4,D3,L1,V0,M1} { f7( true ) ==> true }.
% 0.87/1.24 parent0[0]: (979) {G2,W4,D3,L1,V0,M1} R(54,135) { phi( true ) ==> true }.
% 0.87/1.28 parent1[0; 3]: (3521) {G1,W5,D3,L1,V0,M1} { f7( true ) ==> phi( true ) }.
% 0.87/1.28 substitution0:
% 0.87/1.28 end
% 0.87/1.28 substitution1:
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 subsumption: (2211) {G3,W4,D3,L1,V0,M1} P(1034,94);d(64);d(979) { f7( true
% 0.87/1.28 ) ==> true }.
% 0.87/1.28 parent0: (3522) {G2,W4,D3,L1,V0,M1} { f7( true ) ==> true }.
% 0.87/1.28 substitution0:
% 0.87/1.28 end
% 0.87/1.28 permutation0:
% 0.87/1.28 0 ==> 0
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 eqswap: (3525) {G0,W7,D4,L1,V1,M1} { f7( X ) ==> lazy_impl( prop( X ), X )
% 0.87/1.28 }.
% 0.87/1.28 parent0[0]: (94) {G0,W7,D4,L1,V1,M1} I { lazy_impl( prop( X ), X ) ==> f7(
% 0.87/1.28 X ) }.
% 0.87/1.28 substitution0:
% 0.87/1.28 X := X
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 paramod: (3528) {G1,W6,D3,L1,V0,M1} { f7( false ) ==> lazy_impl( true,
% 0.87/1.28 false ) }.
% 0.87/1.28 parent0[0]: (1033) {G2,W4,D3,L1,V0,M1} R(56,102) { prop( false ) ==> true
% 0.87/1.28 }.
% 0.87/1.28 parent1[0; 4]: (3525) {G0,W7,D4,L1,V1,M1} { f7( X ) ==> lazy_impl( prop( X
% 0.87/1.28 ), X ) }.
% 0.87/1.28 substitution0:
% 0.87/1.28 end
% 0.87/1.28 substitution1:
% 0.87/1.28 X := false
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 paramod: (3529) {G1,W5,D3,L1,V0,M1} { f7( false ) ==> phi( false ) }.
% 0.87/1.28 parent0[0]: (64) {G0,W6,D3,L1,V1,M1} I { lazy_impl( true, X ) ==> phi( X )
% 0.87/1.28 }.
% 0.87/1.28 parent1[0; 3]: (3528) {G1,W6,D3,L1,V0,M1} { f7( false ) ==> lazy_impl(
% 0.87/1.28 true, false ) }.
% 0.87/1.28 substitution0:
% 0.87/1.28 X := false
% 0.87/1.28 end
% 0.87/1.28 substitution1:
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 paramod: (3530) {G2,W4,D3,L1,V0,M1} { f7( false ) ==> false }.
% 0.87/1.28 parent0[0]: (978) {G2,W4,D3,L1,V0,M1} R(54,136) { phi( false ) ==> false
% 0.87/1.28 }.
% 0.87/1.28 parent1[0; 3]: (3529) {G1,W5,D3,L1,V0,M1} { f7( false ) ==> phi( false )
% 0.87/1.28 }.
% 0.87/1.28 substitution0:
% 0.87/1.28 end
% 0.87/1.28 substitution1:
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 subsumption: (2212) {G3,W4,D3,L1,V0,M1} P(1033,94);d(64);d(978) { f7( false
% 0.87/1.28 ) ==> false }.
% 0.87/1.28 parent0: (3530) {G2,W4,D3,L1,V0,M1} { f7( false ) ==> false }.
% 0.87/1.28 substitution0:
% 0.87/1.28 end
% 0.87/1.28 permutation0:
% 0.87/1.28 0 ==> 0
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 paramod: (3533) {G1,W4,D3,L1,V0,M1} { ! forallprefers( false, f7( skol7 )
% 0.87/1.28 ) }.
% 0.87/1.28 parent0[0]: (2212) {G3,W4,D3,L1,V0,M1} P(1033,94);d(64);d(978) { f7( false
% 0.87/1.28 ) ==> false }.
% 0.87/1.28 parent1[0; 2]: (96) {G0,W5,D3,L1,V1,M1} I { ! forallprefers( f7( X ), f7(
% 0.87/1.28 skol7 ) ) }.
% 0.87/1.28 substitution0:
% 0.87/1.28 end
% 0.87/1.28 substitution1:
% 0.87/1.28 X := false
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 subsumption: (2222) {G4,W4,D3,L1,V0,M1} P(2212,96) { ! forallprefers( false
% 0.87/1.28 , f7( skol7 ) ) }.
% 0.87/1.28 parent0: (3533) {G1,W4,D3,L1,V0,M1} { ! forallprefers( false, f7( skol7 )
% 0.87/1.28 ) }.
% 0.87/1.28 substitution0:
% 0.87/1.28 end
% 0.87/1.28 permutation0:
% 0.87/1.28 0 ==> 0
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 paramod: (3536) {G1,W7,D3,L2,V1,M2} { ! forallprefers( false, true ), !
% 0.87/1.28 alpha9( f7( skol7 ), X ) }.
% 0.87/1.28 parent0[1]: (36) {G0,W6,D2,L2,V2,M2} I { ! alpha9( X, Y ), X = true }.
% 0.87/1.28 parent1[0; 3]: (2222) {G4,W4,D3,L1,V0,M1} P(2212,96) { ! forallprefers(
% 0.87/1.28 false, f7( skol7 ) ) }.
% 0.87/1.28 substitution0:
% 0.87/1.28 X := f7( skol7 )
% 0.87/1.28 Y := X
% 0.87/1.28 end
% 0.87/1.28 substitution1:
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 resolution: (3614) {G2,W4,D3,L1,V1,M1} { ! alpha9( f7( skol7 ), X ) }.
% 0.87/1.28 parent0[0]: (3536) {G1,W7,D3,L2,V1,M2} { ! forallprefers( false, true ), !
% 0.87/1.28 alpha9( f7( skol7 ), X ) }.
% 0.87/1.28 parent1[0]: (165) {G4,W3,D2,L1,V0,M1} R(164,11) { forallprefers( false,
% 0.87/1.28 true ) }.
% 0.87/1.28 substitution0:
% 0.87/1.28 X := X
% 0.87/1.28 end
% 0.87/1.28 substitution1:
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 subsumption: (2229) {G5,W4,D3,L1,V1,M1} P(36,2222);r(165) { ! alpha9( f7(
% 0.87/1.28 skol7 ), X ) }.
% 0.87/1.28 parent0: (3614) {G2,W4,D3,L1,V1,M1} { ! alpha9( f7( skol7 ), X ) }.
% 0.87/1.28 substitution0:
% 0.87/1.28 X := X
% 0.87/1.28 end
% 0.87/1.28 permutation0:
% 0.87/1.28 0 ==> 0
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 *** allocated 75937 integers for termspace/termends
% 0.87/1.28 eqswap: (3615) {G0,W8,D2,L3,V1,M3} { false = X, ! bool( X ), X = true }.
% 0.87/1.28 parent0[1]: (0) {G0,W8,D2,L3,V1,M3} I { ! bool( X ), X = false, X = true
% 0.87/1.28 }.
% 0.87/1.28 substitution0:
% 0.87/1.28 X := X
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 paramod: (3622) {G1,W9,D3,L3,V0,M3} { ! forallprefers( false, f7( true ) )
% 0.87/1.28 , false = skol7, ! bool( skol7 ) }.
% 0.87/1.28 parent0[2]: (3615) {G0,W8,D2,L3,V1,M3} { false = X, ! bool( X ), X = true
% 0.87/1.28 }.
% 0.87/1.28 parent1[0; 4]: (2222) {G4,W4,D3,L1,V0,M1} P(2212,96) { ! forallprefers(
% 0.87/1.28 false, f7( skol7 ) ) }.
% 0.87/1.28 substitution0:
% 0.87/1.28 X := skol7
% 0.87/1.28 end
% 0.87/1.28 substitution1:
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 paramod: (4188) {G2,W8,D2,L3,V0,M3} { ! forallprefers( false, true ),
% 0.87/1.28 false = skol7, ! bool( skol7 ) }.
% 0.87/1.28 parent0[0]: (2211) {G3,W4,D3,L1,V0,M1} P(1034,94);d(64);d(979) { f7( true )
% 0.87/1.28 ==> true }.
% 0.87/1.28 parent1[0; 3]: (3622) {G1,W9,D3,L3,V0,M3} { ! forallprefers( false, f7(
% 0.87/1.28 true ) ), false = skol7, ! bool( skol7 ) }.
% 0.87/1.28 substitution0:
% 0.87/1.28 end
% 0.87/1.28 substitution1:
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 resolution: (4189) {G3,W5,D2,L2,V0,M2} { false = skol7, ! bool( skol7 )
% 0.87/1.28 }.
% 0.87/1.28 parent0[0]: (4188) {G2,W8,D2,L3,V0,M3} { ! forallprefers( false, true ),
% 0.87/1.28 false = skol7, ! bool( skol7 ) }.
% 0.87/1.28 parent1[0]: (165) {G4,W3,D2,L1,V0,M1} R(164,11) { forallprefers( false,
% 0.87/1.28 true ) }.
% 0.87/1.28 substitution0:
% 0.87/1.28 end
% 0.87/1.28 substitution1:
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 eqswap: (4190) {G3,W5,D2,L2,V0,M2} { skol7 = false, ! bool( skol7 ) }.
% 0.87/1.28 parent0[0]: (4189) {G3,W5,D2,L2,V0,M2} { false = skol7, ! bool( skol7 )
% 0.87/1.28 }.
% 0.87/1.28 substitution0:
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 subsumption: (2240) {G5,W5,D2,L2,V0,M2} P(0,2222);d(2211);r(165) { ! bool(
% 0.87/1.28 skol7 ), skol7 ==> false }.
% 0.87/1.28 parent0: (4190) {G3,W5,D2,L2,V0,M2} { skol7 = false, ! bool( skol7 ) }.
% 0.87/1.28 substitution0:
% 0.87/1.28 end
% 0.87/1.28 permutation0:
% 0.87/1.28 0 ==> 1
% 0.87/1.28 1 ==> 0
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 eqswap: (4191) {G0,W9,D2,L3,V2,M3} { ! true = X, ! Y = false, alpha9( X, Y
% 0.87/1.28 ) }.
% 0.87/1.28 parent0[0]: (38) {G0,W9,D2,L3,V2,M3} I { ! X = true, ! Y = false, alpha9( X
% 0.87/1.28 , Y ) }.
% 0.87/1.28 substitution0:
% 0.87/1.28 X := X
% 0.87/1.28 Y := Y
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 resolution: (4194) {G1,W7,D3,L2,V1,M2} { ! true = f7( skol7 ), ! X = false
% 0.87/1.28 }.
% 0.87/1.28 parent0[0]: (2229) {G5,W4,D3,L1,V1,M1} P(36,2222);r(165) { ! alpha9( f7(
% 0.87/1.28 skol7 ), X ) }.
% 0.87/1.28 parent1[2]: (4191) {G0,W9,D2,L3,V2,M3} { ! true = X, ! Y = false, alpha9(
% 0.87/1.28 X, Y ) }.
% 0.87/1.28 substitution0:
% 0.87/1.28 X := X
% 0.87/1.28 end
% 0.87/1.28 substitution1:
% 0.87/1.28 X := f7( skol7 )
% 0.87/1.28 Y := X
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 eqswap: (4195) {G1,W7,D3,L2,V1,M2} { ! f7( skol7 ) = true, ! X = false }.
% 0.87/1.28 parent0[0]: (4194) {G1,W7,D3,L2,V1,M2} { ! true = f7( skol7 ), ! X = false
% 0.87/1.28 }.
% 0.87/1.28 substitution0:
% 0.87/1.28 X := X
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 subsumption: (2275) {G6,W7,D3,L2,V1,M2} R(2229,38) { ! f7( skol7 ) ==> true
% 0.87/1.28 , ! X = false }.
% 0.87/1.28 parent0: (4195) {G1,W7,D3,L2,V1,M2} { ! f7( skol7 ) = true, ! X = false
% 0.87/1.28 }.
% 0.87/1.28 substitution0:
% 0.87/1.28 X := X
% 0.87/1.28 end
% 0.87/1.28 permutation0:
% 0.87/1.28 0 ==> 0
% 0.87/1.28 1 ==> 1
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 eqswap: (4198) {G6,W7,D3,L2,V1,M2} { ! true ==> f7( skol7 ), ! X = false
% 0.87/1.28 }.
% 0.87/1.28 parent0[0]: (2275) {G6,W7,D3,L2,V1,M2} R(2229,38) { ! f7( skol7 ) ==> true
% 0.87/1.28 , ! X = false }.
% 0.87/1.28 substitution0:
% 0.87/1.28 X := X
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 eqrefl: (4201) {G0,W4,D3,L1,V0,M1} { ! true ==> f7( skol7 ) }.
% 0.87/1.28 parent0[1]: (4198) {G6,W7,D3,L2,V1,M2} { ! true ==> f7( skol7 ), ! X =
% 0.87/1.28 false }.
% 0.87/1.28 substitution0:
% 0.87/1.28 X := false
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 eqswap: (4202) {G0,W4,D3,L1,V0,M1} { ! f7( skol7 ) ==> true }.
% 0.87/1.28 parent0[0]: (4201) {G0,W4,D3,L1,V0,M1} { ! true ==> f7( skol7 ) }.
% 0.87/1.28 substitution0:
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 subsumption: (2277) {G7,W4,D3,L1,V0,M1} Q(2275) { ! f7( skol7 ) ==> true
% 0.87/1.28 }.
% 0.87/1.28 parent0: (4202) {G0,W4,D3,L1,V0,M1} { ! f7( skol7 ) ==> true }.
% 0.87/1.28 substitution0:
% 0.87/1.28 end
% 0.87/1.28 permutation0:
% 0.87/1.28 0 ==> 0
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 eqswap: (4204) {G0,W5,D4,L1,V0,M1} { false2 ==> phi( f7( skol7 ) ) }.
% 0.87/1.28 parent0[0]: (95) {G0,W5,D4,L1,V0,M1} I { phi( f7( skol7 ) ) ==> false2 }.
% 0.87/1.28 substitution0:
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 paramod: (4207) {G1,W7,D4,L2,V0,M2} { false2 ==> phi( f7( false ) ), !
% 0.87/1.28 bool( skol7 ) }.
% 0.87/1.28 parent0[1]: (2240) {G5,W5,D2,L2,V0,M2} P(0,2222);d(2211);r(165) { ! bool(
% 0.87/1.28 skol7 ), skol7 ==> false }.
% 0.87/1.28 parent1[0; 4]: (4204) {G0,W5,D4,L1,V0,M1} { false2 ==> phi( f7( skol7 ) )
% 0.87/1.28 }.
% 0.87/1.28 substitution0:
% 0.87/1.28 end
% 0.87/1.28 substitution1:
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 paramod: (4218) {G2,W6,D3,L2,V0,M2} { false2 ==> phi( false ), ! bool(
% 0.87/1.28 skol7 ) }.
% 0.87/1.28 parent0[0]: (2212) {G3,W4,D3,L1,V0,M1} P(1033,94);d(64);d(978) { f7( false
% 0.87/1.28 ) ==> false }.
% 0.87/1.28 parent1[0; 3]: (4207) {G1,W7,D4,L2,V0,M2} { false2 ==> phi( f7( false ) )
% 0.87/1.28 , ! bool( skol7 ) }.
% 0.87/1.28 substitution0:
% 0.87/1.28 end
% 0.87/1.28 substitution1:
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 paramod: (4219) {G3,W5,D2,L2,V0,M2} { false2 ==> false, ! bool( skol7 )
% 0.87/1.28 }.
% 0.87/1.28 parent0[0]: (978) {G2,W4,D3,L1,V0,M1} R(54,136) { phi( false ) ==> false
% 0.87/1.28 }.
% 0.87/1.28 parent1[0; 2]: (4218) {G2,W6,D3,L2,V0,M2} { false2 ==> phi( false ), !
% 0.87/1.28 bool( skol7 ) }.
% 0.87/1.28 substitution0:
% 0.87/1.28 end
% 0.87/1.28 substitution1:
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 subsumption: (2319) {G6,W5,D2,L2,V0,M2} P(2240,95);d(2212);d(978) { ! bool
% 0.87/1.28 ( skol7 ), false2 ==> false }.
% 0.87/1.28 parent0: (4219) {G3,W5,D2,L2,V0,M2} { false2 ==> false, ! bool( skol7 )
% 0.87/1.28 }.
% 0.87/1.28 substitution0:
% 0.87/1.28 end
% 0.87/1.28 permutation0:
% 0.87/1.28 0 ==> 1
% 0.87/1.28 1 ==> 0
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 resolution: (4223) {G2,W2,D2,L1,V0,M1} { ! bool( skol7 ) }.
% 0.87/1.28 parent0[0]: (101) {G1,W3,D2,L1,V0,M1} I;d(93) { ! false2 ==> false }.
% 0.87/1.28 parent1[1]: (2319) {G6,W5,D2,L2,V0,M2} P(2240,95);d(2212);d(978) { ! bool(
% 0.87/1.28 skol7 ), false2 ==> false }.
% 0.87/1.28 substitution0:
% 0.87/1.28 end
% 0.87/1.28 substitution1:
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 subsumption: (2381) {G7,W2,D2,L1,V0,M1} S(2319);r(101) { ! bool( skol7 )
% 0.87/1.28 }.
% 0.87/1.28 parent0: (4223) {G2,W2,D2,L1,V0,M1} { ! bool( skol7 ) }.
% 0.87/1.28 substitution0:
% 0.87/1.28 end
% 0.87/1.28 permutation0:
% 0.87/1.28 0 ==> 0
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 eqswap: (4224) {G0,W6,D3,L2,V1,M2} { false ==> prop( X ), bool( X ) }.
% 0.87/1.28 parent0[1]: (57) {G0,W6,D3,L2,V1,M2} I { bool( X ), prop( X ) ==> false }.
% 0.87/1.28 substitution0:
% 0.87/1.28 X := X
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 resolution: (4225) {G1,W4,D3,L1,V0,M1} { false ==> prop( skol7 ) }.
% 0.87/1.28 parent0[0]: (2381) {G7,W2,D2,L1,V0,M1} S(2319);r(101) { ! bool( skol7 ) }.
% 0.87/1.28 parent1[1]: (4224) {G0,W6,D3,L2,V1,M2} { false ==> prop( X ), bool( X )
% 0.87/1.28 }.
% 0.87/1.28 substitution0:
% 0.87/1.28 end
% 0.87/1.28 substitution1:
% 0.87/1.28 X := skol7
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 eqswap: (4226) {G1,W4,D3,L1,V0,M1} { prop( skol7 ) ==> false }.
% 0.87/1.28 parent0[0]: (4225) {G1,W4,D3,L1,V0,M1} { false ==> prop( skol7 ) }.
% 0.87/1.28 substitution0:
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 subsumption: (2393) {G8,W4,D3,L1,V0,M1} R(2381,57) { prop( skol7 ) ==>
% 0.87/1.28 false }.
% 0.87/1.28 parent0: (4226) {G1,W4,D3,L1,V0,M1} { prop( skol7 ) ==> false }.
% 0.87/1.28 substitution0:
% 0.87/1.28 end
% 0.87/1.28 permutation0:
% 0.87/1.28 0 ==> 0
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 eqswap: (4228) {G0,W7,D4,L1,V1,M1} { f7( X ) ==> lazy_impl( prop( X ), X )
% 0.87/1.28 }.
% 0.87/1.28 parent0[0]: (94) {G0,W7,D4,L1,V1,M1} I { lazy_impl( prop( X ), X ) ==> f7(
% 0.87/1.28 X ) }.
% 0.87/1.28 substitution0:
% 0.87/1.28 X := X
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 paramod: (4230) {G1,W6,D3,L1,V0,M1} { f7( skol7 ) ==> lazy_impl( false,
% 0.87/1.28 skol7 ) }.
% 0.87/1.28 parent0[0]: (2393) {G8,W4,D3,L1,V0,M1} R(2381,57) { prop( skol7 ) ==> false
% 0.87/1.28 }.
% 0.87/1.28 parent1[0; 4]: (4228) {G0,W7,D4,L1,V1,M1} { f7( X ) ==> lazy_impl( prop( X
% 0.87/1.28 ), X ) }.
% 0.87/1.28 substitution0:
% 0.87/1.28 end
% 0.87/1.28 substitution1:
% 0.87/1.28 X := skol7
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 paramod: (4231) {G1,W4,D3,L1,V0,M1} { f7( skol7 ) ==> true }.
% 0.87/1.28 parent0[0]: (63) {G0,W5,D3,L1,V1,M1} I { lazy_impl( false, X ) ==> true }.
% 0.87/1.28 parent1[0; 3]: (4230) {G1,W6,D3,L1,V0,M1} { f7( skol7 ) ==> lazy_impl(
% 0.87/1.28 false, skol7 ) }.
% 0.87/1.28 substitution0:
% 0.87/1.28 X := skol7
% 0.87/1.28 end
% 0.87/1.28 substitution1:
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 subsumption: (2691) {G9,W4,D3,L1,V0,M1} P(2393,94);d(63) { f7( skol7 ) ==>
% 0.87/1.28 true }.
% 0.87/1.28 parent0: (4231) {G1,W4,D3,L1,V0,M1} { f7( skol7 ) ==> true }.
% 0.87/1.28 substitution0:
% 0.87/1.28 end
% 0.87/1.28 permutation0:
% 0.87/1.28 0 ==> 0
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 resolution: (4235) {G8,W0,D0,L0,V0,M0} { }.
% 0.87/1.28 parent0[0]: (2277) {G7,W4,D3,L1,V0,M1} Q(2275) { ! f7( skol7 ) ==> true }.
% 0.87/1.28 parent1[0]: (2691) {G9,W4,D3,L1,V0,M1} P(2393,94);d(63) { f7( skol7 ) ==>
% 0.87/1.28 true }.
% 0.87/1.28 substitution0:
% 0.87/1.28 end
% 0.87/1.28 substitution1:
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 subsumption: (2696) {G10,W0,D0,L0,V0,M0} S(2691);r(2277) { }.
% 0.87/1.28 parent0: (4235) {G8,W0,D0,L0,V0,M0} { }.
% 0.87/1.28 substitution0:
% 0.87/1.28 end
% 0.87/1.28 permutation0:
% 0.87/1.28 end
% 0.87/1.28
% 0.87/1.28 Proof check complete!
% 0.87/1.28
% 0.87/1.28 Memory use:
% 0.87/1.28
% 0.87/1.28 space for terms: 29877
% 0.87/1.28 space for clauses: 124804
% 0.87/1.28
% 0.87/1.28
% 0.87/1.28 clauses generated: 10836
% 0.87/1.28 clauses kept: 2697
% 0.87/1.28 clauses selected: 416
% 0.87/1.28 clauses deleted: 8
% 0.87/1.28 clauses inuse deleted: 2
% 0.87/1.28
% 0.87/1.28 subsentry: 52089
% 0.87/1.28 literals s-matched: 22689
% 0.87/1.28 literals matched: 22629
% 0.87/1.28 full subsumption: 5027
% 0.87/1.28
% 0.87/1.28 checksum: -2109483426
% 0.87/1.28
% 0.87/1.28
% 0.87/1.28 Bliksem ended
%------------------------------------------------------------------------------