TSTP Solution File: SYN327+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN327+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n021.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:49:38 EDT 2022
% Result : Theorem 0.50s 1.14s
% Output : Refutation 0.50s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SYN327+1 : TPTP v8.1.0. Released v2.0.0.
% 0.08/0.14 % Command : bliksem %s
% 0.15/0.36 % Computer : n021.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % DateTime : Tue Jul 12 04:28:09 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.50/1.14 *** allocated 10000 integers for termspace/termends
% 0.50/1.14 *** allocated 10000 integers for clauses
% 0.50/1.14 *** allocated 10000 integers for justifications
% 0.50/1.14 Bliksem 1.12
% 0.50/1.14
% 0.50/1.14
% 0.50/1.14 Automatic Strategy Selection
% 0.50/1.14
% 0.50/1.14
% 0.50/1.14 Clauses:
% 0.50/1.14
% 0.50/1.14 { big_f( X, skol1 ) }.
% 0.50/1.14 { alpha1( skol1, X, skol2( X ) ), big_f( skol1, X ) }.
% 0.50/1.14 { alpha1( skol1, X, skol2( X ) ), ! big_f( skol1, skol2( X ) ) }.
% 0.50/1.14 { alpha1( skol1, X, skol2( X ) ), ! big_f( X, skol1 ), ! big_f( skol2( X )
% 0.50/1.14 , X ) }.
% 0.50/1.14 { ! alpha1( X, Y, Z ), big_f( X, Z ) }.
% 0.50/1.14 { ! alpha1( X, Y, Z ), ! big_f( X, Y ) }.
% 0.50/1.14 { ! big_f( X, Z ), big_f( X, Y ), alpha1( X, Y, Z ) }.
% 0.50/1.14
% 0.50/1.14 percentage equality = 0.000000, percentage horn = 0.714286
% 0.50/1.14 This a non-horn, non-equality problem
% 0.50/1.14
% 0.50/1.14
% 0.50/1.14 Options Used:
% 0.50/1.14
% 0.50/1.14 useres = 1
% 0.50/1.14 useparamod = 0
% 0.50/1.14 useeqrefl = 0
% 0.50/1.14 useeqfact = 0
% 0.50/1.14 usefactor = 1
% 0.50/1.14 usesimpsplitting = 0
% 0.50/1.14 usesimpdemod = 0
% 0.50/1.14 usesimpres = 3
% 0.50/1.14
% 0.50/1.14 resimpinuse = 1000
% 0.50/1.14 resimpclauses = 20000
% 0.50/1.14 substype = standard
% 0.50/1.14 backwardsubs = 1
% 0.50/1.14 selectoldest = 5
% 0.50/1.14
% 0.50/1.14 litorderings [0] = split
% 0.50/1.14 litorderings [1] = liftord
% 0.50/1.14
% 0.50/1.14 termordering = none
% 0.50/1.14
% 0.50/1.14 litapriori = 1
% 0.50/1.14 termapriori = 0
% 0.50/1.14 litaposteriori = 0
% 0.50/1.14 termaposteriori = 0
% 0.50/1.14 demodaposteriori = 0
% 0.50/1.14 ordereqreflfact = 0
% 0.50/1.14
% 0.50/1.14 litselect = none
% 0.50/1.14
% 0.50/1.14 maxweight = 15
% 0.50/1.14 maxdepth = 30000
% 0.50/1.14 maxlength = 115
% 0.50/1.14 maxnrvars = 195
% 0.50/1.14 excuselevel = 1
% 0.50/1.14 increasemaxweight = 1
% 0.50/1.14
% 0.50/1.14 maxselected = 10000000
% 0.50/1.14 maxnrclauses = 10000000
% 0.50/1.14
% 0.50/1.14 showgenerated = 0
% 0.50/1.14 showkept = 0
% 0.50/1.14 showselected = 0
% 0.50/1.14 showdeleted = 0
% 0.50/1.14 showresimp = 1
% 0.50/1.14 showstatus = 2000
% 0.50/1.14
% 0.50/1.14 prologoutput = 0
% 0.50/1.14 nrgoals = 5000000
% 0.50/1.14 totalproof = 1
% 0.50/1.14
% 0.50/1.14 Symbols occurring in the translation:
% 0.50/1.14
% 0.50/1.14 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.50/1.14 . [1, 2] (w:1, o:16, a:1, s:1, b:0),
% 0.50/1.14 ! [4, 1] (w:0, o:10, a:1, s:1, b:0),
% 0.50/1.14 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.50/1.14 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.50/1.14 big_f [38, 2] (w:1, o:40, a:1, s:1, b:0),
% 0.50/1.14 alpha1 [39, 3] (w:1, o:41, a:1, s:1, b:0),
% 0.50/1.14 skol1 [40, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.50/1.14 skol2 [41, 1] (w:1, o:15, a:1, s:1, b:0).
% 0.50/1.14
% 0.50/1.14
% 0.50/1.14 Starting Search:
% 0.50/1.14
% 0.50/1.14
% 0.50/1.14 Bliksems!, er is een bewijs:
% 0.50/1.14 % SZS status Theorem
% 0.50/1.14 % SZS output start Refutation
% 0.50/1.14
% 0.50/1.14 (0) {G0,W3,D2,L1,V1,M1} I { big_f( X, skol1 ) }.
% 0.50/1.14 (3) {G1,W9,D3,L2,V1,M1} I;r(0) { ! big_f( skol2( X ), X ), alpha1( skol1, X
% 0.50/1.14 , skol2( X ) ) }.
% 0.50/1.14 (5) {G0,W7,D2,L2,V3,M1} I { ! big_f( X, Y ), ! alpha1( X, Y, Z ) }.
% 0.50/1.14 (16) {G2,W7,D3,L2,V1,M1} R(3,5) { ! big_f( skol1, X ), ! big_f( skol2( X )
% 0.50/1.14 , X ) }.
% 0.50/1.14 (17) {G3,W0,D0,L0,V0,M0} R(16,0);r(0) { }.
% 0.50/1.14
% 0.50/1.14
% 0.50/1.14 % SZS output end Refutation
% 0.50/1.14 found a proof!
% 0.50/1.14
% 0.50/1.14
% 0.50/1.14 Unprocessed initial clauses:
% 0.50/1.14
% 0.50/1.14 (19) {G0,W3,D2,L1,V1,M1} { big_f( X, skol1 ) }.
% 0.50/1.14 (20) {G0,W8,D3,L2,V1,M2} { alpha1( skol1, X, skol2( X ) ), big_f( skol1, X
% 0.50/1.14 ) }.
% 0.50/1.14 (21) {G0,W9,D3,L2,V1,M2} { alpha1( skol1, X, skol2( X ) ), ! big_f( skol1
% 0.50/1.14 , skol2( X ) ) }.
% 0.50/1.14 (22) {G0,W12,D3,L3,V1,M3} { alpha1( skol1, X, skol2( X ) ), ! big_f( X,
% 0.50/1.14 skol1 ), ! big_f( skol2( X ), X ) }.
% 0.50/1.14 (23) {G0,W7,D2,L2,V3,M2} { ! alpha1( X, Y, Z ), big_f( X, Z ) }.
% 0.50/1.14 (24) {G0,W7,D2,L2,V3,M2} { ! alpha1( X, Y, Z ), ! big_f( X, Y ) }.
% 0.50/1.14 (25) {G0,W10,D2,L3,V3,M3} { ! big_f( X, Z ), big_f( X, Y ), alpha1( X, Y,
% 0.50/1.14 Z ) }.
% 0.50/1.14
% 0.50/1.14
% 0.50/1.14 Total Proof:
% 0.50/1.14
% 0.50/1.14 subsumption: (0) {G0,W3,D2,L1,V1,M1} I { big_f( X, skol1 ) }.
% 0.50/1.14 parent0: (19) {G0,W3,D2,L1,V1,M1} { big_f( X, skol1 ) }.
% 0.50/1.14 substitution0:
% 0.50/1.14 X := X
% 0.50/1.14 end
% 0.50/1.14 permutation0:
% 0.50/1.14 0 ==> 0
% 0.50/1.14 end
% 0.50/1.14
% 0.50/1.14 resolution: (26) {G1,W9,D3,L2,V1,M2} { alpha1( skol1, X, skol2( X ) ), !
% 0.50/1.14 big_f( skol2( X ), X ) }.
% 0.50/1.14 parent0[1]: (22) {G0,W12,D3,L3,V1,M3} { alpha1( skol1, X, skol2( X ) ), !
% 0.50/1.14 big_f( X, skol1 ), ! big_f( skol2( X ), X ) }.
% 0.50/1.14 parent1[0]: (0) {G0,W3,D2,L1,V1,M1} I { big_f( X, skol1 ) }.
% 0.50/1.14 substitution0:
% 0.50/1.14 X := X
% 0.50/1.14 end
% 0.50/1.14 substitution1:
% 0.50/1.14 X := X
% 0.50/1.14 end
% 0.50/1.14
% 0.50/1.14 subsumption: (3) {G1,W9,D3,L2,V1,M1} I;r(0) { ! big_f( skol2( X ), X ),
% 0.50/1.14 alpha1( skol1, X, skol2( X ) ) }.
% 0.50/1.14 parent0: (26) {G1,W9,D3,L2,V1,M2} { alpha1( skol1, X, skol2( X ) ), !
% 0.50/1.14 big_f( skol2( X ), X ) }.
% 0.50/1.14 substitution0:
% 0.50/1.14 X := X
% 0.50/1.14 end
% 0.50/1.14 permutation0:
% 0.50/1.14 0 ==> 1
% 0.50/1.14 1 ==> 0
% 0.50/1.14 end
% 0.50/1.14
% 0.50/1.14 subsumption: (5) {G0,W7,D2,L2,V3,M1} I { ! big_f( X, Y ), ! alpha1( X, Y, Z
% 0.50/1.14 ) }.
% 0.50/1.14 parent0: (24) {G0,W7,D2,L2,V3,M2} { ! alpha1( X, Y, Z ), ! big_f( X, Y )
% 0.50/1.14 }.
% 0.50/1.14 substitution0:
% 0.50/1.14 X := X
% 0.50/1.14 Y := Y
% 0.50/1.14 Z := Z
% 0.50/1.14 end
% 0.50/1.14 permutation0:
% 0.50/1.14 0 ==> 1
% 0.50/1.14 1 ==> 0
% 0.50/1.14 end
% 0.50/1.14
% 0.50/1.14 resolution: (27) {G1,W7,D3,L2,V1,M2} { ! big_f( skol1, X ), ! big_f( skol2
% 0.50/1.14 ( X ), X ) }.
% 0.50/1.14 parent0[1]: (5) {G0,W7,D2,L2,V3,M1} I { ! big_f( X, Y ), ! alpha1( X, Y, Z
% 0.50/1.14 ) }.
% 0.50/1.14 parent1[1]: (3) {G1,W9,D3,L2,V1,M1} I;r(0) { ! big_f( skol2( X ), X ),
% 0.50/1.14 alpha1( skol1, X, skol2( X ) ) }.
% 0.50/1.14 substitution0:
% 0.50/1.14 X := skol1
% 0.50/1.14 Y := X
% 0.50/1.14 Z := skol2( X )
% 0.50/1.14 end
% 0.50/1.14 substitution1:
% 0.50/1.14 X := X
% 0.50/1.14 end
% 0.50/1.14
% 0.50/1.14 subsumption: (16) {G2,W7,D3,L2,V1,M1} R(3,5) { ! big_f( skol1, X ), ! big_f
% 0.50/1.14 ( skol2( X ), X ) }.
% 0.50/1.14 parent0: (27) {G1,W7,D3,L2,V1,M2} { ! big_f( skol1, X ), ! big_f( skol2( X
% 0.50/1.14 ), X ) }.
% 0.50/1.14 substitution0:
% 0.50/1.14 X := X
% 0.50/1.14 end
% 0.50/1.14 permutation0:
% 0.50/1.14 0 ==> 0
% 0.50/1.14 1 ==> 1
% 0.50/1.14 end
% 0.50/1.14
% 0.50/1.14 resolution: (28) {G1,W4,D3,L1,V0,M1} { ! big_f( skol2( skol1 ), skol1 )
% 0.50/1.14 }.
% 0.50/1.14 parent0[0]: (16) {G2,W7,D3,L2,V1,M1} R(3,5) { ! big_f( skol1, X ), ! big_f
% 0.50/1.14 ( skol2( X ), X ) }.
% 0.50/1.14 parent1[0]: (0) {G0,W3,D2,L1,V1,M1} I { big_f( X, skol1 ) }.
% 0.50/1.14 substitution0:
% 0.50/1.14 X := skol1
% 0.50/1.14 end
% 0.50/1.14 substitution1:
% 0.50/1.14 X := skol1
% 0.50/1.14 end
% 0.50/1.14
% 0.50/1.14 resolution: (30) {G1,W0,D0,L0,V0,M0} { }.
% 0.50/1.14 parent0[0]: (28) {G1,W4,D3,L1,V0,M1} { ! big_f( skol2( skol1 ), skol1 )
% 0.50/1.14 }.
% 0.50/1.14 parent1[0]: (0) {G0,W3,D2,L1,V1,M1} I { big_f( X, skol1 ) }.
% 0.50/1.14 substitution0:
% 0.50/1.14 end
% 0.50/1.14 substitution1:
% 0.50/1.14 X := skol2( skol1 )
% 0.50/1.14 end
% 0.50/1.14
% 0.50/1.14 subsumption: (17) {G3,W0,D0,L0,V0,M0} R(16,0);r(0) { }.
% 0.50/1.14 parent0: (30) {G1,W0,D0,L0,V0,M0} { }.
% 0.50/1.14 substitution0:
% 0.50/1.14 end
% 0.50/1.14 permutation0:
% 0.50/1.14 end
% 0.50/1.14
% 0.50/1.14 Proof check complete!
% 0.50/1.14
% 0.50/1.14 Memory use:
% 0.50/1.14
% 0.50/1.14 space for terms: 256
% 0.50/1.14 space for clauses: 973
% 0.50/1.14
% 0.50/1.14
% 0.50/1.14 clauses generated: 25
% 0.50/1.14 clauses kept: 18
% 0.50/1.14 clauses selected: 12
% 0.50/1.14 clauses deleted: 0
% 0.50/1.14 clauses inuse deleted: 0
% 0.50/1.14
% 0.50/1.14 subsentry: 16
% 0.50/1.14 literals s-matched: 6
% 0.50/1.14 literals matched: 6
% 0.50/1.14 full subsumption: 0
% 0.50/1.14
% 0.50/1.14 checksum: 609228049
% 0.50/1.14
% 0.50/1.14
% 0.50/1.14 Bliksem ended
%------------------------------------------------------------------------------