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