TSTP Solution File: LCL200-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL200-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n017.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:39 EDT 2022
% Result : Unsatisfiable 0.71s 1.08s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL200-1 : TPTP v8.1.0. Released v1.1.0.
% 0.06/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n017.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 : Sat Jul 2 14:36:25 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.71/1.08 *** allocated 10000 integers for termspace/termends
% 0.71/1.08 *** allocated 10000 integers for clauses
% 0.71/1.08 *** allocated 10000 integers for justifications
% 0.71/1.08 Bliksem 1.12
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 Automatic Strategy Selection
% 0.71/1.08
% 0.71/1.08 Clauses:
% 0.71/1.08 [
% 0.71/1.08 [ axiom( or( not( or( X, X ) ), X ) ) ],
% 0.71/1.08 [ axiom( or( not( X ), or( Y, X ) ) ) ],
% 0.71/1.08 [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ],
% 0.71/1.08 [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) ) ],
% 0.71/1.08 [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or( Z, Y )
% 0.71/1.08 ) ) ) ],
% 0.71/1.08 [ theorem( X ), ~( axiom( X ) ) ],
% 0.71/1.08 [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem( Y ) ) ]
% 0.71/1.08 ,
% 0.71/1.08 [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z ) ) ), ~(
% 0.71/1.08 theorem( or( not( Z ), Y ) ) ) ],
% 0.71/1.08 [ ~( theorem( or( not( not( or( p, q ) ) ), not( q ) ) ) ) ]
% 0.71/1.08 ] .
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 percentage equality = 0.000000, percentage horn = 1.000000
% 0.71/1.08 This is a near-Horn, non-equality problem
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 Options Used:
% 0.71/1.08
% 0.71/1.08 useres = 1
% 0.71/1.08 useparamod = 0
% 0.71/1.08 useeqrefl = 0
% 0.71/1.08 useeqfact = 0
% 0.71/1.08 usefactor = 1
% 0.71/1.08 usesimpsplitting = 0
% 0.71/1.08 usesimpdemod = 0
% 0.71/1.08 usesimpres = 4
% 0.71/1.08
% 0.71/1.08 resimpinuse = 1000
% 0.71/1.08 resimpclauses = 20000
% 0.71/1.08 substype = standard
% 0.71/1.08 backwardsubs = 1
% 0.71/1.08 selectoldest = 5
% 0.71/1.08
% 0.71/1.08 litorderings [0] = split
% 0.71/1.08 litorderings [1] = liftord
% 0.71/1.08
% 0.71/1.08 termordering = none
% 0.71/1.08
% 0.71/1.08 litapriori = 1
% 0.71/1.08 termapriori = 0
% 0.71/1.08 litaposteriori = 0
% 0.71/1.08 termaposteriori = 0
% 0.71/1.08 demodaposteriori = 0
% 0.71/1.08 ordereqreflfact = 0
% 0.71/1.08
% 0.71/1.08 litselect = negative
% 0.71/1.08
% 0.71/1.08 maxweight = 30000
% 0.71/1.08 maxdepth = 30000
% 0.71/1.08 maxlength = 115
% 0.71/1.08 maxnrvars = 195
% 0.71/1.08 excuselevel = 0
% 0.71/1.08 increasemaxweight = 0
% 0.71/1.08
% 0.71/1.08 maxselected = 10000000
% 0.71/1.08 maxnrclauses = 10000000
% 0.71/1.08
% 0.71/1.08 showgenerated = 0
% 0.71/1.08 showkept = 0
% 0.71/1.08 showselected = 0
% 0.71/1.08 showdeleted = 0
% 0.71/1.08 showresimp = 1
% 0.71/1.08 showstatus = 2000
% 0.71/1.08
% 0.71/1.08 prologoutput = 1
% 0.71/1.08 nrgoals = 5000000
% 0.71/1.08 totalproof = 1
% 0.71/1.08
% 0.71/1.08 Symbols occurring in the translation:
% 0.71/1.08
% 0.71/1.08 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.71/1.08 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 0.71/1.08 ! [4, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.71/1.08 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.08 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.08 or [40, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.71/1.08 not [41, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.71/1.08 axiom [42, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.71/1.08 theorem [46, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.71/1.08 p [49, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.71/1.08 q [50, 0] (w:1, o:16, a:1, s:1, b:0).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 Starting Search:
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 Bliksems!, er is een bewijs:
% 0.71/1.08 % SZS status Unsatisfiable
% 0.71/1.08 % SZS output start Refutation
% 0.71/1.08
% 0.71/1.08 clause( 0, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.71/1.08 .
% 0.71/1.08 clause( 1, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.71/1.08 .
% 0.71/1.08 clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.71/1.08 .
% 0.71/1.08 clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) )
% 0.71/1.08 ] )
% 0.71/1.08 .
% 0.71/1.08 clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.71/1.08 .
% 0.71/1.08 clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X ) )
% 0.71/1.08 ) ] )
% 0.71/1.08 .
% 0.71/1.08 clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y ) )
% 0.71/1.08 ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.71/1.08 .
% 0.71/1.08 clause( 8, [ ~( theorem( or( not( not( or( p, q ) ) ), not( q ) ) ) ) ] )
% 0.71/1.08 .
% 0.71/1.08 clause( 9, [ theorem( or( not( X ), or( Y, X ) ) ) ] )
% 0.71/1.08 .
% 0.71/1.08 clause( 12, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.71/1.08 .
% 0.71/1.08 clause( 13, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.71/1.08 .
% 0.71/1.08 clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z )
% 0.71/1.08 ) ) ) ] )
% 0.71/1.08 .
% 0.71/1.08 clause( 37, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z, X )
% 0.71/1.08 ), Y ) ) ) ] )
% 0.71/1.08 .
% 0.71/1.08 clause( 59, [ theorem( or( X, or( not( Y ), Y ) ) ) ] )
% 0.71/1.08 .
% 0.71/1.08 clause( 61, [ theorem( or( not( X ), X ) ) ] )
% 0.71/1.08 .
% 0.71/1.08 clause( 64, [ theorem( or( X, not( X ) ) ) ] )
% 0.71/1.08 .
% 0.71/1.08 clause( 235, [ theorem( or( not( X ), not( not( or( Y, X ) ) ) ) ) ] )
% 0.71/1.08 .
% 0.71/1.08 clause( 366, [ theorem( or( not( not( or( X, Y ) ) ), not( Y ) ) ) ] )
% 0.71/1.08 .
% 0.71/1.08 clause( 371, [] )
% 0.71/1.08 .
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 % SZS output end Refutation
% 0.71/1.08 found a proof!
% 0.71/1.08
% 0.71/1.08 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.08
% 0.71/1.08 initialclauses(
% 0.71/1.08 [ clause( 373, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.71/1.08 , clause( 374, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.71/1.08 , clause( 375, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.71/1.08 , clause( 376, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) )
% 0.71/1.08 ) ) ] )
% 0.71/1.08 , clause( 377, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) )
% 0.71/1.08 , or( Z, Y ) ) ) ) ] )
% 0.71/1.08 , clause( 378, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.71/1.08 , clause( 379, [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem(
% 0.71/1.08 Y ) ) ] )
% 0.71/1.08 , clause( 380, [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z )
% 0.71/1.08 ) ), ~( theorem( or( not( Z ), Y ) ) ) ] )
% 0.71/1.08 , clause( 381, [ ~( theorem( or( not( not( or( p, q ) ) ), not( q ) ) ) ) ]
% 0.71/1.08 )
% 0.71/1.08 ] ).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 subsumption(
% 0.71/1.08 clause( 0, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.71/1.08 , clause( 373, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.71/1.08 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 subsumption(
% 0.71/1.08 clause( 1, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.71/1.08 , clause( 374, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.71/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.08 )] ) ).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 subsumption(
% 0.71/1.08 clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.71/1.08 , clause( 375, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.71/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.08 )] ) ).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 subsumption(
% 0.71/1.08 clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) )
% 0.71/1.08 ] )
% 0.71/1.08 , clause( 376, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) )
% 0.71/1.08 ) ) ] )
% 0.71/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.08 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 subsumption(
% 0.71/1.08 clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.71/1.08 , clause( 378, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.71/1.08 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.71/1.08 1 )] ) ).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 subsumption(
% 0.71/1.08 clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X ) )
% 0.71/1.08 ) ] )
% 0.71/1.08 , clause( 379, [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem(
% 0.71/1.08 Y ) ) ] )
% 0.71/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.08 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 subsumption(
% 0.71/1.08 clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y ) )
% 0.71/1.08 ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.71/1.08 , clause( 380, [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z )
% 0.71/1.08 ) ), ~( theorem( or( not( Z ), Y ) ) ) ] )
% 0.71/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.08 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 subsumption(
% 0.71/1.08 clause( 8, [ ~( theorem( or( not( not( or( p, q ) ) ), not( q ) ) ) ) ] )
% 0.71/1.08 , clause( 381, [ ~( theorem( or( not( not( or( p, q ) ) ), not( q ) ) ) ) ]
% 0.71/1.08 )
% 0.71/1.08 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 resolution(
% 0.71/1.08 clause( 382, [ theorem( or( not( X ), or( Y, X ) ) ) ] )
% 0.71/1.08 , clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.71/1.08 , 1, clause( 1, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.71/1.08 , 0, substitution( 0, [ :=( X, or( not( X ), or( Y, X ) ) )] ),
% 0.71/1.08 substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 subsumption(
% 0.71/1.08 clause( 9, [ theorem( or( not( X ), or( Y, X ) ) ) ] )
% 0.71/1.08 , clause( 382, [ theorem( or( not( X ), or( Y, X ) ) ) ] )
% 0.71/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.08 )] ) ).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 resolution(
% 0.71/1.08 clause( 383, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.71/1.08 , clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X )
% 0.71/1.08 ) ) ] )
% 0.71/1.08 , 2, clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.71/1.08 , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, or( Y, X ) )] ),
% 0.71/1.08 substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 subsumption(
% 0.71/1.08 clause( 12, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.71/1.08 , clause( 383, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.71/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.08 ), ==>( 1, 1 )] ) ).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 resolution(
% 0.71/1.08 clause( 384, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.71/1.08 , clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X )
% 0.71/1.08 ) ) ] )
% 0.71/1.08 , 2, clause( 0, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.71/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, or( X, X ) )] ), substitution( 1
% 0.71/1.08 , [ :=( X, X )] )).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 subsumption(
% 0.71/1.08 clause( 13, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.71/1.08 , clause( 384, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.71/1.08 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.71/1.08 1 )] ) ).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 resolution(
% 0.71/1.08 clause( 385, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 0.71/1.08 ) ) ) ) ] )
% 0.71/1.08 , clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X )
% 0.71/1.08 ) ) ] )
% 0.71/1.08 , 2, clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 0.71/1.08 ) ) ) ] )
% 0.71/1.08 , 0, substitution( 0, [ :=( X, or( X, or( Y, Z ) ) ), :=( Y, or( Y, or( X,
% 0.71/1.08 Z ) ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] )).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 subsumption(
% 0.71/1.08 clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z )
% 0.71/1.08 ) ) ) ] )
% 0.71/1.08 , clause( 385, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X,
% 0.71/1.08 Z ) ) ) ) ] )
% 0.71/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.08 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 resolution(
% 0.71/1.08 clause( 386, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z, X
% 0.71/1.08 ) ), Y ) ) ) ] )
% 0.71/1.08 , clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y )
% 0.71/1.08 ) ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.71/1.08 , 2, clause( 1, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.71/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, or( Z, X ) )] ),
% 0.71/1.08 substitution( 1, [ :=( X, X ), :=( Y, Z )] )).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 subsumption(
% 0.71/1.08 clause( 37, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z, X )
% 0.71/1.08 ), Y ) ) ) ] )
% 0.71/1.08 , clause( 386, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z,
% 0.71/1.08 X ) ), Y ) ) ) ] )
% 0.71/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.08 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 resolution(
% 0.71/1.08 clause( 387, [ theorem( or( X, or( not( Y ), Y ) ) ) ] )
% 0.71/1.08 , clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 0.71/1.08 ) ) ) ) ] )
% 0.71/1.08 , 1, clause( 9, [ theorem( or( not( X ), or( Y, X ) ) ) ] )
% 0.71/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, not( Y ) ), :=( Z, Y )] ),
% 0.71/1.08 substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 subsumption(
% 0.71/1.08 clause( 59, [ theorem( or( X, or( not( Y ), Y ) ) ) ] )
% 0.71/1.08 , clause( 387, [ theorem( or( X, or( not( Y ), Y ) ) ) ] )
% 0.71/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.08 )] ) ).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 resolution(
% 0.71/1.08 clause( 388, [ theorem( or( not( X ), X ) ) ] )
% 0.71/1.08 , clause( 13, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.71/1.08 , 1, clause( 59, [ theorem( or( X, or( not( Y ), Y ) ) ) ] )
% 0.71/1.08 , 0, substitution( 0, [ :=( X, or( not( X ), X ) )] ), substitution( 1, [
% 0.71/1.08 :=( X, or( not( X ), X ) ), :=( Y, X )] )).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 subsumption(
% 0.71/1.08 clause( 61, [ theorem( or( not( X ), X ) ) ] )
% 0.71/1.08 , clause( 388, [ theorem( or( not( X ), X ) ) ] )
% 0.71/1.08 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 resolution(
% 0.71/1.08 clause( 389, [ theorem( or( X, not( X ) ) ) ] )
% 0.71/1.08 , clause( 12, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.71/1.08 , 1, clause( 61, [ theorem( or( not( X ), X ) ) ] )
% 0.71/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, not( X ) )] ), substitution( 1
% 0.71/1.08 , [ :=( X, X )] )).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 subsumption(
% 0.71/1.08 clause( 64, [ theorem( or( X, not( X ) ) ) ] )
% 0.71/1.08 , clause( 389, [ theorem( or( X, not( X ) ) ) ] )
% 0.71/1.08 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 resolution(
% 0.71/1.08 clause( 390, [ theorem( or( not( X ), not( not( or( Y, X ) ) ) ) ) ] )
% 0.71/1.08 , clause( 37, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z, X
% 0.71/1.08 ) ), Y ) ) ) ] )
% 0.71/1.08 , 1, clause( 64, [ theorem( or( X, not( X ) ) ) ] )
% 0.71/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, not( not( or( Y, X ) ) ) ), :=(
% 0.71/1.08 Z, Y )] ), substitution( 1, [ :=( X, not( or( Y, X ) ) )] )).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 subsumption(
% 0.71/1.08 clause( 235, [ theorem( or( not( X ), not( not( or( Y, X ) ) ) ) ) ] )
% 0.71/1.08 , clause( 390, [ theorem( or( not( X ), not( not( or( Y, X ) ) ) ) ) ] )
% 0.71/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.08 )] ) ).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 resolution(
% 0.71/1.08 clause( 391, [ theorem( or( not( not( or( X, Y ) ) ), not( Y ) ) ) ] )
% 0.71/1.08 , clause( 12, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 0.71/1.08 , 1, clause( 235, [ theorem( or( not( X ), not( not( or( Y, X ) ) ) ) ) ]
% 0.71/1.08 )
% 0.71/1.08 , 0, substitution( 0, [ :=( X, not( not( or( X, Y ) ) ) ), :=( Y, not( Y )
% 0.71/1.08 )] ), substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 subsumption(
% 0.71/1.08 clause( 366, [ theorem( or( not( not( or( X, Y ) ) ), not( Y ) ) ) ] )
% 0.71/1.08 , clause( 391, [ theorem( or( not( not( or( X, Y ) ) ), not( Y ) ) ) ] )
% 0.71/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.08 )] ) ).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 resolution(
% 0.71/1.08 clause( 392, [] )
% 0.71/1.08 , clause( 8, [ ~( theorem( or( not( not( or( p, q ) ) ), not( q ) ) ) ) ]
% 0.71/1.08 )
% 0.71/1.08 , 0, clause( 366, [ theorem( or( not( not( or( X, Y ) ) ), not( Y ) ) ) ]
% 0.71/1.08 )
% 0.71/1.08 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, p ), :=( Y, q )] )
% 0.71/1.08 ).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 subsumption(
% 0.71/1.08 clause( 371, [] )
% 0.71/1.08 , clause( 392, [] )
% 0.71/1.08 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 end.
% 0.71/1.08
% 0.71/1.08 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.08
% 0.71/1.08 Memory use:
% 0.71/1.08
% 0.71/1.08 space for terms: 4879
% 0.71/1.08 space for clauses: 27764
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 clauses generated: 685
% 0.71/1.08 clauses kept: 372
% 0.71/1.08 clauses selected: 118
% 0.71/1.08 clauses deleted: 1
% 0.71/1.08 clauses inuse deleted: 0
% 0.71/1.08
% 0.71/1.08 subsentry: 356
% 0.71/1.08 literals s-matched: 356
% 0.71/1.08 literals matched: 356
% 0.71/1.08 full subsumption: 0
% 0.71/1.08
% 0.71/1.08 checksum: -409239936
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 Bliksem ended
%------------------------------------------------------------------------------