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