TSTP Solution File: SYN979+1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN979+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n028.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:58:31 EDT 2022
% Result : Theorem 0.43s 1.06s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN979+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % DateTime : Tue Jul 12 01:47:14 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.43/1.06 *** allocated 10000 integers for termspace/termends
% 0.43/1.06 *** allocated 10000 integers for clauses
% 0.43/1.06 *** allocated 10000 integers for justifications
% 0.43/1.06 Bliksem 1.12
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 Automatic Strategy Selection
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 Clauses:
% 0.43/1.06
% 0.43/1.06 { ! q( X ), p( X, skol1 ) }.
% 0.43/1.06 { q( skol1 ) }.
% 0.43/1.06 { q( skol2 ) }.
% 0.43/1.06 { ! r( Y ), p( skol2, Y ) }.
% 0.43/1.06 { r( skol1 ) }.
% 0.43/1.06 { r( skol2 ) }.
% 0.43/1.06 { ! s( skol1 ), p( X, Y ) }.
% 0.43/1.06 { s( skol1 ) }.
% 0.43/1.06 { ! p( skol1, skol2 ) }.
% 0.43/1.06
% 0.43/1.06 percentage equality = 0.000000, percentage horn = 1.000000
% 0.43/1.06 This is a near-Horn, non-equality problem
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 Options Used:
% 0.43/1.06
% 0.43/1.06 useres = 1
% 0.43/1.06 useparamod = 0
% 0.43/1.06 useeqrefl = 0
% 0.43/1.06 useeqfact = 0
% 0.43/1.06 usefactor = 1
% 0.43/1.06 usesimpsplitting = 0
% 0.43/1.06 usesimpdemod = 0
% 0.43/1.06 usesimpres = 4
% 0.43/1.06
% 0.43/1.06 resimpinuse = 1000
% 0.43/1.06 resimpclauses = 20000
% 0.43/1.06 substype = standard
% 0.43/1.06 backwardsubs = 1
% 0.43/1.06 selectoldest = 5
% 0.43/1.06
% 0.43/1.06 litorderings [0] = split
% 0.43/1.06 litorderings [1] = liftord
% 0.43/1.06
% 0.43/1.06 termordering = none
% 0.43/1.06
% 0.43/1.06 litapriori = 1
% 0.43/1.06 termapriori = 0
% 0.43/1.06 litaposteriori = 0
% 0.43/1.06 termaposteriori = 0
% 0.43/1.06 demodaposteriori = 0
% 0.43/1.06 ordereqreflfact = 0
% 0.43/1.06
% 0.43/1.06 litselect = negative
% 0.43/1.06
% 0.43/1.06 maxweight = 30000
% 0.43/1.06 maxdepth = 30000
% 0.43/1.06 maxlength = 115
% 0.43/1.06 maxnrvars = 195
% 0.43/1.06 excuselevel = 0
% 0.43/1.06 increasemaxweight = 0
% 0.43/1.06
% 0.43/1.06 maxselected = 10000000
% 0.43/1.06 maxnrclauses = 10000000
% 0.43/1.06
% 0.43/1.06 showgenerated = 0
% 0.43/1.06 showkept = 0
% 0.43/1.06 showselected = 0
% 0.43/1.06 showdeleted = 0
% 0.43/1.06 showresimp = 1
% 0.43/1.06 showstatus = 2000
% 0.43/1.06
% 0.43/1.06 prologoutput = 0
% 0.43/1.06 nrgoals = 5000000
% 0.43/1.06 totalproof = 1
% 0.43/1.06
% 0.43/1.06 Symbols occurring in the translation:
% 0.43/1.06
% 0.43/1.06 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.43/1.06 . [1, 2] (w:1, o:20, a:1, s:1, b:0),
% 0.43/1.06 ! [4, 1] (w:1, o:12, a:1, s:1, b:0),
% 0.43/1.06 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.43/1.06 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.43/1.06 q [39, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.43/1.06 p [40, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.43/1.06 r [41, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.43/1.06 s [42, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.43/1.06 skol1 [43, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.43/1.06 skol2 [44, 0] (w:1, o:11, a:1, s:1, b:0).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 Starting Search:
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 Bliksems!, er is een bewijs:
% 0.43/1.06 % SZS status Theorem
% 0.43/1.06 % SZS output start Refutation
% 0.43/1.06
% 0.43/1.06 (6) {G0,W6,D2,L2,V2,M1} I { p( X, Y ), ! s( skol1 ) }.
% 0.43/1.06 (7) {G0,W2,D2,L1,V0,M1} I { s( skol1 ) }.
% 0.43/1.06 (8) {G0,W4,D2,L1,V0,M1} I { ! p( skol1, skol2 ) }.
% 0.43/1.06 (11) {G1,W3,D2,L1,V2,M1} S(6);r(7) { p( X, Y ) }.
% 0.43/1.06 (12) {G2,W0,D0,L0,V0,M0} R(11,8) { }.
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 % SZS output end Refutation
% 0.43/1.06 found a proof!
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 Unprocessed initial clauses:
% 0.43/1.06
% 0.43/1.06 (14) {G0,W6,D2,L2,V1,M2} { ! q( X ), p( X, skol1 ) }.
% 0.43/1.06 (15) {G0,W2,D2,L1,V0,M1} { q( skol1 ) }.
% 0.43/1.06 (16) {G0,W2,D2,L1,V0,M1} { q( skol2 ) }.
% 0.43/1.06 (17) {G0,W6,D2,L2,V1,M2} { ! r( Y ), p( skol2, Y ) }.
% 0.43/1.06 (18) {G0,W2,D2,L1,V0,M1} { r( skol1 ) }.
% 0.43/1.06 (19) {G0,W2,D2,L1,V0,M1} { r( skol2 ) }.
% 0.43/1.06 (20) {G0,W6,D2,L2,V2,M2} { ! s( skol1 ), p( X, Y ) }.
% 0.43/1.06 (21) {G0,W2,D2,L1,V0,M1} { s( skol1 ) }.
% 0.43/1.06 (22) {G0,W4,D2,L1,V0,M1} { ! p( skol1, skol2 ) }.
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 Total Proof:
% 0.43/1.06
% 0.43/1.06 subsumption: (6) {G0,W6,D2,L2,V2,M1} I { p( X, Y ), ! s( skol1 ) }.
% 0.43/1.06 parent0: (20) {G0,W6,D2,L2,V2,M2} { ! s( skol1 ), p( X, Y ) }.
% 0.43/1.06 substitution0:
% 0.43/1.06 X := X
% 0.43/1.06 Y := Y
% 0.43/1.06 end
% 0.43/1.06 permutation0:
% 0.43/1.06 0 ==> 1
% 0.43/1.06 1 ==> 0
% 0.43/1.06 end
% 0.43/1.06
% 0.43/1.06 subsumption: (7) {G0,W2,D2,L1,V0,M1} I { s( skol1 ) }.
% 0.43/1.07 parent0: (21) {G0,W2,D2,L1,V0,M1} { s( skol1 ) }.
% 0.43/1.07 substitution0:
% 0.43/1.07 end
% 0.43/1.07 permutation0:
% 0.43/1.07 0 ==> 0
% 0.43/1.07 end
% 0.43/1.07
% 0.43/1.07 subsumption: (8) {G0,W4,D2,L1,V0,M1} I { ! p( skol1, skol2 ) }.
% 0.43/1.07 parent0: (22) {G0,W4,D2,L1,V0,M1} { ! p( skol1, skol2 ) }.
% 0.43/1.07 substitution0:
% 0.43/1.07 end
% 0.43/1.07 permutation0:
% 0.43/1.07 0 ==> 0
% 0.43/1.07 end
% 0.43/1.07
% 0.43/1.07 resolution: (23) {G1,W3,D2,L1,V2,M1} { p( X, Y ) }.
% 0.43/1.07 parent0[1]: (6) {G0,W6,D2,L2,V2,M1} I { p( X, Y ), ! s( skol1 ) }.
% 0.43/1.07 parent1[0]: (7) {G0,W2,D2,L1,V0,M1} I { s( skol1 ) }.
% 0.43/1.07 substitution0:
% 0.43/1.07 X := X
% 0.43/1.07 Y := Y
% 0.43/1.07 end
% 0.43/1.07 substitution1:
% 0.43/1.07 end
% 0.43/1.07
% 0.43/1.07 subsumption: (11) {G1,W3,D2,L1,V2,M1} S(6);r(7) { p( X, Y ) }.
% 0.43/1.07 parent0: (23) {G1,W3,D2,L1,V2,M1} { p( X, Y ) }.
% 0.43/1.07 substitution0:
% 0.43/1.07 X := X
% 0.43/1.07 Y := Y
% 0.43/1.07 end
% 0.43/1.07 permutation0:
% 0.43/1.07 0 ==> 0
% 0.43/1.07 end
% 0.43/1.07
% 0.43/1.07 resolution: (24) {G1,W0,D0,L0,V0,M0} { }.
% 0.43/1.07 parent0[0]: (8) {G0,W4,D2,L1,V0,M1} I { ! p( skol1, skol2 ) }.
% 0.43/1.07 parent1[0]: (11) {G1,W3,D2,L1,V2,M1} S(6);r(7) { p( X, Y ) }.
% 0.43/1.07 substitution0:
% 0.43/1.07 end
% 0.43/1.07 substitution1:
% 0.43/1.07 X := skol1
% 0.43/1.07 Y := skol2
% 0.43/1.07 end
% 0.43/1.07
% 0.43/1.07 subsumption: (12) {G2,W0,D0,L0,V0,M0} R(11,8) { }.
% 0.43/1.07 parent0: (24) {G1,W0,D0,L0,V0,M0} { }.
% 0.43/1.07 substitution0:
% 0.43/1.07 end
% 0.43/1.07 permutation0:
% 0.43/1.07 end
% 0.43/1.07
% 0.43/1.07 Proof check complete!
% 0.43/1.07
% 0.43/1.07 Memory use:
% 0.43/1.07
% 0.43/1.07 space for terms: 143
% 0.43/1.07 space for clauses: 618
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 clauses generated: 13
% 0.43/1.07 clauses kept: 13
% 0.43/1.07 clauses selected: 10
% 0.43/1.07 clauses deleted: 2
% 0.43/1.07 clauses inuse deleted: 0
% 0.43/1.07
% 0.43/1.07 subsentry: 1
% 0.43/1.07 literals s-matched: 1
% 0.43/1.07 literals matched: 1
% 0.43/1.07 full subsumption: 0
% 0.43/1.07
% 0.43/1.07 checksum: -202132959
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 Bliksem ended
%------------------------------------------------------------------------------