TSTP Solution File: LCL198-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL198-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n005.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:36 EDT 2022
% Result : Unsatisfiable 0.74s 1.21s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL198-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n005.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 : Mon Jul 4 02:07:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.74/1.21 *** allocated 10000 integers for termspace/termends
% 0.74/1.21 *** allocated 10000 integers for clauses
% 0.74/1.21 *** allocated 10000 integers for justifications
% 0.74/1.21 Bliksem 1.12
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 Automatic Strategy Selection
% 0.74/1.21
% 0.74/1.21 Clauses:
% 0.74/1.21 [
% 0.74/1.21 [ axiom( or( not( or( X, X ) ), X ) ) ],
% 0.74/1.21 [ axiom( or( not( X ), or( Y, X ) ) ) ],
% 0.74/1.21 [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ],
% 0.74/1.21 [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) ) ],
% 0.74/1.21 [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or( Z, Y )
% 0.74/1.21 ) ) ) ],
% 0.74/1.21 [ theorem( X ), ~( axiom( X ) ) ],
% 0.74/1.21 [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem( Y ) ) ]
% 0.74/1.21 ,
% 0.74/1.21 [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z ) ) ), ~(
% 0.74/1.21 theorem( or( not( Z ), Y ) ) ) ],
% 0.74/1.21 [ ~( theorem( or( not( or( not( p ), or( not( p ), q ) ) ), or( not( p )
% 0.74/1.21 , q ) ) ) ) ]
% 0.74/1.21 ] .
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 percentage equality = 0.000000, percentage horn = 1.000000
% 0.74/1.21 This is a near-Horn, non-equality problem
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 Options Used:
% 0.74/1.21
% 0.74/1.21 useres = 1
% 0.74/1.21 useparamod = 0
% 0.74/1.21 useeqrefl = 0
% 0.74/1.21 useeqfact = 0
% 0.74/1.21 usefactor = 1
% 0.74/1.21 usesimpsplitting = 0
% 0.74/1.21 usesimpdemod = 0
% 0.74/1.21 usesimpres = 4
% 0.74/1.21
% 0.74/1.21 resimpinuse = 1000
% 0.74/1.21 resimpclauses = 20000
% 0.74/1.21 substype = standard
% 0.74/1.21 backwardsubs = 1
% 0.74/1.21 selectoldest = 5
% 0.74/1.21
% 0.74/1.21 litorderings [0] = split
% 0.74/1.21 litorderings [1] = liftord
% 0.74/1.21
% 0.74/1.21 termordering = none
% 0.74/1.21
% 0.74/1.21 litapriori = 1
% 0.74/1.21 termapriori = 0
% 0.74/1.21 litaposteriori = 0
% 0.74/1.21 termaposteriori = 0
% 0.74/1.21 demodaposteriori = 0
% 0.74/1.21 ordereqreflfact = 0
% 0.74/1.21
% 0.74/1.21 litselect = negative
% 0.74/1.21
% 0.74/1.21 maxweight = 30000
% 0.74/1.21 maxdepth = 30000
% 0.74/1.21 maxlength = 115
% 0.74/1.21 maxnrvars = 195
% 0.74/1.21 excuselevel = 0
% 0.74/1.21 increasemaxweight = 0
% 0.74/1.21
% 0.74/1.21 maxselected = 10000000
% 0.74/1.21 maxnrclauses = 10000000
% 0.74/1.21
% 0.74/1.21 showgenerated = 0
% 0.74/1.21 showkept = 0
% 0.74/1.21 showselected = 0
% 0.74/1.21 showdeleted = 0
% 0.74/1.21 showresimp = 1
% 0.74/1.21 showstatus = 2000
% 0.74/1.21
% 0.74/1.21 prologoutput = 1
% 0.74/1.21 nrgoals = 5000000
% 0.74/1.21 totalproof = 1
% 0.74/1.21
% 0.74/1.21 Symbols occurring in the translation:
% 0.74/1.21
% 0.74/1.21 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.74/1.21 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 0.74/1.21 ! [4, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.74/1.21 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.74/1.21 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.74/1.21 or [40, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.74/1.21 not [41, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.74/1.21 axiom [42, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.74/1.21 theorem [46, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.74/1.21 p [49, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.74/1.21 q [50, 0] (w:1, o:16, a:1, s:1, b:0).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 Starting Search:
% 0.74/1.21
% 0.74/1.21 Resimplifying inuse:
% 0.74/1.21 Done
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 Intermediate Status:
% 0.74/1.21 Generated: 3552
% 0.74/1.21 Kept: 2003
% 0.74/1.21 Inuse: 579
% 0.74/1.21 Deleted: 7
% 0.74/1.21 Deletedinuse: 0
% 0.74/1.21
% 0.74/1.21 Resimplifying inuse:
% 0.74/1.21 Done
% 0.74/1.21
% 0.74/1.21 Resimplifying inuse:
% 0.74/1.21 Done
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 Bliksems!, er is een bewijs:
% 0.74/1.21 % SZS status Unsatisfiable
% 0.74/1.21 % SZS output start Refutation
% 0.74/1.21
% 0.74/1.21 clause( 0, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.74/1.21 .
% 0.74/1.21 clause( 1, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.74/1.21 .
% 0.74/1.21 clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.74/1.21 .
% 0.74/1.21 clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) )
% 0.74/1.21 ] )
% 0.74/1.21 .
% 0.74/1.21 clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or(
% 0.74/1.21 Z, Y ) ) ) ) ] )
% 0.74/1.21 .
% 0.74/1.21 clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.74/1.21 .
% 0.74/1.21 clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X ) )
% 0.74/1.21 ) ] )
% 0.74/1.21 .
% 0.74/1.21 clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y ) )
% 0.74/1.21 ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.74/1.21 .
% 0.74/1.21 clause( 8, [ ~( theorem( or( not( or( not( p ), or( not( p ), q ) ) ), or(
% 0.74/1.21 not( p ), q ) ) ) ) ] )
% 0.74/1.21 .
% 0.74/1.21 clause( 11, [ theorem( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.74/1.21 .
% 0.74/1.21 clause( 13, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.74/1.21 .
% 0.74/1.21 clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z )
% 0.74/1.21 ) ) ) ] )
% 0.74/1.21 .
% 0.74/1.21 clause( 27, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~( theorem(
% 0.74/1.21 or( not( Y ), Z ) ) ) ] )
% 0.74/1.21 .
% 0.74/1.21 clause( 35, [ theorem( or( not( or( X, or( Y, Z ) ) ), T ) ), ~( theorem(
% 0.74/1.21 or( not( or( Y, or( X, Z ) ) ), T ) ) ) ] )
% 0.74/1.21 .
% 0.74/1.21 clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.74/1.21 or( Y, X ) ), Z ) ) ) ] )
% 0.74/1.21 .
% 0.74/1.21 clause( 38, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z, X )
% 0.74/1.21 ), Y ) ) ) ] )
% 0.74/1.21 .
% 0.74/1.21 clause( 220, [ theorem( or( not( X ), or( X, Y ) ) ) ] )
% 0.74/1.21 .
% 0.74/1.21 clause( 226, [ theorem( or( not( or( X, Y ) ), or( X, or( Y, Z ) ) ) ) ] )
% 0.74/1.21 .
% 0.74/1.21 clause( 419, [ theorem( or( not( or( X, Y ) ), or( Y, or( X, Z ) ) ) ) ] )
% 0.74/1.21 .
% 0.74/1.21 clause( 427, [ theorem( or( not( or( X, or( Y, Z ) ) ), or( or( X, Z ), or(
% 0.74/1.21 Y, T ) ) ) ) ] )
% 0.74/1.21 .
% 0.74/1.21 clause( 3909, [ theorem( or( not( or( X, Y ) ), or( or( Z, Y ), or( X, T )
% 0.74/1.21 ) ) ) ] )
% 0.74/1.21 .
% 0.74/1.21 clause( 3918, [ theorem( or( not( or( X, Y ) ), or( or( Z, X ), or( Y, T )
% 0.74/1.21 ) ) ) ] )
% 0.74/1.21 .
% 0.74/1.21 clause( 3929, [ theorem( or( or( X, Y ), or( not( or( Y, Z ) ), or( Z, T )
% 0.74/1.21 ) ) ) ] )
% 0.74/1.21 .
% 0.74/1.21 clause( 3943, [ theorem( or( not( or( or( X, Y ), X ) ), or( X, Y ) ) ) ]
% 0.74/1.21 )
% 0.74/1.21 .
% 0.74/1.21 clause( 3946, [ theorem( or( not( or( X, or( X, Y ) ) ), or( X, Y ) ) ) ]
% 0.74/1.21 )
% 0.74/1.21 .
% 0.74/1.21 clause( 3955, [] )
% 0.74/1.21 .
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 % SZS output end Refutation
% 0.74/1.21 found a proof!
% 0.74/1.21
% 0.74/1.21 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.74/1.21
% 0.74/1.21 initialclauses(
% 0.74/1.21 [ clause( 3957, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.74/1.21 , clause( 3958, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.74/1.21 , clause( 3959, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.74/1.21 , clause( 3960, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 0.74/1.21 ) ) ) ] )
% 0.74/1.21 , clause( 3961, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 0.74/1.21 ), or( Z, Y ) ) ) ) ] )
% 0.74/1.21 , clause( 3962, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.74/1.21 , clause( 3963, [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem(
% 0.74/1.21 Y ) ) ] )
% 0.74/1.21 , clause( 3964, [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z )
% 0.74/1.21 ) ), ~( theorem( or( not( Z ), Y ) ) ) ] )
% 0.74/1.21 , clause( 3965, [ ~( theorem( or( not( or( not( p ), or( not( p ), q ) ) )
% 0.74/1.21 , or( not( p ), q ) ) ) ) ] )
% 0.74/1.21 ] ).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 subsumption(
% 0.74/1.21 clause( 0, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.74/1.21 , clause( 3957, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.74/1.21 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 subsumption(
% 0.74/1.21 clause( 1, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.74/1.21 , clause( 3958, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.74/1.21 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.21 )] ) ).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 subsumption(
% 0.74/1.21 clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.74/1.21 , clause( 3959, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.74/1.21 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.21 )] ) ).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 subsumption(
% 0.74/1.21 clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) )
% 0.74/1.21 ] )
% 0.74/1.21 , clause( 3960, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 0.74/1.21 ) ) ) ] )
% 0.74/1.21 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.74/1.21 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 subsumption(
% 0.74/1.21 clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or(
% 0.74/1.21 Z, Y ) ) ) ) ] )
% 0.74/1.21 , clause( 3961, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 0.74/1.21 ), or( Z, Y ) ) ) ) ] )
% 0.74/1.21 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.74/1.21 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 subsumption(
% 0.74/1.21 clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.74/1.21 , clause( 3962, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.74/1.21 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.74/1.21 1 )] ) ).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 subsumption(
% 0.74/1.21 clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X ) )
% 0.74/1.21 ) ] )
% 0.74/1.21 , clause( 3963, [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem(
% 0.74/1.21 Y ) ) ] )
% 0.74/1.21 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.21 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 subsumption(
% 0.74/1.21 clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y ) )
% 0.74/1.21 ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.74/1.21 , clause( 3964, [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z )
% 0.74/1.21 ) ), ~( theorem( or( not( Z ), Y ) ) ) ] )
% 0.74/1.21 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.74/1.21 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 subsumption(
% 0.74/1.21 clause( 8, [ ~( theorem( or( not( or( not( p ), or( not( p ), q ) ) ), or(
% 0.74/1.21 not( p ), q ) ) ) ) ] )
% 0.74/1.21 , clause( 3965, [ ~( theorem( or( not( or( not( p ), or( not( p ), q ) ) )
% 0.74/1.21 , or( not( p ), q ) ) ) ) ] )
% 0.74/1.21 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 resolution(
% 0.74/1.21 clause( 3966, [ theorem( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.74/1.21 , clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.74/1.21 , 1, clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.74/1.21 , 0, substitution( 0, [ :=( X, or( not( or( X, Y ) ), or( Y, X ) ) )] ),
% 0.74/1.21 substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 subsumption(
% 0.74/1.21 clause( 11, [ theorem( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.74/1.21 , clause( 3966, [ theorem( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.74/1.21 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.21 )] ) ).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 resolution(
% 0.74/1.21 clause( 3967, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.74/1.21 , clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X )
% 0.74/1.21 ) ) ] )
% 0.74/1.21 , 2, clause( 0, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.74/1.21 , 0, substitution( 0, [ :=( X, X ), :=( Y, or( X, X ) )] ), substitution( 1
% 0.74/1.21 , [ :=( X, X )] )).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 subsumption(
% 0.74/1.21 clause( 13, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.74/1.21 , clause( 3967, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.74/1.21 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.74/1.21 1 )] ) ).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 resolution(
% 0.74/1.21 clause( 3968, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 0.74/1.21 ) ) ) ) ] )
% 0.74/1.21 , clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X )
% 0.74/1.21 ) ) ] )
% 0.74/1.21 , 2, clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 0.74/1.21 ) ) ) ] )
% 0.74/1.21 , 0, substitution( 0, [ :=( X, or( X, or( Y, Z ) ) ), :=( Y, or( Y, or( X,
% 0.74/1.21 Z ) ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] )).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 subsumption(
% 0.74/1.21 clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z )
% 0.74/1.21 ) ) ) ] )
% 0.74/1.21 , clause( 3968, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X
% 0.74/1.21 , Z ) ) ) ) ] )
% 0.74/1.21 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.74/1.21 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 resolution(
% 0.74/1.21 clause( 3969, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~( theorem(
% 0.74/1.21 or( not( Y ), Z ) ) ) ] )
% 0.74/1.21 , clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X )
% 0.74/1.21 ) ) ] )
% 0.74/1.21 , 2, clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 0.74/1.21 ), or( Z, Y ) ) ) ) ] )
% 0.74/1.21 , 0, substitution( 0, [ :=( X, or( not( or( X, Y ) ), or( X, Z ) ) ), :=( Y
% 0.74/1.21 , or( not( Y ), Z ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, Z ), :=(
% 0.74/1.21 Z, X )] )).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 subsumption(
% 0.74/1.21 clause( 27, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~( theorem(
% 0.74/1.21 or( not( Y ), Z ) ) ) ] )
% 0.74/1.21 , clause( 3969, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~(
% 0.74/1.21 theorem( or( not( Y ), Z ) ) ) ] )
% 0.74/1.21 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.74/1.21 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 resolution(
% 0.74/1.21 clause( 3970, [ theorem( or( not( or( X, or( Y, Z ) ) ), T ) ), ~( theorem(
% 0.74/1.21 or( not( or( Y, or( X, Z ) ) ), T ) ) ) ] )
% 0.74/1.21 , clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y )
% 0.74/1.21 ) ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.74/1.21 , 2, clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 0.74/1.21 ) ) ) ] )
% 0.74/1.21 , 0, substitution( 0, [ :=( X, or( X, or( Y, Z ) ) ), :=( Y, T ), :=( Z, or(
% 0.74/1.21 Y, or( X, Z ) ) )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z
% 0.74/1.21 )] )).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 subsumption(
% 0.74/1.21 clause( 35, [ theorem( or( not( or( X, or( Y, Z ) ) ), T ) ), ~( theorem(
% 0.74/1.21 or( not( or( Y, or( X, Z ) ) ), T ) ) ) ] )
% 0.74/1.21 , clause( 3970, [ theorem( or( not( or( X, or( Y, Z ) ) ), T ) ), ~(
% 0.74/1.21 theorem( or( not( or( Y, or( X, Z ) ) ), T ) ) ) ] )
% 0.74/1.21 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.74/1.21 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 resolution(
% 0.74/1.21 clause( 3971, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.74/1.21 or( Y, X ) ), Z ) ) ) ] )
% 0.74/1.21 , clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y )
% 0.74/1.21 ) ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.74/1.21 , 2, clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.74/1.21 , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, Z ), :=( Z, or( Y, X )
% 0.74/1.21 )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 subsumption(
% 0.74/1.21 clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.74/1.21 or( Y, X ) ), Z ) ) ) ] )
% 0.74/1.21 , clause( 3971, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or(
% 0.74/1.21 not( or( Y, X ) ), Z ) ) ) ] )
% 0.74/1.21 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.74/1.21 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 resolution(
% 0.74/1.21 clause( 3972, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z, X
% 0.74/1.21 ) ), Y ) ) ) ] )
% 0.74/1.21 , clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y )
% 0.74/1.21 ) ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.74/1.21 , 2, clause( 1, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.74/1.21 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, or( Z, X ) )] ),
% 0.74/1.21 substitution( 1, [ :=( X, X ), :=( Y, Z )] )).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 subsumption(
% 0.74/1.21 clause( 38, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z, X )
% 0.74/1.21 ), Y ) ) ) ] )
% 0.74/1.21 , clause( 3972, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z
% 0.74/1.21 , X ) ), Y ) ) ) ] )
% 0.74/1.21 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.74/1.21 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 resolution(
% 0.74/1.21 clause( 3973, [ theorem( or( not( X ), or( X, Y ) ) ) ] )
% 0.74/1.21 , clause( 38, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z, X
% 0.74/1.21 ) ), Y ) ) ) ] )
% 0.74/1.21 , 1, clause( 11, [ theorem( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.74/1.21 , 0, substitution( 0, [ :=( X, X ), :=( Y, or( X, Y ) ), :=( Z, Y )] ),
% 0.74/1.21 substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 subsumption(
% 0.74/1.21 clause( 220, [ theorem( or( not( X ), or( X, Y ) ) ) ] )
% 0.74/1.21 , clause( 3973, [ theorem( or( not( X ), or( X, Y ) ) ) ] )
% 0.74/1.21 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.21 )] ) ).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 resolution(
% 0.74/1.21 clause( 3974, [ theorem( or( not( or( X, Y ) ), or( X, or( Y, Z ) ) ) ) ]
% 0.74/1.21 )
% 0.74/1.21 , clause( 27, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~( theorem(
% 0.74/1.21 or( not( Y ), Z ) ) ) ] )
% 0.74/1.21 , 1, clause( 220, [ theorem( or( not( X ), or( X, Y ) ) ) ] )
% 0.74/1.21 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, or( Y, Z ) )] ),
% 0.74/1.21 substitution( 1, [ :=( X, Y ), :=( Y, Z )] )).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 subsumption(
% 0.74/1.21 clause( 226, [ theorem( or( not( or( X, Y ) ), or( X, or( Y, Z ) ) ) ) ] )
% 0.74/1.21 , clause( 3974, [ theorem( or( not( or( X, Y ) ), or( X, or( Y, Z ) ) ) ) ]
% 0.74/1.21 )
% 0.74/1.21 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.74/1.21 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 resolution(
% 0.74/1.21 clause( 3975, [ theorem( or( not( or( X, Y ) ), or( Y, or( X, Z ) ) ) ) ]
% 0.74/1.21 )
% 0.74/1.21 , clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.74/1.21 or( Y, X ) ), Z ) ) ) ] )
% 0.74/1.21 , 1, clause( 226, [ theorem( or( not( or( X, Y ) ), or( X, or( Y, Z ) ) ) )
% 0.74/1.21 ] )
% 0.74/1.21 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, or( Y, or( X, Z ) )
% 0.74/1.21 )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] )).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 subsumption(
% 0.74/1.21 clause( 419, [ theorem( or( not( or( X, Y ) ), or( Y, or( X, Z ) ) ) ) ] )
% 0.74/1.21 , clause( 3975, [ theorem( or( not( or( X, Y ) ), or( Y, or( X, Z ) ) ) ) ]
% 0.74/1.21 )
% 0.74/1.21 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.74/1.21 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 resolution(
% 0.74/1.21 clause( 3976, [ theorem( or( not( or( X, or( Y, Z ) ) ), or( or( X, Z ), or(
% 0.74/1.21 Y, T ) ) ) ) ] )
% 0.74/1.21 , clause( 35, [ theorem( or( not( or( X, or( Y, Z ) ) ), T ) ), ~( theorem(
% 0.74/1.21 or( not( or( Y, or( X, Z ) ) ), T ) ) ) ] )
% 0.74/1.21 , 1, clause( 419, [ theorem( or( not( or( X, Y ) ), or( Y, or( X, Z ) ) ) )
% 0.74/1.21 ] )
% 0.74/1.21 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, or( or(
% 0.74/1.21 X, Z ), or( Y, T ) ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, or( X, Z
% 0.74/1.21 ) ), :=( Z, T )] )).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 subsumption(
% 0.74/1.21 clause( 427, [ theorem( or( not( or( X, or( Y, Z ) ) ), or( or( X, Z ), or(
% 0.74/1.21 Y, T ) ) ) ) ] )
% 0.74/1.21 , clause( 3976, [ theorem( or( not( or( X, or( Y, Z ) ) ), or( or( X, Z ),
% 0.74/1.21 or( Y, T ) ) ) ) ] )
% 0.74/1.21 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.74/1.21 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 resolution(
% 0.74/1.21 clause( 3977, [ theorem( or( not( or( X, Y ) ), or( or( Z, Y ), or( X, T )
% 0.74/1.21 ) ) ) ] )
% 0.74/1.21 , clause( 38, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z, X
% 0.74/1.21 ) ), Y ) ) ) ] )
% 0.74/1.21 , 1, clause( 427, [ theorem( or( not( or( X, or( Y, Z ) ) ), or( or( X, Z )
% 0.74/1.21 , or( Y, T ) ) ) ) ] )
% 0.74/1.21 , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, or( or( Z, Y ), or( X,
% 0.74/1.21 T ) ) ), :=( Z, Z )] ), substitution( 1, [ :=( X, Z ), :=( Y, X ), :=( Z
% 0.74/1.21 , Y ), :=( T, T )] )).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 subsumption(
% 0.74/1.21 clause( 3909, [ theorem( or( not( or( X, Y ) ), or( or( Z, Y ), or( X, T )
% 0.74/1.21 ) ) ) ] )
% 0.74/1.21 , clause( 3977, [ theorem( or( not( or( X, Y ) ), or( or( Z, Y ), or( X, T
% 0.74/1.21 ) ) ) ) ] )
% 0.74/1.21 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.74/1.21 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 resolution(
% 0.74/1.21 clause( 3978, [ theorem( or( not( or( X, Y ) ), or( or( Z, X ), or( Y, T )
% 0.74/1.21 ) ) ) ] )
% 0.74/1.21 , clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.74/1.21 or( Y, X ) ), Z ) ) ) ] )
% 0.74/1.21 , 1, clause( 3909, [ theorem( or( not( or( X, Y ) ), or( or( Z, Y ), or( X
% 0.74/1.21 , T ) ) ) ) ] )
% 0.74/1.21 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, or( or( Z, X ), or(
% 0.74/1.21 Y, T ) ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Z ),
% 0.74/1.21 :=( T, T )] )).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 subsumption(
% 0.74/1.21 clause( 3918, [ theorem( or( not( or( X, Y ) ), or( or( Z, X ), or( Y, T )
% 0.74/1.21 ) ) ) ] )
% 0.74/1.21 , clause( 3978, [ theorem( or( not( or( X, Y ) ), or( or( Z, X ), or( Y, T
% 0.74/1.21 ) ) ) ) ] )
% 0.74/1.21 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.74/1.21 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 resolution(
% 0.74/1.21 clause( 3979, [ theorem( or( or( X, Y ), or( not( or( Y, Z ) ), or( Z, T )
% 0.74/1.21 ) ) ) ] )
% 0.74/1.21 , clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 0.74/1.21 ) ) ) ) ] )
% 0.74/1.21 , 1, clause( 3918, [ theorem( or( not( or( X, Y ) ), or( or( Z, X ), or( Y
% 0.74/1.21 , T ) ) ) ) ] )
% 0.74/1.21 , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, not( or( Y, Z ) ) ),
% 0.74/1.21 :=( Z, or( Z, T ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, Z ), :=( Z
% 0.74/1.21 , X ), :=( T, T )] )).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 subsumption(
% 0.74/1.21 clause( 3929, [ theorem( or( or( X, Y ), or( not( or( Y, Z ) ), or( Z, T )
% 0.74/1.21 ) ) ) ] )
% 0.74/1.21 , clause( 3979, [ theorem( or( or( X, Y ), or( not( or( Y, Z ) ), or( Z, T
% 0.74/1.21 ) ) ) ) ] )
% 0.74/1.21 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.74/1.21 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.21
% 0.74/1.21
% 0.74/1.21 resolution(
% 0.74/1.21 clause( 3980, [ theorem( or( not( or( or( X, Y ), X ) ), or( X, Y ) ) ) ]
% 0.74/1.21 )
% 0.74/1.21 , clause( 13, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.74/1.21 , 1, clause( 3929, [ theorem( or( or( X, Y ), or( not( or( Y, Z ) ), or( Z
% 0.74/1.22 , T ) ) ) ) ] )
% 0.74/1.22 , 0, substitution( 0, [ :=( X, or( not( or( or( X, Y ), X ) ), or( X, Y ) )
% 0.74/1.22 )] ), substitution( 1, [ :=( X, not( or( or( X, Y ), X ) ) ), :=( Y, or(
% 0.74/1.22 X, Y ) ), :=( Z, X ), :=( T, Y )] )).
% 0.74/1.22
% 0.74/1.22
% 0.74/1.22 subsumption(
% 0.74/1.22 clause( 3943, [ theorem( or( not( or( or( X, Y ), X ) ), or( X, Y ) ) ) ]
% 0.74/1.22 )
% 0.74/1.22 , clause( 3980, [ theorem( or( not( or( or( X, Y ), X ) ), or( X, Y ) ) ) ]
% 0.74/1.22 )
% 0.74/1.22 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.22 )] ) ).
% 0.74/1.22
% 0.74/1.22
% 0.74/1.22 resolution(
% 0.74/1.22 clause( 3981, [ theorem( or( not( or( X, or( X, Y ) ) ), or( X, Y ) ) ) ]
% 0.74/1.22 )
% 0.74/1.22 , clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.74/1.22 or( Y, X ) ), Z ) ) ) ] )
% 0.74/1.22 , 1, clause( 3943, [ theorem( or( not( or( or( X, Y ), X ) ), or( X, Y ) )
% 0.74/1.22 ) ] )
% 0.74/1.22 , 0, substitution( 0, [ :=( X, X ), :=( Y, or( X, Y ) ), :=( Z, or( X, Y )
% 0.74/1.22 )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.74/1.22
% 0.74/1.22
% 0.74/1.22 subsumption(
% 0.74/1.22 clause( 3946, [ theorem( or( not( or( X, or( X, Y ) ) ), or( X, Y ) ) ) ]
% 0.74/1.22 )
% 0.74/1.22 , clause( 3981, [ theorem( or( not( or( X, or( X, Y ) ) ), or( X, Y ) ) ) ]
% 0.74/1.22 )
% 0.74/1.22 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.22 )] ) ).
% 0.74/1.22
% 0.74/1.22
% 0.74/1.22 resolution(
% 0.74/1.22 clause( 3982, [] )
% 0.74/1.22 , clause( 8, [ ~( theorem( or( not( or( not( p ), or( not( p ), q ) ) ), or(
% 0.74/1.22 not( p ), q ) ) ) ) ] )
% 0.74/1.22 , 0, clause( 3946, [ theorem( or( not( or( X, or( X, Y ) ) ), or( X, Y ) )
% 0.74/1.22 ) ] )
% 0.74/1.22 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, not( p ) ), :=( Y, q
% 0.74/1.22 )] )).
% 0.74/1.22
% 0.74/1.22
% 0.74/1.22 subsumption(
% 0.74/1.22 clause( 3955, [] )
% 0.74/1.22 , clause( 3982, [] )
% 0.74/1.22 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.74/1.22
% 0.74/1.22
% 0.74/1.22 end.
% 0.74/1.22
% 0.74/1.22 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.74/1.22
% 0.74/1.22 Memory use:
% 0.74/1.22
% 0.74/1.22 space for terms: 62662
% 0.74/1.22 space for clauses: 309368
% 0.74/1.22
% 0.74/1.22
% 0.74/1.22 clauses generated: 6919
% 0.74/1.22 clauses kept: 3956
% 0.74/1.22 clauses selected: 1143
% 0.74/1.22 clauses deleted: 21
% 0.74/1.22 clauses inuse deleted: 0
% 0.74/1.22
% 0.74/1.22 subsentry: 3101
% 0.74/1.22 literals s-matched: 3101
% 0.74/1.22 literals matched: 3101
% 0.74/1.22 full subsumption: 0
% 0.74/1.22
% 0.74/1.22 checksum: -2043509082
% 0.74/1.22
% 0.74/1.22
% 0.74/1.22 Bliksem ended
%------------------------------------------------------------------------------