TSTP Solution File: SYN101-1.002.002 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN101-1.002.002 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n007.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:47:43 EDT 2022
% Result : Unsatisfiable 0.44s 1.09s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYN101-1.002.002 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.12/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n007.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 05:28:03 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/1.09 *** allocated 10000 integers for termspace/termends
% 0.44/1.09 *** allocated 10000 integers for clauses
% 0.44/1.09 *** allocated 10000 integers for justifications
% 0.44/1.09 Bliksem 1.12
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 Automatic Strategy Selection
% 0.44/1.09
% 0.44/1.09 Clauses:
% 0.44/1.09 [
% 0.44/1.09 [ ~( 'p_1_2'( a, a ) ) ],
% 0.44/1.09 [ 'p_1_2'( X, Y ), ~( 'p_2_2'( X, Y ) ), ~( 'p_1_1'( X, Y ) ) ],
% 0.44/1.09 [ 'p_1_2'( X, Y ), ~( 'q_2_2'( X, Y ) ), ~( 'q_1_1'( X, Y ) ) ],
% 0.44/1.09 [ 'q_1_2'( X, Y ), ~( 'p_2_2'( X, Y ) ), ~( 'q_1_1'( X, Y ) ) ],
% 0.44/1.09 [ 'q_1_2'( X, Y ), ~( 'q_2_2'( X, Y ) ), ~( 'p_1_1'( X, Y ) ) ],
% 0.44/1.09 [ 'p_1_1'( X, Y ), ~( 'p_1_2'( X, Y ) ) ],
% 0.44/1.09 [ 'q_1_1'( X, Y ), ~( 'q_1_2'( X, Y ) ) ],
% 0.44/1.09 [ 'p_2_2'( X, Y ), ~( 'p_1_2'( X, Y ) ) ],
% 0.44/1.09 [ 'q_2_2'( X, Y ), ~( 'q_1_2'( X, Y ) ) ],
% 0.44/1.09 [ 'p_1_1'( X, Y ), ~( 'nq_1'( X ) ), ~( 'nq_2'( Y ) ) ],
% 0.44/1.09 [ 'q_1_1'( X, Y ), ~( 'nq_1'( X ) ), ~( 'nq_2'( Y ) ) ],
% 0.44/1.09 [ 'p_2_2'( X, Y ), ~( 'nq_1'( X ) ), ~( 'nq_2'( Y ) ) ],
% 0.44/1.09 [ 'q_2_2'( X, Y ), ~( 'nq_1'( X ) ), ~( 'nq_2'( Y ) ) ],
% 0.44/1.09 [ 'nq_1'( a ) ],
% 0.44/1.09 [ 'nq_1'( b ) ],
% 0.44/1.09 [ 'nq_2'( a ) ],
% 0.44/1.09 [ 'nq_2'( b ) ]
% 0.44/1.09 ] .
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 percentage equality = 0.000000, percentage horn = 1.000000
% 0.44/1.09 This is a near-Horn, non-equality problem
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 Options Used:
% 0.44/1.09
% 0.44/1.09 useres = 1
% 0.44/1.09 useparamod = 0
% 0.44/1.09 useeqrefl = 0
% 0.44/1.09 useeqfact = 0
% 0.44/1.09 usefactor = 1
% 0.44/1.09 usesimpsplitting = 0
% 0.44/1.09 usesimpdemod = 0
% 0.44/1.09 usesimpres = 4
% 0.44/1.09
% 0.44/1.09 resimpinuse = 1000
% 0.44/1.09 resimpclauses = 20000
% 0.44/1.09 substype = standard
% 0.44/1.09 backwardsubs = 1
% 0.44/1.09 selectoldest = 5
% 0.44/1.09
% 0.44/1.09 litorderings [0] = split
% 0.44/1.09 litorderings [1] = liftord
% 0.44/1.09
% 0.44/1.09 termordering = none
% 0.44/1.09
% 0.44/1.09 litapriori = 1
% 0.44/1.09 termapriori = 0
% 0.44/1.09 litaposteriori = 0
% 0.44/1.09 termaposteriori = 0
% 0.44/1.09 demodaposteriori = 0
% 0.44/1.09 ordereqreflfact = 0
% 0.44/1.09
% 0.44/1.09 litselect = negative
% 0.44/1.09
% 0.44/1.09 maxweight = 30000
% 0.44/1.09 maxdepth = 30000
% 0.44/1.09 maxlength = 115
% 0.44/1.09 maxnrvars = 195
% 0.44/1.09 excuselevel = 0
% 0.44/1.09 increasemaxweight = 0
% 0.44/1.09
% 0.44/1.09 maxselected = 10000000
% 0.44/1.09 maxnrclauses = 10000000
% 0.44/1.09
% 0.44/1.09 showgenerated = 0
% 0.44/1.09 showkept = 0
% 0.44/1.09 showselected = 0
% 0.44/1.09 showdeleted = 0
% 0.44/1.09 showresimp = 1
% 0.44/1.09 showstatus = 2000
% 0.44/1.09
% 0.44/1.09 prologoutput = 1
% 0.44/1.09 nrgoals = 5000000
% 0.44/1.09 totalproof = 1
% 0.44/1.09
% 0.44/1.09 Symbols occurring in the translation:
% 0.44/1.09
% 0.44/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.44/1.09 . [1, 2] (w:1, o:20, a:1, s:1, b:0),
% 0.44/1.09 ! [4, 1] (w:1, o:13, a:1, s:1, b:0),
% 0.44/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.44/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.44/1.09 a [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.44/1.09 'p_1_2' [40, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.44/1.09 'p_2_2' [43, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.44/1.09 'p_1_1' [44, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.44/1.09 'q_2_2' [45, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.44/1.09 'q_1_1' [46, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.44/1.09 'q_1_2' [47, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.44/1.09 'nq_1' [48, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.44/1.09 'nq_2' [49, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.44/1.09 b [50, 0] (w:1, o:12, a:1, s:1, b:0).
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 Starting Search:
% 0.44/1.09
% 0.44/1.09
% 0.44/1.09 Bliksems!, er is een bewijs:
% 0.44/1.09 % SZS status Unsatisfiable
% 0.44/1.09 % SZS output start Refutation
% 0.44/1.09
% 0.44/1.09 clause( 0, [ ~( 'p_1_2'( a, a ) ) ] )
% 0.44/1.09 .
% 0.44/1.09 clause( 2, [ 'p_1_2'( X, Y ), ~( 'q_1_1'( X, Y ) ), ~( 'q_2_2'( X, Y ) ) ]
% 0.44/1.09 )
% 0.44/1.09 .
% 0.44/1.09 clause( 4, [ 'q_1_2'( X, Y ), ~( 'q_2_2'( X, Y ) ), ~( 'p_1_1'( X, Y ) ) ]
% 0.44/1.10 )
% 0.44/1.10 .
% 0.44/1.10 clause( 6, [ 'q_1_1'( X, Y ), ~( 'q_1_2'( X, Y ) ) ] )
% 0.44/1.10 .
% 0.44/1.10 clause( 9, [ 'p_1_1'( X, Y ), ~( 'nq_2'( Y ) ), ~( 'nq_1'( X ) ) ] )
% 0.44/1.10 .
% 0.44/1.10 clause( 12, [ 'q_2_2'( X, Y ), ~( 'nq_2'( Y ) ), ~( 'nq_1'( X ) ) ] )
% 0.44/1.10 .
% 0.44/1.10 clause( 13, [ 'nq_1'( a ) ] )
% 0.44/1.10 .
% 0.44/1.10 clause( 15, [ 'nq_2'( a ) ] )
% 0.44/1.10 .
% 0.44/1.10 clause( 17, [ 'q_2_2'( a, X ), ~( 'nq_2'( X ) ) ] )
% 0.44/1.10 .
% 0.44/1.10 clause( 19, [ 'q_2_2'( a, a ) ] )
% 0.44/1.10 .
% 0.44/1.10 clause( 21, [ ~( 'q_1_1'( a, a ) ) ] )
% 0.44/1.10 .
% 0.44/1.10 clause( 29, [ 'p_1_1'( a, X ), ~( 'nq_2'( X ) ) ] )
% 0.44/1.10 .
% 0.44/1.10 clause( 31, [ 'p_1_1'( a, a ) ] )
% 0.44/1.10 .
% 0.44/1.10 clause( 33, [ 'q_1_2'( a, a ) ] )
% 0.44/1.10 .
% 0.44/1.10 clause( 34, [] )
% 0.44/1.10 .
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 % SZS output end Refutation
% 0.44/1.10 found a proof!
% 0.44/1.10
% 0.44/1.10 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.44/1.10
% 0.44/1.10 initialclauses(
% 0.44/1.10 [ clause( 36, [ ~( 'p_1_2'( a, a ) ) ] )
% 0.44/1.10 , clause( 37, [ 'p_1_2'( X, Y ), ~( 'p_2_2'( X, Y ) ), ~( 'p_1_1'( X, Y ) )
% 0.44/1.10 ] )
% 0.44/1.10 , clause( 38, [ 'p_1_2'( X, Y ), ~( 'q_2_2'( X, Y ) ), ~( 'q_1_1'( X, Y ) )
% 0.44/1.10 ] )
% 0.44/1.10 , clause( 39, [ 'q_1_2'( X, Y ), ~( 'p_2_2'( X, Y ) ), ~( 'q_1_1'( X, Y ) )
% 0.44/1.10 ] )
% 0.44/1.10 , clause( 40, [ 'q_1_2'( X, Y ), ~( 'q_2_2'( X, Y ) ), ~( 'p_1_1'( X, Y ) )
% 0.44/1.10 ] )
% 0.44/1.10 , clause( 41, [ 'p_1_1'( X, Y ), ~( 'p_1_2'( X, Y ) ) ] )
% 0.44/1.10 , clause( 42, [ 'q_1_1'( X, Y ), ~( 'q_1_2'( X, Y ) ) ] )
% 0.44/1.10 , clause( 43, [ 'p_2_2'( X, Y ), ~( 'p_1_2'( X, Y ) ) ] )
% 0.44/1.10 , clause( 44, [ 'q_2_2'( X, Y ), ~( 'q_1_2'( X, Y ) ) ] )
% 0.44/1.10 , clause( 45, [ 'p_1_1'( X, Y ), ~( 'nq_1'( X ) ), ~( 'nq_2'( Y ) ) ] )
% 0.44/1.10 , clause( 46, [ 'q_1_1'( X, Y ), ~( 'nq_1'( X ) ), ~( 'nq_2'( Y ) ) ] )
% 0.44/1.10 , clause( 47, [ 'p_2_2'( X, Y ), ~( 'nq_1'( X ) ), ~( 'nq_2'( Y ) ) ] )
% 0.44/1.10 , clause( 48, [ 'q_2_2'( X, Y ), ~( 'nq_1'( X ) ), ~( 'nq_2'( Y ) ) ] )
% 0.44/1.10 , clause( 49, [ 'nq_1'( a ) ] )
% 0.44/1.10 , clause( 50, [ 'nq_1'( b ) ] )
% 0.44/1.10 , clause( 51, [ 'nq_2'( a ) ] )
% 0.44/1.10 , clause( 52, [ 'nq_2'( b ) ] )
% 0.44/1.10 ] ).
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 subsumption(
% 0.44/1.10 clause( 0, [ ~( 'p_1_2'( a, a ) ) ] )
% 0.44/1.10 , clause( 36, [ ~( 'p_1_2'( a, a ) ) ] )
% 0.44/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 subsumption(
% 0.44/1.10 clause( 2, [ 'p_1_2'( X, Y ), ~( 'q_1_1'( X, Y ) ), ~( 'q_2_2'( X, Y ) ) ]
% 0.44/1.10 )
% 0.44/1.10 , clause( 38, [ 'p_1_2'( X, Y ), ~( 'q_2_2'( X, Y ) ), ~( 'q_1_1'( X, Y ) )
% 0.44/1.10 ] )
% 0.44/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.44/1.10 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 subsumption(
% 0.44/1.10 clause( 4, [ 'q_1_2'( X, Y ), ~( 'q_2_2'( X, Y ) ), ~( 'p_1_1'( X, Y ) ) ]
% 0.44/1.10 )
% 0.44/1.10 , clause( 40, [ 'q_1_2'( X, Y ), ~( 'q_2_2'( X, Y ) ), ~( 'p_1_1'( X, Y ) )
% 0.44/1.10 ] )
% 0.44/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.44/1.10 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 subsumption(
% 0.44/1.10 clause( 6, [ 'q_1_1'( X, Y ), ~( 'q_1_2'( X, Y ) ) ] )
% 0.44/1.10 , clause( 42, [ 'q_1_1'( X, Y ), ~( 'q_1_2'( X, Y ) ) ] )
% 0.44/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.44/1.10 ), ==>( 1, 1 )] ) ).
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 subsumption(
% 0.44/1.10 clause( 9, [ 'p_1_1'( X, Y ), ~( 'nq_2'( Y ) ), ~( 'nq_1'( X ) ) ] )
% 0.44/1.10 , clause( 45, [ 'p_1_1'( X, Y ), ~( 'nq_1'( X ) ), ~( 'nq_2'( Y ) ) ] )
% 0.44/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.44/1.10 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 subsumption(
% 0.44/1.10 clause( 12, [ 'q_2_2'( X, Y ), ~( 'nq_2'( Y ) ), ~( 'nq_1'( X ) ) ] )
% 0.44/1.10 , clause( 48, [ 'q_2_2'( X, Y ), ~( 'nq_1'( X ) ), ~( 'nq_2'( Y ) ) ] )
% 0.44/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.44/1.10 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 subsumption(
% 0.44/1.10 clause( 13, [ 'nq_1'( a ) ] )
% 0.44/1.10 , clause( 49, [ 'nq_1'( a ) ] )
% 0.44/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 subsumption(
% 0.44/1.10 clause( 15, [ 'nq_2'( a ) ] )
% 0.44/1.10 , clause( 51, [ 'nq_2'( a ) ] )
% 0.44/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 resolution(
% 0.44/1.10 clause( 53, [ 'q_2_2'( a, X ), ~( 'nq_2'( X ) ) ] )
% 0.44/1.10 , clause( 12, [ 'q_2_2'( X, Y ), ~( 'nq_2'( Y ) ), ~( 'nq_1'( X ) ) ] )
% 0.44/1.10 , 2, clause( 13, [ 'nq_1'( a ) ] )
% 0.44/1.10 , 0, substitution( 0, [ :=( X, a ), :=( Y, X )] ), substitution( 1, [] )
% 0.44/1.10 ).
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 subsumption(
% 0.44/1.10 clause( 17, [ 'q_2_2'( a, X ), ~( 'nq_2'( X ) ) ] )
% 0.44/1.10 , clause( 53, [ 'q_2_2'( a, X ), ~( 'nq_2'( X ) ) ] )
% 0.44/1.10 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.44/1.10 1 )] ) ).
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 resolution(
% 0.44/1.10 clause( 54, [ 'q_2_2'( a, a ) ] )
% 0.44/1.10 , clause( 17, [ 'q_2_2'( a, X ), ~( 'nq_2'( X ) ) ] )
% 0.44/1.10 , 1, clause( 15, [ 'nq_2'( a ) ] )
% 0.44/1.10 , 0, substitution( 0, [ :=( X, a )] ), substitution( 1, [] )).
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 subsumption(
% 0.44/1.10 clause( 19, [ 'q_2_2'( a, a ) ] )
% 0.44/1.10 , clause( 54, [ 'q_2_2'( a, a ) ] )
% 0.44/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 resolution(
% 0.44/1.10 clause( 55, [ 'p_1_2'( a, a ), ~( 'q_1_1'( a, a ) ) ] )
% 0.44/1.10 , clause( 2, [ 'p_1_2'( X, Y ), ~( 'q_1_1'( X, Y ) ), ~( 'q_2_2'( X, Y ) )
% 0.44/1.10 ] )
% 0.44/1.10 , 2, clause( 19, [ 'q_2_2'( a, a ) ] )
% 0.44/1.10 , 0, substitution( 0, [ :=( X, a ), :=( Y, a )] ), substitution( 1, [] )
% 0.44/1.10 ).
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 resolution(
% 0.44/1.10 clause( 56, [ ~( 'q_1_1'( a, a ) ) ] )
% 0.44/1.10 , clause( 0, [ ~( 'p_1_2'( a, a ) ) ] )
% 0.44/1.10 , 0, clause( 55, [ 'p_1_2'( a, a ), ~( 'q_1_1'( a, a ) ) ] )
% 0.44/1.10 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 subsumption(
% 0.44/1.10 clause( 21, [ ~( 'q_1_1'( a, a ) ) ] )
% 0.44/1.10 , clause( 56, [ ~( 'q_1_1'( a, a ) ) ] )
% 0.44/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 resolution(
% 0.44/1.10 clause( 57, [ 'p_1_1'( a, X ), ~( 'nq_2'( X ) ) ] )
% 0.44/1.10 , clause( 9, [ 'p_1_1'( X, Y ), ~( 'nq_2'( Y ) ), ~( 'nq_1'( X ) ) ] )
% 0.44/1.10 , 2, clause( 13, [ 'nq_1'( a ) ] )
% 0.44/1.10 , 0, substitution( 0, [ :=( X, a ), :=( Y, X )] ), substitution( 1, [] )
% 0.44/1.10 ).
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 subsumption(
% 0.44/1.10 clause( 29, [ 'p_1_1'( a, X ), ~( 'nq_2'( X ) ) ] )
% 0.44/1.10 , clause( 57, [ 'p_1_1'( a, X ), ~( 'nq_2'( X ) ) ] )
% 0.44/1.10 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.44/1.10 1 )] ) ).
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 resolution(
% 0.44/1.10 clause( 58, [ 'p_1_1'( a, a ) ] )
% 0.44/1.10 , clause( 29, [ 'p_1_1'( a, X ), ~( 'nq_2'( X ) ) ] )
% 0.44/1.10 , 1, clause( 15, [ 'nq_2'( a ) ] )
% 0.44/1.10 , 0, substitution( 0, [ :=( X, a )] ), substitution( 1, [] )).
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 subsumption(
% 0.44/1.10 clause( 31, [ 'p_1_1'( a, a ) ] )
% 0.44/1.10 , clause( 58, [ 'p_1_1'( a, a ) ] )
% 0.44/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 resolution(
% 0.44/1.10 clause( 59, [ 'q_1_2'( a, a ), ~( 'q_2_2'( a, a ) ) ] )
% 0.44/1.10 , clause( 4, [ 'q_1_2'( X, Y ), ~( 'q_2_2'( X, Y ) ), ~( 'p_1_1'( X, Y ) )
% 0.44/1.10 ] )
% 0.44/1.10 , 2, clause( 31, [ 'p_1_1'( a, a ) ] )
% 0.44/1.10 , 0, substitution( 0, [ :=( X, a ), :=( Y, a )] ), substitution( 1, [] )
% 0.44/1.10 ).
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 resolution(
% 0.44/1.10 clause( 60, [ 'q_1_2'( a, a ) ] )
% 0.44/1.10 , clause( 59, [ 'q_1_2'( a, a ), ~( 'q_2_2'( a, a ) ) ] )
% 0.44/1.10 , 1, clause( 19, [ 'q_2_2'( a, a ) ] )
% 0.44/1.10 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 subsumption(
% 0.44/1.10 clause( 33, [ 'q_1_2'( a, a ) ] )
% 0.44/1.10 , clause( 60, [ 'q_1_2'( a, a ) ] )
% 0.44/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 resolution(
% 0.44/1.10 clause( 61, [ 'q_1_1'( a, a ) ] )
% 0.44/1.10 , clause( 6, [ 'q_1_1'( X, Y ), ~( 'q_1_2'( X, Y ) ) ] )
% 0.44/1.10 , 1, clause( 33, [ 'q_1_2'( a, a ) ] )
% 0.44/1.10 , 0, substitution( 0, [ :=( X, a ), :=( Y, a )] ), substitution( 1, [] )
% 0.44/1.10 ).
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 resolution(
% 0.44/1.10 clause( 62, [] )
% 0.44/1.10 , clause( 21, [ ~( 'q_1_1'( a, a ) ) ] )
% 0.44/1.10 , 0, clause( 61, [ 'q_1_1'( a, a ) ] )
% 0.44/1.10 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 subsumption(
% 0.44/1.10 clause( 34, [] )
% 0.44/1.10 , clause( 62, [] )
% 0.44/1.10 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 end.
% 0.44/1.10
% 0.44/1.10 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.44/1.10
% 0.44/1.10 Memory use:
% 0.44/1.10
% 0.44/1.10 space for terms: 557
% 0.44/1.10 space for clauses: 1868
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 clauses generated: 35
% 0.44/1.10 clauses kept: 35
% 0.44/1.10 clauses selected: 29
% 0.44/1.10 clauses deleted: 0
% 0.44/1.10 clauses inuse deleted: 0
% 0.44/1.10
% 0.44/1.10 subsentry: 0
% 0.44/1.10 literals s-matched: 0
% 0.44/1.10 literals matched: 0
% 0.44/1.10 full subsumption: 0
% 0.44/1.10
% 0.44/1.10 checksum: -201409874
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 Bliksem ended
%------------------------------------------------------------------------------