TSTP Solution File: SYN069+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN069+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n026.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:47:24 EDT 2022
% Result : Theorem 0.65s 1.06s
% Output : Refutation 0.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SYN069+1 : TPTP v8.1.0. Released v2.0.0.
% 0.00/0.11 % Command : bliksem %s
% 0.10/0.30 % Computer : n026.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % DateTime : Mon Jul 11 18:24:57 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.65/1.06 *** allocated 10000 integers for termspace/termends
% 0.65/1.06 *** allocated 10000 integers for clauses
% 0.65/1.06 *** allocated 10000 integers for justifications
% 0.65/1.06 Bliksem 1.12
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 Automatic Strategy Selection
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 Clauses:
% 0.65/1.06
% 0.65/1.06 { alpha1( X ), big_g( Y ) }.
% 0.65/1.06 { alpha1( X ), big_h( X, Y ) }.
% 0.65/1.06 { alpha1( X ), big_k( Y ) }.
% 0.65/1.06 { ! alpha1( X ), ! big_f( X ), alpha2( X ) }.
% 0.65/1.06 { big_f( X ), alpha1( X ) }.
% 0.65/1.06 { ! alpha2( X ), alpha1( X ) }.
% 0.65/1.06 { ! alpha2( X ), big_g( skol1( Y ) ) }.
% 0.65/1.06 { ! alpha2( X ), big_h( X, skol1( X ) ) }.
% 0.65/1.06 { ! alpha2( X ), ! big_j( X, skol1( X ) ) }.
% 0.65/1.06 { ! big_g( Y ), ! big_h( X, Y ), big_j( X, Y ), alpha2( X ) }.
% 0.65/1.06 { ! big_l( X ), ! big_k( X ) }.
% 0.65/1.06 { big_f( skol2 ) }.
% 0.65/1.06 { ! big_h( skol2, X ), big_l( X ) }.
% 0.65/1.06 { ! big_g( X ), ! big_h( skol2, X ), big_j( skol2, X ) }.
% 0.65/1.06 { ! big_f( X ), big_g( skol3( Y ) ) }.
% 0.65/1.06 { ! big_f( X ), big_h( X, skol3( X ) ) }.
% 0.65/1.06
% 0.65/1.06 percentage equality = 0.000000, percentage horn = 0.687500
% 0.65/1.06 This a non-horn, non-equality problem
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 Options Used:
% 0.65/1.06
% 0.65/1.06 useres = 1
% 0.65/1.06 useparamod = 0
% 0.65/1.06 useeqrefl = 0
% 0.65/1.06 useeqfact = 0
% 0.65/1.06 usefactor = 1
% 0.65/1.06 usesimpsplitting = 0
% 0.65/1.06 usesimpdemod = 0
% 0.65/1.06 usesimpres = 3
% 0.65/1.06
% 0.65/1.06 resimpinuse = 1000
% 0.65/1.06 resimpclauses = 20000
% 0.65/1.06 substype = standard
% 0.65/1.06 backwardsubs = 1
% 0.65/1.06 selectoldest = 5
% 0.65/1.06
% 0.65/1.06 litorderings [0] = split
% 0.65/1.06 litorderings [1] = liftord
% 0.65/1.06
% 0.65/1.06 termordering = none
% 0.65/1.06
% 0.65/1.06 litapriori = 1
% 0.65/1.06 termapriori = 0
% 0.65/1.06 litaposteriori = 0
% 0.65/1.06 termaposteriori = 0
% 0.65/1.06 demodaposteriori = 0
% 0.65/1.06 ordereqreflfact = 0
% 0.65/1.06
% 0.65/1.06 litselect = none
% 0.65/1.06
% 0.65/1.06 maxweight = 15
% 0.65/1.06 maxdepth = 30000
% 0.65/1.06 maxlength = 115
% 0.65/1.06 maxnrvars = 195
% 0.65/1.06 excuselevel = 1
% 0.65/1.06 increasemaxweight = 1
% 0.65/1.06
% 0.65/1.06 maxselected = 10000000
% 0.65/1.06 maxnrclauses = 10000000
% 0.65/1.06
% 0.65/1.06 showgenerated = 0
% 0.65/1.06 showkept = 0
% 0.65/1.06 showselected = 0
% 0.65/1.06 showdeleted = 0
% 0.65/1.06 showresimp = 1
% 0.65/1.06 showstatus = 2000
% 0.65/1.06
% 0.65/1.06 prologoutput = 0
% 0.65/1.06 nrgoals = 5000000
% 0.65/1.06 totalproof = 1
% 0.65/1.06
% 0.65/1.06 Symbols occurring in the translation:
% 0.65/1.06
% 0.65/1.06 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.65/1.06 . [1, 2] (w:1, o:23, a:1, s:1, b:0),
% 0.65/1.06 ! [4, 1] (w:0, o:10, a:1, s:1, b:0),
% 0.65/1.06 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.65/1.06 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.65/1.06 big_f [36, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.65/1.06 big_g [38, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.65/1.06 big_h [39, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.65/1.06 big_j [40, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.65/1.06 big_k [42, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.65/1.06 big_l [43, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.65/1.06 alpha1 [44, 1] (w:1, o:15, a:1, s:1, b:0),
% 0.65/1.06 alpha2 [45, 1] (w:1, o:16, a:1, s:1, b:0),
% 0.65/1.06 skol1 [46, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.65/1.06 skol2 [47, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.65/1.06 skol3 [48, 1] (w:1, o:22, a:1, s:1, b:0).
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 Starting Search:
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 Bliksems!, er is een bewijs:
% 0.65/1.06 % SZS status Theorem
% 0.65/1.06 % SZS output start Refutation
% 0.65/1.06
% 0.65/1.06 (1) {G0,W5,D2,L2,V2,M1} I { alpha1( X ), big_h( X, Y ) }.
% 0.65/1.06 (2) {G0,W4,D2,L2,V2,M1} I { alpha1( X ), big_k( Y ) }.
% 0.65/1.06 (3) {G0,W6,D2,L3,V1,M1} I { ! alpha1( X ), alpha2( X ), ! big_f( X ) }.
% 0.65/1.06 (6) {G0,W5,D3,L2,V2,M1} I { ! alpha2( X ), big_g( skol1( Y ) ) }.
% 0.65/1.06 (7) {G0,W6,D3,L2,V1,M1} I { ! alpha2( X ), big_h( X, skol1( X ) ) }.
% 0.65/1.06 (8) {G0,W6,D3,L2,V1,M1} I { ! alpha2( X ), ! big_j( X, skol1( X ) ) }.
% 0.65/1.06 (10) {G0,W4,D2,L2,V1,M1} I { ! big_k( X ), ! big_l( X ) }.
% 0.65/1.06 (11) {G0,W2,D2,L1,V0,M1} I { big_f( skol2 ) }.
% 0.65/1.06 (12) {G0,W5,D2,L2,V1,M1} I { big_l( X ), ! big_h( skol2, X ) }.
% 0.65/1.06 (13) {G0,W8,D2,L3,V1,M1} I { ! big_g( X ), ! big_h( skol2, X ), big_j(
% 0.65/1.06 skol2, X ) }.
% 0.65/1.06 (16) {G1,W4,D2,L2,V1,M1} R(12,1) { alpha1( skol2 ), big_l( X ) }.
% 0.65/1.06 (17) {G2,W4,D2,L2,V1,M1} R(16,10) { alpha1( skol2 ), ! big_k( X ) }.
% 0.65/1.06 (18) {G3,W4,D2,L2,V1,M2} R(17,2) { alpha1( X ), alpha1( skol2 ) }.
% 0.65/1.06 (19) {G4,W2,D2,L1,V0,M1} F(18) { alpha1( skol2 ) }.
% 0.65/1.06 (20) {G5,W2,D2,L1,V0,M1} R(3,11);r(19) { alpha2( skol2 ) }.
% 0.65/1.06 (26) {G1,W5,D3,L2,V0,M1} R(13,8);r(7) { ! alpha2( skol2 ), ! big_g( skol1(
% 0.65/1.06 skol2 ) ) }.
% 0.65/1.06 (27) {G6,W3,D3,L1,V0,M1} S(26);r(20) { ! big_g( skol1( skol2 ) ) }.
% 0.65/1.06 (28) {G7,W2,D2,L1,V1,M1} R(27,6) { ! alpha2( X ) }.
% 0.65/1.06 (29) {G8,W0,D0,L0,V0,M0} R(28,20) { }.
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 % SZS output end Refutation
% 0.65/1.06 found a proof!
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 Unprocessed initial clauses:
% 0.65/1.06
% 0.65/1.06 (31) {G0,W4,D2,L2,V2,M2} { alpha1( X ), big_g( Y ) }.
% 0.65/1.06 (32) {G0,W5,D2,L2,V2,M2} { alpha1( X ), big_h( X, Y ) }.
% 0.65/1.06 (33) {G0,W4,D2,L2,V2,M2} { alpha1( X ), big_k( Y ) }.
% 0.65/1.06 (34) {G0,W6,D2,L3,V1,M3} { ! alpha1( X ), ! big_f( X ), alpha2( X ) }.
% 0.65/1.06 (35) {G0,W4,D2,L2,V1,M2} { big_f( X ), alpha1( X ) }.
% 0.65/1.06 (36) {G0,W4,D2,L2,V1,M2} { ! alpha2( X ), alpha1( X ) }.
% 0.65/1.06 (37) {G0,W5,D3,L2,V2,M2} { ! alpha2( X ), big_g( skol1( Y ) ) }.
% 0.65/1.06 (38) {G0,W6,D3,L2,V1,M2} { ! alpha2( X ), big_h( X, skol1( X ) ) }.
% 0.65/1.06 (39) {G0,W6,D3,L2,V1,M2} { ! alpha2( X ), ! big_j( X, skol1( X ) ) }.
% 0.65/1.06 (40) {G0,W10,D2,L4,V2,M4} { ! big_g( Y ), ! big_h( X, Y ), big_j( X, Y ),
% 0.65/1.06 alpha2( X ) }.
% 0.65/1.06 (41) {G0,W4,D2,L2,V1,M2} { ! big_l( X ), ! big_k( X ) }.
% 0.65/1.06 (42) {G0,W2,D2,L1,V0,M1} { big_f( skol2 ) }.
% 0.65/1.06 (43) {G0,W5,D2,L2,V1,M2} { ! big_h( skol2, X ), big_l( X ) }.
% 0.65/1.06 (44) {G0,W8,D2,L3,V1,M3} { ! big_g( X ), ! big_h( skol2, X ), big_j( skol2
% 0.65/1.06 , X ) }.
% 0.65/1.06 (45) {G0,W5,D3,L2,V2,M2} { ! big_f( X ), big_g( skol3( Y ) ) }.
% 0.65/1.06 (46) {G0,W6,D3,L2,V1,M2} { ! big_f( X ), big_h( X, skol3( X ) ) }.
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 Total Proof:
% 0.65/1.06
% 0.65/1.06 subsumption: (1) {G0,W5,D2,L2,V2,M1} I { alpha1( X ), big_h( X, Y ) }.
% 0.65/1.06 parent0: (32) {G0,W5,D2,L2,V2,M2} { alpha1( X ), big_h( X, Y ) }.
% 0.65/1.06 substitution0:
% 0.65/1.06 X := X
% 0.65/1.06 Y := Y
% 0.65/1.06 end
% 0.65/1.06 permutation0:
% 0.65/1.06 0 ==> 0
% 0.65/1.06 1 ==> 1
% 0.65/1.06 end
% 0.65/1.06
% 0.65/1.06 subsumption: (2) {G0,W4,D2,L2,V2,M1} I { alpha1( X ), big_k( Y ) }.
% 0.65/1.06 parent0: (33) {G0,W4,D2,L2,V2,M2} { alpha1( X ), big_k( Y ) }.
% 0.65/1.06 substitution0:
% 0.65/1.06 X := X
% 0.65/1.06 Y := Y
% 0.65/1.06 end
% 0.65/1.06 permutation0:
% 0.65/1.06 0 ==> 0
% 0.65/1.06 1 ==> 1
% 0.65/1.06 end
% 0.65/1.06
% 0.65/1.06 subsumption: (3) {G0,W6,D2,L3,V1,M1} I { ! alpha1( X ), alpha2( X ), !
% 0.65/1.06 big_f( X ) }.
% 0.65/1.06 parent0: (34) {G0,W6,D2,L3,V1,M3} { ! alpha1( X ), ! big_f( X ), alpha2( X
% 0.65/1.06 ) }.
% 0.65/1.06 substitution0:
% 0.65/1.06 X := X
% 0.65/1.06 end
% 0.65/1.06 permutation0:
% 0.65/1.06 0 ==> 0
% 0.65/1.06 1 ==> 2
% 0.65/1.06 2 ==> 1
% 0.65/1.06 end
% 0.65/1.06
% 0.65/1.06 subsumption: (6) {G0,W5,D3,L2,V2,M1} I { ! alpha2( X ), big_g( skol1( Y ) )
% 0.65/1.06 }.
% 0.65/1.06 parent0: (37) {G0,W5,D3,L2,V2,M2} { ! alpha2( X ), big_g( skol1( Y ) ) }.
% 0.65/1.06 substitution0:
% 0.65/1.06 X := X
% 0.65/1.06 Y := Y
% 0.65/1.06 end
% 0.65/1.06 permutation0:
% 0.65/1.06 0 ==> 0
% 0.65/1.06 1 ==> 1
% 0.65/1.06 end
% 0.65/1.06
% 0.65/1.06 subsumption: (7) {G0,W6,D3,L2,V1,M1} I { ! alpha2( X ), big_h( X, skol1( X
% 0.65/1.06 ) ) }.
% 0.65/1.06 parent0: (38) {G0,W6,D3,L2,V1,M2} { ! alpha2( X ), big_h( X, skol1( X ) )
% 0.65/1.06 }.
% 0.65/1.06 substitution0:
% 0.65/1.06 X := X
% 0.65/1.06 end
% 0.65/1.06 permutation0:
% 0.65/1.06 0 ==> 0
% 0.65/1.06 1 ==> 1
% 0.65/1.06 end
% 0.65/1.06
% 0.65/1.06 subsumption: (8) {G0,W6,D3,L2,V1,M1} I { ! alpha2( X ), ! big_j( X, skol1(
% 0.65/1.06 X ) ) }.
% 0.65/1.06 parent0: (39) {G0,W6,D3,L2,V1,M2} { ! alpha2( X ), ! big_j( X, skol1( X )
% 0.65/1.06 ) }.
% 0.65/1.06 substitution0:
% 0.65/1.06 X := X
% 0.65/1.06 end
% 0.65/1.06 permutation0:
% 0.65/1.06 0 ==> 0
% 0.65/1.06 1 ==> 1
% 0.65/1.06 end
% 0.65/1.06
% 0.65/1.06 subsumption: (10) {G0,W4,D2,L2,V1,M1} I { ! big_k( X ), ! big_l( X ) }.
% 0.65/1.06 parent0: (41) {G0,W4,D2,L2,V1,M2} { ! big_l( X ), ! big_k( X ) }.
% 0.65/1.06 substitution0:
% 0.65/1.06 X := X
% 0.65/1.06 end
% 0.65/1.06 permutation0:
% 0.65/1.06 0 ==> 1
% 0.65/1.06 1 ==> 0
% 0.65/1.06 end
% 0.65/1.06
% 0.65/1.06 subsumption: (11) {G0,W2,D2,L1,V0,M1} I { big_f( skol2 ) }.
% 0.65/1.06 parent0: (42) {G0,W2,D2,L1,V0,M1} { big_f( skol2 ) }.
% 0.65/1.06 substitution0:
% 0.65/1.06 end
% 0.65/1.06 permutation0:
% 0.65/1.06 0 ==> 0
% 0.65/1.06 end
% 0.65/1.06
% 0.65/1.06 subsumption: (12) {G0,W5,D2,L2,V1,M1} I { big_l( X ), ! big_h( skol2, X )
% 0.65/1.06 }.
% 0.65/1.06 parent0: (43) {G0,W5,D2,L2,V1,M2} { ! big_h( skol2, X ), big_l( X ) }.
% 0.65/1.06 substitution0:
% 0.65/1.06 X := X
% 0.65/1.06 end
% 0.65/1.06 permutation0:
% 0.65/1.06 0 ==> 1
% 0.65/1.06 1 ==> 0
% 0.65/1.06 end
% 0.65/1.06
% 0.65/1.06 subsumption: (13) {G0,W8,D2,L3,V1,M1} I { ! big_g( X ), ! big_h( skol2, X )
% 0.65/1.07 , big_j( skol2, X ) }.
% 0.65/1.07 parent0: (44) {G0,W8,D2,L3,V1,M3} { ! big_g( X ), ! big_h( skol2, X ),
% 0.65/1.07 big_j( skol2, X ) }.
% 0.65/1.07 substitution0:
% 0.65/1.07 X := X
% 0.65/1.07 end
% 0.65/1.07 permutation0:
% 0.65/1.07 0 ==> 0
% 0.65/1.07 1 ==> 1
% 0.65/1.07 2 ==> 2
% 0.65/1.07 end
% 0.65/1.07
% 0.65/1.07 resolution: (47) {G1,W4,D2,L2,V1,M2} { big_l( X ), alpha1( skol2 ) }.
% 0.65/1.07 parent0[1]: (12) {G0,W5,D2,L2,V1,M1} I { big_l( X ), ! big_h( skol2, X )
% 0.65/1.07 }.
% 0.65/1.07 parent1[1]: (1) {G0,W5,D2,L2,V2,M1} I { alpha1( X ), big_h( X, Y ) }.
% 0.65/1.07 substitution0:
% 0.65/1.07 X := X
% 0.65/1.07 end
% 0.65/1.07 substitution1:
% 0.65/1.07 X := skol2
% 0.65/1.07 Y := X
% 0.65/1.07 end
% 0.65/1.07
% 0.65/1.07 subsumption: (16) {G1,W4,D2,L2,V1,M1} R(12,1) { alpha1( skol2 ), big_l( X )
% 0.65/1.07 }.
% 0.65/1.07 parent0: (47) {G1,W4,D2,L2,V1,M2} { big_l( X ), alpha1( skol2 ) }.
% 0.65/1.07 substitution0:
% 0.65/1.07 X := X
% 0.65/1.07 end
% 0.65/1.07 permutation0:
% 0.65/1.07 0 ==> 1
% 0.65/1.07 1 ==> 0
% 0.65/1.07 end
% 0.65/1.07
% 0.65/1.07 resolution: (48) {G1,W4,D2,L2,V1,M2} { ! big_k( X ), alpha1( skol2 ) }.
% 0.65/1.07 parent0[1]: (10) {G0,W4,D2,L2,V1,M1} I { ! big_k( X ), ! big_l( X ) }.
% 0.65/1.07 parent1[1]: (16) {G1,W4,D2,L2,V1,M1} R(12,1) { alpha1( skol2 ), big_l( X )
% 0.65/1.07 }.
% 0.65/1.07 substitution0:
% 0.65/1.07 X := X
% 0.65/1.07 end
% 0.65/1.07 substitution1:
% 0.65/1.07 X := X
% 0.65/1.07 end
% 0.65/1.07
% 0.65/1.07 subsumption: (17) {G2,W4,D2,L2,V1,M1} R(16,10) { alpha1( skol2 ), ! big_k(
% 0.65/1.07 X ) }.
% 0.65/1.07 parent0: (48) {G1,W4,D2,L2,V1,M2} { ! big_k( X ), alpha1( skol2 ) }.
% 0.65/1.07 substitution0:
% 0.65/1.07 X := X
% 0.65/1.07 end
% 0.65/1.07 permutation0:
% 0.65/1.07 0 ==> 1
% 0.65/1.07 1 ==> 0
% 0.65/1.07 end
% 0.65/1.07
% 0.65/1.07 resolution: (49) {G1,W4,D2,L2,V1,M2} { alpha1( skol2 ), alpha1( Y ) }.
% 0.65/1.07 parent0[1]: (17) {G2,W4,D2,L2,V1,M1} R(16,10) { alpha1( skol2 ), ! big_k( X
% 0.65/1.07 ) }.
% 0.65/1.07 parent1[1]: (2) {G0,W4,D2,L2,V2,M1} I { alpha1( X ), big_k( Y ) }.
% 0.65/1.07 substitution0:
% 0.65/1.07 X := X
% 0.65/1.07 end
% 0.65/1.07 substitution1:
% 0.65/1.07 X := Y
% 0.65/1.07 Y := X
% 0.65/1.07 end
% 0.65/1.07
% 0.65/1.07 subsumption: (18) {G3,W4,D2,L2,V1,M2} R(17,2) { alpha1( X ), alpha1( skol2
% 0.65/1.07 ) }.
% 0.65/1.07 parent0: (49) {G1,W4,D2,L2,V1,M2} { alpha1( skol2 ), alpha1( Y ) }.
% 0.65/1.07 substitution0:
% 0.65/1.07 X := Y
% 0.65/1.07 Y := X
% 0.65/1.07 end
% 0.65/1.07 permutation0:
% 0.65/1.07 0 ==> 1
% 0.65/1.07 1 ==> 0
% 0.65/1.07 end
% 0.65/1.07
% 0.65/1.07 factor: (51) {G3,W2,D2,L1,V0,M1} { alpha1( skol2 ) }.
% 0.65/1.07 parent0[0, 1]: (18) {G3,W4,D2,L2,V1,M2} R(17,2) { alpha1( X ), alpha1(
% 0.65/1.07 skol2 ) }.
% 0.65/1.07 substitution0:
% 0.65/1.07 X := skol2
% 0.65/1.07 end
% 0.65/1.07
% 0.65/1.07 subsumption: (19) {G4,W2,D2,L1,V0,M1} F(18) { alpha1( skol2 ) }.
% 0.65/1.07 parent0: (51) {G3,W2,D2,L1,V0,M1} { alpha1( skol2 ) }.
% 0.65/1.07 substitution0:
% 0.65/1.07 end
% 0.65/1.07 permutation0:
% 0.65/1.07 0 ==> 0
% 0.65/1.07 end
% 0.65/1.07
% 0.65/1.07 resolution: (52) {G1,W4,D2,L2,V0,M2} { ! alpha1( skol2 ), alpha2( skol2 )
% 0.65/1.07 }.
% 0.65/1.07 parent0[2]: (3) {G0,W6,D2,L3,V1,M1} I { ! alpha1( X ), alpha2( X ), ! big_f
% 0.65/1.07 ( X ) }.
% 0.65/1.07 parent1[0]: (11) {G0,W2,D2,L1,V0,M1} I { big_f( skol2 ) }.
% 0.65/1.07 substitution0:
% 0.65/1.07 X := skol2
% 0.65/1.07 end
% 0.65/1.07 substitution1:
% 0.65/1.07 end
% 0.65/1.07
% 0.65/1.07 resolution: (53) {G2,W2,D2,L1,V0,M1} { alpha2( skol2 ) }.
% 0.65/1.07 parent0[0]: (52) {G1,W4,D2,L2,V0,M2} { ! alpha1( skol2 ), alpha2( skol2 )
% 0.65/1.07 }.
% 0.65/1.07 parent1[0]: (19) {G4,W2,D2,L1,V0,M1} F(18) { alpha1( skol2 ) }.
% 0.65/1.07 substitution0:
% 0.65/1.07 end
% 0.65/1.07 substitution1:
% 0.65/1.07 end
% 0.65/1.07
% 0.65/1.07 subsumption: (20) {G5,W2,D2,L1,V0,M1} R(3,11);r(19) { alpha2( skol2 ) }.
% 0.65/1.07 parent0: (53) {G2,W2,D2,L1,V0,M1} { alpha2( skol2 ) }.
% 0.65/1.07 substitution0:
% 0.65/1.07 end
% 0.65/1.07 permutation0:
% 0.65/1.07 0 ==> 0
% 0.65/1.07 end
% 0.65/1.07
% 0.65/1.07 resolution: (54) {G1,W9,D3,L3,V0,M3} { ! alpha2( skol2 ), ! big_g( skol1(
% 0.65/1.07 skol2 ) ), ! big_h( skol2, skol1( skol2 ) ) }.
% 0.65/1.07 parent0[1]: (8) {G0,W6,D3,L2,V1,M1} I { ! alpha2( X ), ! big_j( X, skol1( X
% 0.65/1.07 ) ) }.
% 0.65/1.07 parent1[2]: (13) {G0,W8,D2,L3,V1,M1} I { ! big_g( X ), ! big_h( skol2, X )
% 0.65/1.07 , big_j( skol2, X ) }.
% 0.65/1.07 substitution0:
% 0.65/1.07 X := skol2
% 0.65/1.07 end
% 0.65/1.07 substitution1:
% 0.65/1.07 X := skol1( skol2 )
% 0.65/1.07 end
% 0.65/1.07
% 0.65/1.07 resolution: (55) {G1,W7,D3,L3,V0,M3} { ! alpha2( skol2 ), ! big_g( skol1(
% 0.65/1.07 skol2 ) ), ! alpha2( skol2 ) }.
% 0.65/1.07 parent0[2]: (54) {G1,W9,D3,L3,V0,M3} { ! alpha2( skol2 ), ! big_g( skol1(
% 0.65/1.07 skol2 ) ), ! big_h( skol2, skol1( skol2 ) ) }.
% 0.65/1.07 parent1[1]: (7) {G0,W6,D3,L2,V1,M1} I { ! alpha2( X ), big_h( X, skol1( X )
% 0.65/1.07 ) }.
% 0.65/1.07 substitution0:
% 0.65/1.07 end
% 0.65/1.07 substitution1:
% 0.65/1.07 X := skol2
% 0.65/1.07 end
% 0.65/1.07
% 0.65/1.07 factor: (56) {G1,W5,D3,L2,V0,M2} { ! alpha2( skol2 ), ! big_g( skol1(
% 0.65/1.07 skol2 ) ) }.
% 0.65/1.07 parent0[0, 2]: (55) {G1,W7,D3,L3,V0,M3} { ! alpha2( skol2 ), ! big_g(
% 0.65/1.07 skol1( skol2 ) ), ! alpha2( skol2 ) }.
% 0.65/1.07 substitution0:
% 0.65/1.07 end
% 0.65/1.07
% 0.65/1.07 subsumption: (26) {G1,W5,D3,L2,V0,M1} R(13,8);r(7) { ! alpha2( skol2 ), !
% 0.65/1.07 big_g( skol1( skol2 ) ) }.
% 0.65/1.07 parent0: (56) {G1,W5,D3,L2,V0,M2} { ! alpha2( skol2 ), ! big_g( skol1(
% 0.65/1.07 skol2 ) ) }.
% 0.65/1.07 substitution0:
% 0.65/1.07 end
% 0.65/1.07 permutation0:
% 0.65/1.07 0 ==> 0
% 0.65/1.07 1 ==> 1
% 0.65/1.07 end
% 0.65/1.07
% 0.65/1.07 resolution: (57) {G2,W3,D3,L1,V0,M1} { ! big_g( skol1( skol2 ) ) }.
% 0.65/1.07 parent0[0]: (26) {G1,W5,D3,L2,V0,M1} R(13,8);r(7) { ! alpha2( skol2 ), !
% 0.65/1.07 big_g( skol1( skol2 ) ) }.
% 0.65/1.07 parent1[0]: (20) {G5,W2,D2,L1,V0,M1} R(3,11);r(19) { alpha2( skol2 ) }.
% 0.65/1.07 substitution0:
% 0.65/1.07 end
% 0.65/1.07 substitution1:
% 0.65/1.07 end
% 0.65/1.07
% 0.65/1.07 subsumption: (27) {G6,W3,D3,L1,V0,M1} S(26);r(20) { ! big_g( skol1( skol2 )
% 0.65/1.07 ) }.
% 0.65/1.07 parent0: (57) {G2,W3,D3,L1,V0,M1} { ! big_g( skol1( skol2 ) ) }.
% 0.65/1.07 substitution0:
% 0.65/1.07 end
% 0.65/1.07 permutation0:
% 0.65/1.07 0 ==> 0
% 0.65/1.07 end
% 0.65/1.07
% 0.65/1.07 resolution: (58) {G1,W2,D2,L1,V1,M1} { ! alpha2( X ) }.
% 0.65/1.07 parent0[0]: (27) {G6,W3,D3,L1,V0,M1} S(26);r(20) { ! big_g( skol1( skol2 )
% 0.65/1.07 ) }.
% 0.65/1.07 parent1[1]: (6) {G0,W5,D3,L2,V2,M1} I { ! alpha2( X ), big_g( skol1( Y ) )
% 0.65/1.07 }.
% 0.65/1.07 substitution0:
% 0.65/1.07 end
% 0.65/1.07 substitution1:
% 0.65/1.07 X := X
% 0.65/1.07 Y := skol2
% 0.65/1.07 end
% 0.65/1.07
% 0.65/1.07 subsumption: (28) {G7,W2,D2,L1,V1,M1} R(27,6) { ! alpha2( X ) }.
% 0.65/1.07 parent0: (58) {G1,W2,D2,L1,V1,M1} { ! alpha2( X ) }.
% 0.65/1.07 substitution0:
% 0.65/1.07 X := X
% 0.65/1.07 end
% 0.65/1.07 permutation0:
% 0.65/1.07 0 ==> 0
% 0.65/1.07 end
% 0.65/1.07
% 0.65/1.07 resolution: (59) {G6,W0,D0,L0,V0,M0} { }.
% 0.65/1.07 parent0[0]: (28) {G7,W2,D2,L1,V1,M1} R(27,6) { ! alpha2( X ) }.
% 0.65/1.07 parent1[0]: (20) {G5,W2,D2,L1,V0,M1} R(3,11);r(19) { alpha2( skol2 ) }.
% 0.65/1.07 substitution0:
% 0.65/1.07 X := skol2
% 0.65/1.07 end
% 0.65/1.07 substitution1:
% 0.65/1.07 end
% 0.65/1.07
% 0.65/1.07 subsumption: (29) {G8,W0,D0,L0,V0,M0} R(28,20) { }.
% 0.65/1.07 parent0: (59) {G6,W0,D0,L0,V0,M0} { }.
% 0.65/1.07 substitution0:
% 0.65/1.07 end
% 0.65/1.07 permutation0:
% 0.65/1.07 end
% 0.65/1.07
% 0.65/1.07 Proof check complete!
% 0.65/1.07
% 0.65/1.07 Memory use:
% 0.65/1.07
% 0.65/1.07 space for terms: 377
% 0.65/1.07 space for clauses: 1460
% 0.65/1.07
% 0.65/1.07
% 0.65/1.07 clauses generated: 35
% 0.65/1.07 clauses kept: 30
% 0.65/1.07 clauses selected: 27
% 0.65/1.07 clauses deleted: 2
% 0.65/1.07 clauses inuse deleted: 0
% 0.65/1.07
% 0.65/1.07 subsentry: 7
% 0.65/1.07 literals s-matched: 4
% 0.65/1.07 literals matched: 4
% 0.65/1.07 full subsumption: 0
% 0.65/1.07
% 0.65/1.07 checksum: 1603897561
% 0.65/1.07
% 0.65/1.07
% 0.65/1.07 Bliksem ended
%------------------------------------------------------------------------------