TSTP Solution File: LCL682+1.001 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL682+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n010.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 : Sun Jul 17 07:56:51 EDT 2022
% Result : Theorem 0.71s 1.09s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL682+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : bliksem %s
% 0.12/0.33 % Computer : n010.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Sun Jul 3 00:49:33 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.71/1.09 *** allocated 10000 integers for termspace/termends
% 0.71/1.09 *** allocated 10000 integers for clauses
% 0.71/1.09 *** allocated 10000 integers for justifications
% 0.71/1.09 Bliksem 1.12
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Automatic Strategy Selection
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Clauses:
% 0.71/1.09
% 0.71/1.09 { r1( X, X ) }.
% 0.71/1.09 { ! r1( X, Z ), ! r1( Z, Y ), r1( X, Y ) }.
% 0.71/1.09 { ! r1( skol1, X ), ! r1( X, Y ), p16( Y ) }.
% 0.71/1.09 { ! r1( skol1, X ), ! r1( X, Y ), p12( Y ) }.
% 0.71/1.09 { ! r1( skol1, X ), ! r1( X, Y ), p14( Y ) }.
% 0.71/1.09 { ! r1( skol1, X ), ! r1( X, Y ), p12( Y ) }.
% 0.71/1.09 { r1( skol1, skol2 ) }.
% 0.71/1.09 { r1( skol2, skol3 ) }.
% 0.71/1.09 { ! p15( skol3 ) }.
% 0.71/1.09 { r1( skol1, skol4 ) }.
% 0.71/1.09 { r1( skol4, skol5 ) }.
% 0.71/1.09 { ! p13( skol5 ) }.
% 0.71/1.09 { r1( skol1, skol6 ) }.
% 0.71/1.09 { r1( skol6, skol7 ) }.
% 0.71/1.09 { ! p12( skol7 ) }.
% 0.71/1.09 { r1( skol1, skol8 ) }.
% 0.71/1.09 { r1( skol8, skol9 ) }.
% 0.71/1.09 { ! p11( skol9 ) }.
% 0.71/1.09
% 0.71/1.09 percentage equality = 0.000000, percentage horn = 1.000000
% 0.71/1.09 This is a near-Horn, non-equality problem
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Options Used:
% 0.71/1.09
% 0.71/1.09 useres = 1
% 0.71/1.09 useparamod = 0
% 0.71/1.09 useeqrefl = 0
% 0.71/1.09 useeqfact = 0
% 0.71/1.09 usefactor = 1
% 0.71/1.09 usesimpsplitting = 0
% 0.71/1.09 usesimpdemod = 0
% 0.71/1.09 usesimpres = 4
% 0.71/1.09
% 0.71/1.09 resimpinuse = 1000
% 0.71/1.09 resimpclauses = 20000
% 0.71/1.09 substype = standard
% 0.71/1.09 backwardsubs = 1
% 0.71/1.09 selectoldest = 5
% 0.71/1.09
% 0.71/1.09 litorderings [0] = split
% 0.71/1.09 litorderings [1] = liftord
% 0.71/1.09
% 0.71/1.09 termordering = none
% 0.71/1.09
% 0.71/1.09 litapriori = 1
% 0.71/1.09 termapriori = 0
% 0.71/1.09 litaposteriori = 0
% 0.71/1.09 termaposteriori = 0
% 0.71/1.09 demodaposteriori = 0
% 0.71/1.09 ordereqreflfact = 0
% 0.71/1.09
% 0.71/1.09 litselect = negative
% 0.71/1.09
% 0.71/1.09 maxweight = 30000
% 0.71/1.09 maxdepth = 30000
% 0.71/1.09 maxlength = 115
% 0.71/1.09 maxnrvars = 195
% 0.71/1.09 excuselevel = 0
% 0.71/1.09 increasemaxweight = 0
% 0.71/1.09
% 0.71/1.09 maxselected = 10000000
% 0.71/1.09 maxnrclauses = 10000000
% 0.71/1.09
% 0.71/1.09 showgenerated = 0
% 0.71/1.09 showkept = 0
% 0.71/1.09 showselected = 0
% 0.71/1.09 showdeleted = 0
% 0.71/1.09 showresimp = 1
% 0.71/1.09 showstatus = 2000
% 0.71/1.09
% 0.71/1.09 prologoutput = 0
% 0.71/1.09 nrgoals = 5000000
% 0.71/1.09 totalproof = 1
% 0.71/1.09
% 0.71/1.09 Symbols occurring in the translation:
% 0.71/1.09
% 0.71/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.71/1.09 . [1, 2] (w:1, o:29, a:1, s:1, b:0),
% 0.71/1.09 ! [4, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.71/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.09 r1 [36, 2] (w:1, o:53, a:1, s:1, b:0),
% 0.71/1.09 p16 [39, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.71/1.09 p12 [40, 1] (w:1, o:26, a:1, s:1, b:0),
% 0.71/1.09 p14 [41, 1] (w:1, o:28, a:1, s:1, b:0),
% 0.71/1.09 p15 [42, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.71/1.09 p13 [43, 1] (w:1, o:27, a:1, s:1, b:0),
% 0.71/1.09 p11 [44, 1] (w:1, o:25, a:1, s:1, b:0),
% 0.71/1.09 skol1 [45, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.71/1.09 skol2 [46, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.71/1.09 skol3 [47, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.71/1.09 skol4 [48, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.71/1.09 skol5 [49, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.71/1.09 skol6 [50, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.71/1.09 skol7 [51, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.71/1.09 skol8 [52, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.71/1.09 skol9 [53, 0] (w:1, o:17, a:1, s:1, b:0).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Starting Search:
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Bliksems!, er is een bewijs:
% 0.71/1.09 % SZS status Theorem
% 0.71/1.09 % SZS output start Refutation
% 0.71/1.09
% 0.71/1.09 (3) {G0,W10,D2,L3,V2,M1} I { p12( Y ), ! r1( skol1, X ), ! r1( X, Y ) }.
% 0.71/1.09 (11) {G0,W3,D2,L1,V0,M1} I { r1( skol1, skol6 ) }.
% 0.71/1.09 (12) {G0,W3,D2,L1,V0,M1} I { r1( skol6, skol7 ) }.
% 0.71/1.09 (13) {G0,W3,D2,L1,V0,M1} I { ! p12( skol7 ) }.
% 0.71/1.09 (30) {G1,W4,D2,L1,V0,M1} R(3,12);r(13) { ! r1( skol1, skol6 ) }.
% 0.71/1.09 (57) {G2,W0,D0,L0,V0,M0} S(30);r(11) { }.
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 % SZS output end Refutation
% 0.71/1.09 found a proof!
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Unprocessed initial clauses:
% 0.71/1.09
% 0.71/1.09 (59) {G0,W3,D2,L1,V1,M1} { r1( X, X ) }.
% 0.71/1.09 (60) {G0,W11,D2,L3,V3,M3} { ! r1( X, Z ), ! r1( Z, Y ), r1( X, Y ) }.
% 0.71/1.09 (61) {G0,W10,D2,L3,V2,M3} { ! r1( skol1, X ), ! r1( X, Y ), p16( Y ) }.
% 0.71/1.09 (62) {G0,W10,D2,L3,V2,M3} { ! r1( skol1, X ), ! r1( X, Y ), p12( Y ) }.
% 0.71/1.09 (63) {G0,W10,D2,L3,V2,M3} { ! r1( skol1, X ), ! r1( X, Y ), p14( Y ) }.
% 0.71/1.09 (64) {G0,W10,D2,L3,V2,M3} { ! r1( skol1, X ), ! r1( X, Y ), p12( Y ) }.
% 0.71/1.09 (65) {G0,W3,D2,L1,V0,M1} { r1( skol1, skol2 ) }.
% 0.71/1.09 (66) {G0,W3,D2,L1,V0,M1} { r1( skol2, skol3 ) }.
% 0.71/1.09 (67) {G0,W3,D2,L1,V0,M1} { ! p15( skol3 ) }.
% 0.71/1.09 (68) {G0,W3,D2,L1,V0,M1} { r1( skol1, skol4 ) }.
% 0.71/1.09 (69) {G0,W3,D2,L1,V0,M1} { r1( skol4, skol5 ) }.
% 0.71/1.09 (70) {G0,W3,D2,L1,V0,M1} { ! p13( skol5 ) }.
% 0.71/1.09 (71) {G0,W3,D2,L1,V0,M1} { r1( skol1, skol6 ) }.
% 0.71/1.09 (72) {G0,W3,D2,L1,V0,M1} { r1( skol6, skol7 ) }.
% 0.71/1.09 (73) {G0,W3,D2,L1,V0,M1} { ! p12( skol7 ) }.
% 0.71/1.09 (74) {G0,W3,D2,L1,V0,M1} { r1( skol1, skol8 ) }.
% 0.71/1.09 (75) {G0,W3,D2,L1,V0,M1} { r1( skol8, skol9 ) }.
% 0.71/1.09 (76) {G0,W3,D2,L1,V0,M1} { ! p11( skol9 ) }.
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Total Proof:
% 0.71/1.09
% 0.71/1.09 subsumption: (3) {G0,W10,D2,L3,V2,M1} I { p12( Y ), ! r1( skol1, X ), ! r1
% 0.71/1.09 ( X, Y ) }.
% 0.71/1.09 parent0: (62) {G0,W10,D2,L3,V2,M3} { ! r1( skol1, X ), ! r1( X, Y ), p12(
% 0.71/1.09 Y ) }.
% 0.71/1.09 substitution0:
% 0.71/1.09 X := X
% 0.71/1.09 Y := Y
% 0.71/1.09 end
% 0.71/1.09 permutation0:
% 0.71/1.09 0 ==> 1
% 0.71/1.09 1 ==> 2
% 0.71/1.09 2 ==> 0
% 0.71/1.09 end
% 0.71/1.09
% 0.71/1.09 subsumption: (11) {G0,W3,D2,L1,V0,M1} I { r1( skol1, skol6 ) }.
% 0.71/1.09 parent0: (71) {G0,W3,D2,L1,V0,M1} { r1( skol1, skol6 ) }.
% 0.71/1.09 substitution0:
% 0.71/1.09 end
% 0.71/1.09 permutation0:
% 0.71/1.09 0 ==> 0
% 0.71/1.09 end
% 0.71/1.09
% 0.71/1.09 subsumption: (12) {G0,W3,D2,L1,V0,M1} I { r1( skol6, skol7 ) }.
% 0.71/1.09 parent0: (72) {G0,W3,D2,L1,V0,M1} { r1( skol6, skol7 ) }.
% 0.71/1.09 substitution0:
% 0.71/1.09 end
% 0.71/1.09 permutation0:
% 0.71/1.09 0 ==> 0
% 0.71/1.09 end
% 0.71/1.09
% 0.71/1.09 subsumption: (13) {G0,W3,D2,L1,V0,M1} I { ! p12( skol7 ) }.
% 0.71/1.09 parent0: (73) {G0,W3,D2,L1,V0,M1} { ! p12( skol7 ) }.
% 0.71/1.09 substitution0:
% 0.71/1.09 end
% 0.71/1.09 permutation0:
% 0.71/1.09 0 ==> 0
% 0.71/1.09 end
% 0.71/1.09
% 0.71/1.09 resolution: (95) {G1,W6,D2,L2,V0,M2} { p12( skol7 ), ! r1( skol1, skol6 )
% 0.71/1.09 }.
% 0.71/1.09 parent0[2]: (3) {G0,W10,D2,L3,V2,M1} I { p12( Y ), ! r1( skol1, X ), ! r1(
% 0.71/1.09 X, Y ) }.
% 0.71/1.09 parent1[0]: (12) {G0,W3,D2,L1,V0,M1} I { r1( skol6, skol7 ) }.
% 0.71/1.09 substitution0:
% 0.71/1.09 X := skol6
% 0.71/1.09 Y := skol7
% 0.71/1.09 end
% 0.71/1.09 substitution1:
% 0.71/1.09 end
% 0.71/1.09
% 0.71/1.09 resolution: (96) {G1,W4,D2,L1,V0,M1} { ! r1( skol1, skol6 ) }.
% 0.71/1.09 parent0[0]: (13) {G0,W3,D2,L1,V0,M1} I { ! p12( skol7 ) }.
% 0.71/1.09 parent1[0]: (95) {G1,W6,D2,L2,V0,M2} { p12( skol7 ), ! r1( skol1, skol6 )
% 0.71/1.09 }.
% 0.71/1.09 substitution0:
% 0.71/1.09 end
% 0.71/1.09 substitution1:
% 0.71/1.09 end
% 0.71/1.09
% 0.71/1.09 subsumption: (30) {G1,W4,D2,L1,V0,M1} R(3,12);r(13) { ! r1( skol1, skol6 )
% 0.71/1.09 }.
% 0.71/1.09 parent0: (96) {G1,W4,D2,L1,V0,M1} { ! r1( skol1, skol6 ) }.
% 0.71/1.09 substitution0:
% 0.71/1.09 end
% 0.71/1.09 permutation0:
% 0.71/1.09 0 ==> 0
% 0.71/1.09 end
% 0.71/1.09
% 0.71/1.09 resolution: (97) {G1,W0,D0,L0,V0,M0} { }.
% 0.71/1.09 parent0[0]: (30) {G1,W4,D2,L1,V0,M1} R(3,12);r(13) { ! r1( skol1, skol6 )
% 0.71/1.09 }.
% 0.71/1.09 parent1[0]: (11) {G0,W3,D2,L1,V0,M1} I { r1( skol1, skol6 ) }.
% 0.71/1.09 substitution0:
% 0.71/1.09 end
% 0.71/1.09 substitution1:
% 0.71/1.09 end
% 0.71/1.09
% 0.71/1.09 subsumption: (57) {G2,W0,D0,L0,V0,M0} S(30);r(11) { }.
% 0.71/1.09 parent0: (97) {G1,W0,D0,L0,V0,M0} { }.
% 0.71/1.09 substitution0:
% 0.71/1.09 end
% 0.71/1.09 permutation0:
% 0.71/1.09 end
% 0.71/1.09
% 0.71/1.09 Proof check complete!
% 0.71/1.09
% 0.71/1.09 Memory use:
% 0.71/1.09
% 0.71/1.09 space for terms: 504
% 0.71/1.09 space for clauses: 2613
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 clauses generated: 66
% 0.71/1.09 clauses kept: 58
% 0.71/1.09 clauses selected: 46
% 0.71/1.09 clauses deleted: 1
% 0.71/1.09 clauses inuse deleted: 0
% 0.71/1.09
% 0.71/1.09 subsentry: 20
% 0.71/1.09 literals s-matched: 6
% 0.71/1.09 literals matched: 6
% 0.71/1.09 full subsumption: 1
% 0.71/1.09
% 0.71/1.09 checksum: 1314404414
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Bliksem ended
%------------------------------------------------------------------------------