TSTP Solution File: LCL195-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL195-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n010.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:34 EDT 2022
% Result : Unsatisfiable 2.64s 3.01s
% Output : Refutation 2.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : LCL195-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n010.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Mon Jul 4 16:01:02 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.64/3.01 *** allocated 10000 integers for termspace/termends
% 2.64/3.01 *** allocated 10000 integers for clauses
% 2.64/3.01 *** allocated 10000 integers for justifications
% 2.64/3.01 Bliksem 1.12
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 Automatic Strategy Selection
% 2.64/3.01
% 2.64/3.01 Clauses:
% 2.64/3.01 [
% 2.64/3.01 [ axiom( or( not( or( X, X ) ), X ) ) ],
% 2.64/3.01 [ axiom( or( not( X ), or( Y, X ) ) ) ],
% 2.64/3.01 [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ],
% 2.64/3.01 [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) ) ],
% 2.64/3.01 [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or( Z, Y )
% 2.64/3.01 ) ) ) ],
% 2.64/3.01 [ theorem( X ), ~( axiom( X ) ) ],
% 2.64/3.01 [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem( Y ) ) ]
% 2.64/3.01 ,
% 2.64/3.01 [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z ) ) ), ~(
% 2.64/3.01 theorem( or( not( Z ), Y ) ) ) ],
% 2.64/3.01 [ ~( theorem( or( not( or( not( q ), r ) ), or( not( or( q, p ) ), or( r
% 2.64/3.01 , p ) ) ) ) ) ]
% 2.64/3.01 ] .
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 percentage equality = 0.000000, percentage horn = 1.000000
% 2.64/3.01 This is a near-Horn, non-equality problem
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 Options Used:
% 2.64/3.01
% 2.64/3.01 useres = 1
% 2.64/3.01 useparamod = 0
% 2.64/3.01 useeqrefl = 0
% 2.64/3.01 useeqfact = 0
% 2.64/3.01 usefactor = 1
% 2.64/3.01 usesimpsplitting = 0
% 2.64/3.01 usesimpdemod = 0
% 2.64/3.01 usesimpres = 4
% 2.64/3.01
% 2.64/3.01 resimpinuse = 1000
% 2.64/3.01 resimpclauses = 20000
% 2.64/3.01 substype = standard
% 2.64/3.01 backwardsubs = 1
% 2.64/3.01 selectoldest = 5
% 2.64/3.01
% 2.64/3.01 litorderings [0] = split
% 2.64/3.01 litorderings [1] = liftord
% 2.64/3.01
% 2.64/3.01 termordering = none
% 2.64/3.01
% 2.64/3.01 litapriori = 1
% 2.64/3.01 termapriori = 0
% 2.64/3.01 litaposteriori = 0
% 2.64/3.01 termaposteriori = 0
% 2.64/3.01 demodaposteriori = 0
% 2.64/3.01 ordereqreflfact = 0
% 2.64/3.01
% 2.64/3.01 litselect = negative
% 2.64/3.01
% 2.64/3.01 maxweight = 30000
% 2.64/3.01 maxdepth = 30000
% 2.64/3.01 maxlength = 115
% 2.64/3.01 maxnrvars = 195
% 2.64/3.01 excuselevel = 0
% 2.64/3.01 increasemaxweight = 0
% 2.64/3.01
% 2.64/3.01 maxselected = 10000000
% 2.64/3.01 maxnrclauses = 10000000
% 2.64/3.01
% 2.64/3.01 showgenerated = 0
% 2.64/3.01 showkept = 0
% 2.64/3.01 showselected = 0
% 2.64/3.01 showdeleted = 0
% 2.64/3.01 showresimp = 1
% 2.64/3.01 showstatus = 2000
% 2.64/3.01
% 2.64/3.01 prologoutput = 1
% 2.64/3.01 nrgoals = 5000000
% 2.64/3.01 totalproof = 1
% 2.64/3.01
% 2.64/3.01 Symbols occurring in the translation:
% 2.64/3.01
% 2.64/3.01 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 2.64/3.01 . [1, 2] (w:1, o:26, a:1, s:1, b:0),
% 2.64/3.01 ! [4, 1] (w:1, o:18, a:1, s:1, b:0),
% 2.64/3.01 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 2.64/3.01 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 2.64/3.01 or [40, 2] (w:1, o:51, a:1, s:1, b:0),
% 2.64/3.01 not [41, 1] (w:1, o:23, a:1, s:1, b:0),
% 2.64/3.01 axiom [42, 1] (w:1, o:24, a:1, s:1, b:0),
% 2.64/3.01 theorem [46, 1] (w:1, o:25, a:1, s:1, b:0),
% 2.64/3.01 q [49, 0] (w:1, o:16, a:1, s:1, b:0),
% 2.64/3.01 r [50, 0] (w:1, o:17, a:1, s:1, b:0),
% 2.64/3.01 p [51, 0] (w:1, o:15, a:1, s:1, b:0).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 Starting Search:
% 2.64/3.01
% 2.64/3.01 Resimplifying inuse:
% 2.64/3.01 Done
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 Intermediate Status:
% 2.64/3.01 Generated: 3552
% 2.64/3.01 Kept: 2003
% 2.64/3.01 Inuse: 579
% 2.64/3.01 Deleted: 7
% 2.64/3.01 Deletedinuse: 0
% 2.64/3.01
% 2.64/3.01 Resimplifying inuse:
% 2.64/3.01 Done
% 2.64/3.01
% 2.64/3.01 Resimplifying inuse:
% 2.64/3.01 Done
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 Intermediate Status:
% 2.64/3.01 Generated: 7011
% 2.64/3.01 Kept: 4004
% 2.64/3.01 Inuse: 1159
% 2.64/3.01 Deleted: 22
% 2.64/3.01 Deletedinuse: 0
% 2.64/3.01
% 2.64/3.01 Resimplifying inuse:
% 2.64/3.01 Done
% 2.64/3.01
% 2.64/3.01 Resimplifying inuse:
% 2.64/3.01 Done
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 Intermediate Status:
% 2.64/3.01 Generated: 10535
% 2.64/3.01 Kept: 6005
% 2.64/3.01 Inuse: 1749
% 2.64/3.01 Deleted: 36
% 2.64/3.01 Deletedinuse: 0
% 2.64/3.01
% 2.64/3.01 Resimplifying inuse:
% 2.64/3.01 Done
% 2.64/3.01
% 2.64/3.01 Resimplifying inuse:
% 2.64/3.01 Done
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 Intermediate Status:
% 2.64/3.01 Generated: 13970
% 2.64/3.01 Kept: 8008
% 2.64/3.01 Inuse: 2286
% 2.64/3.01 Deleted: 54
% 2.64/3.01 Deletedinuse: 0
% 2.64/3.01
% 2.64/3.01 Resimplifying inuse:
% 2.64/3.01 Done
% 2.64/3.01
% 2.64/3.01 Resimplifying inuse:
% 2.64/3.01 Done
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 Intermediate Status:
% 2.64/3.01 Generated: 17352
% 2.64/3.01 Kept: 10008
% 2.64/3.01 Inuse: 2812
% 2.64/3.01 Deleted: 63
% 2.64/3.01 Deletedinuse: 0
% 2.64/3.01
% 2.64/3.01 Resimplifying inuse:
% 2.64/3.01 Done
% 2.64/3.01
% 2.64/3.01 Resimplifying inuse:
% 2.64/3.01 Done
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 Intermediate Status:
% 2.64/3.01 Generated: 20537
% 2.64/3.01 Kept: 12010
% 2.64/3.01 Inuse: 3393
% 2.64/3.01 Deleted: 83
% 2.64/3.01 Deletedinuse: 0
% 2.64/3.01
% 2.64/3.01 Resimplifying inuse:
% 2.64/3.01 Done
% 2.64/3.01
% 2.64/3.01 Resimplifying inuse:
% 2.64/3.01 Done
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 Intermediate Status:
% 2.64/3.01 Generated: 24245
% 2.64/3.01 Kept: 14010
% 2.64/3.01 Inuse: 4013
% 2.64/3.01 Deleted: 89
% 2.64/3.01 Deletedinuse: 0
% 2.64/3.01
% 2.64/3.01 Resimplifying inuse:
% 2.64/3.01 Done
% 2.64/3.01
% 2.64/3.01 Resimplifying inuse:
% 2.64/3.01 Done
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 Intermediate Status:
% 2.64/3.01 Generated: 27742
% 2.64/3.01 Kept: 16011
% 2.64/3.01 Inuse: 4575
% 2.64/3.01 Deleted: 95
% 2.64/3.01 Deletedinuse: 0
% 2.64/3.01
% 2.64/3.01 Resimplifying inuse:
% 2.64/3.01 Done
% 2.64/3.01
% 2.64/3.01 Resimplifying inuse:
% 2.64/3.01 Done
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 Intermediate Status:
% 2.64/3.01 Generated: 31389
% 2.64/3.01 Kept: 18016
% 2.64/3.01 Inuse: 5173
% 2.64/3.01 Deleted: 107
% 2.64/3.01 Deletedinuse: 0
% 2.64/3.01
% 2.64/3.01 Resimplifying inuse:
% 2.64/3.01 Done
% 2.64/3.01
% 2.64/3.01 Resimplifying inuse:
% 2.64/3.01 Done
% 2.64/3.01
% 2.64/3.01 Resimplifying clauses:
% 2.64/3.01 Done
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 Intermediate Status:
% 2.64/3.01 Generated: 35129
% 2.64/3.01 Kept: 20020
% 2.64/3.01 Inuse: 5808
% 2.64/3.01 Deleted: 1058
% 2.64/3.01 Deletedinuse: 0
% 2.64/3.01
% 2.64/3.01 Resimplifying inuse:
% 2.64/3.01 Done
% 2.64/3.01
% 2.64/3.01 Resimplifying inuse:
% 2.64/3.01 Done
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 Intermediate Status:
% 2.64/3.01 Generated: 38407
% 2.64/3.01 Kept: 22020
% 2.64/3.01 Inuse: 6379
% 2.64/3.01 Deleted: 1058
% 2.64/3.01 Deletedinuse: 0
% 2.64/3.01
% 2.64/3.01 Resimplifying inuse:
% 2.64/3.01 Done
% 2.64/3.01
% 2.64/3.01 Resimplifying inuse:
% 2.64/3.01 Done
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 Intermediate Status:
% 2.64/3.01 Generated: 41584
% 2.64/3.01 Kept: 24023
% 2.64/3.01 Inuse: 6938
% 2.64/3.01 Deleted: 1058
% 2.64/3.01 Deletedinuse: 0
% 2.64/3.01
% 2.64/3.01 Resimplifying inuse:
% 2.64/3.01 Done
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 Bliksems!, er is een bewijs:
% 2.64/3.01 % SZS status Unsatisfiable
% 2.64/3.01 % SZS output start Refutation
% 2.64/3.01
% 2.64/3.01 clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 2.64/3.01 .
% 2.64/3.01 clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) )
% 2.64/3.01 ] )
% 2.64/3.01 .
% 2.64/3.01 clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or(
% 2.64/3.01 Z, Y ) ) ) ) ] )
% 2.64/3.01 .
% 2.64/3.01 clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 2.64/3.01 .
% 2.64/3.01 clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X ) )
% 2.64/3.01 ) ] )
% 2.64/3.01 .
% 2.64/3.01 clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y ) )
% 2.64/3.01 ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 2.64/3.01 .
% 2.64/3.01 clause( 8, [ ~( theorem( or( not( or( not( q ), r ) ), or( not( or( q, p )
% 2.64/3.01 ), or( r, p ) ) ) ) ) ] )
% 2.64/3.01 .
% 2.64/3.01 clause( 11, [ theorem( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 2.64/3.01 .
% 2.64/3.01 clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z )
% 2.64/3.01 ) ) ) ] )
% 2.64/3.01 .
% 2.64/3.01 clause( 27, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~( theorem(
% 2.64/3.01 or( not( Y ), Z ) ) ) ] )
% 2.64/3.01 .
% 2.64/3.01 clause( 34, [ theorem( or( not( or( not( X ), Y ) ), Z ) ), ~( theorem( or(
% 2.64/3.01 not( or( not( or( T, X ) ), or( T, Y ) ) ), Z ) ) ) ] )
% 2.64/3.01 .
% 2.64/3.01 clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 2.64/3.01 or( Y, X ) ), Z ) ) ) ] )
% 2.64/3.01 .
% 2.64/3.01 clause( 89, [ theorem( or( not( or( X, or( Y, Z ) ) ), or( X, or( Z, Y ) )
% 2.64/3.01 ) ) ] )
% 2.64/3.01 .
% 2.64/3.01 clause( 647, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) )
% 2.64/3.01 , or( Y, Z ) ) ) ) ] )
% 2.64/3.01 .
% 2.64/3.01 clause( 5770, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( Z, Y )
% 2.64/3.01 ), or( X, Z ) ) ) ) ] )
% 2.64/3.01 .
% 2.64/3.01 clause( 11407, [ theorem( or( not( or( X, Y ) ), or( not( or( Z, not( Y ) )
% 2.64/3.01 ), or( Z, X ) ) ) ) ] )
% 2.64/3.01 .
% 2.64/3.01 clause( 24211, [ theorem( or( not( or( X, Y ) ), or( not( or( Z, not( X ) )
% 2.64/3.01 ), or( Z, Y ) ) ) ) ] )
% 2.64/3.01 .
% 2.64/3.01 clause( 24221, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( Y, Z )
% 2.64/3.01 ), or( X, Z ) ) ) ) ] )
% 2.64/3.01 .
% 2.64/3.01 clause( 24225, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( X, Z )
% 2.64/3.01 ), or( Y, Z ) ) ) ) ] )
% 2.64/3.01 .
% 2.64/3.01 clause( 24234, [] )
% 2.64/3.01 .
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 % SZS output end Refutation
% 2.64/3.01 found a proof!
% 2.64/3.01
% 2.64/3.01 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 2.64/3.01
% 2.64/3.01 initialclauses(
% 2.64/3.01 [ clause( 24236, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 2.64/3.01 , clause( 24237, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 2.64/3.01 , clause( 24238, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 2.64/3.01 , clause( 24239, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 2.64/3.01 ) ) ) ] )
% 2.64/3.01 , clause( 24240, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 2.64/3.01 ), or( Z, Y ) ) ) ) ] )
% 2.64/3.01 , clause( 24241, [ theorem( X ), ~( axiom( X ) ) ] )
% 2.64/3.01 , clause( 24242, [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~(
% 2.64/3.01 theorem( Y ) ) ] )
% 2.64/3.01 , clause( 24243, [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z
% 2.64/3.01 ) ) ), ~( theorem( or( not( Z ), Y ) ) ) ] )
% 2.64/3.01 , clause( 24244, [ ~( theorem( or( not( or( not( q ), r ) ), or( not( or( q
% 2.64/3.01 , p ) ), or( r, p ) ) ) ) ) ] )
% 2.64/3.01 ] ).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 subsumption(
% 2.64/3.01 clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 2.64/3.01 , clause( 24238, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 2.64/3.01 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 2.64/3.01 )] ) ).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 subsumption(
% 2.64/3.01 clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) )
% 2.64/3.01 ] )
% 2.64/3.01 , clause( 24239, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 2.64/3.01 ) ) ) ] )
% 2.64/3.01 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.64/3.01 permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 subsumption(
% 2.64/3.01 clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or(
% 2.64/3.01 Z, Y ) ) ) ) ] )
% 2.64/3.01 , clause( 24240, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 2.64/3.01 ), or( Z, Y ) ) ) ) ] )
% 2.64/3.01 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.64/3.01 permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 subsumption(
% 2.64/3.01 clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 2.64/3.01 , clause( 24241, [ theorem( X ), ~( axiom( X ) ) ] )
% 2.64/3.01 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 2.64/3.01 1 )] ) ).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 subsumption(
% 2.64/3.01 clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X ) )
% 2.64/3.01 ) ] )
% 2.64/3.01 , clause( 24242, [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~(
% 2.64/3.01 theorem( Y ) ) ] )
% 2.64/3.01 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 2.64/3.01 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 subsumption(
% 2.64/3.01 clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y ) )
% 2.64/3.01 ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 2.64/3.01 , clause( 24243, [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z
% 2.64/3.01 ) ) ), ~( theorem( or( not( Z ), Y ) ) ) ] )
% 2.64/3.01 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.64/3.01 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 subsumption(
% 2.64/3.01 clause( 8, [ ~( theorem( or( not( or( not( q ), r ) ), or( not( or( q, p )
% 2.64/3.01 ), or( r, p ) ) ) ) ) ] )
% 2.64/3.01 , clause( 24244, [ ~( theorem( or( not( or( not( q ), r ) ), or( not( or( q
% 2.64/3.01 , p ) ), or( r, p ) ) ) ) ) ] )
% 2.64/3.01 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 resolution(
% 2.64/3.01 clause( 24245, [ theorem( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 2.64/3.01 , clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 2.64/3.01 , 1, clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 2.64/3.01 , 0, substitution( 0, [ :=( X, or( not( or( X, Y ) ), or( Y, X ) ) )] ),
% 2.64/3.01 substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 subsumption(
% 2.64/3.01 clause( 11, [ theorem( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 2.64/3.01 , clause( 24245, [ theorem( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 2.64/3.01 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 2.64/3.01 )] ) ).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 resolution(
% 2.64/3.01 clause( 24246, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X,
% 2.64/3.01 Z ) ) ) ) ] )
% 2.64/3.01 , clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X )
% 2.64/3.01 ) ) ] )
% 2.64/3.01 , 2, clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 2.64/3.01 ) ) ) ] )
% 2.64/3.01 , 0, substitution( 0, [ :=( X, or( X, or( Y, Z ) ) ), :=( Y, or( Y, or( X,
% 2.64/3.01 Z ) ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] )).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 subsumption(
% 2.64/3.01 clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z )
% 2.64/3.01 ) ) ) ] )
% 2.64/3.01 , clause( 24246, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X
% 2.64/3.01 , Z ) ) ) ) ] )
% 2.64/3.01 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.64/3.01 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 resolution(
% 2.64/3.01 clause( 24247, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~( theorem(
% 2.64/3.01 or( not( Y ), Z ) ) ) ] )
% 2.64/3.01 , clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X )
% 2.64/3.01 ) ) ] )
% 2.64/3.01 , 2, clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 2.64/3.01 ), or( Z, Y ) ) ) ) ] )
% 2.64/3.01 , 0, substitution( 0, [ :=( X, or( not( or( X, Y ) ), or( X, Z ) ) ), :=( Y
% 2.64/3.01 , or( not( Y ), Z ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, Z ), :=(
% 2.64/3.01 Z, X )] )).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 subsumption(
% 2.64/3.01 clause( 27, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~( theorem(
% 2.64/3.01 or( not( Y ), Z ) ) ) ] )
% 2.64/3.01 , clause( 24247, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~(
% 2.64/3.01 theorem( or( not( Y ), Z ) ) ) ] )
% 2.64/3.01 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.64/3.01 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 resolution(
% 2.64/3.01 clause( 24248, [ theorem( or( not( or( not( X ), Y ) ), Z ) ), ~( theorem(
% 2.64/3.01 or( not( or( not( or( T, X ) ), or( T, Y ) ) ), Z ) ) ) ] )
% 2.64/3.01 , clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y )
% 2.64/3.01 ) ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 2.64/3.01 , 2, clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 2.64/3.01 ), or( Z, Y ) ) ) ) ] )
% 2.64/3.01 , 0, substitution( 0, [ :=( X, or( not( X ), Y ) ), :=( Y, Z ), :=( Z, or(
% 2.64/3.01 not( or( T, X ) ), or( T, Y ) ) )] ), substitution( 1, [ :=( X, X ), :=(
% 2.64/3.01 Y, Y ), :=( Z, T )] )).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 subsumption(
% 2.64/3.01 clause( 34, [ theorem( or( not( or( not( X ), Y ) ), Z ) ), ~( theorem( or(
% 2.64/3.01 not( or( not( or( T, X ) ), or( T, Y ) ) ), Z ) ) ) ] )
% 2.64/3.01 , clause( 24248, [ theorem( or( not( or( not( X ), Y ) ), Z ) ), ~( theorem(
% 2.64/3.01 or( not( or( not( or( T, X ) ), or( T, Y ) ) ), Z ) ) ) ] )
% 2.64/3.01 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 2.64/3.01 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 resolution(
% 2.64/3.01 clause( 24249, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 2.64/3.01 or( Y, X ) ), Z ) ) ) ] )
% 2.64/3.01 , clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y )
% 2.64/3.01 ) ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 2.64/3.01 , 2, clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 2.64/3.01 , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, Z ), :=( Z, or( Y, X )
% 2.64/3.01 )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 subsumption(
% 2.64/3.01 clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 2.64/3.01 or( Y, X ) ), Z ) ) ) ] )
% 2.64/3.01 , clause( 24249, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or(
% 2.64/3.01 not( or( Y, X ) ), Z ) ) ) ] )
% 2.64/3.01 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.64/3.01 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 resolution(
% 2.64/3.01 clause( 24250, [ theorem( or( not( or( X, or( Y, Z ) ) ), or( X, or( Z, Y )
% 2.64/3.01 ) ) ) ] )
% 2.64/3.01 , clause( 27, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~( theorem(
% 2.64/3.01 or( not( Y ), Z ) ) ) ] )
% 2.64/3.01 , 1, clause( 11, [ theorem( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 2.64/3.01 , 0, substitution( 0, [ :=( X, X ), :=( Y, or( Y, Z ) ), :=( Z, or( Z, Y )
% 2.64/3.01 )] ), substitution( 1, [ :=( X, Y ), :=( Y, Z )] )).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 subsumption(
% 2.64/3.01 clause( 89, [ theorem( or( not( or( X, or( Y, Z ) ) ), or( X, or( Z, Y ) )
% 2.64/3.01 ) ) ] )
% 2.64/3.01 , clause( 24250, [ theorem( or( not( or( X, or( Y, Z ) ) ), or( X, or( Z, Y
% 2.64/3.01 ) ) ) ) ] )
% 2.64/3.01 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.64/3.01 permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 resolution(
% 2.64/3.01 clause( 24251, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 2.64/3.01 ), or( Y, Z ) ) ) ) ] )
% 2.64/3.01 , clause( 34, [ theorem( or( not( or( not( X ), Y ) ), Z ) ), ~( theorem(
% 2.64/3.01 or( not( or( not( or( T, X ) ), or( T, Y ) ) ), Z ) ) ) ] )
% 2.64/3.01 , 1, clause( 89, [ theorem( or( not( or( X, or( Y, Z ) ) ), or( X, or( Z, Y
% 2.64/3.01 ) ) ) ) ] )
% 2.64/3.01 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, or( not( or( Z, X )
% 2.64/3.01 ), or( Y, Z ) ) ), :=( T, Z )] ), substitution( 1, [ :=( X, not( or( Z,
% 2.64/3.01 X ) ) ), :=( Y, Z ), :=( Z, Y )] )).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 subsumption(
% 2.64/3.01 clause( 647, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) )
% 2.64/3.01 , or( Y, Z ) ) ) ) ] )
% 2.64/3.01 , clause( 24251, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Z, X
% 2.64/3.01 ) ), or( Y, Z ) ) ) ) ] )
% 2.64/3.01 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.64/3.01 permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 resolution(
% 2.64/3.01 clause( 24252, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( Z, Y )
% 2.64/3.01 ), or( X, Z ) ) ) ) ] )
% 2.64/3.01 , clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 2.64/3.01 or( Y, X ) ), Z ) ) ) ] )
% 2.64/3.01 , 1, clause( 647, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Z,
% 2.64/3.01 X ) ), or( Y, Z ) ) ) ) ] )
% 2.64/3.01 , 0, substitution( 0, [ :=( X, X ), :=( Y, not( Y ) ), :=( Z, or( not( or(
% 2.64/3.01 Z, Y ) ), or( X, Z ) ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ),
% 2.64/3.01 :=( Z, Z )] )).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 subsumption(
% 2.64/3.01 clause( 5770, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( Z, Y )
% 2.64/3.01 ), or( X, Z ) ) ) ) ] )
% 2.64/3.01 , clause( 24252, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( Z, Y
% 2.64/3.01 ) ), or( X, Z ) ) ) ) ] )
% 2.64/3.01 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.64/3.01 permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 resolution(
% 2.64/3.01 clause( 24253, [ theorem( or( not( or( X, Y ) ), or( not( or( Z, not( Y ) )
% 2.64/3.01 ), or( Z, X ) ) ) ) ] )
% 2.64/3.01 , clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 2.64/3.01 ) ) ) ) ] )
% 2.64/3.01 , 1, clause( 5770, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( Z
% 2.64/3.01 , Y ) ), or( X, Z ) ) ) ) ] )
% 2.64/3.01 , 0, substitution( 0, [ :=( X, not( or( X, Y ) ) ), :=( Y, not( or( Z, not(
% 2.64/3.01 Y ) ) ) ), :=( Z, or( Z, X ) )] ), substitution( 1, [ :=( X, Z ), :=( Y,
% 2.64/3.01 Y ), :=( Z, X )] )).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 subsumption(
% 2.64/3.01 clause( 11407, [ theorem( or( not( or( X, Y ) ), or( not( or( Z, not( Y ) )
% 2.64/3.01 ), or( Z, X ) ) ) ) ] )
% 2.64/3.01 , clause( 24253, [ theorem( or( not( or( X, Y ) ), or( not( or( Z, not( Y )
% 2.64/3.01 ) ), or( Z, X ) ) ) ) ] )
% 2.64/3.01 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.64/3.01 permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 resolution(
% 2.64/3.01 clause( 24254, [ theorem( or( not( or( X, Y ) ), or( not( or( Z, not( X ) )
% 2.64/3.01 ), or( Z, Y ) ) ) ) ] )
% 2.64/3.01 , clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 2.64/3.01 or( Y, X ) ), Z ) ) ) ] )
% 2.64/3.01 , 1, clause( 11407, [ theorem( or( not( or( X, Y ) ), or( not( or( Z, not(
% 2.64/3.01 Y ) ) ), or( Z, X ) ) ) ) ] )
% 2.64/3.01 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, or( not( or( Z, not(
% 2.64/3.01 X ) ) ), or( Z, Y ) ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ),
% 2.64/3.01 :=( Z, Z )] )).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 subsumption(
% 2.64/3.01 clause( 24211, [ theorem( or( not( or( X, Y ) ), or( not( or( Z, not( X ) )
% 2.64/3.01 ), or( Z, Y ) ) ) ) ] )
% 2.64/3.01 , clause( 24254, [ theorem( or( not( or( X, Y ) ), or( not( or( Z, not( X )
% 2.64/3.01 ) ), or( Z, Y ) ) ) ) ] )
% 2.64/3.01 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.64/3.01 permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 resolution(
% 2.64/3.01 clause( 24255, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( Y, Z )
% 2.64/3.01 ), or( X, Z ) ) ) ) ] )
% 2.64/3.01 , clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 2.64/3.01 ) ) ) ) ] )
% 2.64/3.01 , 1, clause( 24211, [ theorem( or( not( or( X, Y ) ), or( not( or( Z, not(
% 2.64/3.01 X ) ) ), or( Z, Y ) ) ) ) ] )
% 2.64/3.01 , 0, substitution( 0, [ :=( X, not( or( X, not( Y ) ) ) ), :=( Y, not( or(
% 2.64/3.01 Y, Z ) ) ), :=( Z, or( X, Z ) )] ), substitution( 1, [ :=( X, Y ), :=( Y
% 2.64/3.01 , Z ), :=( Z, X )] )).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 subsumption(
% 2.64/3.01 clause( 24221, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( Y, Z )
% 2.64/3.01 ), or( X, Z ) ) ) ) ] )
% 2.64/3.01 , clause( 24255, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( Y, Z
% 2.64/3.01 ) ), or( X, Z ) ) ) ) ] )
% 2.64/3.01 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.64/3.01 permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 resolution(
% 2.64/3.01 clause( 24256, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( X, Z )
% 2.64/3.01 ), or( Y, Z ) ) ) ) ] )
% 2.64/3.01 , clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 2.64/3.01 or( Y, X ) ), Z ) ) ) ] )
% 2.64/3.01 , 1, clause( 24221, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( Y
% 2.64/3.01 , Z ) ), or( X, Z ) ) ) ) ] )
% 2.64/3.01 , 0, substitution( 0, [ :=( X, not( X ) ), :=( Y, Y ), :=( Z, or( not( or(
% 2.64/3.01 X, Z ) ), or( Y, Z ) ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ),
% 2.64/3.01 :=( Z, Z )] )).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 subsumption(
% 2.64/3.01 clause( 24225, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( X, Z )
% 2.64/3.01 ), or( Y, Z ) ) ) ) ] )
% 2.64/3.01 , clause( 24256, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( X, Z
% 2.64/3.01 ) ), or( Y, Z ) ) ) ) ] )
% 2.64/3.01 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 2.64/3.01 permutation( 0, [ ==>( 0, 0 )] ) ).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 resolution(
% 2.64/3.01 clause( 24257, [] )
% 2.64/3.01 , clause( 8, [ ~( theorem( or( not( or( not( q ), r ) ), or( not( or( q, p
% 2.64/3.01 ) ), or( r, p ) ) ) ) ) ] )
% 2.64/3.01 , 0, clause( 24225, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( X
% 2.64/3.01 , Z ) ), or( Y, Z ) ) ) ) ] )
% 2.64/3.01 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, q ), :=( Y, r ), :=(
% 2.64/3.01 Z, p )] )).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 subsumption(
% 2.64/3.01 clause( 24234, [] )
% 2.64/3.01 , clause( 24257, [] )
% 2.64/3.01 , substitution( 0, [] ), permutation( 0, [] ) ).
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 end.
% 2.64/3.01
% 2.64/3.01 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 2.64/3.01
% 2.64/3.01 Memory use:
% 2.64/3.01
% 2.64/3.01 space for terms: 441631
% 2.64/3.01 space for clauses: 1911643
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 clauses generated: 41904
% 2.64/3.01 clauses kept: 24235
% 2.64/3.01 clauses selected: 6992
% 2.64/3.01 clauses deleted: 1058
% 2.64/3.01 clauses inuse deleted: 0
% 2.64/3.01
% 2.64/3.01 subsentry: 19369
% 2.64/3.01 literals s-matched: 19369
% 2.64/3.01 literals matched: 19369
% 2.64/3.01 full subsumption: 0
% 2.64/3.01
% 2.64/3.01 checksum: 1228817980
% 2.64/3.01
% 2.64/3.01
% 2.64/3.01 Bliksem ended
%------------------------------------------------------------------------------