TSTP Solution File: SYN729+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN729+1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n004.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:54:17 EDT 2022
% Result : Theorem 0.71s 1.10s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SYN729+1 : TPTP v8.1.0. Released v2.5.0.
% 0.04/0.13 % Command : bliksem %s
% 0.13/0.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % DateTime : Mon Jul 11 13:43:37 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.71/1.10 *** allocated 10000 integers for termspace/termends
% 0.71/1.10 *** allocated 10000 integers for clauses
% 0.71/1.10 *** allocated 10000 integers for justifications
% 0.71/1.10 Bliksem 1.12
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Automatic Strategy Selection
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Clauses:
% 0.71/1.10
% 0.71/1.10 { ! p( X ), p( skol1( Y ) ) }.
% 0.71/1.10 { ! p( X ), l( X, g( h( skol1( X ) ) ) ) }.
% 0.71/1.10 { ! p( X ), p( g( X ) ) }.
% 0.71/1.10 { ! p( X ), p( h( X ) ) }.
% 0.71/1.10 { p( skol2 ) }.
% 0.71/1.10 { ! l( skol2, X ), ! p( X ) }.
% 0.71/1.10
% 0.71/1.10 percentage equality = 0.000000, percentage horn = 1.000000
% 0.71/1.10 This is a near-Horn, non-equality problem
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Options Used:
% 0.71/1.10
% 0.71/1.10 useres = 1
% 0.71/1.10 useparamod = 0
% 0.71/1.10 useeqrefl = 0
% 0.71/1.10 useeqfact = 0
% 0.71/1.10 usefactor = 1
% 0.71/1.10 usesimpsplitting = 0
% 0.71/1.10 usesimpdemod = 0
% 0.71/1.10 usesimpres = 4
% 0.71/1.10
% 0.71/1.10 resimpinuse = 1000
% 0.71/1.10 resimpclauses = 20000
% 0.71/1.10 substype = standard
% 0.71/1.10 backwardsubs = 1
% 0.71/1.10 selectoldest = 5
% 0.71/1.10
% 0.71/1.10 litorderings [0] = split
% 0.71/1.10 litorderings [1] = liftord
% 0.71/1.10
% 0.71/1.10 termordering = none
% 0.71/1.10
% 0.71/1.10 litapriori = 1
% 0.71/1.10 termapriori = 0
% 0.71/1.10 litaposteriori = 0
% 0.71/1.10 termaposteriori = 0
% 0.71/1.10 demodaposteriori = 0
% 0.71/1.10 ordereqreflfact = 0
% 0.71/1.10
% 0.71/1.10 litselect = negative
% 0.71/1.10
% 0.71/1.10 maxweight = 30000
% 0.71/1.10 maxdepth = 30000
% 0.71/1.10 maxlength = 115
% 0.71/1.10 maxnrvars = 195
% 0.71/1.10 excuselevel = 0
% 0.71/1.10 increasemaxweight = 0
% 0.71/1.10
% 0.71/1.10 maxselected = 10000000
% 0.71/1.10 maxnrclauses = 10000000
% 0.71/1.10
% 0.71/1.10 showgenerated = 0
% 0.71/1.10 showkept = 0
% 0.71/1.10 showselected = 0
% 0.71/1.10 showdeleted = 0
% 0.71/1.10 showresimp = 1
% 0.71/1.10 showstatus = 2000
% 0.71/1.10
% 0.71/1.10 prologoutput = 0
% 0.71/1.10 nrgoals = 5000000
% 0.71/1.10 totalproof = 1
% 0.71/1.10
% 0.71/1.10 Symbols occurring in the translation:
% 0.71/1.10
% 0.71/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.71/1.10 . [1, 2] (w:1, o:19, a:1, s:1, b:0),
% 0.71/1.10 ! [4, 1] (w:1, o:10, a:1, s:1, b:0),
% 0.71/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.10 p [37, 1] (w:1, o:15, a:1, s:1, b:0),
% 0.71/1.10 h [38, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.71/1.10 g [39, 1] (w:1, o:16, a:1, s:1, b:0),
% 0.71/1.10 l [40, 2] (w:1, o:43, a:1, s:1, b:0),
% 0.71/1.10 skol1 [42, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.71/1.10 skol2 [43, 0] (w:1, o:9, a:1, s:1, b:0).
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Starting Search:
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Bliksems!, er is een bewijs:
% 0.71/1.10 % SZS status Theorem
% 0.71/1.10 % SZS output start Refutation
% 0.71/1.10
% 0.71/1.10 (0) {G0,W6,D3,L2,V2,M1} I { p( skol1( Y ) ), ! p( X ) }.
% 0.71/1.10 (1) {G0,W9,D5,L2,V1,M1} I { l( X, g( h( skol1( X ) ) ) ), ! p( X ) }.
% 0.71/1.10 (2) {G0,W6,D3,L2,V1,M1} I { p( g( X ) ), ! p( X ) }.
% 0.71/1.10 (3) {G0,W6,D3,L2,V1,M1} I { p( h( X ) ), ! p( X ) }.
% 0.71/1.10 (4) {G0,W2,D2,L1,V0,M1} I { p( skol2 ) }.
% 0.71/1.10 (5) {G0,W7,D2,L2,V1,M1} I { ! l( skol2, X ), ! p( X ) }.
% 0.71/1.10 (6) {G1,W3,D3,L1,V1,M1} R(0,4) { p( skol1( X ) ) }.
% 0.71/1.10 (7) {G2,W4,D4,L1,V1,M1} R(3,6) { p( h( skol1( X ) ) ) }.
% 0.71/1.10 (12) {G1,W6,D5,L1,V0,M1} R(1,4) { l( skol2, g( h( skol1( skol2 ) ) ) ) }.
% 0.71/1.10 (24) {G3,W5,D5,L1,V1,M1} R(2,7) { p( g( h( skol1( X ) ) ) ) }.
% 0.71/1.10 (63) {G4,W7,D5,L1,V1,M1} R(24,5) { ! l( skol2, g( h( skol1( X ) ) ) ) }.
% 0.71/1.10 (83) {G5,W0,D0,L0,V0,M0} S(12);r(63) { }.
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 % SZS output end Refutation
% 0.71/1.10 found a proof!
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Unprocessed initial clauses:
% 0.71/1.10
% 0.71/1.10 (85) {G0,W6,D3,L2,V2,M2} { ! p( X ), p( skol1( Y ) ) }.
% 0.71/1.10 (86) {G0,W9,D5,L2,V1,M2} { ! p( X ), l( X, g( h( skol1( X ) ) ) ) }.
% 0.71/1.10 (87) {G0,W6,D3,L2,V1,M2} { ! p( X ), p( g( X ) ) }.
% 0.71/1.10 (88) {G0,W6,D3,L2,V1,M2} { ! p( X ), p( h( X ) ) }.
% 0.71/1.10 (89) {G0,W2,D2,L1,V0,M1} { p( skol2 ) }.
% 0.71/1.10 (90) {G0,W7,D2,L2,V1,M2} { ! l( skol2, X ), ! p( X ) }.
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Total Proof:
% 0.71/1.10
% 0.71/1.10 subsumption: (0) {G0,W6,D3,L2,V2,M1} I { p( skol1( Y ) ), ! p( X ) }.
% 0.71/1.10 parent0: (85) {G0,W6,D3,L2,V2,M2} { ! p( X ), p( skol1( Y ) ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 Y := Y
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 1
% 0.71/1.10 1 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (1) {G0,W9,D5,L2,V1,M1} I { l( X, g( h( skol1( X ) ) ) ), ! p
% 0.71/1.10 ( X ) }.
% 0.71/1.10 parent0: (86) {G0,W9,D5,L2,V1,M2} { ! p( X ), l( X, g( h( skol1( X ) ) ) )
% 0.71/1.10 }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 1
% 0.71/1.10 1 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (2) {G0,W6,D3,L2,V1,M1} I { p( g( X ) ), ! p( X ) }.
% 0.71/1.10 parent0: (87) {G0,W6,D3,L2,V1,M2} { ! p( X ), p( g( X ) ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 1
% 0.71/1.10 1 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (3) {G0,W6,D3,L2,V1,M1} I { p( h( X ) ), ! p( X ) }.
% 0.71/1.10 parent0: (88) {G0,W6,D3,L2,V1,M2} { ! p( X ), p( h( X ) ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 1
% 0.71/1.10 1 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (4) {G0,W2,D2,L1,V0,M1} I { p( skol2 ) }.
% 0.71/1.10 parent0: (89) {G0,W2,D2,L1,V0,M1} { p( skol2 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (5) {G0,W7,D2,L2,V1,M1} I { ! l( skol2, X ), ! p( X ) }.
% 0.71/1.10 parent0: (90) {G0,W7,D2,L2,V1,M2} { ! l( skol2, X ), ! p( X ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 1 ==> 1
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (91) {G1,W3,D3,L1,V1,M1} { p( skol1( X ) ) }.
% 0.71/1.10 parent0[1]: (0) {G0,W6,D3,L2,V2,M1} I { p( skol1( Y ) ), ! p( X ) }.
% 0.71/1.10 parent1[0]: (4) {G0,W2,D2,L1,V0,M1} I { p( skol2 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := skol2
% 0.71/1.10 Y := X
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (6) {G1,W3,D3,L1,V1,M1} R(0,4) { p( skol1( X ) ) }.
% 0.71/1.10 parent0: (91) {G1,W3,D3,L1,V1,M1} { p( skol1( X ) ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (92) {G1,W4,D4,L1,V1,M1} { p( h( skol1( X ) ) ) }.
% 0.71/1.10 parent0[1]: (3) {G0,W6,D3,L2,V1,M1} I { p( h( X ) ), ! p( X ) }.
% 0.71/1.10 parent1[0]: (6) {G1,W3,D3,L1,V1,M1} R(0,4) { p( skol1( X ) ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := skol1( X )
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 X := X
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (7) {G2,W4,D4,L1,V1,M1} R(3,6) { p( h( skol1( X ) ) ) }.
% 0.71/1.10 parent0: (92) {G1,W4,D4,L1,V1,M1} { p( h( skol1( X ) ) ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (93) {G1,W6,D5,L1,V0,M1} { l( skol2, g( h( skol1( skol2 ) ) )
% 0.71/1.10 ) }.
% 0.71/1.10 parent0[1]: (1) {G0,W9,D5,L2,V1,M1} I { l( X, g( h( skol1( X ) ) ) ), ! p(
% 0.71/1.10 X ) }.
% 0.71/1.10 parent1[0]: (4) {G0,W2,D2,L1,V0,M1} I { p( skol2 ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := skol2
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (12) {G1,W6,D5,L1,V0,M1} R(1,4) { l( skol2, g( h( skol1( skol2
% 0.71/1.10 ) ) ) ) }.
% 0.71/1.10 parent0: (93) {G1,W6,D5,L1,V0,M1} { l( skol2, g( h( skol1( skol2 ) ) ) )
% 0.71/1.10 }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (94) {G1,W5,D5,L1,V1,M1} { p( g( h( skol1( X ) ) ) ) }.
% 0.71/1.10 parent0[1]: (2) {G0,W6,D3,L2,V1,M1} I { p( g( X ) ), ! p( X ) }.
% 0.71/1.10 parent1[0]: (7) {G2,W4,D4,L1,V1,M1} R(3,6) { p( h( skol1( X ) ) ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := h( skol1( X ) )
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 X := X
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (24) {G3,W5,D5,L1,V1,M1} R(2,7) { p( g( h( skol1( X ) ) ) )
% 0.71/1.10 }.
% 0.71/1.10 parent0: (94) {G1,W5,D5,L1,V1,M1} { p( g( h( skol1( X ) ) ) ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (95) {G1,W7,D5,L1,V1,M1} { ! l( skol2, g( h( skol1( X ) ) ) )
% 0.71/1.10 }.
% 0.71/1.10 parent0[1]: (5) {G0,W7,D2,L2,V1,M1} I { ! l( skol2, X ), ! p( X ) }.
% 0.71/1.10 parent1[0]: (24) {G3,W5,D5,L1,V1,M1} R(2,7) { p( g( h( skol1( X ) ) ) ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := g( h( skol1( X ) ) )
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 X := X
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (63) {G4,W7,D5,L1,V1,M1} R(24,5) { ! l( skol2, g( h( skol1( X
% 0.71/1.10 ) ) ) ) }.
% 0.71/1.10 parent0: (95) {G1,W7,D5,L1,V1,M1} { ! l( skol2, g( h( skol1( X ) ) ) ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 0 ==> 0
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 resolution: (96) {G2,W0,D0,L0,V0,M0} { }.
% 0.71/1.10 parent0[0]: (63) {G4,W7,D5,L1,V1,M1} R(24,5) { ! l( skol2, g( h( skol1( X )
% 0.71/1.10 ) ) ) }.
% 0.71/1.10 parent1[0]: (12) {G1,W6,D5,L1,V0,M1} R(1,4) { l( skol2, g( h( skol1( skol2
% 0.71/1.10 ) ) ) ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := skol2
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (83) {G5,W0,D0,L0,V0,M0} S(12);r(63) { }.
% 0.71/1.10 parent0: (96) {G2,W0,D0,L0,V0,M0} { }.
% 0.71/1.10 substitution0:
% 0.71/1.10 end
% 0.71/1.10 permutation0:
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 Proof check complete!
% 0.71/1.10
% 0.71/1.10 Memory use:
% 0.71/1.10
% 0.71/1.10 space for terms: 650
% 0.71/1.10 space for clauses: 5117
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 clauses generated: 102
% 0.71/1.10 clauses kept: 84
% 0.71/1.10 clauses selected: 30
% 0.71/1.10 clauses deleted: 1
% 0.71/1.10 clauses inuse deleted: 0
% 0.71/1.10
% 0.71/1.10 subsentry: 18
% 0.71/1.10 literals s-matched: 18
% 0.71/1.10 literals matched: 18
% 0.71/1.10 full subsumption: 0
% 0.71/1.10
% 0.71/1.10 checksum: -1307758811
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Bliksem ended
%------------------------------------------------------------------------------