TSTP Solution File: SYN065+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN065+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n026.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:20 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.07/0.13 % Problem : SYN065+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.14 % Command : bliksem %s
% 0.14/0.35 % Computer : n026.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % DateTime : Tue Jul 12 09:19:42 EDT 2022
% 0.14/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 { big_f( X, skol1( X ) ) }.
% 0.71/1.10 { big_g( X, skol2( X ) ) }.
% 0.71/1.10 { alpha1( X, Y ), ! big_f( Y, Z ), big_h( X, Z ) }.
% 0.71/1.10 { alpha1( X, Y ), ! big_g( Y, Z ), big_h( X, Z ) }.
% 0.71/1.10 { ! alpha1( X, Y ), ! big_f( X, Y ) }.
% 0.71/1.10 { ! alpha1( X, Y ), ! big_g( X, Y ) }.
% 0.71/1.10 { big_f( X, Y ), big_g( X, Y ), alpha1( X, Y ) }.
% 0.71/1.10 { ! big_h( skol3, X ) }.
% 0.71/1.10
% 0.71/1.10 percentage equality = 0.000000, percentage horn = 0.625000
% 0.71/1.10 This a non-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 = 3
% 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 = none
% 0.71/1.10
% 0.71/1.10 maxweight = 15
% 0.71/1.10 maxdepth = 30000
% 0.71/1.10 maxlength = 115
% 0.71/1.10 maxnrvars = 195
% 0.71/1.10 excuselevel = 1
% 0.71/1.10 increasemaxweight = 1
% 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:17, a:1, s:1, b:0),
% 0.71/1.10 ! [4, 1] (w:0, 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 big_f [37, 2] (w:1, o:42, a:1, s:1, b:0),
% 0.71/1.10 big_g [38, 2] (w:1, o:43, a:1, s:1, b:0),
% 0.71/1.10 big_h [40, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.71/1.10 alpha1 [41, 2] (w:1, o:41, a:1, s:1, b:0),
% 0.71/1.10 skol1 [42, 1] (w:1, o:15, a:1, s:1, b:0),
% 0.71/1.10 skol2 [43, 1] (w:1, o:16, a:1, s:1, b:0),
% 0.71/1.10 skol3 [44, 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,W4,D3,L1,V1,M1} I { big_f( X, skol1( X ) ) }.
% 0.71/1.10 (1) {G0,W4,D3,L1,V1,M1} I { big_g( X, skol2( X ) ) }.
% 0.71/1.10 (2) {G0,W9,D2,L3,V3,M1} I { alpha1( X, Y ), ! big_f( Y, Z ), big_h( X, Z )
% 0.71/1.10 }.
% 0.71/1.10 (5) {G0,W6,D2,L2,V2,M1} I { ! alpha1( X, Y ), ! big_g( X, Y ) }.
% 0.71/1.10 (7) {G0,W3,D2,L1,V1,M1} I { ! big_h( skol3, X ) }.
% 0.71/1.10 (8) {G1,W4,D3,L1,V1,M1} R(5,1) { ! alpha1( X, skol2( X ) ) }.
% 0.71/1.10 (9) {G1,W6,D2,L2,V2,M1} R(2,7) { alpha1( skol3, X ), ! big_f( X, Y ) }.
% 0.71/1.10 (10) {G2,W3,D2,L1,V1,M1} R(9,0) { alpha1( skol3, X ) }.
% 0.71/1.10 (11) {G3,W0,D0,L0,V0,M0} R(10,8) { }.
% 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 (13) {G0,W4,D3,L1,V1,M1} { big_f( X, skol1( X ) ) }.
% 0.71/1.10 (14) {G0,W4,D3,L1,V1,M1} { big_g( X, skol2( X ) ) }.
% 0.71/1.10 (15) {G0,W9,D2,L3,V3,M3} { alpha1( X, Y ), ! big_f( Y, Z ), big_h( X, Z )
% 0.71/1.10 }.
% 0.71/1.10 (16) {G0,W9,D2,L3,V3,M3} { alpha1( X, Y ), ! big_g( Y, Z ), big_h( X, Z )
% 0.71/1.10 }.
% 0.71/1.10 (17) {G0,W6,D2,L2,V2,M2} { ! alpha1( X, Y ), ! big_f( X, Y ) }.
% 0.71/1.10 (18) {G0,W6,D2,L2,V2,M2} { ! alpha1( X, Y ), ! big_g( X, Y ) }.
% 0.71/1.10 (19) {G0,W9,D2,L3,V2,M3} { big_f( X, Y ), big_g( X, Y ), alpha1( X, Y )
% 0.71/1.10 }.
% 0.71/1.10 (20) {G0,W3,D2,L1,V1,M1} { ! big_h( skol3, 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,W4,D3,L1,V1,M1} I { big_f( X, skol1( X ) ) }.
% 0.71/1.10 parent0: (13) {G0,W4,D3,L1,V1,M1} { big_f( X, 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 subsumption: (1) {G0,W4,D3,L1,V1,M1} I { big_g( X, skol2( X ) ) }.
% 0.71/1.10 parent0: (14) {G0,W4,D3,L1,V1,M1} { big_g( X, skol2( 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 subsumption: (2) {G0,W9,D2,L3,V3,M1} I { alpha1( X, Y ), ! big_f( Y, Z ),
% 0.71/1.10 big_h( X, Z ) }.
% 0.71/1.10 parent0: (15) {G0,W9,D2,L3,V3,M3} { alpha1( X, Y ), ! big_f( Y, Z ), big_h
% 0.71/1.10 ( X, Z ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 Y := Y
% 0.71/1.10 Z := Z
% 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 2 ==> 2
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (5) {G0,W6,D2,L2,V2,M1} I { ! alpha1( X, Y ), ! big_g( X, Y )
% 0.71/1.10 }.
% 0.71/1.10 parent0: (18) {G0,W6,D2,L2,V2,M2} { ! alpha1( X, Y ), ! big_g( X, 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 ==> 0
% 0.71/1.10 1 ==> 1
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (7) {G0,W3,D2,L1,V1,M1} I { ! big_h( skol3, X ) }.
% 0.71/1.10 parent0: (20) {G0,W3,D2,L1,V1,M1} { ! big_h( skol3, 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: (21) {G1,W4,D3,L1,V1,M1} { ! alpha1( X, skol2( X ) ) }.
% 0.71/1.10 parent0[1]: (5) {G0,W6,D2,L2,V2,M1} I { ! alpha1( X, Y ), ! big_g( X, Y )
% 0.71/1.10 }.
% 0.71/1.10 parent1[0]: (1) {G0,W4,D3,L1,V1,M1} I { big_g( X, skol2( X ) ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 Y := skol2( 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: (8) {G1,W4,D3,L1,V1,M1} R(5,1) { ! alpha1( X, skol2( X ) ) }.
% 0.71/1.10 parent0: (21) {G1,W4,D3,L1,V1,M1} { ! alpha1( X, skol2( 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: (22) {G1,W6,D2,L2,V2,M2} { alpha1( skol3, Y ), ! big_f( Y, X )
% 0.71/1.10 }.
% 0.71/1.10 parent0[0]: (7) {G0,W3,D2,L1,V1,M1} I { ! big_h( skol3, X ) }.
% 0.71/1.10 parent1[2]: (2) {G0,W9,D2,L3,V3,M1} I { alpha1( X, Y ), ! big_f( Y, Z ),
% 0.71/1.10 big_h( X, Z ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 X := skol3
% 0.71/1.10 Y := Y
% 0.71/1.10 Z := X
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (9) {G1,W6,D2,L2,V2,M1} R(2,7) { alpha1( skol3, X ), ! big_f(
% 0.71/1.10 X, Y ) }.
% 0.71/1.10 parent0: (22) {G1,W6,D2,L2,V2,M2} { alpha1( skol3, Y ), ! big_f( Y, X )
% 0.71/1.10 }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := Y
% 0.71/1.10 Y := 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: (23) {G1,W3,D2,L1,V1,M1} { alpha1( skol3, X ) }.
% 0.71/1.10 parent0[1]: (9) {G1,W6,D2,L2,V2,M1} R(2,7) { alpha1( skol3, X ), ! big_f( X
% 0.71/1.10 , Y ) }.
% 0.71/1.10 parent1[0]: (0) {G0,W4,D3,L1,V1,M1} I { big_f( X, skol1( X ) ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := X
% 0.71/1.10 Y := 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: (10) {G2,W3,D2,L1,V1,M1} R(9,0) { alpha1( skol3, X ) }.
% 0.71/1.10 parent0: (23) {G1,W3,D2,L1,V1,M1} { alpha1( skol3, 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: (24) {G2,W0,D0,L0,V0,M0} { }.
% 0.71/1.10 parent0[0]: (8) {G1,W4,D3,L1,V1,M1} R(5,1) { ! alpha1( X, skol2( X ) ) }.
% 0.71/1.10 parent1[0]: (10) {G2,W3,D2,L1,V1,M1} R(9,0) { alpha1( skol3, X ) }.
% 0.71/1.10 substitution0:
% 0.71/1.10 X := skol3
% 0.71/1.10 end
% 0.71/1.10 substitution1:
% 0.71/1.10 X := skol2( skol3 )
% 0.71/1.10 end
% 0.71/1.10
% 0.71/1.10 subsumption: (11) {G3,W0,D0,L0,V0,M0} R(10,8) { }.
% 0.71/1.10 parent0: (24) {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: 201
% 0.71/1.10 space for clauses: 650
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 clauses generated: 12
% 0.71/1.10 clauses kept: 12
% 0.71/1.10 clauses selected: 8
% 0.71/1.10 clauses deleted: 0
% 0.71/1.10 clauses inuse deleted: 0
% 0.71/1.10
% 0.71/1.10 subsentry: 0
% 0.71/1.10 literals s-matched: 0
% 0.71/1.10 literals matched: 0
% 0.71/1.10 full subsumption: 0
% 0.71/1.10
% 0.71/1.10 checksum: 16822792
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Bliksem ended
%------------------------------------------------------------------------------