TSTP Solution File: LCL172-3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL172-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n019.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:51:13 EDT 2022
% Result : Unsatisfiable 1.62s 2.01s
% Output : Refutation 1.62s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL172-3 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n019.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 : Sun Jul 3 00:18:23 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.62/2.01 *** allocated 10000 integers for termspace/termends
% 1.62/2.01 *** allocated 10000 integers for clauses
% 1.62/2.01 *** allocated 10000 integers for justifications
% 1.62/2.01 Bliksem 1.12
% 1.62/2.01
% 1.62/2.01
% 1.62/2.01 Automatic Strategy Selection
% 1.62/2.01
% 1.62/2.01 Clauses:
% 1.62/2.01 [
% 1.62/2.01 [ axiom( implies( or( X, X ), X ) ) ],
% 1.62/2.01 [ axiom( implies( X, or( Y, X ) ) ) ],
% 1.62/2.01 [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ],
% 1.62/2.01 [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ],
% 1.62/2.01 [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or( Z, Y ) ) ) )
% 1.62/2.01 ],
% 1.62/2.01 [ =( implies( X, Y ), or( not( X ), Y ) ) ],
% 1.62/2.01 [ theorem( X ), ~( axiom( X ) ) ],
% 1.62/2.01 [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y ) ) ]
% 1.62/2.01 ,
% 1.62/2.01 [ ~( theorem( implies( implies( p, implies( q, r ) ), implies( q,
% 1.62/2.01 implies( p, r ) ) ) ) ) ]
% 1.62/2.01 ] .
% 1.62/2.01
% 1.62/2.01
% 1.62/2.01 percentage equality = 0.083333, percentage horn = 1.000000
% 1.62/2.01 This is a problem with some equality
% 1.62/2.01
% 1.62/2.01
% 1.62/2.01
% 1.62/2.01 Options Used:
% 1.62/2.01
% 1.62/2.01 useres = 1
% 1.62/2.01 useparamod = 1
% 1.62/2.01 useeqrefl = 1
% 1.62/2.01 useeqfact = 1
% 1.62/2.01 usefactor = 1
% 1.62/2.01 usesimpsplitting = 0
% 1.62/2.01 usesimpdemod = 5
% 1.62/2.01 usesimpres = 3
% 1.62/2.01
% 1.62/2.01 resimpinuse = 1000
% 1.62/2.01 resimpclauses = 20000
% 1.62/2.01 substype = eqrewr
% 1.62/2.01 backwardsubs = 1
% 1.62/2.01 selectoldest = 5
% 1.62/2.01
% 1.62/2.01 litorderings [0] = split
% 1.62/2.01 litorderings [1] = extend the termordering, first sorting on arguments
% 1.62/2.01
% 1.62/2.01 termordering = kbo
% 1.62/2.01
% 1.62/2.01 litapriori = 0
% 1.62/2.01 termapriori = 1
% 1.62/2.01 litaposteriori = 0
% 1.62/2.01 termaposteriori = 0
% 1.62/2.01 demodaposteriori = 0
% 1.62/2.01 ordereqreflfact = 0
% 1.62/2.01
% 1.62/2.01 litselect = negord
% 1.62/2.01
% 1.62/2.01 maxweight = 15
% 1.62/2.01 maxdepth = 30000
% 1.62/2.01 maxlength = 115
% 1.62/2.01 maxnrvars = 195
% 1.62/2.01 excuselevel = 1
% 1.62/2.01 increasemaxweight = 1
% 1.62/2.01
% 1.62/2.01 maxselected = 10000000
% 1.62/2.01 maxnrclauses = 10000000
% 1.62/2.01
% 1.62/2.01 showgenerated = 0
% 1.62/2.01 showkept = 0
% 1.62/2.01 showselected = 0
% 1.62/2.01 showdeleted = 0
% 1.62/2.01 showresimp = 1
% 1.62/2.01 showstatus = 2000
% 1.62/2.01
% 1.62/2.01 prologoutput = 1
% 1.62/2.01 nrgoals = 5000000
% 1.62/2.01 totalproof = 1
% 1.62/2.01
% 1.62/2.01 Symbols occurring in the translation:
% 1.62/2.01
% 1.62/2.01 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 1.62/2.01 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 1.62/2.01 ! [4, 1] (w:0, o:17, a:1, s:1, b:0),
% 1.62/2.01 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.62/2.01 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.62/2.01 or [40, 2] (w:1, o:50, a:1, s:1, b:0),
% 1.62/2.01 implies [41, 2] (w:1, o:51, a:1, s:1, b:0),
% 1.62/2.01 axiom [42, 1] (w:1, o:22, a:1, s:1, b:0),
% 1.62/2.01 not [47, 1] (w:1, o:23, a:1, s:1, b:0),
% 1.62/2.01 theorem [48, 1] (w:1, o:24, a:1, s:1, b:0),
% 1.62/2.01 p [49, 0] (w:1, o:14, a:1, s:1, b:0),
% 1.62/2.01 q [50, 0] (w:1, o:15, a:1, s:1, b:0),
% 1.62/2.01 r [51, 0] (w:1, o:16, a:1, s:1, b:0).
% 1.62/2.01
% 1.62/2.01
% 1.62/2.01 Starting Search:
% 1.62/2.01
% 1.62/2.01 Resimplifying inuse:
% 1.62/2.01 Done
% 1.62/2.01
% 1.62/2.01
% 1.62/2.01 Intermediate Status:
% 1.62/2.01 Generated: 3757
% 1.62/2.01 Kept: 2015
% 1.62/2.01 Inuse: 122
% 1.62/2.01 Deleted: 0
% 1.62/2.01 Deletedinuse: 0
% 1.62/2.01
% 1.62/2.01 Resimplifying inuse:
% 1.62/2.01 Done
% 1.62/2.01
% 1.62/2.01 Resimplifying inuse:
% 1.62/2.01 Done
% 1.62/2.01
% 1.62/2.01
% 1.62/2.01 Intermediate Status:
% 1.62/2.01 Generated: 8132
% 1.62/2.01 Kept: 4055
% 1.62/2.01 Inuse: 182
% 1.62/2.01 Deleted: 0
% 1.62/2.01 Deletedinuse: 0
% 1.62/2.01
% 1.62/2.01 Resimplifying inuse:
% 1.62/2.01 Done
% 1.62/2.01
% 1.62/2.01 Resimplifying inuse:
% 1.62/2.01 Done
% 1.62/2.01
% 1.62/2.01
% 1.62/2.01 Intermediate Status:
% 1.62/2.01 Generated: 12998
% 1.62/2.01 Kept: 6151
% 1.62/2.01 Inuse: 231
% 1.62/2.01 Deleted: 0
% 1.62/2.01 Deletedinuse: 0
% 1.62/2.01
% 1.62/2.01 Resimplifying inuse:
% 1.62/2.01 Done
% 1.62/2.01
% 1.62/2.01 Resimplifying inuse:
% 1.62/2.01 Done
% 1.62/2.01
% 1.62/2.01
% 1.62/2.01 Intermediate Status:
% 1.62/2.01 Generated: 17508
% 1.62/2.01 Kept: 8243
% 1.62/2.01 Inuse: 272
% 1.62/2.01 Deleted: 0
% 1.62/2.01 Deletedinuse: 0
% 1.62/2.01
% 1.62/2.01 Resimplifying inuse:
% 1.62/2.01 Done
% 1.62/2.01
% 1.62/2.01 Resimplifying inuse:
% 1.62/2.01 Done
% 1.62/2.01
% 1.62/2.01
% 1.62/2.01 Intermediate Status:
% 1.62/2.01 Generated: 22807
% 1.62/2.01 Kept: 10286
% 1.62/2.01 Inuse: 325
% 1.62/2.01 Deleted: 0
% 1.62/2.01 Deletedinuse: 0
% 1.62/2.01
% 1.62/2.01 Resimplifying inuse:
% 1.62/2.01 Done
% 1.62/2.01
% 1.62/2.01 Resimplifying inuse:
% 1.62/2.01 Done
% 1.62/2.01
% 1.62/2.01
% 1.62/2.01 Intermediate Status:
% 1.62/2.01 Generated: 27986
% 1.62/2.01 Kept: 12314
% 1.62/2.01 Inuse: 363
% 1.62/2.01 Deleted: 0
% 1.62/2.01 Deletedinuse: 0
% 1.62/2.01
% 1.62/2.01 Resimplifying inuse:
% 1.62/2.01 Done
% 1.62/2.01
% 1.62/2.01 Resimplifying inuse:
% 1.62/2.01 Done
% 1.62/2.01
% 1.62/2.01
% 1.62/2.01 Intermediate Status:
% 1.62/2.01 Generated: 32379
% 1.62/2.01 Kept: 14374
% 1.62/2.01 Inuse: 386
% 1.62/2.01 Deleted: 0
% 1.62/2.01 Deletedinuse: 0
% 1.62/2.01
% 1.62/2.01 Resimplifying inuse:
% 1.62/2.01 Done
% 1.62/2.01
% 1.62/2.01 Resimplifying inuse:
% 1.62/2.01 Done
% 1.62/2.01
% 1.62/2.01
% 1.62/2.01 Intermediate Status:
% 1.62/2.01 Generated: 39803
% 1.62/2.01 Kept: 16381
% 1.62/2.01 Inuse: 443
% 1.62/2.01 Deleted: 0
% 1.62/2.01 Deletedinuse: 0
% 1.62/2.01
% 1.62/2.01 Resimplifying inuse:
% 1.62/2.01 Done
% 1.62/2.01
% 1.62/2.01 Resimplifying inuse:
% 1.62/2.01 Done
% 1.62/2.01
% 1.62/2.01
% 1.62/2.01 Intermediate Status:
% 1.62/2.01 Generated: 43150
% 1.62/2.01 Kept: 18382
% 1.62/2.01 Inuse: 474
% 1.62/2.01 Deleted: 0
% 1.62/2.01 Deletedinuse: 0
% 1.62/2.01
% 1.62/2.01 Resimplifying inuse:
% 1.62/2.01 Done
% 1.62/2.01
% 1.62/2.01 Resimplifying inuse:
% 1.62/2.01 Done
% 1.62/2.01
% 1.62/2.01 Resimplifying clauses:
% 1.62/2.01
% 1.62/2.01 Bliksems!, er is een bewijs:
% 1.62/2.01 % SZS status Unsatisfiable
% 1.62/2.01 % SZS output start Refutation
% 1.62/2.01
% 1.62/2.01 clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ]
% 1.62/2.01 )
% 1.62/2.01 .
% 1.62/2.01 clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.62/2.01 .
% 1.62/2.01 clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.62/2.01 .
% 1.62/2.01 clause( 8, [ ~( theorem( implies( implies( p, implies( q, r ) ), implies( q
% 1.62/2.01 , implies( p, r ) ) ) ) ) ] )
% 1.62/2.01 .
% 1.62/2.01 clause( 124, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies( X
% 1.62/2.01 , Z ) ) ) ) ] )
% 1.62/2.01 .
% 1.62/2.01 clause( 168, [ ~( axiom( implies( implies( p, implies( q, r ) ), implies( q
% 1.62/2.01 , implies( p, r ) ) ) ) ) ] )
% 1.62/2.01 .
% 1.62/2.01 clause( 16484, [ axiom( implies( implies( Z, implies( X, Y ) ), implies( X
% 1.62/2.01 , implies( Z, Y ) ) ) ) ] )
% 1.62/2.01 .
% 1.62/2.01 clause( 20055, [] )
% 1.62/2.01 .
% 1.62/2.01
% 1.62/2.01
% 1.62/2.01 % SZS output end Refutation
% 1.62/2.01 found a proof!
% 1.62/2.01
% 1.62/2.01 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 1.62/2.01
% 1.62/2.01 initialclauses(
% 1.62/2.01 [ clause( 20057, [ axiom( implies( or( X, X ), X ) ) ] )
% 1.62/2.01 , clause( 20058, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.62/2.01 , clause( 20059, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 1.62/2.01 , clause( 20060, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 1.62/2.01 ) ) ] )
% 1.62/2.01 , clause( 20061, [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or(
% 1.62/2.01 Z, Y ) ) ) ) ] )
% 1.62/2.01 , clause( 20062, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 1.62/2.01 , clause( 20063, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.62/2.01 , clause( 20064, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~(
% 1.62/2.01 theorem( Y ) ) ] )
% 1.62/2.01 , clause( 20065, [ ~( theorem( implies( implies( p, implies( q, r ) ),
% 1.62/2.01 implies( q, implies( p, r ) ) ) ) ) ] )
% 1.62/2.01 ] ).
% 1.62/2.01
% 1.62/2.01
% 1.62/2.01
% 1.62/2.01 subsumption(
% 1.62/2.01 clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ]
% 1.62/2.01 )
% 1.62/2.01 , clause( 20060, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 1.62/2.01 ) ) ] )
% 1.62/2.01 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.62/2.01 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.62/2.01
% 1.62/2.01
% 1.62/2.01 eqswap(
% 1.62/2.01 clause( 20066, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.62/2.01 , clause( 20062, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 1.62/2.01 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 1.62/2.01
% 1.62/2.01
% 1.62/2.01 subsumption(
% 1.62/2.01 clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.62/2.01 , clause( 20066, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.62/2.01 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.62/2.01 )] ) ).
% 1.62/2.01
% 1.62/2.01
% 1.62/2.01 subsumption(
% 1.62/2.01 clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.62/2.01 , clause( 20063, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.62/2.01 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 1.62/2.01 1 )] ) ).
% 1.62/2.01
% 1.62/2.01
% 1.62/2.01 subsumption(
% 1.62/2.01 clause( 8, [ ~( theorem( implies( implies( p, implies( q, r ) ), implies( q
% 1.62/2.01 , implies( p, r ) ) ) ) ) ] )
% 1.62/2.01 , clause( 20065, [ ~( theorem( implies( implies( p, implies( q, r ) ),
% 1.62/2.01 implies( q, implies( p, r ) ) ) ) ) ] )
% 1.62/2.01 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.62/2.01
% 1.62/2.01
% 1.62/2.01 paramod(
% 1.62/2.01 clause( 20074, [ axiom( implies( or( not( X ), or( Y, Z ) ), or( Y, implies(
% 1.62/2.01 X, Z ) ) ) ) ] )
% 1.62/2.01 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.62/2.01 , 0, clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 1.62/2.01 ) ) ] )
% 1.62/2.01 , 0, 10, substitution( 0, [ :=( X, X ), :=( Y, Z )] ), substitution( 1, [
% 1.62/2.01 :=( X, not( X ) ), :=( Y, Y ), :=( Z, Z )] )).
% 1.62/2.01
% 1.62/2.01
% 1.62/2.01 paramod(
% 1.62/2.01 clause( 20077, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies(
% 1.62/2.01 X, Z ) ) ) ) ] )
% 1.62/2.01 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.62/2.01 , 0, clause( 20074, [ axiom( implies( or( not( X ), or( Y, Z ) ), or( Y,
% 1.62/2.01 implies( X, Z ) ) ) ) ] )
% 1.62/2.01 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, or( Y, Z ) )] ),
% 1.62/2.01 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 1.62/2.01
% 1.62/2.01
% 1.62/2.01 subsumption(
% 1.62/2.01 clause( 124, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies( X
% 1.62/2.01 , Z ) ) ) ) ] )
% 1.62/2.01 , clause( 20077, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies(
% 1.62/2.01 X, Z ) ) ) ) ] )
% 1.62/2.01 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.62/2.01 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.62/2.01
% 1.62/2.01
% 1.62/2.01 resolution(
% 1.62/2.01 clause( 20078, [ ~( axiom( implies( implies( p, implies( q, r ) ), implies(
% 1.62/2.01 q, implies( p, r ) ) ) ) ) ] )
% 1.62/2.01 , clause( 8, [ ~( theorem( implies( implies( p, implies( q, r ) ), implies(
% 1.62/2.01 q, implies( p, r ) ) ) ) ) ] )
% 1.62/2.01 , 0, clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.62/2.01 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, implies( implies( p,
% 1.62/2.01 implies( q, r ) ), implies( q, implies( p, r ) ) ) )] )).
% 1.62/2.01
% 1.62/2.01
% 1.62/2.01 subsumption(
% 1.62/2.01 clause( 168, [ ~( axiom( implies( implies( p, implies( q, r ) ), implies( q
% 1.62/2.01 , implies( p, r ) ) ) ) ) ] )
% 1.62/2.01 , clause( 20078, [ ~( axiom( implies( implies( p, implies( q, r ) ),
% 1.62/2.01 implies( q, implies( p, r ) ) ) ) ) ] )
% 1.62/2.01 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.62/2.01
% 1.62/2.01
% 1.62/2.01 paramod(
% 1.62/2.01 clause( 20082, [ axiom( implies( implies( X, or( not( Y ), Z ) ), implies(
% 1.62/2.01 Y, implies( X, Z ) ) ) ) ] )
% 1.62/2.01 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.62/2.01 , 0, clause( 124, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y,
% 1.62/2.01 implies( X, Z ) ) ) ) ] )
% 1.62/2.01 , 0, 8, substitution( 0, [ :=( X, Y ), :=( Y, implies( X, Z ) )] ),
% 1.62/2.01 substitution( 1, [ :=( X, X ), :=( Y, not( Y ) ), :=( Z, Z )] )).
% 1.62/2.01
% 1.62/2.01
% 1.62/2.01 paramod(
% 1.62/2.01 clause( 20084, [ axiom( implies( implies( X, implies( Y, Z ) ), implies( Y
% 1.62/2.01 , implies( X, Z ) ) ) ) ] )
% 1.62/2.01 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.62/2.01 , 0, clause( 20082, [ axiom( implies( implies( X, or( not( Y ), Z ) ),
% 1.62/2.01 implies( Y, implies( X, Z ) ) ) ) ] )
% 1.62/2.01 , 0, 4, substitution( 0, [ :=( X, Y ), :=( Y, Z )] ), substitution( 1, [
% 1.62/2.01 :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 1.62/2.01
% 1.62/2.01
% 1.62/2.01 subsumption(
% 1.62/2.01 clause( 16484, [ axiom( implies( implies( Z, implies( X, Y ) ), implies( X
% 1.62/2.01 , implies( Z, Y ) ) ) ) ] )
% 1.62/2.01 , clause( 20084, [ axiom( implies( implies( X, implies( Y, Z ) ), implies(
% 1.62/2.01 Y, implies( X, Z ) ) ) ) ] )
% 1.62/2.01 , substitution( 0, [ :=( X, Z ), :=( Y, X ), :=( Z, Y )] ),
% 1.62/2.01 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.62/2.01
% 1.62/2.01
% 1.62/2.01 resolution(
% 1.62/2.01 clause( 20085, [] )
% 1.62/2.01 , clause( 168, [ ~( axiom( implies( implies( p, implies( q, r ) ), implies(
% 1.62/2.01 q, implies( p, r ) ) ) ) ) ] )
% 1.62/2.01 , 0, clause( 16484, [ axiom( implies( implies( Z, implies( X, Y ) ),
% 1.62/2.01 implies( X, implies( Z, Y ) ) ) ) ] )
% 1.62/2.01 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, q ), :=( Y, r ), :=(
% 1.62/2.01 Z, p )] )).
% 1.62/2.01
% 1.62/2.01
% 1.62/2.01 subsumption(
% 1.62/2.01 clause( 20055, [] )
% 1.62/2.01 , clause( 20085, [] )
% 1.62/2.01 , substitution( 0, [] ), permutation( 0, [] ) ).
% 1.62/2.01
% 1.62/2.01
% 1.62/2.01 end.
% 1.62/2.01
% 1.62/2.01 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 1.62/2.01
% 1.62/2.01 Memory use:
% 1.62/2.01
% 1.62/2.01 space for terms: 304321
% 1.62/2.01 space for clauses: 910893
% 1.62/2.01
% 1.62/2.01
% 1.62/2.01 clauses generated: 46193
% 1.62/2.01 clauses kept: 20056
% 1.62/2.01 clauses selected: 494
% 1.62/2.01 clauses deleted: 61
% 1.62/2.01 clauses inuse deleted: 0
% 1.62/2.01
% 1.62/2.01 subsentry: 954034
% 1.62/2.01 literals s-matched: 411756
% 1.62/2.01 literals matched: 383290
% 1.62/2.01 full subsumption: 172196
% 1.62/2.01
% 1.62/2.01 checksum: -1588713311
% 1.62/2.01
% 1.62/2.01
% 1.62/2.01 Bliksem ended
%------------------------------------------------------------------------------