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