TSTP Solution File: ALG201+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : ALG201+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n023.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:54 EDT 2022
% Result : Theorem 0.68s 1.10s
% Output : Refutation 0.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : ALG201+1 : TPTP v8.1.0. Released v2.7.0.
% 0.11/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n023.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 11:30:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.68/1.10 *** allocated 10000 integers for termspace/termends
% 0.68/1.10 *** allocated 10000 integers for clauses
% 0.68/1.10 *** allocated 10000 integers for justifications
% 0.68/1.10 Bliksem 1.12
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 Automatic Strategy Selection
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 Clauses:
% 0.68/1.10
% 0.68/1.10 { ! sorti1( X ), ! sorti1( Y ), sorti1( op1( X, Y ) ) }.
% 0.68/1.10 { ! sorti2( X ), ! sorti2( Y ), sorti2( op2( X, Y ) ) }.
% 0.68/1.10 { ! sorti1( X ), ! op1( X, X ) = X }.
% 0.68/1.10 { sorti2( skol1 ) }.
% 0.68/1.10 { op2( skol1, skol1 ) = skol1 }.
% 0.68/1.10 { ! sorti1( X ), sorti2( h( X ) ) }.
% 0.68/1.10 { ! sorti2( X ), sorti1( j( X ) ) }.
% 0.68/1.10 { ! sorti1( X ), ! sorti1( Y ), h( op1( X, Y ) ) = op2( h( X ), h( Y ) ) }
% 0.68/1.10 .
% 0.68/1.10 { ! sorti2( X ), ! sorti2( Y ), j( op2( X, Y ) ) = op1( j( X ), j( Y ) ) }
% 0.68/1.10 .
% 0.68/1.10 { ! sorti2( X ), h( j( X ) ) = X }.
% 0.68/1.10 { ! sorti1( X ), j( h( X ) ) = X }.
% 0.68/1.10
% 0.68/1.10 percentage equality = 0.250000, percentage horn = 1.000000
% 0.68/1.10 This is a problem with some equality
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 Options Used:
% 0.68/1.10
% 0.68/1.10 useres = 1
% 0.68/1.10 useparamod = 1
% 0.68/1.10 useeqrefl = 1
% 0.68/1.10 useeqfact = 1
% 0.68/1.10 usefactor = 1
% 0.68/1.10 usesimpsplitting = 0
% 0.68/1.10 usesimpdemod = 5
% 0.68/1.10 usesimpres = 3
% 0.68/1.10
% 0.68/1.10 resimpinuse = 1000
% 0.68/1.10 resimpclauses = 20000
% 0.68/1.10 substype = eqrewr
% 0.68/1.10 backwardsubs = 1
% 0.68/1.10 selectoldest = 5
% 0.68/1.10
% 0.68/1.10 litorderings [0] = split
% 0.68/1.10 litorderings [1] = extend the termordering, first sorting on arguments
% 0.68/1.10
% 0.68/1.10 termordering = kbo
% 0.68/1.10
% 0.68/1.10 litapriori = 0
% 0.68/1.10 termapriori = 1
% 0.68/1.10 litaposteriori = 0
% 0.68/1.10 termaposteriori = 0
% 0.68/1.10 demodaposteriori = 0
% 0.68/1.10 ordereqreflfact = 0
% 0.68/1.10
% 0.68/1.10 litselect = negord
% 0.68/1.10
% 0.68/1.10 maxweight = 15
% 0.68/1.10 maxdepth = 30000
% 0.68/1.10 maxlength = 115
% 0.68/1.10 maxnrvars = 195
% 0.68/1.10 excuselevel = 1
% 0.68/1.10 increasemaxweight = 1
% 0.68/1.10
% 0.68/1.10 maxselected = 10000000
% 0.68/1.10 maxnrclauses = 10000000
% 0.68/1.10
% 0.68/1.10 showgenerated = 0
% 0.68/1.10 showkept = 0
% 0.68/1.10 showselected = 0
% 0.68/1.10 showdeleted = 0
% 0.68/1.10 showresimp = 1
% 0.68/1.10 showstatus = 2000
% 0.68/1.10
% 0.68/1.10 prologoutput = 0
% 0.68/1.10 nrgoals = 5000000
% 0.68/1.10 totalproof = 1
% 0.68/1.10
% 0.68/1.10 Symbols occurring in the translation:
% 0.68/1.10
% 0.68/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.68/1.10 . [1, 2] (w:1, o:24, a:1, s:1, b:0),
% 0.68/1.10 ! [4, 1] (w:0, o:15, a:1, s:1, b:0),
% 0.68/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.68/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.68/1.10 sorti1 [36, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.68/1.10 op1 [38, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.68/1.10 sorti2 [39, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.68/1.10 op2 [40, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.68/1.10 h [41, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.68/1.10 j [42, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.68/1.10 skol1 [49, 0] (w:1, o:14, a:1, s:1, b:1).
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 Starting Search:
% 0.68/1.10
% 0.68/1.10 *** allocated 15000 integers for clauses
% 0.68/1.10 *** allocated 22500 integers for clauses
% 0.68/1.10
% 0.68/1.10 Bliksems!, er is een bewijs:
% 0.68/1.10 % SZS status Theorem
% 0.68/1.10 % SZS output start Refutation
% 0.68/1.10
% 0.68/1.10 (2) {G0,W7,D3,L2,V1,M2} I { ! sorti1( X ), ! op1( X, X ) ==> X }.
% 0.68/1.10 (3) {G0,W2,D2,L1,V0,M1} I { sorti2( skol1 ) }.
% 0.68/1.10 (4) {G0,W5,D3,L1,V0,M1} I { op2( skol1, skol1 ) ==> skol1 }.
% 0.68/1.10 (5) {G0,W5,D3,L2,V1,M2} I { ! sorti1( X ), sorti2( h( X ) ) }.
% 0.68/1.10 (6) {G0,W5,D3,L2,V1,M2} I { ! sorti2( X ), sorti1( j( X ) ) }.
% 0.68/1.10 (8) {G0,W14,D4,L3,V2,M3} I { ! sorti2( X ), ! sorti2( Y ), op1( j( X ), j(
% 0.68/1.10 Y ) ) ==> j( op2( X, Y ) ) }.
% 0.68/1.10 (9) {G0,W7,D4,L2,V1,M2} I { ! sorti2( X ), h( j( X ) ) ==> X }.
% 0.68/1.10 (10) {G0,W7,D4,L2,V1,M2} I { ! sorti1( X ), j( h( X ) ) ==> X }.
% 0.68/1.10 (14) {G1,W12,D4,L2,V1,M2} F(8) { ! sorti2( X ), op1( j( X ), j( X ) ) ==> j
% 0.68/1.10 ( op2( X, X ) ) }.
% 0.68/1.10 (15) {G1,W3,D3,L1,V0,M1} R(6,3) { sorti1( j( skol1 ) ) }.
% 0.68/1.10 (16) {G2,W4,D4,L1,V0,M1} R(5,15) { sorti2( h( j( skol1 ) ) ) }.
% 0.68/1.10 (33) {G3,W5,D5,L1,V0,M1} R(16,6) { sorti1( j( h( j( skol1 ) ) ) ) }.
% 0.68/1.10 (36) {G4,W6,D6,L1,V0,M1} R(33,5) { sorti2( h( j( h( j( skol1 ) ) ) ) ) }.
% 0.68/1.10 (99) {G2,W8,D4,L1,V0,M1} R(2,15) { ! op1( j( skol1 ), j( skol1 ) ) ==> j(
% 0.68/1.10 skol1 ) }.
% 0.68/1.10 (246) {G4,W11,D7,L1,V0,M1} R(10,33) { j( h( j( h( j( skol1 ) ) ) ) ) ==> j
% 0.68/1.10 ( h( j( skol1 ) ) ) }.
% 0.68/1.10 (257) {G1,W5,D4,L1,V0,M1} R(9,3) { h( j( skol1 ) ) ==> skol1 }.
% 0.68/1.10 (261) {G5,W0,D0,L0,V0,M0} R(14,36);d(246);d(257);d(257);d(4);r(99) { }.
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 % SZS output end Refutation
% 0.68/1.10 found a proof!
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 Unprocessed initial clauses:
% 0.68/1.10
% 0.68/1.10 (263) {G0,W8,D3,L3,V2,M3} { ! sorti1( X ), ! sorti1( Y ), sorti1( op1( X,
% 0.68/1.10 Y ) ) }.
% 0.68/1.10 (264) {G0,W8,D3,L3,V2,M3} { ! sorti2( X ), ! sorti2( Y ), sorti2( op2( X,
% 0.68/1.10 Y ) ) }.
% 0.68/1.10 (265) {G0,W7,D3,L2,V1,M2} { ! sorti1( X ), ! op1( X, X ) = X }.
% 0.68/1.10 (266) {G0,W2,D2,L1,V0,M1} { sorti2( skol1 ) }.
% 0.68/1.10 (267) {G0,W5,D3,L1,V0,M1} { op2( skol1, skol1 ) = skol1 }.
% 0.68/1.10 (268) {G0,W5,D3,L2,V1,M2} { ! sorti1( X ), sorti2( h( X ) ) }.
% 0.68/1.10 (269) {G0,W5,D3,L2,V1,M2} { ! sorti2( X ), sorti1( j( X ) ) }.
% 0.68/1.10 (270) {G0,W14,D4,L3,V2,M3} { ! sorti1( X ), ! sorti1( Y ), h( op1( X, Y )
% 0.68/1.10 ) = op2( h( X ), h( Y ) ) }.
% 0.68/1.10 (271) {G0,W14,D4,L3,V2,M3} { ! sorti2( X ), ! sorti2( Y ), j( op2( X, Y )
% 0.68/1.10 ) = op1( j( X ), j( Y ) ) }.
% 0.68/1.10 (272) {G0,W7,D4,L2,V1,M2} { ! sorti2( X ), h( j( X ) ) = X }.
% 0.68/1.10 (273) {G0,W7,D4,L2,V1,M2} { ! sorti1( X ), j( h( X ) ) = X }.
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 Total Proof:
% 0.68/1.10
% 0.68/1.10 subsumption: (2) {G0,W7,D3,L2,V1,M2} I { ! sorti1( X ), ! op1( X, X ) ==> X
% 0.68/1.10 }.
% 0.68/1.10 parent0: (265) {G0,W7,D3,L2,V1,M2} { ! sorti1( X ), ! op1( X, X ) = X }.
% 0.68/1.10 substitution0:
% 0.68/1.10 X := X
% 0.68/1.10 end
% 0.68/1.10 permutation0:
% 0.68/1.10 0 ==> 0
% 0.68/1.10 1 ==> 1
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 subsumption: (3) {G0,W2,D2,L1,V0,M1} I { sorti2( skol1 ) }.
% 0.68/1.10 parent0: (266) {G0,W2,D2,L1,V0,M1} { sorti2( skol1 ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 end
% 0.68/1.10 permutation0:
% 0.68/1.10 0 ==> 0
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 subsumption: (4) {G0,W5,D3,L1,V0,M1} I { op2( skol1, skol1 ) ==> skol1 }.
% 0.68/1.10 parent0: (267) {G0,W5,D3,L1,V0,M1} { op2( skol1, skol1 ) = skol1 }.
% 0.68/1.10 substitution0:
% 0.68/1.10 end
% 0.68/1.10 permutation0:
% 0.68/1.10 0 ==> 0
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 subsumption: (5) {G0,W5,D3,L2,V1,M2} I { ! sorti1( X ), sorti2( h( X ) )
% 0.68/1.10 }.
% 0.68/1.10 parent0: (268) {G0,W5,D3,L2,V1,M2} { ! sorti1( X ), sorti2( h( X ) ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 X := X
% 0.68/1.10 end
% 0.68/1.10 permutation0:
% 0.68/1.10 0 ==> 0
% 0.68/1.10 1 ==> 1
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 subsumption: (6) {G0,W5,D3,L2,V1,M2} I { ! sorti2( X ), sorti1( j( X ) )
% 0.68/1.10 }.
% 0.68/1.10 parent0: (269) {G0,W5,D3,L2,V1,M2} { ! sorti2( X ), sorti1( j( X ) ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 X := X
% 0.68/1.10 end
% 0.68/1.10 permutation0:
% 0.68/1.10 0 ==> 0
% 0.68/1.10 1 ==> 1
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 eqswap: (299) {G0,W14,D4,L3,V2,M3} { op1( j( X ), j( Y ) ) = j( op2( X, Y
% 0.68/1.10 ) ), ! sorti2( X ), ! sorti2( Y ) }.
% 0.68/1.10 parent0[2]: (271) {G0,W14,D4,L3,V2,M3} { ! sorti2( X ), ! sorti2( Y ), j(
% 0.68/1.10 op2( X, Y ) ) = op1( j( X ), j( Y ) ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 X := X
% 0.68/1.10 Y := Y
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 subsumption: (8) {G0,W14,D4,L3,V2,M3} I { ! sorti2( X ), ! sorti2( Y ), op1
% 0.68/1.10 ( j( X ), j( Y ) ) ==> j( op2( X, Y ) ) }.
% 0.68/1.10 parent0: (299) {G0,W14,D4,L3,V2,M3} { op1( j( X ), j( Y ) ) = j( op2( X, Y
% 0.68/1.10 ) ), ! sorti2( X ), ! sorti2( Y ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 X := X
% 0.68/1.10 Y := Y
% 0.68/1.10 end
% 0.68/1.10 permutation0:
% 0.68/1.10 0 ==> 2
% 0.68/1.10 1 ==> 0
% 0.68/1.10 2 ==> 1
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 subsumption: (9) {G0,W7,D4,L2,V1,M2} I { ! sorti2( X ), h( j( X ) ) ==> X
% 0.68/1.10 }.
% 0.68/1.10 parent0: (272) {G0,W7,D4,L2,V1,M2} { ! sorti2( X ), h( j( X ) ) = X }.
% 0.68/1.10 substitution0:
% 0.68/1.10 X := X
% 0.68/1.10 end
% 0.68/1.10 permutation0:
% 0.68/1.10 0 ==> 0
% 0.68/1.10 1 ==> 1
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 subsumption: (10) {G0,W7,D4,L2,V1,M2} I { ! sorti1( X ), j( h( X ) ) ==> X
% 0.68/1.10 }.
% 0.68/1.10 parent0: (273) {G0,W7,D4,L2,V1,M2} { ! sorti1( X ), j( h( X ) ) = X }.
% 0.68/1.10 substitution0:
% 0.68/1.10 X := X
% 0.68/1.10 end
% 0.68/1.10 permutation0:
% 0.68/1.10 0 ==> 0
% 0.68/1.10 1 ==> 1
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 factor: (326) {G0,W12,D4,L2,V1,M2} { ! sorti2( X ), op1( j( X ), j( X ) )
% 0.68/1.10 ==> j( op2( X, X ) ) }.
% 0.68/1.10 parent0[0, 1]: (8) {G0,W14,D4,L3,V2,M3} I { ! sorti2( X ), ! sorti2( Y ),
% 0.68/1.10 op1( j( X ), j( Y ) ) ==> j( op2( X, Y ) ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 X := X
% 0.68/1.10 Y := X
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 subsumption: (14) {G1,W12,D4,L2,V1,M2} F(8) { ! sorti2( X ), op1( j( X ), j
% 0.68/1.10 ( X ) ) ==> j( op2( X, X ) ) }.
% 0.68/1.10 parent0: (326) {G0,W12,D4,L2,V1,M2} { ! sorti2( X ), op1( j( X ), j( X ) )
% 0.68/1.10 ==> j( op2( X, X ) ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 X := X
% 0.68/1.10 end
% 0.68/1.10 permutation0:
% 0.68/1.10 0 ==> 0
% 0.68/1.10 1 ==> 1
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 resolution: (328) {G1,W3,D3,L1,V0,M1} { sorti1( j( skol1 ) ) }.
% 0.68/1.10 parent0[0]: (6) {G0,W5,D3,L2,V1,M2} I { ! sorti2( X ), sorti1( j( X ) ) }.
% 0.68/1.10 parent1[0]: (3) {G0,W2,D2,L1,V0,M1} I { sorti2( skol1 ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 X := skol1
% 0.68/1.10 end
% 0.68/1.10 substitution1:
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 subsumption: (15) {G1,W3,D3,L1,V0,M1} R(6,3) { sorti1( j( skol1 ) ) }.
% 0.68/1.10 parent0: (328) {G1,W3,D3,L1,V0,M1} { sorti1( j( skol1 ) ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 end
% 0.68/1.10 permutation0:
% 0.68/1.10 0 ==> 0
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 resolution: (329) {G1,W4,D4,L1,V0,M1} { sorti2( h( j( skol1 ) ) ) }.
% 0.68/1.10 parent0[0]: (5) {G0,W5,D3,L2,V1,M2} I { ! sorti1( X ), sorti2( h( X ) ) }.
% 0.68/1.10 parent1[0]: (15) {G1,W3,D3,L1,V0,M1} R(6,3) { sorti1( j( skol1 ) ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 X := j( skol1 )
% 0.68/1.10 end
% 0.68/1.10 substitution1:
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 subsumption: (16) {G2,W4,D4,L1,V0,M1} R(5,15) { sorti2( h( j( skol1 ) ) )
% 0.68/1.10 }.
% 0.68/1.10 parent0: (329) {G1,W4,D4,L1,V0,M1} { sorti2( h( j( skol1 ) ) ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 end
% 0.68/1.10 permutation0:
% 0.68/1.10 0 ==> 0
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 resolution: (330) {G1,W5,D5,L1,V0,M1} { sorti1( j( h( j( skol1 ) ) ) ) }.
% 0.68/1.10 parent0[0]: (6) {G0,W5,D3,L2,V1,M2} I { ! sorti2( X ), sorti1( j( X ) ) }.
% 0.68/1.10 parent1[0]: (16) {G2,W4,D4,L1,V0,M1} R(5,15) { sorti2( h( j( skol1 ) ) )
% 0.68/1.10 }.
% 0.68/1.10 substitution0:
% 0.68/1.10 X := h( j( skol1 ) )
% 0.68/1.10 end
% 0.68/1.10 substitution1:
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 subsumption: (33) {G3,W5,D5,L1,V0,M1} R(16,6) { sorti1( j( h( j( skol1 ) )
% 0.68/1.10 ) ) }.
% 0.68/1.10 parent0: (330) {G1,W5,D5,L1,V0,M1} { sorti1( j( h( j( skol1 ) ) ) ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 end
% 0.68/1.10 permutation0:
% 0.68/1.10 0 ==> 0
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 resolution: (331) {G1,W6,D6,L1,V0,M1} { sorti2( h( j( h( j( skol1 ) ) ) )
% 0.68/1.10 ) }.
% 0.68/1.10 parent0[0]: (5) {G0,W5,D3,L2,V1,M2} I { ! sorti1( X ), sorti2( h( X ) ) }.
% 0.68/1.10 parent1[0]: (33) {G3,W5,D5,L1,V0,M1} R(16,6) { sorti1( j( h( j( skol1 ) ) )
% 0.68/1.10 ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 X := j( h( j( skol1 ) ) )
% 0.68/1.10 end
% 0.68/1.10 substitution1:
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 subsumption: (36) {G4,W6,D6,L1,V0,M1} R(33,5) { sorti2( h( j( h( j( skol1 )
% 0.68/1.10 ) ) ) ) }.
% 0.68/1.10 parent0: (331) {G1,W6,D6,L1,V0,M1} { sorti2( h( j( h( j( skol1 ) ) ) ) )
% 0.68/1.10 }.
% 0.68/1.10 substitution0:
% 0.68/1.10 end
% 0.68/1.10 permutation0:
% 0.68/1.10 0 ==> 0
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 eqswap: (332) {G0,W7,D3,L2,V1,M2} { ! X ==> op1( X, X ), ! sorti1( X ) }.
% 0.68/1.10 parent0[1]: (2) {G0,W7,D3,L2,V1,M2} I { ! sorti1( X ), ! op1( X, X ) ==> X
% 0.68/1.10 }.
% 0.68/1.10 substitution0:
% 0.68/1.10 X := X
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 resolution: (333) {G1,W8,D4,L1,V0,M1} { ! j( skol1 ) ==> op1( j( skol1 ),
% 0.68/1.10 j( skol1 ) ) }.
% 0.68/1.10 parent0[1]: (332) {G0,W7,D3,L2,V1,M2} { ! X ==> op1( X, X ), ! sorti1( X )
% 0.68/1.10 }.
% 0.68/1.10 parent1[0]: (15) {G1,W3,D3,L1,V0,M1} R(6,3) { sorti1( j( skol1 ) ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 X := j( skol1 )
% 0.68/1.10 end
% 0.68/1.10 substitution1:
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 eqswap: (334) {G1,W8,D4,L1,V0,M1} { ! op1( j( skol1 ), j( skol1 ) ) ==> j
% 0.68/1.10 ( skol1 ) }.
% 0.68/1.10 parent0[0]: (333) {G1,W8,D4,L1,V0,M1} { ! j( skol1 ) ==> op1( j( skol1 ),
% 0.68/1.10 j( skol1 ) ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 subsumption: (99) {G2,W8,D4,L1,V0,M1} R(2,15) { ! op1( j( skol1 ), j( skol1
% 0.68/1.10 ) ) ==> j( skol1 ) }.
% 0.68/1.10 parent0: (334) {G1,W8,D4,L1,V0,M1} { ! op1( j( skol1 ), j( skol1 ) ) ==> j
% 0.68/1.10 ( skol1 ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 end
% 0.68/1.10 permutation0:
% 0.68/1.10 0 ==> 0
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 eqswap: (335) {G0,W7,D4,L2,V1,M2} { X ==> j( h( X ) ), ! sorti1( X ) }.
% 0.68/1.10 parent0[1]: (10) {G0,W7,D4,L2,V1,M2} I { ! sorti1( X ), j( h( X ) ) ==> X
% 0.68/1.10 }.
% 0.68/1.10 substitution0:
% 0.68/1.10 X := X
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 resolution: (336) {G1,W11,D7,L1,V0,M1} { j( h( j( skol1 ) ) ) ==> j( h( j
% 0.68/1.10 ( h( j( skol1 ) ) ) ) ) }.
% 0.68/1.10 parent0[1]: (335) {G0,W7,D4,L2,V1,M2} { X ==> j( h( X ) ), ! sorti1( X )
% 0.68/1.10 }.
% 0.68/1.10 parent1[0]: (33) {G3,W5,D5,L1,V0,M1} R(16,6) { sorti1( j( h( j( skol1 ) ) )
% 0.68/1.10 ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 X := j( h( j( skol1 ) ) )
% 0.68/1.10 end
% 0.68/1.10 substitution1:
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 eqswap: (337) {G1,W11,D7,L1,V0,M1} { j( h( j( h( j( skol1 ) ) ) ) ) ==> j
% 0.68/1.10 ( h( j( skol1 ) ) ) }.
% 0.68/1.10 parent0[0]: (336) {G1,W11,D7,L1,V0,M1} { j( h( j( skol1 ) ) ) ==> j( h( j
% 0.68/1.10 ( h( j( skol1 ) ) ) ) ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 subsumption: (246) {G4,W11,D7,L1,V0,M1} R(10,33) { j( h( j( h( j( skol1 ) )
% 0.68/1.10 ) ) ) ==> j( h( j( skol1 ) ) ) }.
% 0.68/1.10 parent0: (337) {G1,W11,D7,L1,V0,M1} { j( h( j( h( j( skol1 ) ) ) ) ) ==> j
% 0.68/1.10 ( h( j( skol1 ) ) ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 end
% 0.68/1.10 permutation0:
% 0.68/1.10 0 ==> 0
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 eqswap: (338) {G0,W7,D4,L2,V1,M2} { X ==> h( j( X ) ), ! sorti2( X ) }.
% 0.68/1.10 parent0[1]: (9) {G0,W7,D4,L2,V1,M2} I { ! sorti2( X ), h( j( X ) ) ==> X
% 0.68/1.10 }.
% 0.68/1.10 substitution0:
% 0.68/1.10 X := X
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 resolution: (339) {G1,W5,D4,L1,V0,M1} { skol1 ==> h( j( skol1 ) ) }.
% 0.68/1.10 parent0[1]: (338) {G0,W7,D4,L2,V1,M2} { X ==> h( j( X ) ), ! sorti2( X )
% 0.68/1.10 }.
% 0.68/1.10 parent1[0]: (3) {G0,W2,D2,L1,V0,M1} I { sorti2( skol1 ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 X := skol1
% 0.68/1.10 end
% 0.68/1.10 substitution1:
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 eqswap: (340) {G1,W5,D4,L1,V0,M1} { h( j( skol1 ) ) ==> skol1 }.
% 0.68/1.10 parent0[0]: (339) {G1,W5,D4,L1,V0,M1} { skol1 ==> h( j( skol1 ) ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 subsumption: (257) {G1,W5,D4,L1,V0,M1} R(9,3) { h( j( skol1 ) ) ==> skol1
% 0.68/1.10 }.
% 0.68/1.10 parent0: (340) {G1,W5,D4,L1,V0,M1} { h( j( skol1 ) ) ==> skol1 }.
% 0.68/1.10 substitution0:
% 0.68/1.10 end
% 0.68/1.10 permutation0:
% 0.68/1.10 0 ==> 0
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 eqswap: (341) {G1,W12,D4,L2,V1,M2} { j( op2( X, X ) ) ==> op1( j( X ), j(
% 0.68/1.10 X ) ), ! sorti2( X ) }.
% 0.68/1.10 parent0[1]: (14) {G1,W12,D4,L2,V1,M2} F(8) { ! sorti2( X ), op1( j( X ), j
% 0.68/1.10 ( X ) ) ==> j( op2( X, X ) ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 X := X
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 eqswap: (346) {G2,W8,D4,L1,V0,M1} { ! j( skol1 ) ==> op1( j( skol1 ), j(
% 0.68/1.10 skol1 ) ) }.
% 0.68/1.10 parent0[0]: (99) {G2,W8,D4,L1,V0,M1} R(2,15) { ! op1( j( skol1 ), j( skol1
% 0.68/1.10 ) ) ==> j( skol1 ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 resolution: (347) {G2,W26,D8,L1,V0,M1} { j( op2( h( j( h( j( skol1 ) ) ) )
% 0.68/1.10 , h( j( h( j( skol1 ) ) ) ) ) ) ==> op1( j( h( j( h( j( skol1 ) ) ) ) ),
% 0.68/1.10 j( h( j( h( j( skol1 ) ) ) ) ) ) }.
% 0.68/1.10 parent0[1]: (341) {G1,W12,D4,L2,V1,M2} { j( op2( X, X ) ) ==> op1( j( X )
% 0.68/1.10 , j( X ) ), ! sorti2( X ) }.
% 0.68/1.10 parent1[0]: (36) {G4,W6,D6,L1,V0,M1} R(33,5) { sorti2( h( j( h( j( skol1 )
% 0.68/1.10 ) ) ) ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 X := h( j( h( j( skol1 ) ) ) )
% 0.68/1.10 end
% 0.68/1.10 substitution1:
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 paramod: (349) {G3,W24,D8,L1,V0,M1} { j( op2( h( j( h( j( skol1 ) ) ) ), h
% 0.68/1.10 ( j( h( j( skol1 ) ) ) ) ) ) ==> op1( j( h( j( h( j( skol1 ) ) ) ) ), j(
% 0.68/1.10 h( j( skol1 ) ) ) ) }.
% 0.68/1.10 parent0[0]: (246) {G4,W11,D7,L1,V0,M1} R(10,33) { j( h( j( h( j( skol1 ) )
% 0.68/1.10 ) ) ) ==> j( h( j( skol1 ) ) ) }.
% 0.68/1.10 parent1[0; 20]: (347) {G2,W26,D8,L1,V0,M1} { j( op2( h( j( h( j( skol1 ) )
% 0.68/1.10 ) ), h( j( h( j( skol1 ) ) ) ) ) ) ==> op1( j( h( j( h( j( skol1 ) ) ) )
% 0.68/1.10 ), j( h( j( h( j( skol1 ) ) ) ) ) ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 end
% 0.68/1.10 substitution1:
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 paramod: (354) {G2,W22,D8,L1,V0,M1} { j( op2( h( j( h( j( skol1 ) ) ) ), h
% 0.68/1.10 ( j( h( j( skol1 ) ) ) ) ) ) ==> op1( j( h( j( h( j( skol1 ) ) ) ) ), j(
% 0.68/1.10 skol1 ) ) }.
% 0.68/1.10 parent0[0]: (257) {G1,W5,D4,L1,V0,M1} R(9,3) { h( j( skol1 ) ) ==> skol1
% 0.68/1.10 }.
% 0.68/1.10 parent1[0; 21]: (349) {G3,W24,D8,L1,V0,M1} { j( op2( h( j( h( j( skol1 ) )
% 0.68/1.10 ) ), h( j( h( j( skol1 ) ) ) ) ) ) ==> op1( j( h( j( h( j( skol1 ) ) ) )
% 0.68/1.10 ), j( h( j( skol1 ) ) ) ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 end
% 0.68/1.10 substitution1:
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 paramod: (371) {G2,W20,D8,L1,V0,M1} { j( op2( h( j( h( j( skol1 ) ) ) ), h
% 0.68/1.10 ( j( h( j( skol1 ) ) ) ) ) ) ==> op1( j( h( j( skol1 ) ) ), j( skol1 ) )
% 0.68/1.10 }.
% 0.68/1.10 parent0[0]: (257) {G1,W5,D4,L1,V0,M1} R(9,3) { h( j( skol1 ) ) ==> skol1
% 0.68/1.10 }.
% 0.68/1.10 parent1[0; 17]: (354) {G2,W22,D8,L1,V0,M1} { j( op2( h( j( h( j( skol1 ) )
% 0.68/1.10 ) ), h( j( h( j( skol1 ) ) ) ) ) ) ==> op1( j( h( j( h( j( skol1 ) ) ) )
% 0.68/1.10 ), j( skol1 ) ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 end
% 0.68/1.10 substitution1:
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 paramod: (374) {G2,W18,D8,L1,V0,M1} { j( op2( h( j( h( j( skol1 ) ) ) ), h
% 0.68/1.10 ( j( h( j( skol1 ) ) ) ) ) ) ==> op1( j( skol1 ), j( skol1 ) ) }.
% 0.68/1.10 parent0[0]: (257) {G1,W5,D4,L1,V0,M1} R(9,3) { h( j( skol1 ) ) ==> skol1
% 0.68/1.10 }.
% 0.68/1.10 parent1[0; 15]: (371) {G2,W20,D8,L1,V0,M1} { j( op2( h( j( h( j( skol1 ) )
% 0.68/1.10 ) ), h( j( h( j( skol1 ) ) ) ) ) ) ==> op1( j( h( j( skol1 ) ) ), j(
% 0.68/1.10 skol1 ) ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 end
% 0.68/1.10 substitution1:
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 paramod: (376) {G2,W16,D8,L1,V0,M1} { j( op2( h( j( h( j( skol1 ) ) ) ), h
% 0.68/1.10 ( j( skol1 ) ) ) ) ==> op1( j( skol1 ), j( skol1 ) ) }.
% 0.68/1.10 parent0[0]: (257) {G1,W5,D4,L1,V0,M1} R(9,3) { h( j( skol1 ) ) ==> skol1
% 0.68/1.10 }.
% 0.68/1.10 parent1[0; 10]: (374) {G2,W18,D8,L1,V0,M1} { j( op2( h( j( h( j( skol1 ) )
% 0.68/1.10 ) ), h( j( h( j( skol1 ) ) ) ) ) ) ==> op1( j( skol1 ), j( skol1 ) ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 end
% 0.68/1.10 substitution1:
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 paramod: (378) {G2,W14,D8,L1,V0,M1} { j( op2( h( j( h( j( skol1 ) ) ) ),
% 0.68/1.10 skol1 ) ) ==> op1( j( skol1 ), j( skol1 ) ) }.
% 0.68/1.10 parent0[0]: (257) {G1,W5,D4,L1,V0,M1} R(9,3) { h( j( skol1 ) ) ==> skol1
% 0.68/1.10 }.
% 0.68/1.10 parent1[0; 8]: (376) {G2,W16,D8,L1,V0,M1} { j( op2( h( j( h( j( skol1 ) )
% 0.68/1.10 ) ), h( j( skol1 ) ) ) ) ==> op1( j( skol1 ), j( skol1 ) ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 end
% 0.68/1.10 substitution1:
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 paramod: (379) {G2,W12,D6,L1,V0,M1} { j( op2( h( j( skol1 ) ), skol1 ) )
% 0.68/1.10 ==> op1( j( skol1 ), j( skol1 ) ) }.
% 0.68/1.10 parent0[0]: (257) {G1,W5,D4,L1,V0,M1} R(9,3) { h( j( skol1 ) ) ==> skol1
% 0.68/1.10 }.
% 0.68/1.10 parent1[0; 5]: (378) {G2,W14,D8,L1,V0,M1} { j( op2( h( j( h( j( skol1 ) )
% 0.68/1.10 ) ), skol1 ) ) ==> op1( j( skol1 ), j( skol1 ) ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 end
% 0.68/1.10 substitution1:
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 paramod: (380) {G2,W10,D4,L1,V0,M1} { j( op2( skol1, skol1 ) ) ==> op1( j
% 0.68/1.10 ( skol1 ), j( skol1 ) ) }.
% 0.68/1.10 parent0[0]: (257) {G1,W5,D4,L1,V0,M1} R(9,3) { h( j( skol1 ) ) ==> skol1
% 0.68/1.10 }.
% 0.68/1.10 parent1[0; 3]: (379) {G2,W12,D6,L1,V0,M1} { j( op2( h( j( skol1 ) ), skol1
% 0.68/1.10 ) ) ==> op1( j( skol1 ), j( skol1 ) ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 end
% 0.68/1.10 substitution1:
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 paramod: (383) {G1,W8,D4,L1,V0,M1} { j( skol1 ) ==> op1( j( skol1 ), j(
% 0.68/1.10 skol1 ) ) }.
% 0.68/1.10 parent0[0]: (4) {G0,W5,D3,L1,V0,M1} I { op2( skol1, skol1 ) ==> skol1 }.
% 0.68/1.10 parent1[0; 2]: (380) {G2,W10,D4,L1,V0,M1} { j( op2( skol1, skol1 ) ) ==>
% 0.68/1.10 op1( j( skol1 ), j( skol1 ) ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 end
% 0.68/1.10 substitution1:
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 resolution: (384) {G2,W0,D0,L0,V0,M0} { }.
% 0.68/1.10 parent0[0]: (346) {G2,W8,D4,L1,V0,M1} { ! j( skol1 ) ==> op1( j( skol1 ),
% 0.68/1.10 j( skol1 ) ) }.
% 0.68/1.10 parent1[0]: (383) {G1,W8,D4,L1,V0,M1} { j( skol1 ) ==> op1( j( skol1 ), j
% 0.68/1.10 ( skol1 ) ) }.
% 0.68/1.10 substitution0:
% 0.68/1.10 end
% 0.68/1.10 substitution1:
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 subsumption: (261) {G5,W0,D0,L0,V0,M0} R(14,36);d(246);d(257);d(257);d(4);r
% 0.68/1.10 (99) { }.
% 0.68/1.10 parent0: (384) {G2,W0,D0,L0,V0,M0} { }.
% 0.68/1.10 substitution0:
% 0.68/1.10 end
% 0.68/1.10 permutation0:
% 0.68/1.10 end
% 0.68/1.10
% 0.68/1.10 Proof check complete!
% 0.68/1.10
% 0.68/1.10 Memory use:
% 0.68/1.10
% 0.68/1.10 space for terms: 3172
% 0.68/1.10 space for clauses: 17634
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 clauses generated: 474
% 0.68/1.10 clauses kept: 262
% 0.68/1.10 clauses selected: 33
% 0.68/1.10 clauses deleted: 3
% 0.68/1.10 clauses inuse deleted: 0
% 0.68/1.10
% 0.68/1.10 subsentry: 1267
% 0.68/1.10 literals s-matched: 441
% 0.68/1.10 literals matched: 441
% 0.68/1.10 full subsumption: 106
% 0.68/1.10
% 0.68/1.10 checksum: 608603927
% 0.68/1.10
% 0.68/1.10
% 0.68/1.10 Bliksem ended
%------------------------------------------------------------------------------