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