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