TSTP Solution File: COM002-2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : COM002-2 : TPTP v8.1.0. Released v1.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 : Fri Jul 15 00:50:58 EDT 2022
% Result : Unsatisfiable 0.45s 1.10s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COM002-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n017.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 19:13:56 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.45/1.10 *** allocated 10000 integers for termspace/termends
% 0.45/1.10 *** allocated 10000 integers for clauses
% 0.45/1.10 *** allocated 10000 integers for justifications
% 0.45/1.10 Bliksem 1.12
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 Automatic Strategy Selection
% 0.45/1.10
% 0.45/1.10 Clauses:
% 0.45/1.10 [
% 0.45/1.10 [ ~( fails( X, Y ) ), ~( follows( X, Y ) ) ],
% 0.45/1.10 [ ~( fails( X, Y ) ), fails( X, Z ), fails( Z, Y ) ],
% 0.45/1.10 [ ~( fails( X, Y ) ), ~( has( Y, goto( Z ) ) ), ~( labels( Z, X ) ) ]
% 0.45/1.10 ,
% 0.45/1.10 [ ~( fails( X, Y ) ), ~( has( Y, ifthen( Z, X ) ) ) ],
% 0.45/1.10 [ has( p1, assign( 'register_j', n0 ) ) ],
% 0.45/1.10 [ follows( p2, p1 ) ],
% 0.45/1.10 [ has( p2, assign( 'register_k', n1 ) ) ],
% 0.45/1.10 [ labels( loop, p3 ) ],
% 0.45/1.10 [ follows( p3, p2 ) ],
% 0.45/1.10 [ has( p3, ifthen( 'equal_function'( 'register_j', n ), p4 ) ) ],
% 0.45/1.10 [ has( p4, goto( out ) ) ],
% 0.45/1.10 [ follows( p5, p4 ) ],
% 0.45/1.10 [ follows( p6, p3 ) ],
% 0.45/1.10 [ has( p6, assign( 'register_k', times( n2, 'register_k' ) ) ) ],
% 0.45/1.10 [ follows( p7, p6 ) ],
% 0.45/1.10 [ has( p7, assign( 'register_j', plus( 'register_j', n1 ) ) ) ],
% 0.45/1.10 [ follows( p8, p7 ) ],
% 0.45/1.10 [ has( p8, goto( loop ) ) ],
% 0.45/1.10 [ fails( p3, p3 ) ]
% 0.45/1.10 ] .
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 percentage equality = 0.000000, percentage horn = 0.947368
% 0.45/1.10 This is a near-Horn, non-equality problem
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 Options Used:
% 0.45/1.10
% 0.45/1.10 useres = 1
% 0.45/1.10 useparamod = 0
% 0.45/1.10 useeqrefl = 0
% 0.45/1.10 useeqfact = 0
% 0.45/1.10 usefactor = 1
% 0.45/1.10 usesimpsplitting = 0
% 0.45/1.10 usesimpdemod = 0
% 0.45/1.10 usesimpres = 4
% 0.45/1.10
% 0.45/1.10 resimpinuse = 1000
% 0.45/1.10 resimpclauses = 20000
% 0.45/1.10 substype = standard
% 0.45/1.10 backwardsubs = 1
% 0.45/1.10 selectoldest = 5
% 0.45/1.10
% 0.45/1.10 litorderings [0] = split
% 0.45/1.10 litorderings [1] = liftord
% 0.45/1.10
% 0.45/1.10 termordering = none
% 0.45/1.10
% 0.45/1.10 litapriori = 1
% 0.45/1.10 termapriori = 0
% 0.45/1.10 litaposteriori = 0
% 0.45/1.10 termaposteriori = 0
% 0.45/1.10 demodaposteriori = 0
% 0.45/1.10 ordereqreflfact = 0
% 0.45/1.10
% 0.45/1.10 litselect = negative
% 0.45/1.10
% 0.45/1.10 maxweight = 30000
% 0.45/1.10 maxdepth = 30000
% 0.45/1.10 maxlength = 115
% 0.45/1.10 maxnrvars = 195
% 0.45/1.10 excuselevel = 0
% 0.45/1.10 increasemaxweight = 0
% 0.45/1.10
% 0.45/1.10 maxselected = 10000000
% 0.45/1.10 maxnrclauses = 10000000
% 0.45/1.10
% 0.45/1.10 showgenerated = 0
% 0.45/1.10 showkept = 0
% 0.45/1.10 showselected = 0
% 0.45/1.10 showdeleted = 0
% 0.45/1.10 showresimp = 1
% 0.45/1.10 showstatus = 2000
% 0.45/1.10
% 0.45/1.10 prologoutput = 1
% 0.45/1.10 nrgoals = 5000000
% 0.45/1.10 totalproof = 1
% 0.45/1.10
% 0.45/1.10 Symbols occurring in the translation:
% 0.45/1.10
% 0.45/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.45/1.10 . [1, 2] (w:1, o:36, a:1, s:1, b:0),
% 0.45/1.10 ! [4, 1] (w:1, o:30, a:1, s:1, b:0),
% 0.45/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.45/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.45/1.10 fails [41, 2] (w:1, o:62, a:1, s:1, b:0),
% 0.45/1.10 follows [42, 2] (w:1, o:63, a:1, s:1, b:0),
% 0.45/1.10 goto [45, 1] (w:1, o:35, a:1, s:1, b:0),
% 0.45/1.10 has [46, 2] (w:1, o:64, a:1, s:1, b:0),
% 0.45/1.10 labels [47, 2] (w:1, o:65, a:1, s:1, b:0),
% 0.45/1.10 ifthen [49, 2] (w:1, o:66, a:1, s:1, b:0),
% 0.45/1.10 p1 [50, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.45/1.10 'register_j' [51, 0] (w:1, o:17, a:1, s:1, b:0),
% 0.45/1.10 n0 [52, 0] (w:1, o:18, a:1, s:1, b:0),
% 0.45/1.10 assign [53, 2] (w:1, o:67, a:1, s:1, b:0),
% 0.45/1.10 p2 [54, 0] (w:1, o:19, a:1, s:1, b:0),
% 0.45/1.10 'register_k' [55, 0] (w:1, o:20, a:1, s:1, b:0),
% 0.45/1.10 n1 [56, 0] (w:1, o:21, a:1, s:1, b:0),
% 0.45/1.10 loop [57, 0] (w:1, o:22, a:1, s:1, b:0),
% 0.45/1.10 p3 [58, 0] (w:1, o:23, a:1, s:1, b:0),
% 0.45/1.10 n [59, 0] (w:1, o:24, a:1, s:1, b:0),
% 0.45/1.10 'equal_function' [60, 2] (w:1, o:61, a:1, s:1, b:0),
% 0.45/1.10 p4 [61, 0] (w:1, o:25, a:1, s:1, b:0),
% 0.45/1.10 out [62, 0] (w:1, o:8, a:1, s:1, b:0),
% 0.45/1.10 p5 [63, 0] (w:1, o:26, a:1, s:1, b:0),
% 0.45/1.10 p6 [64, 0] (w:1, o:27, a:1, s:1, b:0),
% 0.45/1.10 n2 [65, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.45/1.10 times [66, 2] (w:1, o:68, a:1, s:1, b:0),
% 0.45/1.10 p7 [67, 0] (w:1, o:28, a:1, s:1, b:0),
% 0.45/1.10 plus [68, 2] (w:1, o:69, a:1, s:1, b:0),
% 0.45/1.10 p8 [69, 0] (w:1, o:29, a:1, s:1, b:0).
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 Starting Search:
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 Bliksems!, er is een bewijs:
% 0.45/1.10 % SZS status Unsatisfiable
% 0.45/1.10 % SZS output start Refutation
% 0.45/1.10
% 0.45/1.10 clause( 0, [ ~( follows( X, Y ) ), ~( fails( X, Y ) ) ] )
% 0.45/1.10 .
% 0.45/1.10 clause( 1, [ fails( X, Z ), fails( Z, Y ), ~( fails( X, Y ) ) ] )
% 0.45/1.10 .
% 0.45/1.10 clause( 2, [ ~( labels( Z, X ) ), ~( has( Y, goto( Z ) ) ), ~( fails( X, Y
% 0.45/1.10 ) ) ] )
% 0.45/1.10 .
% 0.45/1.10 clause( 7, [ labels( loop, p3 ) ] )
% 0.45/1.10 .
% 0.45/1.10 clause( 12, [ follows( p6, p3 ) ] )
% 0.45/1.10 .
% 0.45/1.10 clause( 14, [ follows( p7, p6 ) ] )
% 0.45/1.10 .
% 0.45/1.10 clause( 16, [ follows( p8, p7 ) ] )
% 0.45/1.10 .
% 0.45/1.10 clause( 17, [ has( p8, goto( loop ) ) ] )
% 0.45/1.10 .
% 0.45/1.10 clause( 18, [ fails( p3, p3 ) ] )
% 0.45/1.10 .
% 0.45/1.10 clause( 20, [ fails( X, p3 ), fails( p3, X ) ] )
% 0.45/1.10 .
% 0.45/1.10 clause( 23, [ fails( X, p3 ), ~( labels( Y, p3 ) ), ~( has( X, goto( Y ) )
% 0.45/1.10 ) ] )
% 0.45/1.10 .
% 0.45/1.10 clause( 91, [ fails( p8, p3 ) ] )
% 0.45/1.10 .
% 0.45/1.10 clause( 94, [ fails( X, p3 ), fails( p8, X ) ] )
% 0.45/1.10 .
% 0.45/1.10 clause( 101, [ fails( p8, X ), ~( follows( X, p3 ) ) ] )
% 0.45/1.10 .
% 0.45/1.10 clause( 113, [ fails( p8, p6 ) ] )
% 0.45/1.10 .
% 0.45/1.10 clause( 116, [ fails( X, p6 ), fails( p8, X ) ] )
% 0.45/1.10 .
% 0.45/1.10 clause( 135, [ fails( p8, X ), ~( follows( X, p6 ) ) ] )
% 0.45/1.10 .
% 0.45/1.10 clause( 137, [ fails( p8, p7 ) ] )
% 0.45/1.10 .
% 0.45/1.10 clause( 141, [] )
% 0.45/1.10 .
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 % SZS output end Refutation
% 0.45/1.10 found a proof!
% 0.45/1.10
% 0.45/1.10 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.45/1.10
% 0.45/1.10 initialclauses(
% 0.45/1.10 [ clause( 143, [ ~( fails( X, Y ) ), ~( follows( X, Y ) ) ] )
% 0.45/1.10 , clause( 144, [ ~( fails( X, Y ) ), fails( X, Z ), fails( Z, Y ) ] )
% 0.45/1.10 , clause( 145, [ ~( fails( X, Y ) ), ~( has( Y, goto( Z ) ) ), ~( labels( Z
% 0.45/1.10 , X ) ) ] )
% 0.45/1.10 , clause( 146, [ ~( fails( X, Y ) ), ~( has( Y, ifthen( Z, X ) ) ) ] )
% 0.45/1.10 , clause( 147, [ has( p1, assign( 'register_j', n0 ) ) ] )
% 0.45/1.10 , clause( 148, [ follows( p2, p1 ) ] )
% 0.45/1.10 , clause( 149, [ has( p2, assign( 'register_k', n1 ) ) ] )
% 0.45/1.10 , clause( 150, [ labels( loop, p3 ) ] )
% 0.45/1.10 , clause( 151, [ follows( p3, p2 ) ] )
% 0.45/1.10 , clause( 152, [ has( p3, ifthen( 'equal_function'( 'register_j', n ), p4 )
% 0.45/1.10 ) ] )
% 0.45/1.10 , clause( 153, [ has( p4, goto( out ) ) ] )
% 0.45/1.10 , clause( 154, [ follows( p5, p4 ) ] )
% 0.45/1.10 , clause( 155, [ follows( p6, p3 ) ] )
% 0.45/1.10 , clause( 156, [ has( p6, assign( 'register_k', times( n2, 'register_k' ) )
% 0.45/1.10 ) ] )
% 0.45/1.10 , clause( 157, [ follows( p7, p6 ) ] )
% 0.45/1.10 , clause( 158, [ has( p7, assign( 'register_j', plus( 'register_j', n1 ) )
% 0.45/1.10 ) ] )
% 0.45/1.10 , clause( 159, [ follows( p8, p7 ) ] )
% 0.45/1.10 , clause( 160, [ has( p8, goto( loop ) ) ] )
% 0.45/1.10 , clause( 161, [ fails( p3, p3 ) ] )
% 0.45/1.10 ] ).
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 subsumption(
% 0.45/1.10 clause( 0, [ ~( follows( X, Y ) ), ~( fails( X, Y ) ) ] )
% 0.45/1.10 , clause( 143, [ ~( fails( X, Y ) ), ~( follows( X, Y ) ) ] )
% 0.45/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.45/1.10 ), ==>( 1, 0 )] ) ).
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 subsumption(
% 0.45/1.10 clause( 1, [ fails( X, Z ), fails( Z, Y ), ~( fails( X, Y ) ) ] )
% 0.45/1.10 , clause( 144, [ ~( fails( X, Y ) ), fails( X, Z ), fails( Z, Y ) ] )
% 0.45/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.45/1.10 permutation( 0, [ ==>( 0, 2 ), ==>( 1, 0 ), ==>( 2, 1 )] ) ).
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 subsumption(
% 0.45/1.10 clause( 2, [ ~( labels( Z, X ) ), ~( has( Y, goto( Z ) ) ), ~( fails( X, Y
% 0.45/1.10 ) ) ] )
% 0.45/1.10 , clause( 145, [ ~( fails( X, Y ) ), ~( has( Y, goto( Z ) ) ), ~( labels( Z
% 0.45/1.10 , X ) ) ] )
% 0.45/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.45/1.10 permutation( 0, [ ==>( 0, 2 ), ==>( 1, 1 ), ==>( 2, 0 )] ) ).
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 subsumption(
% 0.45/1.10 clause( 7, [ labels( loop, p3 ) ] )
% 0.45/1.10 , clause( 150, [ labels( loop, p3 ) ] )
% 0.45/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 subsumption(
% 0.45/1.10 clause( 12, [ follows( p6, p3 ) ] )
% 0.45/1.10 , clause( 155, [ follows( p6, p3 ) ] )
% 0.45/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 subsumption(
% 0.45/1.10 clause( 14, [ follows( p7, p6 ) ] )
% 0.45/1.10 , clause( 157, [ follows( p7, p6 ) ] )
% 0.45/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 subsumption(
% 0.45/1.10 clause( 16, [ follows( p8, p7 ) ] )
% 0.45/1.10 , clause( 159, [ follows( p8, p7 ) ] )
% 0.45/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 subsumption(
% 0.45/1.10 clause( 17, [ has( p8, goto( loop ) ) ] )
% 0.45/1.10 , clause( 160, [ has( p8, goto( loop ) ) ] )
% 0.45/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 subsumption(
% 0.45/1.10 clause( 18, [ fails( p3, p3 ) ] )
% 0.45/1.10 , clause( 161, [ fails( p3, p3 ) ] )
% 0.45/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 resolution(
% 0.45/1.10 clause( 170, [ fails( p3, X ), fails( X, p3 ) ] )
% 0.45/1.10 , clause( 1, [ fails( X, Z ), fails( Z, Y ), ~( fails( X, Y ) ) ] )
% 0.45/1.10 , 2, clause( 18, [ fails( p3, p3 ) ] )
% 0.45/1.10 , 0, substitution( 0, [ :=( X, p3 ), :=( Y, p3 ), :=( Z, X )] ),
% 0.45/1.10 substitution( 1, [] )).
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 subsumption(
% 0.45/1.10 clause( 20, [ fails( X, p3 ), fails( p3, X ) ] )
% 0.45/1.10 , clause( 170, [ fails( p3, X ), fails( X, p3 ) ] )
% 0.45/1.10 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.45/1.10 0 )] ) ).
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 resolution(
% 0.45/1.10 clause( 173, [ ~( labels( X, p3 ) ), ~( has( Y, goto( X ) ) ), fails( Y, p3
% 0.45/1.10 ) ] )
% 0.45/1.10 , clause( 2, [ ~( labels( Z, X ) ), ~( has( Y, goto( Z ) ) ), ~( fails( X,
% 0.45/1.10 Y ) ) ] )
% 0.45/1.10 , 2, clause( 20, [ fails( X, p3 ), fails( p3, X ) ] )
% 0.45/1.10 , 1, substitution( 0, [ :=( X, p3 ), :=( Y, Y ), :=( Z, X )] ),
% 0.45/1.10 substitution( 1, [ :=( X, Y )] )).
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 subsumption(
% 0.45/1.10 clause( 23, [ fails( X, p3 ), ~( labels( Y, p3 ) ), ~( has( X, goto( Y ) )
% 0.45/1.10 ) ] )
% 0.45/1.10 , clause( 173, [ ~( labels( X, p3 ) ), ~( has( Y, goto( X ) ) ), fails( Y,
% 0.45/1.10 p3 ) ] )
% 0.45/1.10 , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 1
% 0.45/1.10 ), ==>( 1, 2 ), ==>( 2, 0 )] ) ).
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 resolution(
% 0.45/1.10 clause( 174, [ fails( p8, p3 ), ~( labels( loop, p3 ) ) ] )
% 0.45/1.10 , clause( 23, [ fails( X, p3 ), ~( labels( Y, p3 ) ), ~( has( X, goto( Y )
% 0.45/1.10 ) ) ] )
% 0.45/1.10 , 2, clause( 17, [ has( p8, goto( loop ) ) ] )
% 0.45/1.10 , 0, substitution( 0, [ :=( X, p8 ), :=( Y, loop )] ), substitution( 1, [] )
% 0.45/1.10 ).
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 resolution(
% 0.45/1.10 clause( 175, [ fails( p8, p3 ) ] )
% 0.45/1.10 , clause( 174, [ fails( p8, p3 ), ~( labels( loop, p3 ) ) ] )
% 0.45/1.10 , 1, clause( 7, [ labels( loop, p3 ) ] )
% 0.45/1.10 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 subsumption(
% 0.45/1.10 clause( 91, [ fails( p8, p3 ) ] )
% 0.45/1.10 , clause( 175, [ fails( p8, p3 ) ] )
% 0.45/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 resolution(
% 0.45/1.10 clause( 176, [ fails( p8, X ), fails( X, p3 ) ] )
% 0.45/1.10 , clause( 1, [ fails( X, Z ), fails( Z, Y ), ~( fails( X, Y ) ) ] )
% 0.45/1.10 , 2, clause( 91, [ fails( p8, p3 ) ] )
% 0.45/1.10 , 0, substitution( 0, [ :=( X, p8 ), :=( Y, p3 ), :=( Z, X )] ),
% 0.45/1.10 substitution( 1, [] )).
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 subsumption(
% 0.45/1.10 clause( 94, [ fails( X, p3 ), fails( p8, X ) ] )
% 0.45/1.10 , clause( 176, [ fails( p8, X ), fails( X, p3 ) ] )
% 0.45/1.10 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.45/1.10 0 )] ) ).
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 resolution(
% 0.45/1.10 clause( 177, [ ~( follows( X, p3 ) ), fails( p8, X ) ] )
% 0.45/1.10 , clause( 0, [ ~( follows( X, Y ) ), ~( fails( X, Y ) ) ] )
% 0.45/1.10 , 1, clause( 94, [ fails( X, p3 ), fails( p8, X ) ] )
% 0.45/1.10 , 0, substitution( 0, [ :=( X, X ), :=( Y, p3 )] ), substitution( 1, [ :=(
% 0.45/1.10 X, X )] )).
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 subsumption(
% 0.45/1.10 clause( 101, [ fails( p8, X ), ~( follows( X, p3 ) ) ] )
% 0.45/1.10 , clause( 177, [ ~( follows( X, p3 ) ), fails( p8, X ) ] )
% 0.45/1.10 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.45/1.10 0 )] ) ).
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 resolution(
% 0.45/1.10 clause( 179, [ fails( p8, p6 ) ] )
% 0.45/1.10 , clause( 101, [ fails( p8, X ), ~( follows( X, p3 ) ) ] )
% 0.45/1.10 , 1, clause( 12, [ follows( p6, p3 ) ] )
% 0.45/1.10 , 0, substitution( 0, [ :=( X, p6 )] ), substitution( 1, [] )).
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 subsumption(
% 0.45/1.10 clause( 113, [ fails( p8, p6 ) ] )
% 0.45/1.10 , clause( 179, [ fails( p8, p6 ) ] )
% 0.45/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 resolution(
% 0.45/1.10 clause( 180, [ fails( p8, X ), fails( X, p6 ) ] )
% 0.45/1.10 , clause( 1, [ fails( X, Z ), fails( Z, Y ), ~( fails( X, Y ) ) ] )
% 0.45/1.10 , 2, clause( 113, [ fails( p8, p6 ) ] )
% 0.45/1.10 , 0, substitution( 0, [ :=( X, p8 ), :=( Y, p6 ), :=( Z, X )] ),
% 0.45/1.10 substitution( 1, [] )).
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 subsumption(
% 0.45/1.10 clause( 116, [ fails( X, p6 ), fails( p8, X ) ] )
% 0.45/1.10 , clause( 180, [ fails( p8, X ), fails( X, p6 ) ] )
% 0.45/1.10 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.45/1.10 0 )] ) ).
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 resolution(
% 0.45/1.10 clause( 181, [ ~( follows( X, p6 ) ), fails( p8, X ) ] )
% 0.45/1.10 , clause( 0, [ ~( follows( X, Y ) ), ~( fails( X, Y ) ) ] )
% 0.45/1.10 , 1, clause( 116, [ fails( X, p6 ), fails( p8, X ) ] )
% 0.45/1.10 , 0, substitution( 0, [ :=( X, X ), :=( Y, p6 )] ), substitution( 1, [ :=(
% 0.45/1.10 X, X )] )).
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 subsumption(
% 0.45/1.10 clause( 135, [ fails( p8, X ), ~( follows( X, p6 ) ) ] )
% 0.45/1.10 , clause( 181, [ ~( follows( X, p6 ) ), fails( p8, X ) ] )
% 0.45/1.10 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.45/1.10 0 )] ) ).
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 resolution(
% 0.45/1.10 clause( 183, [ fails( p8, p7 ) ] )
% 0.45/1.10 , clause( 135, [ fails( p8, X ), ~( follows( X, p6 ) ) ] )
% 0.45/1.10 , 1, clause( 14, [ follows( p7, p6 ) ] )
% 0.45/1.10 , 0, substitution( 0, [ :=( X, p7 )] ), substitution( 1, [] )).
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 subsumption(
% 0.45/1.10 clause( 137, [ fails( p8, p7 ) ] )
% 0.45/1.10 , clause( 183, [ fails( p8, p7 ) ] )
% 0.45/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 resolution(
% 0.45/1.10 clause( 184, [ ~( follows( p8, p7 ) ) ] )
% 0.45/1.10 , clause( 0, [ ~( follows( X, Y ) ), ~( fails( X, Y ) ) ] )
% 0.45/1.10 , 1, clause( 137, [ fails( p8, p7 ) ] )
% 0.45/1.10 , 0, substitution( 0, [ :=( X, p8 ), :=( Y, p7 )] ), substitution( 1, [] )
% 0.45/1.10 ).
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 resolution(
% 0.45/1.10 clause( 185, [] )
% 0.45/1.10 , clause( 184, [ ~( follows( p8, p7 ) ) ] )
% 0.45/1.10 , 0, clause( 16, [ follows( p8, p7 ) ] )
% 0.45/1.10 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 subsumption(
% 0.45/1.10 clause( 141, [] )
% 0.45/1.10 , clause( 185, [] )
% 0.45/1.10 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 end.
% 0.45/1.10
% 0.45/1.10 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.45/1.10
% 0.45/1.10 Memory use:
% 0.45/1.10
% 0.45/1.10 space for terms: 1395
% 0.45/1.10 space for clauses: 6492
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 clauses generated: 197
% 0.45/1.10 clauses kept: 142
% 0.45/1.10 clauses selected: 70
% 0.45/1.10 clauses deleted: 0
% 0.45/1.10 clauses inuse deleted: 0
% 0.45/1.10
% 0.45/1.10 subsentry: 105
% 0.45/1.10 literals s-matched: 92
% 0.45/1.10 literals matched: 92
% 0.45/1.10 full subsumption: 16
% 0.45/1.10
% 0.45/1.10 checksum: -502874358
% 0.45/1.10
% 0.45/1.10
% 0.45/1.10 Bliksem ended
%------------------------------------------------------------------------------