TSTP Solution File: LCL194-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL194-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n011.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:33 EDT 2022
% Result : Unsatisfiable 0.78s 1.40s
% Output : Refutation 0.78s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : LCL194-1 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.14 % Command : bliksem %s
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % DateTime : Mon Jul 4 01:01:51 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.78/1.40 *** allocated 10000 integers for termspace/termends
% 0.78/1.40 *** allocated 10000 integers for clauses
% 0.78/1.40 *** allocated 10000 integers for justifications
% 0.78/1.40 Bliksem 1.12
% 0.78/1.40
% 0.78/1.40
% 0.78/1.40 Automatic Strategy Selection
% 0.78/1.40
% 0.78/1.40 Clauses:
% 0.78/1.40 [
% 0.78/1.40 [ axiom( or( not( or( X, X ) ), X ) ) ],
% 0.78/1.40 [ axiom( or( not( X ), or( Y, X ) ) ) ],
% 0.78/1.40 [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ],
% 0.78/1.40 [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) ) ],
% 0.78/1.40 [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or( Z, Y )
% 0.78/1.40 ) ) ) ],
% 0.78/1.40 [ theorem( X ), ~( axiom( X ) ) ],
% 0.78/1.40 [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem( Y ) ) ]
% 0.78/1.40 ,
% 0.78/1.40 [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z ) ) ), ~(
% 0.78/1.40 theorem( or( not( Z ), Y ) ) ) ],
% 0.78/1.40 [ ~( theorem( or( not( or( not( q ), r ) ), or( not( or( q, p ) ), or( p
% 0.78/1.40 , r ) ) ) ) ) ]
% 0.78/1.40 ] .
% 0.78/1.40
% 0.78/1.40
% 0.78/1.40 percentage equality = 0.000000, percentage horn = 1.000000
% 0.78/1.40 This is a near-Horn, non-equality problem
% 0.78/1.40
% 0.78/1.40
% 0.78/1.40 Options Used:
% 0.78/1.40
% 0.78/1.40 useres = 1
% 0.78/1.40 useparamod = 0
% 0.78/1.40 useeqrefl = 0
% 0.78/1.40 useeqfact = 0
% 0.78/1.40 usefactor = 1
% 0.78/1.40 usesimpsplitting = 0
% 0.78/1.40 usesimpdemod = 0
% 0.78/1.40 usesimpres = 4
% 0.78/1.40
% 0.78/1.40 resimpinuse = 1000
% 0.78/1.40 resimpclauses = 20000
% 0.78/1.40 substype = standard
% 0.78/1.40 backwardsubs = 1
% 0.78/1.40 selectoldest = 5
% 0.78/1.40
% 0.78/1.40 litorderings [0] = split
% 0.78/1.40 litorderings [1] = liftord
% 0.78/1.40
% 0.78/1.40 termordering = none
% 0.78/1.40
% 0.78/1.40 litapriori = 1
% 0.78/1.40 termapriori = 0
% 0.78/1.40 litaposteriori = 0
% 0.78/1.40 termaposteriori = 0
% 0.78/1.40 demodaposteriori = 0
% 0.78/1.40 ordereqreflfact = 0
% 0.78/1.40
% 0.78/1.40 litselect = negative
% 0.78/1.40
% 0.78/1.40 maxweight = 30000
% 0.78/1.40 maxdepth = 30000
% 0.78/1.40 maxlength = 115
% 0.78/1.40 maxnrvars = 195
% 0.78/1.40 excuselevel = 0
% 0.78/1.40 increasemaxweight = 0
% 0.78/1.40
% 0.78/1.40 maxselected = 10000000
% 0.78/1.40 maxnrclauses = 10000000
% 0.78/1.40
% 0.78/1.40 showgenerated = 0
% 0.78/1.40 showkept = 0
% 0.78/1.40 showselected = 0
% 0.78/1.40 showdeleted = 0
% 0.78/1.40 showresimp = 1
% 0.78/1.40 showstatus = 2000
% 0.78/1.40
% 0.78/1.40 prologoutput = 1
% 0.78/1.40 nrgoals = 5000000
% 0.78/1.40 totalproof = 1
% 0.78/1.40
% 0.78/1.40 Symbols occurring in the translation:
% 0.78/1.40
% 0.78/1.40 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.78/1.40 . [1, 2] (w:1, o:26, a:1, s:1, b:0),
% 0.78/1.40 ! [4, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.78/1.40 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.78/1.40 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.78/1.40 or [40, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.78/1.40 not [41, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.78/1.40 axiom [42, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.78/1.40 theorem [46, 1] (w:1, o:25, a:1, s:1, b:0),
% 0.78/1.40 q [49, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.78/1.40 r [50, 0] (w:1, o:17, a:1, s:1, b:0),
% 0.78/1.40 p [51, 0] (w:1, o:15, a:1, s:1, b:0).
% 0.78/1.40
% 0.78/1.40
% 0.78/1.40 Starting Search:
% 0.78/1.40
% 0.78/1.40 Resimplifying inuse:
% 0.78/1.40 Done
% 0.78/1.40
% 0.78/1.40
% 0.78/1.40 Intermediate Status:
% 0.78/1.40 Generated: 3552
% 0.78/1.40 Kept: 2003
% 0.78/1.40 Inuse: 579
% 0.78/1.40 Deleted: 7
% 0.78/1.40 Deletedinuse: 0
% 0.78/1.40
% 0.78/1.40 Resimplifying inuse:
% 0.78/1.40 Done
% 0.78/1.40
% 0.78/1.40 Resimplifying inuse:
% 0.78/1.40 Done
% 0.78/1.40
% 0.78/1.40
% 0.78/1.40 Intermediate Status:
% 0.78/1.40 Generated: 7011
% 0.78/1.40 Kept: 4004
% 0.78/1.40 Inuse: 1159
% 0.78/1.40 Deleted: 22
% 0.78/1.40 Deletedinuse: 0
% 0.78/1.40
% 0.78/1.40 Resimplifying inuse:
% 0.78/1.40 Done
% 0.78/1.40
% 0.78/1.40 Resimplifying inuse:
% 0.78/1.40 Done
% 0.78/1.40
% 0.78/1.40
% 0.78/1.40 Intermediate Status:
% 0.78/1.40 Generated: 10535
% 0.78/1.40 Kept: 6005
% 0.78/1.40 Inuse: 1749
% 0.78/1.40 Deleted: 36
% 0.78/1.40 Deletedinuse: 0
% 0.78/1.40
% 0.78/1.40 Resimplifying inuse:
% 0.78/1.40 Done
% 0.78/1.40
% 0.78/1.40 Resimplifying inuse:
% 0.78/1.40
% 0.78/1.40 Bliksems!, er is een bewijs:
% 0.78/1.40 % SZS status Unsatisfiable
% 0.78/1.40 % SZS output start Refutation
% 0.78/1.40
% 0.78/1.40 clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.78/1.40 .
% 0.78/1.40 clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) )
% 0.78/1.40 ] )
% 0.78/1.40 .
% 0.78/1.40 clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or(
% 0.78/1.40 Z, Y ) ) ) ) ] )
% 0.78/1.40 .
% 0.78/1.40 clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.78/1.40 .
% 0.78/1.40 clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X ) )
% 0.78/1.40 ) ] )
% 0.78/1.40 .
% 0.78/1.40 clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y ) )
% 0.78/1.40 ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.78/1.40 .
% 0.78/1.40 clause( 8, [ ~( theorem( or( not( or( not( q ), r ) ), or( not( or( q, p )
% 0.78/1.40 ), or( p, r ) ) ) ) ) ] )
% 0.78/1.40 .
% 0.78/1.40 clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z )
% 0.78/1.40 ) ) ) ] )
% 0.78/1.40 .
% 0.78/1.40 clause( 28, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) )
% 0.78/1.40 , or( Z, Y ) ) ) ) ] )
% 0.78/1.40 .
% 0.78/1.40 clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.78/1.40 or( Y, X ) ), Z ) ) ) ] )
% 0.78/1.40 .
% 0.78/1.40 clause( 100, [ theorem( or( not( or( X, Y ) ), or( not( or( not( Y ), Z ) )
% 0.78/1.40 , or( X, Z ) ) ) ) ] )
% 0.78/1.40 .
% 0.78/1.40 clause( 756, [ theorem( or( not( or( X, Y ) ), or( not( or( not( X ), Z ) )
% 0.78/1.40 , or( Y, Z ) ) ) ) ] )
% 0.78/1.40 .
% 0.78/1.40 clause( 6366, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( X, Z )
% 0.78/1.40 ), or( Z, Y ) ) ) ) ] )
% 0.78/1.40 .
% 0.78/1.40 clause( 7018, [] )
% 0.78/1.40 .
% 0.78/1.40
% 0.78/1.40
% 0.78/1.40 % SZS output end Refutation
% 0.78/1.40 found a proof!
% 0.78/1.40
% 0.78/1.40 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.78/1.40
% 0.78/1.40 initialclauses(
% 0.78/1.40 [ clause( 7020, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.78/1.40 , clause( 7021, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.78/1.40 , clause( 7022, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.78/1.40 , clause( 7023, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 0.78/1.40 ) ) ) ] )
% 0.78/1.40 , clause( 7024, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 0.78/1.40 ), or( Z, Y ) ) ) ) ] )
% 0.78/1.40 , clause( 7025, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.78/1.40 , clause( 7026, [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem(
% 0.78/1.40 Y ) ) ] )
% 0.78/1.40 , clause( 7027, [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z )
% 0.78/1.40 ) ), ~( theorem( or( not( Z ), Y ) ) ) ] )
% 0.78/1.40 , clause( 7028, [ ~( theorem( or( not( or( not( q ), r ) ), or( not( or( q
% 0.78/1.40 , p ) ), or( p, r ) ) ) ) ) ] )
% 0.78/1.40 ] ).
% 0.78/1.40
% 0.78/1.40
% 0.78/1.40
% 0.78/1.40 subsumption(
% 0.78/1.40 clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.78/1.40 , clause( 7022, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.78/1.40 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.78/1.40 )] ) ).
% 0.78/1.40
% 0.78/1.40
% 0.78/1.40 subsumption(
% 0.78/1.40 clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) )
% 0.78/1.40 ] )
% 0.78/1.40 , clause( 7023, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 0.78/1.40 ) ) ) ] )
% 0.78/1.40 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.78/1.40 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.78/1.40
% 0.78/1.40
% 0.78/1.40 subsumption(
% 0.78/1.40 clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or(
% 0.78/1.40 Z, Y ) ) ) ) ] )
% 0.78/1.40 , clause( 7024, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 0.78/1.40 ), or( Z, Y ) ) ) ) ] )
% 0.78/1.40 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.78/1.40 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.78/1.40
% 0.78/1.40
% 0.78/1.40 subsumption(
% 0.78/1.40 clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.78/1.40 , clause( 7025, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.78/1.40 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.78/1.40 1 )] ) ).
% 0.78/1.40
% 0.78/1.40
% 0.78/1.40 subsumption(
% 0.78/1.40 clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X ) )
% 0.78/1.40 ) ] )
% 0.78/1.40 , clause( 7026, [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem(
% 0.78/1.40 Y ) ) ] )
% 0.78/1.40 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.78/1.40 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.78/1.40
% 0.78/1.40
% 0.78/1.40 subsumption(
% 0.78/1.40 clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y ) )
% 0.78/1.40 ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.78/1.40 , clause( 7027, [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z )
% 0.78/1.40 ) ), ~( theorem( or( not( Z ), Y ) ) ) ] )
% 0.78/1.40 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.78/1.40 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.78/1.40
% 0.78/1.40
% 0.78/1.40 subsumption(
% 0.78/1.40 clause( 8, [ ~( theorem( or( not( or( not( q ), r ) ), or( not( or( q, p )
% 0.78/1.40 ), or( p, r ) ) ) ) ) ] )
% 0.78/1.40 , clause( 7028, [ ~( theorem( or( not( or( not( q ), r ) ), or( not( or( q
% 0.78/1.40 , p ) ), or( p, r ) ) ) ) ) ] )
% 0.78/1.40 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.78/1.40
% 0.78/1.40
% 0.78/1.40 resolution(
% 0.78/1.40 clause( 7029, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 0.78/1.40 ) ) ) ) ] )
% 0.78/1.40 , clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X )
% 0.78/1.40 ) ) ] )
% 0.78/1.40 , 2, clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 0.78/1.40 ) ) ) ] )
% 0.78/1.40 , 0, substitution( 0, [ :=( X, or( X, or( Y, Z ) ) ), :=( Y, or( Y, or( X,
% 0.78/1.40 Z ) ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] )).
% 0.78/1.40
% 0.78/1.40
% 0.78/1.40 subsumption(
% 0.78/1.40 clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z )
% 0.78/1.40 ) ) ) ] )
% 0.78/1.40 , clause( 7029, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X
% 0.78/1.40 , Z ) ) ) ) ] )
% 0.78/1.40 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.78/1.40 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.78/1.40
% 0.78/1.40
% 0.78/1.40 resolution(
% 0.78/1.40 clause( 7030, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 0.78/1.40 ), or( Z, Y ) ) ) ) ] )
% 0.78/1.40 , clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.78/1.40 , 1, clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 0.78/1.40 ), or( Z, Y ) ) ) ) ] )
% 0.78/1.40 , 0, substitution( 0, [ :=( X, or( not( or( not( X ), Y ) ), or( not( or( Z
% 0.78/1.40 , X ) ), or( Z, Y ) ) ) )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ),
% 0.78/1.40 :=( Z, Z )] )).
% 0.78/1.40
% 0.78/1.40
% 0.78/1.40 subsumption(
% 0.78/1.40 clause( 28, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) )
% 0.78/1.40 , or( Z, Y ) ) ) ) ] )
% 0.78/1.40 , clause( 7030, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Z, X
% 0.78/1.40 ) ), or( Z, Y ) ) ) ) ] )
% 0.78/1.40 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.78/1.40 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.78/1.40
% 0.78/1.40
% 0.78/1.40 resolution(
% 0.78/1.40 clause( 7031, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.78/1.40 or( Y, X ) ), Z ) ) ) ] )
% 0.78/1.40 , clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y )
% 0.78/1.40 ) ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.78/1.40 , 2, clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.78/1.40 , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, Z ), :=( Z, or( Y, X )
% 0.78/1.40 )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.78/1.40
% 0.78/1.40
% 0.78/1.40 subsumption(
% 0.78/1.40 clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.78/1.40 or( Y, X ) ), Z ) ) ) ] )
% 0.78/1.40 , clause( 7031, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or(
% 0.78/1.40 not( or( Y, X ) ), Z ) ) ) ] )
% 0.78/1.40 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.78/1.40 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.78/1.40
% 0.78/1.40
% 0.78/1.40 resolution(
% 0.78/1.40 clause( 7032, [ theorem( or( not( or( X, Y ) ), or( not( or( not( Y ), Z )
% 0.78/1.40 ), or( X, Z ) ) ) ) ] )
% 0.78/1.40 , clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 0.78/1.40 ) ) ) ) ] )
% 0.78/1.40 , 1, clause( 28, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Z, X
% 0.78/1.40 ) ), or( Z, Y ) ) ) ) ] )
% 0.78/1.40 , 0, substitution( 0, [ :=( X, not( or( X, Y ) ) ), :=( Y, not( or( not( Y
% 0.78/1.40 ), Z ) ) ), :=( Z, or( X, Z ) )] ), substitution( 1, [ :=( X, Y ), :=( Y
% 0.78/1.40 , Z ), :=( Z, X )] )).
% 0.78/1.40
% 0.78/1.40
% 0.78/1.40 subsumption(
% 0.78/1.40 clause( 100, [ theorem( or( not( or( X, Y ) ), or( not( or( not( Y ), Z ) )
% 0.78/1.40 , or( X, Z ) ) ) ) ] )
% 0.78/1.40 , clause( 7032, [ theorem( or( not( or( X, Y ) ), or( not( or( not( Y ), Z
% 0.78/1.40 ) ), or( X, Z ) ) ) ) ] )
% 0.78/1.40 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.78/1.40 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.78/1.40
% 0.78/1.40
% 0.78/1.40 resolution(
% 0.78/1.40 clause( 7033, [ theorem( or( not( or( X, Y ) ), or( not( or( not( X ), Z )
% 0.78/1.40 ), or( Y, Z ) ) ) ) ] )
% 0.78/1.40 , clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.78/1.40 or( Y, X ) ), Z ) ) ) ] )
% 0.78/1.40 , 1, clause( 100, [ theorem( or( not( or( X, Y ) ), or( not( or( not( Y ),
% 0.78/1.40 Z ) ), or( X, Z ) ) ) ) ] )
% 0.78/1.40 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, or( not( or( not( X
% 0.78/1.40 ), Z ) ), or( Y, Z ) ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ),
% 0.78/1.40 :=( Z, Z )] )).
% 0.78/1.40
% 0.78/1.40
% 0.78/1.40 subsumption(
% 0.78/1.40 clause( 756, [ theorem( or( not( or( X, Y ) ), or( not( or( not( X ), Z ) )
% 0.78/1.40 , or( Y, Z ) ) ) ) ] )
% 0.78/1.40 , clause( 7033, [ theorem( or( not( or( X, Y ) ), or( not( or( not( X ), Z
% 0.78/1.40 ) ), or( Y, Z ) ) ) ) ] )
% 0.78/1.40 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.78/1.40 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.78/1.40
% 0.78/1.40
% 0.78/1.40 resolution(
% 0.78/1.40 clause( 7034, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( X, Z )
% 0.78/1.40 ), or( Z, Y ) ) ) ) ] )
% 0.78/1.40 , clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 0.78/1.40 ) ) ) ) ] )
% 0.78/1.40 , 1, clause( 756, [ theorem( or( not( or( X, Y ) ), or( not( or( not( X ),
% 0.78/1.40 Z ) ), or( Y, Z ) ) ) ) ] )
% 0.78/1.40 , 0, substitution( 0, [ :=( X, not( or( not( X ), Y ) ) ), :=( Y, not( or(
% 0.78/1.40 X, Z ) ) ), :=( Z, or( Z, Y ) )] ), substitution( 1, [ :=( X, X ), :=( Y
% 0.78/1.40 , Z ), :=( Z, Y )] )).
% 0.78/1.40
% 0.78/1.40
% 0.78/1.40 subsumption(
% 0.78/1.40 clause( 6366, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( X, Z )
% 0.78/1.40 ), or( Z, Y ) ) ) ) ] )
% 0.78/1.40 , clause( 7034, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( X, Z
% 0.78/1.40 ) ), or( Z, Y ) ) ) ) ] )
% 0.78/1.40 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.78/1.40 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.78/1.40
% 0.78/1.40
% 0.78/1.40 resolution(
% 0.78/1.40 clause( 7035, [] )
% 0.78/1.40 , clause( 8, [ ~( theorem( or( not( or( not( q ), r ) ), or( not( or( q, p
% 0.78/1.40 ) ), or( p, r ) ) ) ) ) ] )
% 0.78/1.40 , 0, clause( 6366, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( X
% 0.78/1.40 , Z ) ), or( Z, Y ) ) ) ) ] )
% 0.78/1.40 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, q ), :=( Y, r ), :=(
% 0.78/1.40 Z, p )] )).
% 0.78/1.40
% 0.78/1.40
% 0.78/1.40 subsumption(
% 0.78/1.40 clause( 7018, [] )
% 0.78/1.40 , clause( 7035, [] )
% 0.78/1.40 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.78/1.40
% 0.78/1.40
% 0.78/1.40 end.
% 0.78/1.40
% 0.78/1.40 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.78/1.40
% 0.78/1.40 Memory use:
% 0.78/1.40
% 0.78/1.40 space for terms: 115768
% 0.78/1.40 space for clauses: 540004
% 0.78/1.40
% 0.78/1.40
% 0.78/1.40 clauses generated: 12096
% 0.78/1.40 clauses kept: 7019
% 0.78/1.40 clauses selected: 2008
% 0.78/1.40 clauses deleted: 47
% 0.78/1.40 clauses inuse deleted: 1
% 0.78/1.40
% 0.78/1.40 subsentry: 5334
% 0.78/1.40 literals s-matched: 5334
% 0.78/1.40 literals matched: 5334
% 0.78/1.40 full subsumption: 0
% 0.78/1.40
% 0.78/1.40 checksum: -1041843044
% 0.78/1.40
% 0.78/1.40
% 0.78/1.40 Bliksem ended
%------------------------------------------------------------------------------