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