TSTP Solution File: COM002-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : COM002-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n008.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 : Fri Jul 15 00:50:58 EDT 2022
% Result : Unsatisfiable 0.44s 1.07s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COM002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n008.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 : Thu Jun 16 18:10:52 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 Clauses:
% 0.44/1.07 [
% 0.44/1.07 [ succeeds( X, Y ), ~( follows( X, Y ) ) ],
% 0.44/1.07 [ succeeds( X, Y ), ~( succeeds( X, Z ) ), ~( succeeds( Z, Y ) ) ],
% 0.44/1.07 [ succeeds( X, Y ), ~( has( Y, goto( Z ) ) ), ~( labels( Z, X ) ) ],
% 0.44/1.07 [ succeeds( X, Y ), ~( has( Y, ifthen( Z, X ) ) ) ],
% 0.44/1.07 [ has( p1, assign( 'register_j', n0 ) ) ],
% 0.44/1.07 [ follows( p2, p1 ) ],
% 0.44/1.07 [ has( p2, assign( 'register_k', n1 ) ) ],
% 0.44/1.07 [ labels( loop, p3 ) ],
% 0.44/1.07 [ follows( p3, p2 ) ],
% 0.44/1.07 [ has( p3, ifthen( 'equal_function'( 'register_j', n ), p4 ) ) ],
% 0.44/1.07 [ has( p4, goto( out ) ) ],
% 0.44/1.07 [ follows( p5, p4 ) ],
% 0.44/1.07 [ follows( p6, p3 ) ],
% 0.44/1.07 [ has( p6, assign( 'register_k', times( n2, 'register_k' ) ) ) ],
% 0.44/1.07 [ follows( p7, p6 ) ],
% 0.44/1.07 [ has( p7, assign( 'register_j', plus( 'register_j', n1 ) ) ) ],
% 0.44/1.07 [ follows( p8, p7 ) ],
% 0.44/1.07 [ has( p8, goto( loop ) ) ],
% 0.44/1.07 [ ~( succeeds( p3, p3 ) ) ]
% 0.44/1.07 ] .
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 percentage equality = 0.000000, percentage horn = 1.000000
% 0.44/1.07 This is a near-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 = 4
% 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 = negative
% 0.44/1.07
% 0.44/1.07 maxweight = 30000
% 0.44/1.07 maxdepth = 30000
% 0.44/1.07 maxlength = 115
% 0.44/1.07 maxnrvars = 195
% 0.44/1.07 excuselevel = 0
% 0.44/1.07 increasemaxweight = 0
% 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 = 1
% 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:36, a:1, s:1, b:0),
% 0.44/1.07 ! [4, 1] (w:1, o:30, 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 succeeds [41, 2] (w:1, o:61, a:1, s:1, b:0),
% 0.44/1.07 follows [42, 2] (w:1, o:63, a:1, s:1, b:0),
% 0.44/1.07 goto [45, 1] (w:1, o:35, a:1, s:1, b:0),
% 0.44/1.07 has [46, 2] (w:1, o:64, a:1, s:1, b:0),
% 0.44/1.07 labels [47, 2] (w:1, o:65, a:1, s:1, b:0),
% 0.44/1.07 ifthen [49, 2] (w:1, o:66, a:1, s:1, b:0),
% 0.44/1.07 p1 [50, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.44/1.07 'register_j' [51, 0] (w:1, o:17, a:1, s:1, b:0),
% 0.44/1.07 n0 [52, 0] (w:1, o:18, a:1, s:1, b:0),
% 0.44/1.07 assign [53, 2] (w:1, o:67, a:1, s:1, b:0),
% 0.44/1.07 p2 [54, 0] (w:1, o:19, a:1, s:1, b:0),
% 0.44/1.07 'register_k' [55, 0] (w:1, o:20, a:1, s:1, b:0),
% 0.44/1.07 n1 [56, 0] (w:1, o:21, a:1, s:1, b:0),
% 0.44/1.07 loop [57, 0] (w:1, o:22, a:1, s:1, b:0),
% 0.44/1.07 p3 [58, 0] (w:1, o:23, a:1, s:1, b:0),
% 0.44/1.07 n [59, 0] (w:1, o:24, a:1, s:1, b:0),
% 0.44/1.07 'equal_function' [60, 2] (w:1, o:62, a:1, s:1, b:0),
% 0.44/1.07 p4 [61, 0] (w:1, o:25, a:1, s:1, b:0),
% 0.44/1.07 out [62, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.44/1.07 p5 [63, 0] (w:1, o:26, a:1, s:1, b:0),
% 0.44/1.07 p6 [64, 0] (w:1, o:27, a:1, s:1, b:0),
% 0.44/1.07 n2 [65, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.44/1.07 times [66, 2] (w:1, o:68, a:1, s:1, b:0),
% 0.44/1.07 p7 [67, 0] (w:1, o:28, a:1, s:1, b:0),
% 0.44/1.07 plus [68, 2] (w:1, o:69, a:1, s:1, b:0),
% 0.44/1.07 p8 [69, 0] (w:1, o:29, 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 Unsatisfiable
% 0.44/1.07 % SZS output start Refutation
% 0.44/1.07
% 0.44/1.07 clause( 0, [ succeeds( X, Y ), ~( follows( X, Y ) ) ] )
% 0.44/1.07 .
% 0.44/1.07 clause( 1, [ ~( succeeds( X, Z ) ), succeeds( X, Y ), ~( succeeds( Z, Y ) )
% 0.44/1.07 ] )
% 0.44/1.07 .
% 0.44/1.07 clause( 2, [ succeeds( X, Y ), ~( labels( Z, X ) ), ~( has( Y, goto( Z ) )
% 0.44/1.07 ) ] )
% 0.44/1.07 .
% 0.44/1.07 clause( 7, [ labels( loop, p3 ) ] )
% 0.44/1.07 .
% 0.44/1.07 clause( 12, [ follows( p6, p3 ) ] )
% 0.44/1.07 .
% 0.44/1.07 clause( 14, [ follows( p7, p6 ) ] )
% 0.44/1.07 .
% 0.44/1.07 clause( 16, [ follows( p8, p7 ) ] )
% 0.44/1.07 .
% 0.44/1.07 clause( 17, [ has( p8, goto( loop ) ) ] )
% 0.44/1.07 .
% 0.44/1.07 clause( 18, [ ~( succeeds( p3, p3 ) ) ] )
% 0.44/1.07 .
% 0.44/1.07 clause( 21, [ succeeds( p6, p3 ) ] )
% 0.44/1.07 .
% 0.44/1.07 clause( 22, [ succeeds( p7, p6 ) ] )
% 0.44/1.07 .
% 0.44/1.07 clause( 23, [ succeeds( p8, p7 ) ] )
% 0.44/1.07 .
% 0.44/1.07 clause( 24, [ succeeds( X, p6 ), ~( succeeds( X, p7 ) ) ] )
% 0.44/1.07 .
% 0.44/1.07 clause( 25, [ succeeds( X, p3 ), ~( succeeds( X, p6 ) ) ] )
% 0.44/1.07 .
% 0.44/1.07 clause( 31, [ succeeds( X, p8 ), ~( labels( loop, X ) ) ] )
% 0.44/1.07 .
% 0.44/1.07 clause( 33, [ succeeds( p3, p8 ) ] )
% 0.44/1.07 .
% 0.44/1.07 clause( 48, [ succeeds( p8, p6 ) ] )
% 0.44/1.07 .
% 0.44/1.07 clause( 49, [ succeeds( X, p6 ), ~( succeeds( X, p8 ) ) ] )
% 0.44/1.07 .
% 0.44/1.07 clause( 53, [ succeeds( p3, p6 ) ] )
% 0.44/1.07 .
% 0.44/1.07 clause( 60, [] )
% 0.44/1.07 .
% 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 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.44/1.07
% 0.44/1.07 initialclauses(
% 0.44/1.07 [ clause( 62, [ succeeds( X, Y ), ~( follows( X, Y ) ) ] )
% 0.44/1.07 , clause( 63, [ succeeds( X, Y ), ~( succeeds( X, Z ) ), ~( succeeds( Z, Y
% 0.44/1.07 ) ) ] )
% 0.44/1.07 , clause( 64, [ succeeds( X, Y ), ~( has( Y, goto( Z ) ) ), ~( labels( Z, X
% 0.44/1.07 ) ) ] )
% 0.44/1.07 , clause( 65, [ succeeds( X, Y ), ~( has( Y, ifthen( Z, X ) ) ) ] )
% 0.44/1.07 , clause( 66, [ has( p1, assign( 'register_j', n0 ) ) ] )
% 0.44/1.07 , clause( 67, [ follows( p2, p1 ) ] )
% 0.44/1.07 , clause( 68, [ has( p2, assign( 'register_k', n1 ) ) ] )
% 0.44/1.07 , clause( 69, [ labels( loop, p3 ) ] )
% 0.44/1.07 , clause( 70, [ follows( p3, p2 ) ] )
% 0.44/1.07 , clause( 71, [ has( p3, ifthen( 'equal_function'( 'register_j', n ), p4 )
% 0.44/1.07 ) ] )
% 0.44/1.07 , clause( 72, [ has( p4, goto( out ) ) ] )
% 0.44/1.07 , clause( 73, [ follows( p5, p4 ) ] )
% 0.44/1.07 , clause( 74, [ follows( p6, p3 ) ] )
% 0.44/1.07 , clause( 75, [ has( p6, assign( 'register_k', times( n2, 'register_k' ) )
% 0.44/1.07 ) ] )
% 0.44/1.07 , clause( 76, [ follows( p7, p6 ) ] )
% 0.44/1.07 , clause( 77, [ has( p7, assign( 'register_j', plus( 'register_j', n1 ) ) )
% 0.44/1.07 ] )
% 0.44/1.07 , clause( 78, [ follows( p8, p7 ) ] )
% 0.44/1.07 , clause( 79, [ has( p8, goto( loop ) ) ] )
% 0.44/1.07 , clause( 80, [ ~( succeeds( p3, p3 ) ) ] )
% 0.44/1.07 ] ).
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 subsumption(
% 0.44/1.07 clause( 0, [ succeeds( X, Y ), ~( follows( X, Y ) ) ] )
% 0.44/1.07 , clause( 62, [ succeeds( X, Y ), ~( follows( X, Y ) ) ] )
% 0.44/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.44/1.07 ), ==>( 1, 1 )] ) ).
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 subsumption(
% 0.44/1.07 clause( 1, [ ~( succeeds( X, Z ) ), succeeds( X, Y ), ~( succeeds( Z, Y ) )
% 0.44/1.08 ] )
% 0.44/1.08 , clause( 63, [ succeeds( X, Y ), ~( succeeds( X, Z ) ), ~( succeeds( Z, Y
% 0.44/1.08 ) ) ] )
% 0.44/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.44/1.08 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 ), ==>( 2, 2 )] ) ).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 subsumption(
% 0.44/1.08 clause( 2, [ succeeds( X, Y ), ~( labels( Z, X ) ), ~( has( Y, goto( Z ) )
% 0.44/1.08 ) ] )
% 0.44/1.08 , clause( 64, [ succeeds( X, Y ), ~( has( Y, goto( Z ) ) ), ~( labels( Z, X
% 0.44/1.08 ) ) ] )
% 0.44/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.44/1.08 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 subsumption(
% 0.44/1.08 clause( 7, [ labels( loop, p3 ) ] )
% 0.44/1.08 , clause( 69, [ labels( loop, p3 ) ] )
% 0.44/1.08 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 subsumption(
% 0.44/1.08 clause( 12, [ follows( p6, p3 ) ] )
% 0.44/1.08 , clause( 74, [ follows( p6, p3 ) ] )
% 0.44/1.08 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 subsumption(
% 0.44/1.08 clause( 14, [ follows( p7, p6 ) ] )
% 0.44/1.08 , clause( 76, [ follows( p7, p6 ) ] )
% 0.44/1.08 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 subsumption(
% 0.44/1.08 clause( 16, [ follows( p8, p7 ) ] )
% 0.44/1.08 , clause( 78, [ follows( p8, p7 ) ] )
% 0.44/1.08 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 subsumption(
% 0.44/1.08 clause( 17, [ has( p8, goto( loop ) ) ] )
% 0.44/1.08 , clause( 79, [ has( p8, goto( loop ) ) ] )
% 0.44/1.08 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 subsumption(
% 0.44/1.08 clause( 18, [ ~( succeeds( p3, p3 ) ) ] )
% 0.44/1.08 , clause( 80, [ ~( succeeds( p3, p3 ) ) ] )
% 0.44/1.08 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 resolution(
% 0.44/1.08 clause( 89, [ succeeds( p6, p3 ) ] )
% 0.44/1.08 , clause( 0, [ succeeds( X, Y ), ~( follows( X, Y ) ) ] )
% 0.44/1.08 , 1, clause( 12, [ follows( p6, p3 ) ] )
% 0.44/1.08 , 0, substitution( 0, [ :=( X, p6 ), :=( Y, p3 )] ), substitution( 1, [] )
% 0.44/1.08 ).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 subsumption(
% 0.44/1.08 clause( 21, [ succeeds( p6, p3 ) ] )
% 0.44/1.08 , clause( 89, [ succeeds( p6, p3 ) ] )
% 0.44/1.08 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 resolution(
% 0.44/1.08 clause( 90, [ succeeds( p7, p6 ) ] )
% 0.44/1.08 , clause( 0, [ succeeds( X, Y ), ~( follows( X, Y ) ) ] )
% 0.44/1.08 , 1, clause( 14, [ follows( p7, p6 ) ] )
% 0.44/1.08 , 0, substitution( 0, [ :=( X, p7 ), :=( Y, p6 )] ), substitution( 1, [] )
% 0.44/1.08 ).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 subsumption(
% 0.44/1.08 clause( 22, [ succeeds( p7, p6 ) ] )
% 0.44/1.08 , clause( 90, [ succeeds( p7, p6 ) ] )
% 0.44/1.08 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 resolution(
% 0.44/1.08 clause( 91, [ succeeds( p8, p7 ) ] )
% 0.44/1.08 , clause( 0, [ succeeds( X, Y ), ~( follows( X, Y ) ) ] )
% 0.44/1.08 , 1, clause( 16, [ follows( p8, p7 ) ] )
% 0.44/1.08 , 0, substitution( 0, [ :=( X, p8 ), :=( Y, p7 )] ), substitution( 1, [] )
% 0.44/1.08 ).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 subsumption(
% 0.44/1.08 clause( 23, [ succeeds( p8, p7 ) ] )
% 0.44/1.08 , clause( 91, [ succeeds( p8, p7 ) ] )
% 0.44/1.08 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 resolution(
% 0.44/1.08 clause( 93, [ ~( succeeds( X, p7 ) ), succeeds( X, p6 ) ] )
% 0.44/1.08 , clause( 1, [ ~( succeeds( X, Z ) ), succeeds( X, Y ), ~( succeeds( Z, Y )
% 0.44/1.08 ) ] )
% 0.44/1.08 , 2, clause( 22, [ succeeds( p7, p6 ) ] )
% 0.44/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, p6 ), :=( Z, p7 )] ),
% 0.44/1.08 substitution( 1, [] )).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 subsumption(
% 0.44/1.08 clause( 24, [ succeeds( X, p6 ), ~( succeeds( X, p7 ) ) ] )
% 0.44/1.08 , clause( 93, [ ~( succeeds( X, p7 ) ), succeeds( X, p6 ) ] )
% 0.44/1.08 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.44/1.08 0 )] ) ).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 resolution(
% 0.44/1.08 clause( 95, [ ~( succeeds( X, p6 ) ), succeeds( X, p3 ) ] )
% 0.44/1.08 , clause( 1, [ ~( succeeds( X, Z ) ), succeeds( X, Y ), ~( succeeds( Z, Y )
% 0.44/1.08 ) ] )
% 0.44/1.08 , 2, clause( 21, [ succeeds( p6, p3 ) ] )
% 0.44/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, p3 ), :=( Z, p6 )] ),
% 0.44/1.08 substitution( 1, [] )).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 subsumption(
% 0.44/1.08 clause( 25, [ succeeds( X, p3 ), ~( succeeds( X, p6 ) ) ] )
% 0.44/1.08 , clause( 95, [ ~( succeeds( X, p6 ) ), succeeds( X, p3 ) ] )
% 0.44/1.08 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.44/1.08 0 )] ) ).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 resolution(
% 0.44/1.08 clause( 96, [ succeeds( X, p8 ), ~( labels( loop, X ) ) ] )
% 0.44/1.08 , clause( 2, [ succeeds( X, Y ), ~( labels( Z, X ) ), ~( has( Y, goto( Z )
% 0.44/1.08 ) ) ] )
% 0.44/1.08 , 2, clause( 17, [ has( p8, goto( loop ) ) ] )
% 0.44/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, p8 ), :=( Z, loop )] ),
% 0.44/1.08 substitution( 1, [] )).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 subsumption(
% 0.44/1.08 clause( 31, [ succeeds( X, p8 ), ~( labels( loop, X ) ) ] )
% 0.44/1.08 , clause( 96, [ succeeds( X, p8 ), ~( labels( loop, X ) ) ] )
% 0.44/1.08 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.44/1.08 1 )] ) ).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 resolution(
% 0.44/1.08 clause( 97, [ succeeds( p3, p8 ) ] )
% 0.44/1.08 , clause( 31, [ succeeds( X, p8 ), ~( labels( loop, X ) ) ] )
% 0.44/1.08 , 1, clause( 7, [ labels( loop, p3 ) ] )
% 0.44/1.08 , 0, substitution( 0, [ :=( X, p3 )] ), substitution( 1, [] )).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 subsumption(
% 0.44/1.08 clause( 33, [ succeeds( p3, p8 ) ] )
% 0.44/1.08 , clause( 97, [ succeeds( p3, p8 ) ] )
% 0.44/1.08 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 resolution(
% 0.44/1.08 clause( 98, [ succeeds( p8, p6 ) ] )
% 0.44/1.08 , clause( 24, [ succeeds( X, p6 ), ~( succeeds( X, p7 ) ) ] )
% 0.44/1.08 , 1, clause( 23, [ succeeds( p8, p7 ) ] )
% 0.44/1.08 , 0, substitution( 0, [ :=( X, p8 )] ), substitution( 1, [] )).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 subsumption(
% 0.44/1.08 clause( 48, [ succeeds( p8, p6 ) ] )
% 0.44/1.08 , clause( 98, [ succeeds( p8, p6 ) ] )
% 0.44/1.08 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 resolution(
% 0.44/1.08 clause( 100, [ ~( succeeds( X, p8 ) ), succeeds( X, p6 ) ] )
% 0.44/1.08 , clause( 1, [ ~( succeeds( X, Z ) ), succeeds( X, Y ), ~( succeeds( Z, Y )
% 0.44/1.08 ) ] )
% 0.44/1.08 , 2, clause( 48, [ succeeds( p8, p6 ) ] )
% 0.44/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, p6 ), :=( Z, p8 )] ),
% 0.44/1.08 substitution( 1, [] )).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 subsumption(
% 0.44/1.08 clause( 49, [ succeeds( X, p6 ), ~( succeeds( X, p8 ) ) ] )
% 0.44/1.08 , clause( 100, [ ~( succeeds( X, p8 ) ), succeeds( X, p6 ) ] )
% 0.44/1.08 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.44/1.08 0 )] ) ).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 resolution(
% 0.44/1.08 clause( 101, [ succeeds( p3, p6 ) ] )
% 0.44/1.08 , clause( 49, [ succeeds( X, p6 ), ~( succeeds( X, p8 ) ) ] )
% 0.44/1.08 , 1, clause( 33, [ succeeds( p3, p8 ) ] )
% 0.44/1.08 , 0, substitution( 0, [ :=( X, p3 )] ), substitution( 1, [] )).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 subsumption(
% 0.44/1.08 clause( 53, [ succeeds( p3, p6 ) ] )
% 0.44/1.08 , clause( 101, [ succeeds( p3, p6 ) ] )
% 0.44/1.08 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 resolution(
% 0.44/1.08 clause( 102, [ succeeds( p3, p3 ) ] )
% 0.44/1.08 , clause( 25, [ succeeds( X, p3 ), ~( succeeds( X, p6 ) ) ] )
% 0.44/1.08 , 1, clause( 53, [ succeeds( p3, p6 ) ] )
% 0.44/1.08 , 0, substitution( 0, [ :=( X, p3 )] ), substitution( 1, [] )).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 resolution(
% 0.44/1.08 clause( 103, [] )
% 0.44/1.08 , clause( 18, [ ~( succeeds( p3, p3 ) ) ] )
% 0.44/1.08 , 0, clause( 102, [ succeeds( p3, p3 ) ] )
% 0.73/1.08 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.73/1.08
% 0.73/1.08
% 0.73/1.08 subsumption(
% 0.73/1.08 clause( 60, [] )
% 0.73/1.08 , clause( 103, [] )
% 0.73/1.08 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.73/1.08
% 0.73/1.08
% 0.73/1.08 end.
% 0.73/1.08
% 0.73/1.08 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.73/1.08
% 0.73/1.08 Memory use:
% 0.73/1.08
% 0.73/1.08 space for terms: 607
% 0.73/1.08 space for clauses: 3031
% 0.73/1.08
% 0.73/1.08
% 0.73/1.08 clauses generated: 75
% 0.73/1.08 clauses kept: 61
% 0.73/1.08 clauses selected: 50
% 0.73/1.08 clauses deleted: 0
% 0.73/1.08 clauses inuse deleted: 0
% 0.73/1.08
% 0.73/1.08 subsentry: 40
% 0.73/1.08 literals s-matched: 11
% 0.73/1.08 literals matched: 11
% 0.73/1.08 full subsumption: 0
% 0.73/1.08
% 0.73/1.08 checksum: -1894587995
% 0.73/1.08
% 0.73/1.08
% 0.73/1.08 Bliksem ended
%------------------------------------------------------------------------------