%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN351+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n020.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 21 02:49:57 EDT 2022
% Result : Theorem 0.72s 1.11s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SYN351+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n020.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 : Tue Jul 12 06:28:42 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.72/1.11 *** allocated 10000 integers for termspace/termends
% 0.72/1.11 *** allocated 10000 integers for clauses
% 0.72/1.11 *** allocated 10000 integers for justifications
% 0.72/1.11 Bliksem 1.12
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 Automatic Strategy Selection
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 Clauses:
% 0.72/1.11
% 0.72/1.11 { big_f( skol1, X, skol1, skol3( X, Z ) ) }.
% 0.72/1.11 { ! big_f( skol1, Y, skol1, X ), big_f( Y, skol2, Y, X ) }.
% 0.72/1.11 { ! big_f( Y, skol2, Y, X ), big_f( skol1, Y, skol1, X ) }.
% 0.72/1.11 { big_f( skol1, Y, skol1, X ) }.
% 0.72/1.11 { alpha2( skol1, X, Y, skol3( X, Y ) ), big_f( skol1, skol3( X, Y ), Y,
% 0.72/1.11 skol3( X, Y ) ) }.
% 0.72/1.11 { alpha2( skol1, X, Y, skol3( X, Y ) ), alpha1( skol1, X, Y ) }.
% 0.72/1.11 { ! alpha2( X, Y, Z, T ), big_f( X, Y, Z, Y ) }.
% 0.72/1.11 { ! alpha2( X, Y, Z, T ), ! big_f( X, T, Z, T ) }.
% 0.72/1.11 { ! big_f( X, Y, Z, Y ), big_f( X, T, Z, T ), alpha2( X, Y, Z, T ) }.
% 0.72/1.11 { ! alpha1( X, Y, Z ), alpha3( X, Y, Z ), big_f( X, Y, Z, Y ) }.
% 0.72/1.11 { ! alpha1( X, Y, Z ), alpha3( X, Y, Z ), ! big_f( X, Z, X, Y ) }.
% 0.72/1.11 { ! alpha3( X, Y, Z ), alpha1( X, Y, Z ) }.
% 0.72/1.11 { ! big_f( X, Y, Z, Y ), big_f( X, Z, X, Y ), alpha1( X, Y, Z ) }.
% 0.72/1.11 { ! alpha3( X, Y, Z ), big_f( X, Z, X, Y ) }.
% 0.72/1.11 { ! alpha3( X, Y, Z ), ! big_f( X, Y, Z, Y ) }.
% 0.72/1.11 { ! big_f( X, Z, X, Y ), big_f( X, Y, Z, Y ), alpha3( X, Y, Z ) }.
% 0.72/1.11
% 0.72/1.11 percentage equality = 0.000000, percentage horn = 0.625000
% 0.72/1.11 This a non-horn, non-equality problem
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 Options Used:
% 0.72/1.11
% 0.72/1.11 useres = 1
% 0.72/1.11 useparamod = 0
% 0.72/1.11 useeqrefl = 0
% 0.72/1.11 useeqfact = 0
% 0.72/1.11 usefactor = 1
% 0.72/1.11 usesimpsplitting = 0
% 0.72/1.11 usesimpdemod = 0
% 0.72/1.11 usesimpres = 3
% 0.72/1.11
% 0.72/1.11 resimpinuse = 1000
% 0.72/1.11 resimpclauses = 20000
% 0.72/1.11 substype = standard
% 0.72/1.11 backwardsubs = 1
% 0.72/1.11 selectoldest = 5
% 0.72/1.11
% 0.72/1.11 litorderings [0] = split
% 0.72/1.11 litorderings [1] = liftord
% 0.72/1.11
% 0.72/1.11 termordering = none
% 0.72/1.11
% 0.72/1.11 litapriori = 1
% 0.72/1.11 termapriori = 0
% 0.72/1.11 litaposteriori = 0
% 0.72/1.11 termaposteriori = 0
% 0.72/1.11 demodaposteriori = 0
% 0.72/1.11 ordereqreflfact = 0
% 0.72/1.11
% 0.72/1.11 litselect = none
% 0.72/1.11
% 0.72/1.11 maxweight = 15
% 0.72/1.11 maxdepth = 30000
% 0.72/1.11 maxlength = 115
% 0.72/1.11 maxnrvars = 195
% 0.72/1.11 excuselevel = 1
% 0.72/1.11 increasemaxweight = 1
% 0.72/1.11
% 0.72/1.11 maxselected = 10000000
% 0.72/1.11 maxnrclauses = 10000000
% 0.72/1.11
% 0.72/1.11 showgenerated = 0
% 0.72/1.11 showkept = 0
% 0.72/1.11 showselected = 0
% 0.72/1.11 showdeleted = 0
% 0.72/1.11 showresimp = 1
% 0.72/1.11 showstatus = 2000
% 0.72/1.11
% 0.72/1.11 prologoutput = 0
% 0.72/1.11 nrgoals = 5000000
% 0.72/1.11 totalproof = 1
% 0.72/1.11
% 0.72/1.11 Symbols occurring in the translation:
% 0.72/1.11
% 0.72/1.11 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.72/1.11 . [1, 2] (w:1, o:18, a:1, s:1, b:0),
% 0.72/1.11 ! [4, 1] (w:0, o:13, a:1, s:1, b:0),
% 0.72/1.11 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.72/1.11 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.72/1.11 big_f [40, 4] (w:1, o:46, a:1, s:1, b:0),
% 0.72/1.11 alpha1 [41, 3] (w:1, o:43, a:1, s:1, b:0),
% 0.72/1.11 alpha2 [42, 4] (w:1, o:45, a:1, s:1, b:0),
% 0.72/1.11 alpha3 [43, 3] (w:1, o:44, a:1, s:1, b:0),
% 0.72/1.11 skol1 [44, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.72/1.11 skol2 [45, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.72/1.11 skol3 [46, 2] (w:1, o:42, a:1, s:1, b:0).
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 Starting Search:
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 Bliksems!, er is een bewijs:
% 0.72/1.11 % SZS status Theorem
% 0.72/1.11 % SZS output start Refutation
% 0.72/1.11
% 0.72/1.11 (3) {G0,W5,D2,L1,V2,M1} I { big_f( skol1, Y, skol1, X ) }.
% 0.72/1.11 (5) {G0,W11,D3,L2,V2,M1} I { alpha1( skol1, X, Y ), alpha2( skol1, X, Y,
% 0.72/1.11 skol3( X, Y ) ) }.
% 0.72/1.11 (7) {G0,W10,D2,L2,V4,M1} I { ! alpha2( X, Y, Z, T ), ! big_f( X, T, Z, T )
% 0.72/1.11 }.
% 0.72/1.11 (9) {G0,W13,D2,L3,V3,M1} I { ! alpha1( X, Y, Z ), alpha3( X, Y, Z ), big_f
% 0.72/1.11 ( X, Y, Z, Y ) }.
% 0.72/1.11 (10) {G0,W13,D2,L3,V3,M1} I { ! alpha1( X, Y, Z ), alpha3( X, Y, Z ), !
% 0.72/1.11 big_f( X, Z, X, Y ) }.
% 0.72/1.11 (13) {G0,W9,D2,L2,V3,M1} I { ! alpha3( X, Y, Z ), big_f( X, Z, X, Y ) }.
% 0.72/1.11 (14) {G0,W9,D2,L2,V3,M1} I { ! alpha3( X, Y, Z ), ! big_f( X, Y, Z, Y ) }.
% 0.72/1.11 (19) {G1,W8,D2,L2,V2,M2} R(13,14) { ! alpha3( X, Y, X ), ! alpha3( X, Y, Y
% 0.72/1.11 ) }.
% 0.72/1.11 (20) {G2,W4,D2,L1,V1,M1} F(19) { ! alpha3( X, X, X ) }.
% 0.72/1.11 (23) {G1,W5,D2,L1,V2,M1} R(7,3) { ! alpha2( skol1, X, skol1, Y ) }.
% 0.72/1.11 (30) {G2,W4,D2,L1,V1,M1} R(5,23) { alpha1( skol1, X, skol1 ) }.
% 0.72/1.11 (47) {G1,W16,D2,L4,V2,M2} R(10,9) { ! alpha1( X, Y, Y ), ! alpha1( X, Y, X
% 0.72/1.11 ), alpha3( X, Y, X ), alpha3( X, Y, Y ) }.
% 0.72/1.11 (53) {G3,W4,D2,L1,V1,M1} F(47);f;r(20) { ! alpha1( X, X, X ) }.
% 0.72/1.11 (63) {G4,W0,D0,L0,V0,M0} R(53,30) { }.
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 % SZS output end Refutation
% 0.72/1.11 found a proof!
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 Unprocessed initial clauses:
% 0.72/1.11
% 0.72/1.11 (65) {G0,W7,D3,L1,V2,M1} { big_f( skol1, X, skol1, skol3( X, Z ) ) }.
% 0.72/1.11 (66) {G0,W10,D2,L2,V2,M2} { ! big_f( skol1, Y, skol1, X ), big_f( Y, skol2
% 0.72/1.11 , Y, X ) }.
% 0.72/1.11 (67) {G0,W10,D2,L2,V2,M2} { ! big_f( Y, skol2, Y, X ), big_f( skol1, Y,
% 0.72/1.11 skol1, X ) }.
% 0.72/1.11 (68) {G0,W5,D2,L1,V2,M1} { big_f( skol1, Y, skol1, X ) }.
% 0.72/1.11 (69) {G0,W16,D3,L2,V2,M2} { alpha2( skol1, X, Y, skol3( X, Y ) ), big_f(
% 0.72/1.11 skol1, skol3( X, Y ), Y, skol3( X, Y ) ) }.
% 0.72/1.11 (70) {G0,W11,D3,L2,V2,M2} { alpha2( skol1, X, Y, skol3( X, Y ) ), alpha1(
% 0.72/1.11 skol1, X, Y ) }.
% 0.72/1.11 (71) {G0,W10,D2,L2,V4,M2} { ! alpha2( X, Y, Z, T ), big_f( X, Y, Z, Y )
% 0.72/1.11 }.
% 0.72/1.11 (72) {G0,W10,D2,L2,V4,M2} { ! alpha2( X, Y, Z, T ), ! big_f( X, T, Z, T )
% 0.72/1.11 }.
% 0.72/1.11 (73) {G0,W15,D2,L3,V4,M3} { ! big_f( X, Y, Z, Y ), big_f( X, T, Z, T ),
% 0.72/1.11 alpha2( X, Y, Z, T ) }.
% 0.72/1.11 (74) {G0,W13,D2,L3,V3,M3} { ! alpha1( X, Y, Z ), alpha3( X, Y, Z ), big_f
% 0.72/1.11 ( X, Y, Z, Y ) }.
% 0.72/1.11 (75) {G0,W13,D2,L3,V3,M3} { ! alpha1( X, Y, Z ), alpha3( X, Y, Z ), !
% 0.72/1.11 big_f( X, Z, X, Y ) }.
% 0.72/1.11 (76) {G0,W8,D2,L2,V3,M2} { ! alpha3( X, Y, Z ), alpha1( X, Y, Z ) }.
% 0.72/1.11 (77) {G0,W14,D2,L3,V3,M3} { ! big_f( X, Y, Z, Y ), big_f( X, Z, X, Y ),
% 0.72/1.11 alpha1( X, Y, Z ) }.
% 0.72/1.11 (78) {G0,W9,D2,L2,V3,M2} { ! alpha3( X, Y, Z ), big_f( X, Z, X, Y ) }.
% 0.72/1.11 (79) {G0,W9,D2,L2,V3,M2} { ! alpha3( X, Y, Z ), ! big_f( X, Y, Z, Y ) }.
% 0.72/1.11 (80) {G0,W14,D2,L3,V3,M3} { ! big_f( X, Z, X, Y ), big_f( X, Y, Z, Y ),
% 0.72/1.11 alpha3( X, Y, Z ) }.
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 Total Proof:
% 0.72/1.11
% 0.72/1.11 subsumption: (3) {G0,W5,D2,L1,V2,M1} I { big_f( skol1, Y, skol1, X ) }.
% 0.72/1.11 parent0: (68) {G0,W5,D2,L1,V2,M1} { big_f( skol1, Y, skol1, X ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := X
% 0.72/1.11 Y := Y
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (5) {G0,W11,D3,L2,V2,M1} I { alpha1( skol1, X, Y ), alpha2(
% 0.72/1.11 skol1, X, Y, skol3( X, Y ) ) }.
% 0.72/1.11 parent0: (70) {G0,W11,D3,L2,V2,M2} { alpha2( skol1, X, Y, skol3( X, Y ) )
% 0.72/1.11 , alpha1( skol1, X, Y ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := X
% 0.72/1.11 Y := Y
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 1
% 0.72/1.11 1 ==> 0
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (7) {G0,W10,D2,L2,V4,M1} I { ! alpha2( X, Y, Z, T ), ! big_f(
% 0.72/1.11 X, T, Z, T ) }.
% 0.72/1.11 parent0: (72) {G0,W10,D2,L2,V4,M2} { ! alpha2( X, Y, Z, T ), ! big_f( X, T
% 0.72/1.11 , Z, T ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := X
% 0.72/1.11 Y := Y
% 0.72/1.11 Z := Z
% 0.72/1.11 T := T
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 1 ==> 1
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (9) {G0,W13,D2,L3,V3,M1} I { ! alpha1( X, Y, Z ), alpha3( X, Y
% 0.72/1.11 , Z ), big_f( X, Y, Z, Y ) }.
% 0.72/1.11 parent0: (74) {G0,W13,D2,L3,V3,M3} { ! alpha1( X, Y, Z ), alpha3( X, Y, Z
% 0.72/1.11 ), big_f( X, Y, Z, Y ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := X
% 0.72/1.11 Y := Y
% 0.72/1.11 Z := Z
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 1 ==> 1
% 0.72/1.11 2 ==> 2
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (10) {G0,W13,D2,L3,V3,M1} I { ! alpha1( X, Y, Z ), alpha3( X,
% 0.72/1.11 Y, Z ), ! big_f( X, Z, X, Y ) }.
% 0.72/1.11 parent0: (75) {G0,W13,D2,L3,V3,M3} { ! alpha1( X, Y, Z ), alpha3( X, Y, Z
% 0.72/1.11 ), ! big_f( X, Z, X, Y ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := X
% 0.72/1.11 Y := Y
% 0.72/1.11 Z := Z
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 1 ==> 1
% 0.72/1.11 2 ==> 2
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (13) {G0,W9,D2,L2,V3,M1} I { ! alpha3( X, Y, Z ), big_f( X, Z
% 0.72/1.11 , X, Y ) }.
% 0.72/1.11 parent0: (78) {G0,W9,D2,L2,V3,M2} { ! alpha3( X, Y, Z ), big_f( X, Z, X, Y
% 0.72/1.11 ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := X
% 0.72/1.11 Y := Y
% 0.72/1.11 Z := Z
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 1 ==> 1
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (14) {G0,W9,D2,L2,V3,M1} I { ! alpha3( X, Y, Z ), ! big_f( X,
% 0.72/1.11 Y, Z, Y ) }.
% 0.72/1.11 parent0: (79) {G0,W9,D2,L2,V3,M2} { ! alpha3( X, Y, Z ), ! big_f( X, Y, Z
% 0.72/1.11 , Y ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := X
% 0.72/1.11 Y := Y
% 0.72/1.11 Z := Z
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 1 ==> 1
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 resolution: (81) {G1,W8,D2,L2,V2,M2} { ! alpha3( X, Y, X ), ! alpha3( X, Y
% 0.72/1.11 , Y ) }.
% 0.72/1.11 parent0[1]: (14) {G0,W9,D2,L2,V3,M1} I { ! alpha3( X, Y, Z ), ! big_f( X, Y
% 0.72/1.11 , Z, Y ) }.
% 0.72/1.11 parent1[1]: (13) {G0,W9,D2,L2,V3,M1} I { ! alpha3( X, Y, Z ), big_f( X, Z,
% 0.72/1.11 X, Y ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := X
% 0.72/1.11 Y := Y
% 0.72/1.11 Z := X
% 0.72/1.11 end
% 0.72/1.11 substitution1:
% 0.72/1.11 X := X
% 0.72/1.11 Y := Y
% 0.72/1.11 Z := Y
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (19) {G1,W8,D2,L2,V2,M2} R(13,14) { ! alpha3( X, Y, X ), !
% 0.72/1.11 alpha3( X, Y, Y ) }.
% 0.72/1.11 parent0: (81) {G1,W8,D2,L2,V2,M2} { ! alpha3( X, Y, X ), ! alpha3( X, Y, Y
% 0.72/1.11 ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := X
% 0.72/1.11 Y := Y
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 1 ==> 1
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 factor: (83) {G1,W4,D2,L1,V1,M1} { ! alpha3( X, X, X ) }.
% 0.72/1.11 parent0[0, 1]: (19) {G1,W8,D2,L2,V2,M2} R(13,14) { ! alpha3( X, Y, X ), !
% 0.72/1.11 alpha3( X, Y, Y ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := X
% 0.72/1.11 Y := X
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (20) {G2,W4,D2,L1,V1,M1} F(19) { ! alpha3( X, X, X ) }.
% 0.72/1.11 parent0: (83) {G1,W4,D2,L1,V1,M1} { ! alpha3( X, X, X ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := X
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 resolution: (84) {G1,W5,D2,L1,V2,M1} { ! alpha2( skol1, X, skol1, Y ) }.
% 0.72/1.11 parent0[1]: (7) {G0,W10,D2,L2,V4,M1} I { ! alpha2( X, Y, Z, T ), ! big_f( X
% 0.72/1.11 , T, Z, T ) }.
% 0.72/1.11 parent1[0]: (3) {G0,W5,D2,L1,V2,M1} I { big_f( skol1, Y, skol1, X ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := skol1
% 0.72/1.11 Y := X
% 0.72/1.11 Z := skol1
% 0.72/1.11 T := Y
% 0.72/1.11 end
% 0.72/1.11 substitution1:
% 0.72/1.11 X := Y
% 0.72/1.11 Y := Y
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (23) {G1,W5,D2,L1,V2,M1} R(7,3) { ! alpha2( skol1, X, skol1, Y
% 0.72/1.11 ) }.
% 0.72/1.11 parent0: (84) {G1,W5,D2,L1,V2,M1} { ! alpha2( skol1, X, skol1, Y ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := X
% 0.72/1.11 Y := Y
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 resolution: (85) {G1,W4,D2,L1,V1,M1} { alpha1( skol1, X, skol1 ) }.
% 0.72/1.11 parent0[0]: (23) {G1,W5,D2,L1,V2,M1} R(7,3) { ! alpha2( skol1, X, skol1, Y
% 0.72/1.11 ) }.
% 0.72/1.11 parent1[1]: (5) {G0,W11,D3,L2,V2,M1} I { alpha1( skol1, X, Y ), alpha2(
% 0.72/1.11 skol1, X, Y, skol3( X, Y ) ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := X
% 0.72/1.11 Y := skol3( X, skol1 )
% 0.72/1.11 end
% 0.72/1.11 substitution1:
% 0.72/1.11 X := X
% 0.72/1.11 Y := skol1
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (30) {G2,W4,D2,L1,V1,M1} R(5,23) { alpha1( skol1, X, skol1 )
% 0.72/1.11 }.
% 0.72/1.11 parent0: (85) {G1,W4,D2,L1,V1,M1} { alpha1( skol1, X, skol1 ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := X
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 resolution: (86) {G1,W16,D2,L4,V2,M4} { ! alpha1( X, Y, Y ), alpha3( X, Y
% 0.72/1.11 , Y ), ! alpha1( X, Y, X ), alpha3( X, Y, X ) }.
% 0.72/1.11 parent0[2]: (10) {G0,W13,D2,L3,V3,M1} I { ! alpha1( X, Y, Z ), alpha3( X, Y
% 0.72/1.11 , Z ), ! big_f( X, Z, X, Y ) }.
% 0.72/1.11 parent1[2]: (9) {G0,W13,D2,L3,V3,M1} I { ! alpha1( X, Y, Z ), alpha3( X, Y
% 0.72/1.11 , Z ), big_f( X, Y, Z, Y ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := X
% 0.72/1.11 Y := Y
% 0.72/1.11 Z := Y
% 0.72/1.11 end
% 0.72/1.11 substitution1:
% 0.72/1.11 X := X
% 0.72/1.11 Y := Y
% 0.72/1.11 Z := X
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (47) {G1,W16,D2,L4,V2,M2} R(10,9) { ! alpha1( X, Y, Y ), !
% 0.72/1.11 alpha1( X, Y, X ), alpha3( X, Y, X ), alpha3( X, Y, Y ) }.
% 0.72/1.11 parent0: (86) {G1,W16,D2,L4,V2,M4} { ! alpha1( X, Y, Y ), alpha3( X, Y, Y
% 0.72/1.11 ), ! alpha1( X, Y, X ), alpha3( X, Y, X ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := X
% 0.72/1.11 Y := Y
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 1 ==> 3
% 0.72/1.11 2 ==> 1
% 0.72/1.11 3 ==> 2
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 factor: (89) {G1,W12,D2,L3,V1,M3} { ! alpha1( X, X, X ), alpha3( X, X, X )
% 0.72/1.11 , alpha3( X, X, X ) }.
% 0.72/1.11 parent0[0, 1]: (47) {G1,W16,D2,L4,V2,M2} R(10,9) { ! alpha1( X, Y, Y ), !
% 0.72/1.11 alpha1( X, Y, X ), alpha3( X, Y, X ), alpha3( X, Y, Y ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := X
% 0.72/1.11 Y := X
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 factor: (90) {G1,W8,D2,L2,V1,M2} { ! alpha1( X, X, X ), alpha3( X, X, X )
% 0.72/1.11 }.
% 0.72/1.11 parent0[1, 2]: (89) {G1,W12,D2,L3,V1,M3} { ! alpha1( X, X, X ), alpha3( X
% 0.72/1.11 , X, X ), alpha3( X, X, X ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := X
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 resolution: (92) {G2,W4,D2,L1,V1,M1} { ! alpha1( X, X, X ) }.
% 0.72/1.11 parent0[0]: (20) {G2,W4,D2,L1,V1,M1} F(19) { ! alpha3( X, X, X ) }.
% 0.72/1.11 parent1[1]: (90) {G1,W8,D2,L2,V1,M2} { ! alpha1( X, X, X ), alpha3( X, X,
% 0.72/1.11 X ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := X
% 0.72/1.11 end
% 0.72/1.11 substitution1:
% 0.72/1.11 X := X
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (53) {G3,W4,D2,L1,V1,M1} F(47);f;r(20) { ! alpha1( X, X, X )
% 0.72/1.11 }.
% 0.72/1.11 parent0: (92) {G2,W4,D2,L1,V1,M1} { ! alpha1( X, X, X ) }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := X
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 0 ==> 0
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 resolution: (93) {G3,W0,D0,L0,V0,M0} { }.
% 0.72/1.11 parent0[0]: (53) {G3,W4,D2,L1,V1,M1} F(47);f;r(20) { ! alpha1( X, X, X )
% 0.72/1.11 }.
% 0.72/1.11 parent1[0]: (30) {G2,W4,D2,L1,V1,M1} R(5,23) { alpha1( skol1, X, skol1 )
% 0.72/1.11 }.
% 0.72/1.11 substitution0:
% 0.72/1.11 X := skol1
% 0.72/1.11 end
% 0.72/1.11 substitution1:
% 0.72/1.11 X := skol1
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 subsumption: (63) {G4,W0,D0,L0,V0,M0} R(53,30) { }.
% 0.72/1.11 parent0: (93) {G3,W0,D0,L0,V0,M0} { }.
% 0.72/1.11 substitution0:
% 0.72/1.11 end
% 0.72/1.11 permutation0:
% 0.72/1.11 end
% 0.72/1.11
% 0.72/1.11 Proof check complete!
% 0.72/1.11
% 0.72/1.11 Memory use:
% 0.72/1.11
% 0.72/1.11 space for terms: 1080
% 0.72/1.11 space for clauses: 3722
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 clauses generated: 106
% 0.72/1.11 clauses kept: 64
% 0.72/1.11 clauses selected: 33
% 0.72/1.11 clauses deleted: 4
% 0.72/1.11 clauses inuse deleted: 0
% 0.72/1.11
% 0.72/1.11 subsentry: 126
% 0.72/1.11 literals s-matched: 102
% 0.72/1.11 literals matched: 86
% 0.72/1.11 full subsumption: 8
% 0.72/1.11
% 0.72/1.11 checksum: -1077143385
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 Bliksem ended
%------------------------------------------------------------------------------