TSTP Solution File: ALG069+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : ALG069+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n017.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 : Thu Jul 14 12:09:22 EDT 2022
% Result : Theorem 0.72s 1.09s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : ALG069+1 : TPTP v8.1.0. Released v2.7.0.
% 0.03/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n017.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Wed Jun 8 16:10:03 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.72/1.09 *** allocated 10000 integers for termspace/termends
% 0.72/1.09 *** allocated 10000 integers for clauses
% 0.72/1.09 *** allocated 10000 integers for justifications
% 0.72/1.09 Bliksem 1.12
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 Automatic Strategy Selection
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 Clauses:
% 0.72/1.09
% 0.72/1.09 { ! sorti1( X ), ! sorti1( Y ), sorti1( op1( X, Y ) ) }.
% 0.72/1.09 { ! sorti2( X ), ! sorti2( Y ), sorti2( op2( X, Y ) ) }.
% 0.72/1.09 { ! sorti1( X ), sorti1( skol1( Y ) ) }.
% 0.72/1.09 { ! sorti1( X ), op1( skol1( X ), skol1( X ) ) = X }.
% 0.72/1.09 { sorti2( skol2 ) }.
% 0.72/1.09 { ! sorti2( X ), ! op2( X, X ) = skol2 }.
% 0.72/1.09 { ! sorti1( X ), sorti2( h( X ) ) }.
% 0.72/1.09 { ! sorti2( X ), sorti1( j( X ) ) }.
% 0.72/1.09 { ! sorti1( X ), ! sorti1( Y ), h( op1( X, Y ) ) = op2( h( X ), h( Y ) ) }
% 0.72/1.09 .
% 0.72/1.09 { ! sorti2( X ), ! sorti2( Y ), j( op2( X, Y ) ) = op1( j( X ), j( Y ) ) }
% 0.72/1.09 .
% 0.72/1.09 { ! sorti2( X ), h( j( X ) ) = X }.
% 0.72/1.09 { ! sorti1( X ), j( h( X ) ) = X }.
% 0.72/1.09
% 0.72/1.09 percentage equality = 0.222222, percentage horn = 1.000000
% 0.72/1.09 This is a problem with some equality
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 Options Used:
% 0.72/1.09
% 0.72/1.09 useres = 1
% 0.72/1.09 useparamod = 1
% 0.72/1.09 useeqrefl = 1
% 0.72/1.09 useeqfact = 1
% 0.72/1.09 usefactor = 1
% 0.72/1.09 usesimpsplitting = 0
% 0.72/1.09 usesimpdemod = 5
% 0.72/1.09 usesimpres = 3
% 0.72/1.09
% 0.72/1.09 resimpinuse = 1000
% 0.72/1.09 resimpclauses = 20000
% 0.72/1.09 substype = eqrewr
% 0.72/1.09 backwardsubs = 1
% 0.72/1.09 selectoldest = 5
% 0.72/1.09
% 0.72/1.09 litorderings [0] = split
% 0.72/1.09 litorderings [1] = extend the termordering, first sorting on arguments
% 0.72/1.09
% 0.72/1.09 termordering = kbo
% 0.72/1.09
% 0.72/1.09 litapriori = 0
% 0.72/1.09 termapriori = 1
% 0.72/1.09 litaposteriori = 0
% 0.72/1.09 termaposteriori = 0
% 0.72/1.09 demodaposteriori = 0
% 0.72/1.09 ordereqreflfact = 0
% 0.72/1.09
% 0.72/1.09 litselect = negord
% 0.72/1.09
% 0.72/1.09 maxweight = 15
% 0.72/1.09 maxdepth = 30000
% 0.72/1.09 maxlength = 115
% 0.72/1.09 maxnrvars = 195
% 0.72/1.09 excuselevel = 1
% 0.72/1.09 increasemaxweight = 1
% 0.72/1.09
% 0.72/1.09 maxselected = 10000000
% 0.72/1.09 maxnrclauses = 10000000
% 0.72/1.09
% 0.72/1.09 showgenerated = 0
% 0.72/1.09 showkept = 0
% 0.72/1.09 showselected = 0
% 0.72/1.09 showdeleted = 0
% 0.72/1.09 showresimp = 1
% 0.72/1.09 showstatus = 2000
% 0.72/1.09
% 0.72/1.09 prologoutput = 0
% 0.72/1.09 nrgoals = 5000000
% 0.72/1.09 totalproof = 1
% 0.72/1.09
% 0.72/1.09 Symbols occurring in the translation:
% 0.72/1.09
% 0.72/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.72/1.09 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 0.72/1.09 ! [4, 1] (w:0, o:15, a:1, s:1, b:0),
% 0.72/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.72/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.72/1.09 sorti1 [36, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.72/1.09 op1 [38, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.72/1.09 sorti2 [39, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.72/1.09 op2 [40, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.72/1.09 h [41, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.72/1.09 j [42, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.72/1.09 skol1 [49, 1] (w:1, o:24, a:1, s:1, b:1),
% 0.72/1.09 skol2 [50, 0] (w:1, o:14, a:1, s:1, b:1).
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 Starting Search:
% 0.72/1.09
% 0.72/1.09 *** allocated 15000 integers for clauses
% 0.72/1.09 *** allocated 22500 integers for clauses
% 0.72/1.09 *** allocated 33750 integers for clauses
% 0.72/1.09 *** allocated 50625 integers for clauses
% 0.72/1.09 *** allocated 15000 integers for termspace/termends
% 0.72/1.09 *** allocated 75937 integers for clauses
% 0.72/1.09
% 0.72/1.09 Bliksems!, er is een bewijs:
% 0.72/1.09 % SZS status Theorem
% 0.72/1.09 % SZS output start Refutation
% 0.72/1.09
% 0.72/1.09 (2) {G0,W5,D3,L2,V2,M2} I { ! sorti1( X ), sorti1( skol1( Y ) ) }.
% 0.72/1.09 (3) {G0,W9,D4,L2,V1,M2} I { ! sorti1( X ), op1( skol1( X ), skol1( X ) )
% 0.72/1.09 ==> X }.
% 0.72/1.09 (4) {G0,W2,D2,L1,V0,M1} I { sorti2( skol2 ) }.
% 0.72/1.09 (5) {G0,W7,D3,L2,V1,M2} I { ! sorti2( X ), ! op2( X, X ) ==> skol2 }.
% 0.72/1.09 (6) {G0,W5,D3,L2,V1,M2} I { ! sorti1( X ), sorti2( h( X ) ) }.
% 0.72/1.09 (7) {G0,W5,D3,L2,V1,M2} I { ! sorti2( X ), sorti1( j( X ) ) }.
% 0.72/1.09 (8) {G0,W14,D4,L3,V2,M3} I { ! sorti1( X ), ! sorti1( Y ), op2( h( X ), h(
% 0.72/1.09 Y ) ) ==> h( op1( X, Y ) ) }.
% 0.72/1.09 (10) {G0,W7,D4,L2,V1,M2} I { ! sorti2( X ), h( j( X ) ) ==> X }.
% 0.72/1.09 (14) {G1,W12,D4,L2,V1,M2} F(8) { ! sorti1( X ), op2( h( X ), h( X ) ) ==> h
% 0.72/1.09 ( op1( X, X ) ) }.
% 0.72/1.09 (17) {G1,W3,D3,L1,V0,M1} R(7,4) { sorti1( j( skol2 ) ) }.
% 0.72/1.09 (18) {G2,W3,D3,L1,V1,M1} R(17,2) { sorti1( skol1( X ) ) }.
% 0.72/1.09 (126) {G2,W8,D4,L2,V1,M2} R(5,6);d(14) { ! sorti1( X ), ! h( op1( X, X ) )
% 0.72/1.09 ==> skol2 }.
% 0.72/1.09 (229) {G1,W5,D4,L1,V0,M1} R(10,4) { h( j( skol2 ) ) ==> skol2 }.
% 0.72/1.09 (992) {G3,W6,D3,L2,V1,M2} P(3,126);r(18) { ! h( X ) ==> skol2, ! sorti1( X
% 0.72/1.09 ) }.
% 0.72/1.09 (1013) {G4,W0,D0,L0,V0,M0} R(992,229);r(17) { }.
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 % SZS output end Refutation
% 0.72/1.09 found a proof!
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 Unprocessed initial clauses:
% 0.72/1.09
% 0.72/1.09 (1015) {G0,W8,D3,L3,V2,M3} { ! sorti1( X ), ! sorti1( Y ), sorti1( op1( X
% 0.72/1.09 , Y ) ) }.
% 0.72/1.09 (1016) {G0,W8,D3,L3,V2,M3} { ! sorti2( X ), ! sorti2( Y ), sorti2( op2( X
% 0.72/1.09 , Y ) ) }.
% 0.72/1.09 (1017) {G0,W5,D3,L2,V2,M2} { ! sorti1( X ), sorti1( skol1( Y ) ) }.
% 0.72/1.09 (1018) {G0,W9,D4,L2,V1,M2} { ! sorti1( X ), op1( skol1( X ), skol1( X ) )
% 0.72/1.09 = X }.
% 0.72/1.09 (1019) {G0,W2,D2,L1,V0,M1} { sorti2( skol2 ) }.
% 0.72/1.09 (1020) {G0,W7,D3,L2,V1,M2} { ! sorti2( X ), ! op2( X, X ) = skol2 }.
% 0.72/1.09 (1021) {G0,W5,D3,L2,V1,M2} { ! sorti1( X ), sorti2( h( X ) ) }.
% 0.72/1.09 (1022) {G0,W5,D3,L2,V1,M2} { ! sorti2( X ), sorti1( j( X ) ) }.
% 0.72/1.09 (1023) {G0,W14,D4,L3,V2,M3} { ! sorti1( X ), ! sorti1( Y ), h( op1( X, Y )
% 0.72/1.09 ) = op2( h( X ), h( Y ) ) }.
% 0.72/1.09 (1024) {G0,W14,D4,L3,V2,M3} { ! sorti2( X ), ! sorti2( Y ), j( op2( X, Y )
% 0.72/1.09 ) = op1( j( X ), j( Y ) ) }.
% 0.72/1.09 (1025) {G0,W7,D4,L2,V1,M2} { ! sorti2( X ), h( j( X ) ) = X }.
% 0.72/1.09 (1026) {G0,W7,D4,L2,V1,M2} { ! sorti1( X ), j( h( X ) ) = X }.
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 Total Proof:
% 0.72/1.09
% 0.72/1.09 subsumption: (2) {G0,W5,D3,L2,V2,M2} I { ! sorti1( X ), sorti1( skol1( Y )
% 0.72/1.09 ) }.
% 0.72/1.09 parent0: (1017) {G0,W5,D3,L2,V2,M2} { ! sorti1( X ), sorti1( skol1( Y ) )
% 0.72/1.09 }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := X
% 0.72/1.09 Y := Y
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 0 ==> 0
% 0.72/1.09 1 ==> 1
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 subsumption: (3) {G0,W9,D4,L2,V1,M2} I { ! sorti1( X ), op1( skol1( X ),
% 0.72/1.09 skol1( X ) ) ==> X }.
% 0.72/1.09 parent0: (1018) {G0,W9,D4,L2,V1,M2} { ! sorti1( X ), op1( skol1( X ),
% 0.72/1.09 skol1( X ) ) = X }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := X
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 0 ==> 0
% 0.72/1.09 1 ==> 1
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 subsumption: (4) {G0,W2,D2,L1,V0,M1} I { sorti2( skol2 ) }.
% 0.72/1.09 parent0: (1019) {G0,W2,D2,L1,V0,M1} { sorti2( skol2 ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 0 ==> 0
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 subsumption: (5) {G0,W7,D3,L2,V1,M2} I { ! sorti2( X ), ! op2( X, X ) ==>
% 0.72/1.09 skol2 }.
% 0.72/1.09 parent0: (1020) {G0,W7,D3,L2,V1,M2} { ! sorti2( X ), ! op2( X, X ) = skol2
% 0.72/1.09 }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := X
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 0 ==> 0
% 0.72/1.09 1 ==> 1
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 subsumption: (6) {G0,W5,D3,L2,V1,M2} I { ! sorti1( X ), sorti2( h( X ) )
% 0.72/1.09 }.
% 0.72/1.09 parent0: (1021) {G0,W5,D3,L2,V1,M2} { ! sorti1( X ), sorti2( h( X ) ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := X
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 0 ==> 0
% 0.72/1.09 1 ==> 1
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 subsumption: (7) {G0,W5,D3,L2,V1,M2} I { ! sorti2( X ), sorti1( j( X ) )
% 0.72/1.09 }.
% 0.72/1.09 parent0: (1022) {G0,W5,D3,L2,V1,M2} { ! sorti2( X ), sorti1( j( X ) ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := X
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 0 ==> 0
% 0.72/1.09 1 ==> 1
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 eqswap: (1051) {G0,W14,D4,L3,V2,M3} { op2( h( X ), h( Y ) ) = h( op1( X, Y
% 0.72/1.09 ) ), ! sorti1( X ), ! sorti1( Y ) }.
% 0.72/1.09 parent0[2]: (1023) {G0,W14,D4,L3,V2,M3} { ! sorti1( X ), ! sorti1( Y ), h
% 0.72/1.09 ( op1( X, Y ) ) = op2( h( X ), h( Y ) ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := X
% 0.72/1.09 Y := Y
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 subsumption: (8) {G0,W14,D4,L3,V2,M3} I { ! sorti1( X ), ! sorti1( Y ), op2
% 0.72/1.09 ( h( X ), h( Y ) ) ==> h( op1( X, Y ) ) }.
% 0.72/1.09 parent0: (1051) {G0,W14,D4,L3,V2,M3} { op2( h( X ), h( Y ) ) = h( op1( X,
% 0.72/1.09 Y ) ), ! sorti1( X ), ! sorti1( Y ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := X
% 0.72/1.09 Y := Y
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 0 ==> 2
% 0.72/1.09 1 ==> 0
% 0.72/1.09 2 ==> 1
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 subsumption: (10) {G0,W7,D4,L2,V1,M2} I { ! sorti2( X ), h( j( X ) ) ==> X
% 0.72/1.09 }.
% 0.72/1.09 parent0: (1025) {G0,W7,D4,L2,V1,M2} { ! sorti2( X ), h( j( X ) ) = X }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := X
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 0 ==> 0
% 0.72/1.09 1 ==> 1
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 factor: (1066) {G0,W12,D4,L2,V1,M2} { ! sorti1( X ), op2( h( X ), h( X ) )
% 0.72/1.09 ==> h( op1( X, X ) ) }.
% 0.72/1.09 parent0[0, 1]: (8) {G0,W14,D4,L3,V2,M3} I { ! sorti1( X ), ! sorti1( Y ),
% 0.72/1.09 op2( h( X ), h( Y ) ) ==> h( op1( X, Y ) ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := X
% 0.72/1.09 Y := X
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 subsumption: (14) {G1,W12,D4,L2,V1,M2} F(8) { ! sorti1( X ), op2( h( X ), h
% 0.72/1.09 ( X ) ) ==> h( op1( X, X ) ) }.
% 0.72/1.09 parent0: (1066) {G0,W12,D4,L2,V1,M2} { ! sorti1( X ), op2( h( X ), h( X )
% 0.72/1.09 ) ==> h( op1( X, X ) ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := X
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 0 ==> 0
% 0.72/1.09 1 ==> 1
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 resolution: (1068) {G1,W3,D3,L1,V0,M1} { sorti1( j( skol2 ) ) }.
% 0.72/1.09 parent0[0]: (7) {G0,W5,D3,L2,V1,M2} I { ! sorti2( X ), sorti1( j( X ) ) }.
% 0.72/1.09 parent1[0]: (4) {G0,W2,D2,L1,V0,M1} I { sorti2( skol2 ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := skol2
% 0.72/1.09 end
% 0.72/1.09 substitution1:
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 subsumption: (17) {G1,W3,D3,L1,V0,M1} R(7,4) { sorti1( j( skol2 ) ) }.
% 0.72/1.09 parent0: (1068) {G1,W3,D3,L1,V0,M1} { sorti1( j( skol2 ) ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 0 ==> 0
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 resolution: (1069) {G1,W3,D3,L1,V1,M1} { sorti1( skol1( X ) ) }.
% 0.72/1.09 parent0[0]: (2) {G0,W5,D3,L2,V2,M2} I { ! sorti1( X ), sorti1( skol1( Y ) )
% 0.72/1.09 }.
% 0.72/1.09 parent1[0]: (17) {G1,W3,D3,L1,V0,M1} R(7,4) { sorti1( j( skol2 ) ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := j( skol2 )
% 0.72/1.09 Y := X
% 0.72/1.09 end
% 0.72/1.09 substitution1:
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 subsumption: (18) {G2,W3,D3,L1,V1,M1} R(17,2) { sorti1( skol1( X ) ) }.
% 0.72/1.09 parent0: (1069) {G1,W3,D3,L1,V1,M1} { sorti1( skol1( X ) ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := X
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 0 ==> 0
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 eqswap: (1070) {G0,W7,D3,L2,V1,M2} { ! skol2 ==> op2( X, X ), ! sorti2( X
% 0.72/1.09 ) }.
% 0.72/1.09 parent0[1]: (5) {G0,W7,D3,L2,V1,M2} I { ! sorti2( X ), ! op2( X, X ) ==>
% 0.72/1.09 skol2 }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := X
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 resolution: (1072) {G1,W9,D4,L2,V1,M2} { ! skol2 ==> op2( h( X ), h( X ) )
% 0.72/1.09 , ! sorti1( X ) }.
% 0.72/1.09 parent0[1]: (1070) {G0,W7,D3,L2,V1,M2} { ! skol2 ==> op2( X, X ), ! sorti2
% 0.72/1.09 ( X ) }.
% 0.72/1.09 parent1[1]: (6) {G0,W5,D3,L2,V1,M2} I { ! sorti1( X ), sorti2( h( X ) ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := h( X )
% 0.72/1.09 end
% 0.72/1.09 substitution1:
% 0.72/1.09 X := X
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 paramod: (1073) {G2,W10,D4,L3,V1,M3} { ! skol2 ==> h( op1( X, X ) ), !
% 0.72/1.09 sorti1( X ), ! sorti1( X ) }.
% 0.72/1.09 parent0[1]: (14) {G1,W12,D4,L2,V1,M2} F(8) { ! sorti1( X ), op2( h( X ), h
% 0.72/1.09 ( X ) ) ==> h( op1( X, X ) ) }.
% 0.72/1.09 parent1[0; 3]: (1072) {G1,W9,D4,L2,V1,M2} { ! skol2 ==> op2( h( X ), h( X
% 0.72/1.09 ) ), ! sorti1( X ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := X
% 0.72/1.09 end
% 0.72/1.09 substitution1:
% 0.72/1.09 X := X
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 eqswap: (1074) {G2,W10,D4,L3,V1,M3} { ! h( op1( X, X ) ) ==> skol2, !
% 0.72/1.09 sorti1( X ), ! sorti1( X ) }.
% 0.72/1.09 parent0[0]: (1073) {G2,W10,D4,L3,V1,M3} { ! skol2 ==> h( op1( X, X ) ), !
% 0.72/1.09 sorti1( X ), ! sorti1( X ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := X
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 factor: (1075) {G2,W8,D4,L2,V1,M2} { ! h( op1( X, X ) ) ==> skol2, !
% 0.72/1.09 sorti1( X ) }.
% 0.72/1.09 parent0[1, 2]: (1074) {G2,W10,D4,L3,V1,M3} { ! h( op1( X, X ) ) ==> skol2
% 0.72/1.09 , ! sorti1( X ), ! sorti1( X ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := X
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 subsumption: (126) {G2,W8,D4,L2,V1,M2} R(5,6);d(14) { ! sorti1( X ), ! h(
% 0.72/1.09 op1( X, X ) ) ==> skol2 }.
% 0.72/1.09 parent0: (1075) {G2,W8,D4,L2,V1,M2} { ! h( op1( X, X ) ) ==> skol2, !
% 0.72/1.09 sorti1( X ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := X
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 0 ==> 1
% 0.72/1.09 1 ==> 0
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 eqswap: (1077) {G0,W7,D4,L2,V1,M2} { X ==> h( j( X ) ), ! sorti2( X ) }.
% 0.72/1.09 parent0[1]: (10) {G0,W7,D4,L2,V1,M2} I { ! sorti2( X ), h( j( X ) ) ==> X
% 0.72/1.09 }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := X
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 resolution: (1078) {G1,W5,D4,L1,V0,M1} { skol2 ==> h( j( skol2 ) ) }.
% 0.72/1.09 parent0[1]: (1077) {G0,W7,D4,L2,V1,M2} { X ==> h( j( X ) ), ! sorti2( X )
% 0.72/1.09 }.
% 0.72/1.09 parent1[0]: (4) {G0,W2,D2,L1,V0,M1} I { sorti2( skol2 ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := skol2
% 0.72/1.09 end
% 0.72/1.09 substitution1:
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 eqswap: (1079) {G1,W5,D4,L1,V0,M1} { h( j( skol2 ) ) ==> skol2 }.
% 0.72/1.09 parent0[0]: (1078) {G1,W5,D4,L1,V0,M1} { skol2 ==> h( j( skol2 ) ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 subsumption: (229) {G1,W5,D4,L1,V0,M1} R(10,4) { h( j( skol2 ) ) ==> skol2
% 0.72/1.09 }.
% 0.72/1.09 parent0: (1079) {G1,W5,D4,L1,V0,M1} { h( j( skol2 ) ) ==> skol2 }.
% 0.72/1.09 substitution0:
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 0 ==> 0
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 eqswap: (1081) {G2,W8,D4,L2,V1,M2} { ! skol2 ==> h( op1( X, X ) ), !
% 0.72/1.09 sorti1( X ) }.
% 0.72/1.09 parent0[1]: (126) {G2,W8,D4,L2,V1,M2} R(5,6);d(14) { ! sorti1( X ), ! h(
% 0.72/1.09 op1( X, X ) ) ==> skol2 }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := X
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 paramod: (1082) {G1,W9,D3,L3,V1,M3} { ! skol2 ==> h( X ), ! sorti1( X ), !
% 0.72/1.09 sorti1( skol1( X ) ) }.
% 0.72/1.09 parent0[1]: (3) {G0,W9,D4,L2,V1,M2} I { ! sorti1( X ), op1( skol1( X ),
% 0.72/1.09 skol1( X ) ) ==> X }.
% 0.72/1.09 parent1[0; 4]: (1081) {G2,W8,D4,L2,V1,M2} { ! skol2 ==> h( op1( X, X ) ),
% 0.72/1.09 ! sorti1( X ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := X
% 0.72/1.09 end
% 0.72/1.09 substitution1:
% 0.72/1.09 X := skol1( X )
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 resolution: (1083) {G2,W6,D3,L2,V1,M2} { ! skol2 ==> h( X ), ! sorti1( X )
% 0.72/1.09 }.
% 0.72/1.09 parent0[2]: (1082) {G1,W9,D3,L3,V1,M3} { ! skol2 ==> h( X ), ! sorti1( X )
% 0.72/1.09 , ! sorti1( skol1( X ) ) }.
% 0.72/1.09 parent1[0]: (18) {G2,W3,D3,L1,V1,M1} R(17,2) { sorti1( skol1( X ) ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := X
% 0.72/1.09 end
% 0.72/1.09 substitution1:
% 0.72/1.09 X := X
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 eqswap: (1084) {G2,W6,D3,L2,V1,M2} { ! h( X ) ==> skol2, ! sorti1( X ) }.
% 0.72/1.09 parent0[0]: (1083) {G2,W6,D3,L2,V1,M2} { ! skol2 ==> h( X ), ! sorti1( X )
% 0.72/1.09 }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := X
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 subsumption: (992) {G3,W6,D3,L2,V1,M2} P(3,126);r(18) { ! h( X ) ==> skol2
% 0.72/1.09 , ! sorti1( X ) }.
% 0.72/1.09 parent0: (1084) {G2,W6,D3,L2,V1,M2} { ! h( X ) ==> skol2, ! sorti1( X )
% 0.72/1.09 }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := X
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 0 ==> 0
% 0.72/1.09 1 ==> 1
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 eqswap: (1085) {G3,W6,D3,L2,V1,M2} { ! skol2 ==> h( X ), ! sorti1( X ) }.
% 0.72/1.09 parent0[0]: (992) {G3,W6,D3,L2,V1,M2} P(3,126);r(18) { ! h( X ) ==> skol2,
% 0.72/1.09 ! sorti1( X ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := X
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 eqswap: (1086) {G1,W5,D4,L1,V0,M1} { skol2 ==> h( j( skol2 ) ) }.
% 0.72/1.09 parent0[0]: (229) {G1,W5,D4,L1,V0,M1} R(10,4) { h( j( skol2 ) ) ==> skol2
% 0.72/1.09 }.
% 0.72/1.09 substitution0:
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 resolution: (1087) {G2,W3,D3,L1,V0,M1} { ! sorti1( j( skol2 ) ) }.
% 0.72/1.09 parent0[0]: (1085) {G3,W6,D3,L2,V1,M2} { ! skol2 ==> h( X ), ! sorti1( X )
% 0.72/1.09 }.
% 0.72/1.09 parent1[0]: (1086) {G1,W5,D4,L1,V0,M1} { skol2 ==> h( j( skol2 ) ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 X := j( skol2 )
% 0.72/1.09 end
% 0.72/1.09 substitution1:
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 resolution: (1088) {G2,W0,D0,L0,V0,M0} { }.
% 0.72/1.09 parent0[0]: (1087) {G2,W3,D3,L1,V0,M1} { ! sorti1( j( skol2 ) ) }.
% 0.72/1.09 parent1[0]: (17) {G1,W3,D3,L1,V0,M1} R(7,4) { sorti1( j( skol2 ) ) }.
% 0.72/1.09 substitution0:
% 0.72/1.09 end
% 0.72/1.09 substitution1:
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 subsumption: (1013) {G4,W0,D0,L0,V0,M0} R(992,229);r(17) { }.
% 0.72/1.09 parent0: (1088) {G2,W0,D0,L0,V0,M0} { }.
% 0.72/1.09 substitution0:
% 0.72/1.09 end
% 0.72/1.09 permutation0:
% 0.72/1.09 end
% 0.72/1.09
% 0.72/1.09 Proof check complete!
% 0.72/1.09
% 0.72/1.09 Memory use:
% 0.72/1.09
% 0.72/1.09 space for terms: 13236
% 0.72/1.09 space for clauses: 62195
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 clauses generated: 1980
% 0.72/1.09 clauses kept: 1014
% 0.72/1.09 clauses selected: 70
% 0.72/1.09 clauses deleted: 8
% 0.72/1.09 clauses inuse deleted: 0
% 0.72/1.09
% 0.72/1.09 subsentry: 4747
% 0.72/1.09 literals s-matched: 1971
% 0.72/1.09 literals matched: 1971
% 0.72/1.09 full subsumption: 910
% 0.72/1.09
% 0.72/1.09 checksum: 739535250
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 Bliksem ended
%------------------------------------------------------------------------------