TSTP Solution File: SYN066+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN066+1 : TPTP v8.1.0. Bugfixed v3.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:21 EDT 2022
% Result : Theorem 0.73s 1.12s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN066+1 : TPTP v8.1.0. Bugfixed v3.0.0.
% 0.07/0.14 % Command : bliksem %s
% 0.13/0.35 % Computer : n009.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 : Tue Jul 12 09:05:22 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.73/1.12 *** allocated 10000 integers for termspace/termends
% 0.73/1.12 *** allocated 10000 integers for clauses
% 0.73/1.12 *** allocated 10000 integers for justifications
% 0.73/1.12 Bliksem 1.12
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 Automatic Strategy Selection
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 Clauses:
% 0.73/1.12
% 0.73/1.12 { big_p( skol4( X, Z ), X ) }.
% 0.73/1.12 { ! big_p( skol4( X, Z ), skol1( X ) ), big_q( skol5( X ), skol1( X ) ) }.
% 0.73/1.12 { ! big_p( Y, X ), big_p( skol4( X, Y ), skol1( X ) ) }.
% 0.73/1.12 { big_p( Y, X ), big_q( skol2( X ), X ) }.
% 0.73/1.12 { ! big_q( X, Y ), big_r( Z, Z ) }.
% 0.73/1.12 { ! big_r( skol3, X ) }.
% 0.73/1.12
% 0.73/1.12 percentage equality = 0.000000, percentage horn = 0.833333
% 0.73/1.12 This a non-horn, non-equality problem
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 Options Used:
% 0.73/1.12
% 0.73/1.12 useres = 1
% 0.73/1.12 useparamod = 0
% 0.73/1.12 useeqrefl = 0
% 0.73/1.12 useeqfact = 0
% 0.73/1.12 usefactor = 1
% 0.73/1.12 usesimpsplitting = 0
% 0.73/1.12 usesimpdemod = 0
% 0.73/1.12 usesimpres = 3
% 0.73/1.12
% 0.73/1.12 resimpinuse = 1000
% 0.73/1.12 resimpclauses = 20000
% 0.73/1.12 substype = standard
% 0.73/1.12 backwardsubs = 1
% 0.73/1.12 selectoldest = 5
% 0.73/1.12
% 0.73/1.12 litorderings [0] = split
% 0.73/1.12 litorderings [1] = liftord
% 0.73/1.12
% 0.73/1.12 termordering = none
% 0.73/1.12
% 0.73/1.12 litapriori = 1
% 0.73/1.12 termapriori = 0
% 0.73/1.12 litaposteriori = 0
% 0.73/1.12 termaposteriori = 0
% 0.73/1.12 demodaposteriori = 0
% 0.73/1.12 ordereqreflfact = 0
% 0.73/1.12
% 0.73/1.12 litselect = none
% 0.73/1.12
% 0.73/1.12 maxweight = 15
% 0.73/1.12 maxdepth = 30000
% 0.73/1.12 maxlength = 115
% 0.73/1.12 maxnrvars = 195
% 0.73/1.12 excuselevel = 1
% 0.73/1.12 increasemaxweight = 1
% 0.73/1.12
% 0.73/1.12 maxselected = 10000000
% 0.73/1.12 maxnrclauses = 10000000
% 0.73/1.12
% 0.73/1.12 showgenerated = 0
% 0.73/1.12 showkept = 0
% 0.73/1.12 showselected = 0
% 0.73/1.12 showdeleted = 0
% 0.73/1.12 showresimp = 1
% 0.73/1.12 showstatus = 2000
% 0.73/1.12
% 0.73/1.12 prologoutput = 0
% 0.73/1.12 nrgoals = 5000000
% 0.73/1.12 totalproof = 1
% 0.73/1.12
% 0.73/1.12 Symbols occurring in the translation:
% 0.73/1.12
% 0.73/1.12 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.73/1.12 . [1, 2] (w:1, o:20, a:1, s:1, b:0),
% 0.73/1.12 ! [4, 1] (w:0, o:12, a:1, s:1, b:0),
% 0.73/1.12 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.73/1.12 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.73/1.12 big_p [39, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.73/1.12 big_q [41, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.73/1.12 big_r [42, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.73/1.12 skol1 [43, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.73/1.12 skol2 [44, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.73/1.12 skol3 [45, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.73/1.12 skol4 [46, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.73/1.12 skol5 [47, 1] (w:1, o:19, a:1, s:1, b:0).
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 Starting Search:
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 Bliksems!, er is een bewijs:
% 0.73/1.12 % SZS status Theorem
% 0.73/1.12 % SZS output start Refutation
% 0.73/1.12
% 0.73/1.12 (1) {G0,W11,D3,L2,V2,M1} I { ! big_p( skol4( X, Z ), skol1( X ) ), big_q(
% 0.73/1.12 skol5( X ), skol1( X ) ) }.
% 0.73/1.12 (3) {G0,W7,D3,L2,V2,M1} I { big_p( Y, X ), big_q( skol2( X ), X ) }.
% 0.73/1.12 (4) {G0,W6,D2,L2,V3,M1} I { ! big_q( X, Y ), big_r( Z, Z ) }.
% 0.73/1.12 (5) {G0,W3,D2,L1,V1,M1} I { ! big_r( skol3, X ) }.
% 0.73/1.12 (6) {G1,W3,D2,L1,V2,M1} R(4,5) { ! big_q( X, Y ) }.
% 0.73/1.12 (7) {G2,W3,D2,L1,V2,M1} S(3);r(6) { big_p( Y, X ) }.
% 0.73/1.12 (8) {G3,W0,D0,L0,V0,M0} S(1);r(7);r(6) { }.
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 % SZS output end Refutation
% 0.73/1.12 found a proof!
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 Unprocessed initial clauses:
% 0.73/1.12
% 0.73/1.12 (10) {G0,W5,D3,L1,V2,M1} { big_p( skol4( X, Z ), X ) }.
% 0.73/1.12 (11) {G0,W11,D3,L2,V2,M2} { ! big_p( skol4( X, Z ), skol1( X ) ), big_q(
% 0.73/1.12 skol5( X ), skol1( X ) ) }.
% 0.73/1.12 (12) {G0,W9,D3,L2,V2,M2} { ! big_p( Y, X ), big_p( skol4( X, Y ), skol1( X
% 0.73/1.12 ) ) }.
% 0.73/1.12 (13) {G0,W7,D3,L2,V2,M2} { big_p( Y, X ), big_q( skol2( X ), X ) }.
% 0.73/1.12 (14) {G0,W6,D2,L2,V3,M2} { ! big_q( X, Y ), big_r( Z, Z ) }.
% 0.73/1.12 (15) {G0,W3,D2,L1,V1,M1} { ! big_r( skol3, X ) }.
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 Total Proof:
% 0.73/1.12
% 0.73/1.12 subsumption: (1) {G0,W11,D3,L2,V2,M1} I { ! big_p( skol4( X, Z ), skol1( X
% 0.73/1.12 ) ), big_q( skol5( X ), skol1( X ) ) }.
% 0.73/1.12 parent0: (11) {G0,W11,D3,L2,V2,M2} { ! big_p( skol4( X, Z ), skol1( X ) )
% 0.73/1.12 , big_q( skol5( X ), skol1( X ) ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := X
% 0.73/1.12 Y := T
% 0.73/1.12 Z := Z
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 0 ==> 0
% 0.73/1.12 1 ==> 1
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 subsumption: (3) {G0,W7,D3,L2,V2,M1} I { big_p( Y, X ), big_q( skol2( X ),
% 0.73/1.12 X ) }.
% 0.73/1.12 parent0: (13) {G0,W7,D3,L2,V2,M2} { big_p( Y, X ), big_q( skol2( X ), X )
% 0.73/1.12 }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := X
% 0.73/1.12 Y := Y
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 0 ==> 0
% 0.73/1.12 1 ==> 1
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 subsumption: (4) {G0,W6,D2,L2,V3,M1} I { ! big_q( X, Y ), big_r( Z, Z ) }.
% 0.73/1.12 parent0: (14) {G0,W6,D2,L2,V3,M2} { ! big_q( X, Y ), big_r( Z, Z ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := X
% 0.73/1.12 Y := Y
% 0.73/1.12 Z := Z
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 0 ==> 0
% 0.73/1.12 1 ==> 1
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 subsumption: (5) {G0,W3,D2,L1,V1,M1} I { ! big_r( skol3, X ) }.
% 0.73/1.12 parent0: (15) {G0,W3,D2,L1,V1,M1} { ! big_r( skol3, X ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := X
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 0 ==> 0
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 resolution: (16) {G1,W3,D2,L1,V2,M1} { ! big_q( X, Y ) }.
% 0.73/1.12 parent0[0]: (5) {G0,W3,D2,L1,V1,M1} I { ! big_r( skol3, X ) }.
% 0.73/1.12 parent1[1]: (4) {G0,W6,D2,L2,V3,M1} I { ! big_q( X, Y ), big_r( Z, Z ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := skol3
% 0.73/1.12 end
% 0.73/1.12 substitution1:
% 0.73/1.12 X := X
% 0.73/1.12 Y := Y
% 0.73/1.12 Z := skol3
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 subsumption: (6) {G1,W3,D2,L1,V2,M1} R(4,5) { ! big_q( X, Y ) }.
% 0.73/1.12 parent0: (16) {G1,W3,D2,L1,V2,M1} { ! big_q( X, Y ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := X
% 0.73/1.12 Y := Y
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 0 ==> 0
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 resolution: (17) {G1,W3,D2,L1,V2,M1} { big_p( Y, X ) }.
% 0.73/1.12 parent0[0]: (6) {G1,W3,D2,L1,V2,M1} R(4,5) { ! big_q( X, Y ) }.
% 0.73/1.12 parent1[1]: (3) {G0,W7,D3,L2,V2,M1} I { big_p( Y, X ), big_q( skol2( X ), X
% 0.73/1.12 ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := skol2( X )
% 0.73/1.12 Y := X
% 0.73/1.12 end
% 0.73/1.12 substitution1:
% 0.73/1.12 X := X
% 0.73/1.12 Y := Y
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 subsumption: (7) {G2,W3,D2,L1,V2,M1} S(3);r(6) { big_p( Y, X ) }.
% 0.73/1.12 parent0: (17) {G1,W3,D2,L1,V2,M1} { big_p( Y, X ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := X
% 0.73/1.12 Y := Y
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 0 ==> 0
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 resolution: (18) {G1,W5,D3,L1,V1,M1} { big_q( skol5( X ), skol1( X ) ) }.
% 0.73/1.12 parent0[0]: (1) {G0,W11,D3,L2,V2,M1} I { ! big_p( skol4( X, Z ), skol1( X )
% 0.73/1.12 ), big_q( skol5( X ), skol1( X ) ) }.
% 0.73/1.12 parent1[0]: (7) {G2,W3,D2,L1,V2,M1} S(3);r(6) { big_p( Y, X ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := X
% 0.73/1.12 Y := Z
% 0.73/1.12 Z := Y
% 0.73/1.12 end
% 0.73/1.12 substitution1:
% 0.73/1.12 X := skol1( X )
% 0.73/1.12 Y := skol4( X, Y )
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 resolution: (19) {G2,W0,D0,L0,V0,M0} { }.
% 0.73/1.12 parent0[0]: (6) {G1,W3,D2,L1,V2,M1} R(4,5) { ! big_q( X, Y ) }.
% 0.73/1.12 parent1[0]: (18) {G1,W5,D3,L1,V1,M1} { big_q( skol5( X ), skol1( X ) ) }.
% 0.73/1.12 substitution0:
% 0.73/1.12 X := skol5( X )
% 0.73/1.12 Y := skol1( X )
% 0.73/1.12 end
% 0.73/1.12 substitution1:
% 0.73/1.12 X := X
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 subsumption: (8) {G3,W0,D0,L0,V0,M0} S(1);r(7);r(6) { }.
% 0.73/1.12 parent0: (19) {G2,W0,D0,L0,V0,M0} { }.
% 0.73/1.12 substitution0:
% 0.73/1.12 end
% 0.73/1.12 permutation0:
% 0.73/1.12 end
% 0.73/1.12
% 0.73/1.12 Proof check complete!
% 0.73/1.12
% 0.73/1.12 Memory use:
% 0.73/1.12
% 0.73/1.12 space for terms: 183
% 0.73/1.12 space for clauses: 515
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 clauses generated: 9
% 0.73/1.12 clauses kept: 9
% 0.73/1.12 clauses selected: 4
% 0.73/1.12 clauses deleted: 2
% 0.73/1.12 clauses inuse deleted: 0
% 0.73/1.12
% 0.73/1.12 subsentry: 0
% 0.73/1.12 literals s-matched: 0
% 0.73/1.12 literals matched: 0
% 0.73/1.12 full subsumption: 0
% 0.73/1.12
% 0.73/1.12 checksum: -570517080
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 Bliksem ended
%------------------------------------------------------------------------------