TSTP Solution File: LCL216-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL216-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n020.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:50 EDT 2022
% Result : Unsatisfiable 0.56s 1.04s
% Output : Refutation 0.56s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL216-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.33 % Computer : n020.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % DateTime : Mon Jul 4 23:56:59 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.56/1.04 *** allocated 10000 integers for termspace/termends
% 0.56/1.04 *** allocated 10000 integers for clauses
% 0.56/1.04 *** allocated 10000 integers for justifications
% 0.56/1.04 Bliksem 1.12
% 0.56/1.04
% 0.56/1.04
% 0.56/1.04 Automatic Strategy Selection
% 0.56/1.04
% 0.56/1.04 Clauses:
% 0.56/1.04 [
% 0.56/1.04 [ axiom( or( not( or( X, X ) ), X ) ) ],
% 0.56/1.04 [ axiom( or( not( X ), or( Y, X ) ) ) ],
% 0.56/1.04 [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ],
% 0.56/1.04 [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) ) ],
% 0.56/1.04 [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or( Z, Y )
% 0.56/1.04 ) ) ) ],
% 0.56/1.04 [ theorem( X ), ~( axiom( X ) ) ],
% 0.56/1.04 [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem( Y ) ) ]
% 0.56/1.04 ,
% 0.56/1.04 [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z ) ) ), ~(
% 0.56/1.04 theorem( or( not( Z ), Y ) ) ) ],
% 0.56/1.04 [ ~( theorem( or( not( or( p, q ) ), or( not( or( p, not( q ) ) ), p ) )
% 0.56/1.04 ) ) ]
% 0.56/1.04 ] .
% 0.56/1.04
% 0.56/1.04
% 0.56/1.04 percentage equality = 0.000000, percentage horn = 1.000000
% 0.56/1.04 This is a near-Horn, non-equality problem
% 0.56/1.04
% 0.56/1.04
% 0.56/1.04 Options Used:
% 0.56/1.04
% 0.56/1.04 useres = 1
% 0.56/1.04 useparamod = 0
% 0.56/1.04 useeqrefl = 0
% 0.56/1.04 useeqfact = 0
% 0.56/1.04 usefactor = 1
% 0.56/1.04 usesimpsplitting = 0
% 0.56/1.04 usesimpdemod = 0
% 0.56/1.04 usesimpres = 4
% 0.56/1.04
% 0.56/1.04 resimpinuse = 1000
% 0.56/1.04 resimpclauses = 20000
% 0.56/1.04 substype = standard
% 0.56/1.04 backwardsubs = 1
% 0.56/1.04 selectoldest = 5
% 0.56/1.04
% 0.56/1.04 litorderings [0] = split
% 0.56/1.04 litorderings [1] = liftord
% 0.56/1.04
% 0.56/1.04 termordering = none
% 0.56/1.04
% 0.56/1.04 litapriori = 1
% 0.56/1.04 termapriori = 0
% 0.56/1.04 litaposteriori = 0
% 0.56/1.04 termaposteriori = 0
% 0.56/1.04 demodaposteriori = 0
% 0.56/1.04 ordereqreflfact = 0
% 0.56/1.04
% 0.56/1.04 litselect = negative
% 0.56/1.04
% 0.56/1.04 maxweight = 30000
% 0.56/1.04 maxdepth = 30000
% 0.56/1.04 maxlength = 115
% 0.56/1.04 maxnrvars = 195
% 0.56/1.04 excuselevel = 0
% 0.56/1.04 increasemaxweight = 0
% 0.56/1.04
% 0.56/1.04 maxselected = 10000000
% 0.56/1.04 maxnrclauses = 10000000
% 0.56/1.04
% 0.56/1.04 showgenerated = 0
% 0.56/1.04 showkept = 0
% 0.56/1.04 showselected = 0
% 0.56/1.04 showdeleted = 0
% 0.56/1.04 showresimp = 1
% 0.56/1.04 showstatus = 2000
% 0.56/1.04
% 0.56/1.04 prologoutput = 1
% 0.56/1.04 nrgoals = 5000000
% 0.56/1.04 totalproof = 1
% 0.56/1.04
% 0.56/1.04 Symbols occurring in the translation:
% 0.56/1.04
% 0.56/1.04 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.56/1.04 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 0.56/1.04 ! [4, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.56/1.04 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.56/1.04 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.56/1.04 or [40, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.56/1.04 not [41, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.56/1.04 axiom [42, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.56/1.04 theorem [46, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.56/1.04 p [49, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.56/1.04 q [50, 0] (w:1, o:16, a:1, s:1, b:0).
% 0.56/1.04
% 0.56/1.04
% 0.56/1.04 Starting Search:
% 0.56/1.04
% 0.56/1.04 Resimplifying inuse:
% 0.56/1.04 Done
% 0.56/1.04
% 0.56/1.04
% 0.56/1.04 Intermediate Status:
% 0.56/1.04 Generated: 3552
% 0.56/1.04 Kept: 2003
% 0.56/1.04 Inuse: 579
% 0.56/1.04 Deleted: 7
% 0.56/1.04 Deletedinuse: 0
% 0.56/1.04
% 0.56/1.04 Resimplifying inuse:
% 0.56/1.04 Done
% 0.56/1.04
% 0.56/1.04 Resimplifying inuse:
% 0.56/1.04 Done
% 0.56/1.04
% 0.56/1.04
% 0.56/1.04 Intermediate Status:
% 0.56/1.04 Generated: 7011
% 0.56/1.04 Kept: 4004
% 0.56/1.04 Inuse: 1159
% 0.56/1.04 Deleted: 22
% 0.56/1.04 Deletedinuse: 0
% 0.56/1.04
% 0.56/1.04 Resimplifying inuse:
% 0.56/1.04
% 0.56/1.04 Bliksems!, er is een bewijs:
% 0.56/1.04 % SZS status Unsatisfiable
% 0.56/1.04 % SZS output start Refutation
% 0.56/1.04
% 0.56/1.04 clause( 0, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.56/1.04 .
% 0.56/1.04 clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.56/1.04 .
% 0.56/1.04 clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) )
% 0.56/1.04 ] )
% 0.56/1.04 .
% 0.56/1.04 clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or(
% 0.56/1.04 Z, Y ) ) ) ) ] )
% 0.56/1.04 .
% 0.56/1.04 clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.56/1.04 .
% 0.56/1.04 clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X ) )
% 0.56/1.04 ) ] )
% 0.56/1.04 .
% 0.56/1.04 clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y ) )
% 0.56/1.04 ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.56/1.04 .
% 0.56/1.04 clause( 8, [ ~( theorem( or( not( or( p, q ) ), or( not( or( p, not( q ) )
% 0.56/1.04 ), p ) ) ) ) ] )
% 0.56/1.04 .
% 0.56/1.04 clause( 10, [ theorem( or( not( or( X, X ) ), X ) ) ] )
% 0.56/1.04 .
% 0.56/1.04 clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z )
% 0.56/1.04 ) ) ) ] )
% 0.56/1.04 .
% 0.56/1.04 clause( 27, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~( theorem(
% 0.56/1.04 or( not( Y ), Z ) ) ) ] )
% 0.56/1.04 .
% 0.56/1.04 clause( 34, [ theorem( or( not( or( not( X ), Y ) ), Z ) ), ~( theorem( or(
% 0.56/1.04 not( or( not( or( T, X ) ), or( T, Y ) ) ), Z ) ) ) ] )
% 0.56/1.04 .
% 0.56/1.04 clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.56/1.04 or( Y, X ) ), Z ) ) ) ] )
% 0.56/1.04 .
% 0.56/1.04 clause( 90, [ theorem( or( not( or( X, or( Y, Y ) ) ), or( X, Y ) ) ) ] )
% 0.56/1.04 .
% 0.56/1.04 clause( 665, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Y, X ) )
% 0.56/1.04 , Y ) ) ) ] )
% 0.56/1.04 .
% 0.56/1.04 clause( 3146, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( X, Y )
% 0.56/1.04 ), X ) ) ) ] )
% 0.56/1.04 .
% 0.56/1.04 clause( 3156, [ theorem( or( not( or( X, Y ) ), or( not( or( X, not( Y ) )
% 0.56/1.04 ), X ) ) ) ] )
% 0.56/1.04 .
% 0.56/1.04 clause( 4006, [] )
% 0.56/1.04 .
% 0.56/1.04
% 0.56/1.04
% 0.56/1.04 % SZS output end Refutation
% 0.56/1.04 found a proof!
% 0.56/1.04
% 0.56/1.04 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.56/1.04
% 0.56/1.04 initialclauses(
% 0.56/1.04 [ clause( 4008, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.56/1.04 , clause( 4009, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.56/1.04 , clause( 4010, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.56/1.04 , clause( 4011, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 0.56/1.04 ) ) ) ] )
% 0.56/1.04 , clause( 4012, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 0.56/1.04 ), or( Z, Y ) ) ) ) ] )
% 0.56/1.04 , clause( 4013, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.56/1.04 , clause( 4014, [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem(
% 0.56/1.04 Y ) ) ] )
% 0.56/1.04 , clause( 4015, [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z )
% 0.56/1.04 ) ), ~( theorem( or( not( Z ), Y ) ) ) ] )
% 0.56/1.04 , clause( 4016, [ ~( theorem( or( not( or( p, q ) ), or( not( or( p, not( q
% 0.56/1.04 ) ) ), p ) ) ) ) ] )
% 0.56/1.04 ] ).
% 0.56/1.04
% 0.56/1.04
% 0.56/1.04
% 0.56/1.04 subsumption(
% 0.56/1.04 clause( 0, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.56/1.04 , clause( 4008, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.56/1.04 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.56/1.04
% 0.56/1.04
% 0.56/1.04 subsumption(
% 0.56/1.04 clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.56/1.04 , clause( 4010, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.56/1.04 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.56/1.04 )] ) ).
% 0.56/1.04
% 0.56/1.04
% 0.56/1.04 subsumption(
% 0.56/1.04 clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) )
% 0.56/1.04 ] )
% 0.56/1.04 , clause( 4011, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 0.56/1.04 ) ) ) ] )
% 0.56/1.04 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.56/1.04 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.56/1.04
% 0.56/1.04
% 0.56/1.04 subsumption(
% 0.56/1.04 clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or(
% 0.56/1.04 Z, Y ) ) ) ) ] )
% 0.56/1.04 , clause( 4012, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 0.56/1.04 ), or( Z, Y ) ) ) ) ] )
% 0.56/1.04 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.56/1.04 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.56/1.04
% 0.56/1.04
% 0.56/1.04 subsumption(
% 0.56/1.04 clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.56/1.04 , clause( 4013, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.56/1.04 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.56/1.04 1 )] ) ).
% 0.56/1.04
% 0.56/1.04
% 0.56/1.04 subsumption(
% 0.56/1.04 clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X ) )
% 0.56/1.04 ) ] )
% 0.56/1.04 , clause( 4014, [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem(
% 0.56/1.04 Y ) ) ] )
% 0.56/1.04 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.56/1.04 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.56/1.04
% 0.56/1.04
% 0.56/1.04 subsumption(
% 0.56/1.04 clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y ) )
% 0.56/1.04 ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.56/1.04 , clause( 4015, [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z )
% 0.56/1.04 ) ), ~( theorem( or( not( Z ), Y ) ) ) ] )
% 0.56/1.04 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.56/1.04 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.56/1.04
% 0.56/1.04
% 0.56/1.04 subsumption(
% 0.56/1.04 clause( 8, [ ~( theorem( or( not( or( p, q ) ), or( not( or( p, not( q ) )
% 0.56/1.05 ), p ) ) ) ) ] )
% 0.56/1.05 , clause( 4016, [ ~( theorem( or( not( or( p, q ) ), or( not( or( p, not( q
% 0.56/1.05 ) ) ), p ) ) ) ) ] )
% 0.56/1.05 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.56/1.05
% 0.56/1.05
% 0.56/1.05 resolution(
% 0.56/1.05 clause( 4017, [ theorem( or( not( or( X, X ) ), X ) ) ] )
% 0.56/1.05 , clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.56/1.05 , 1, clause( 0, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.56/1.05 , 0, substitution( 0, [ :=( X, or( not( or( X, X ) ), X ) )] ),
% 0.56/1.05 substitution( 1, [ :=( X, X )] )).
% 0.56/1.05
% 0.56/1.05
% 0.56/1.05 subsumption(
% 0.56/1.05 clause( 10, [ theorem( or( not( or( X, X ) ), X ) ) ] )
% 0.56/1.05 , clause( 4017, [ theorem( or( not( or( X, X ) ), X ) ) ] )
% 0.56/1.05 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.56/1.05
% 0.56/1.05
% 0.56/1.05 resolution(
% 0.56/1.05 clause( 4018, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 0.56/1.05 ) ) ) ) ] )
% 0.56/1.05 , clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X )
% 0.56/1.05 ) ) ] )
% 0.56/1.05 , 2, clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 0.56/1.05 ) ) ) ] )
% 0.56/1.05 , 0, substitution( 0, [ :=( X, or( X, or( Y, Z ) ) ), :=( Y, or( Y, or( X,
% 0.56/1.05 Z ) ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] )).
% 0.56/1.05
% 0.56/1.05
% 0.56/1.05 subsumption(
% 0.56/1.05 clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z )
% 0.56/1.05 ) ) ) ] )
% 0.56/1.05 , clause( 4018, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X
% 0.56/1.05 , Z ) ) ) ) ] )
% 0.56/1.05 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.56/1.05 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.56/1.05
% 0.56/1.05
% 0.56/1.05 resolution(
% 0.56/1.05 clause( 4019, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~( theorem(
% 0.56/1.05 or( not( Y ), Z ) ) ) ] )
% 0.56/1.05 , clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X )
% 0.56/1.05 ) ) ] )
% 0.56/1.05 , 2, clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 0.56/1.05 ), or( Z, Y ) ) ) ) ] )
% 0.56/1.05 , 0, substitution( 0, [ :=( X, or( not( or( X, Y ) ), or( X, Z ) ) ), :=( Y
% 0.56/1.05 , or( not( Y ), Z ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, Z ), :=(
% 0.56/1.05 Z, X )] )).
% 0.56/1.05
% 0.56/1.05
% 0.56/1.05 subsumption(
% 0.56/1.05 clause( 27, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~( theorem(
% 0.56/1.05 or( not( Y ), Z ) ) ) ] )
% 0.56/1.05 , clause( 4019, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~(
% 0.56/1.05 theorem( or( not( Y ), Z ) ) ) ] )
% 0.56/1.05 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.56/1.05 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.56/1.05
% 0.56/1.05
% 0.56/1.05 resolution(
% 0.56/1.05 clause( 4020, [ theorem( or( not( or( not( X ), Y ) ), Z ) ), ~( theorem(
% 0.56/1.05 or( not( or( not( or( T, X ) ), or( T, Y ) ) ), Z ) ) ) ] )
% 0.56/1.05 , clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y )
% 0.56/1.05 ) ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.56/1.05 , 2, clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 0.56/1.05 ), or( Z, Y ) ) ) ) ] )
% 0.56/1.05 , 0, substitution( 0, [ :=( X, or( not( X ), Y ) ), :=( Y, Z ), :=( Z, or(
% 0.56/1.05 not( or( T, X ) ), or( T, Y ) ) )] ), substitution( 1, [ :=( X, X ), :=(
% 0.56/1.05 Y, Y ), :=( Z, T )] )).
% 0.56/1.05
% 0.56/1.05
% 0.56/1.05 subsumption(
% 0.56/1.05 clause( 34, [ theorem( or( not( or( not( X ), Y ) ), Z ) ), ~( theorem( or(
% 0.56/1.05 not( or( not( or( T, X ) ), or( T, Y ) ) ), Z ) ) ) ] )
% 0.56/1.05 , clause( 4020, [ theorem( or( not( or( not( X ), Y ) ), Z ) ), ~( theorem(
% 0.56/1.05 or( not( or( not( or( T, X ) ), or( T, Y ) ) ), Z ) ) ) ] )
% 0.56/1.05 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.56/1.05 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.56/1.05
% 0.56/1.05
% 0.56/1.05 resolution(
% 0.56/1.05 clause( 4021, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.56/1.05 or( Y, X ) ), Z ) ) ) ] )
% 0.56/1.05 , clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y )
% 0.56/1.05 ) ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.56/1.05 , 2, clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.56/1.05 , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, Z ), :=( Z, or( Y, X )
% 0.56/1.05 )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.56/1.05
% 0.56/1.05
% 0.56/1.05 subsumption(
% 0.56/1.05 clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.56/1.05 or( Y, X ) ), Z ) ) ) ] )
% 0.56/1.05 , clause( 4021, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or(
% 0.56/1.05 not( or( Y, X ) ), Z ) ) ) ] )
% 0.56/1.05 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.56/1.05 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.56/1.05
% 0.56/1.05
% 0.56/1.05 resolution(
% 0.56/1.05 clause( 4022, [ theorem( or( not( or( X, or( Y, Y ) ) ), or( X, Y ) ) ) ]
% 0.56/1.05 )
% 0.56/1.05 , clause( 27, [ theorem( or( not( or( X, Y ) ), or( X, Z ) ) ), ~( theorem(
% 0.56/1.05 or( not( Y ), Z ) ) ) ] )
% 0.56/1.05 , 1, clause( 10, [ theorem( or( not( or( X, X ) ), X ) ) ] )
% 0.56/1.05 , 0, substitution( 0, [ :=( X, X ), :=( Y, or( Y, Y ) ), :=( Z, Y )] ),
% 0.56/1.05 substitution( 1, [ :=( X, Y )] )).
% 0.56/1.05
% 0.56/1.05
% 0.56/1.05 subsumption(
% 0.56/1.05 clause( 90, [ theorem( or( not( or( X, or( Y, Y ) ) ), or( X, Y ) ) ) ] )
% 0.56/1.05 , clause( 4022, [ theorem( or( not( or( X, or( Y, Y ) ) ), or( X, Y ) ) ) ]
% 0.56/1.05 )
% 0.56/1.05 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.56/1.05 )] ) ).
% 0.56/1.05
% 0.56/1.05
% 0.56/1.05 resolution(
% 0.56/1.05 clause( 4023, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Y, X )
% 0.56/1.05 ), Y ) ) ) ] )
% 0.56/1.05 , clause( 34, [ theorem( or( not( or( not( X ), Y ) ), Z ) ), ~( theorem(
% 0.56/1.05 or( not( or( not( or( T, X ) ), or( T, Y ) ) ), Z ) ) ) ] )
% 0.56/1.05 , 1, clause( 90, [ theorem( or( not( or( X, or( Y, Y ) ) ), or( X, Y ) ) )
% 0.56/1.05 ] )
% 0.56/1.05 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, or( not( or( Y, X )
% 0.56/1.05 ), Y ) ), :=( T, Y )] ), substitution( 1, [ :=( X, not( or( Y, X ) ) ),
% 0.56/1.05 :=( Y, Y )] )).
% 0.56/1.05
% 0.56/1.05
% 0.56/1.05 subsumption(
% 0.56/1.05 clause( 665, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Y, X ) )
% 0.56/1.05 , Y ) ) ) ] )
% 0.56/1.05 , clause( 4023, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Y, X
% 0.56/1.05 ) ), Y ) ) ) ] )
% 0.56/1.05 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.56/1.05 )] ) ).
% 0.56/1.05
% 0.56/1.05
% 0.56/1.05 resolution(
% 0.56/1.05 clause( 4024, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( X, Y )
% 0.56/1.05 ), X ) ) ) ] )
% 0.56/1.05 , clause( 36, [ theorem( or( not( or( X, Y ) ), Z ) ), ~( theorem( or( not(
% 0.56/1.05 or( Y, X ) ), Z ) ) ) ] )
% 0.56/1.05 , 1, clause( 665, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Y,
% 0.56/1.05 X ) ), Y ) ) ) ] )
% 0.56/1.05 , 0, substitution( 0, [ :=( X, X ), :=( Y, not( Y ) ), :=( Z, or( not( or(
% 0.56/1.05 X, Y ) ), X ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 0.56/1.05
% 0.56/1.05
% 0.56/1.05 subsumption(
% 0.56/1.05 clause( 3146, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( X, Y )
% 0.56/1.05 ), X ) ) ) ] )
% 0.56/1.05 , clause( 4024, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( X, Y
% 0.56/1.05 ) ), X ) ) ) ] )
% 0.56/1.05 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.56/1.05 )] ) ).
% 0.56/1.05
% 0.56/1.05
% 0.56/1.05 resolution(
% 0.56/1.05 clause( 4025, [ theorem( or( not( or( X, Y ) ), or( not( or( X, not( Y ) )
% 0.56/1.05 ), X ) ) ) ] )
% 0.56/1.05 , clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 0.56/1.05 ) ) ) ) ] )
% 0.56/1.05 , 1, clause( 3146, [ theorem( or( not( or( X, not( Y ) ) ), or( not( or( X
% 0.56/1.05 , Y ) ), X ) ) ) ] )
% 0.56/1.05 , 0, substitution( 0, [ :=( X, not( or( X, Y ) ) ), :=( Y, not( or( X, not(
% 0.56/1.05 Y ) ) ) ), :=( Z, X )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )
% 0.56/1.05 ).
% 0.56/1.05
% 0.56/1.05
% 0.56/1.05 subsumption(
% 0.56/1.05 clause( 3156, [ theorem( or( not( or( X, Y ) ), or( not( or( X, not( Y ) )
% 0.56/1.05 ), X ) ) ) ] )
% 0.56/1.05 , clause( 4025, [ theorem( or( not( or( X, Y ) ), or( not( or( X, not( Y )
% 0.56/1.05 ) ), X ) ) ) ] )
% 0.56/1.05 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.56/1.05 )] ) ).
% 0.56/1.05
% 0.56/1.05
% 0.56/1.05 resolution(
% 0.56/1.05 clause( 4026, [] )
% 0.56/1.05 , clause( 8, [ ~( theorem( or( not( or( p, q ) ), or( not( or( p, not( q )
% 0.56/1.05 ) ), p ) ) ) ) ] )
% 0.56/1.05 , 0, clause( 3156, [ theorem( or( not( or( X, Y ) ), or( not( or( X, not( Y
% 0.56/1.05 ) ) ), X ) ) ) ] )
% 0.56/1.05 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, p ), :=( Y, q )] )
% 0.56/1.05 ).
% 0.56/1.05
% 0.56/1.05
% 0.56/1.05 subsumption(
% 0.56/1.05 clause( 4006, [] )
% 0.56/1.05 , clause( 4026, [] )
% 0.56/1.05 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.56/1.05
% 0.56/1.05
% 0.56/1.05 end.
% 0.56/1.05
% 0.56/1.05 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.56/1.05
% 0.56/1.05 Memory use:
% 0.56/1.05
% 0.56/1.05 space for terms: 63497
% 0.56/1.05 space for clauses: 313044
% 0.56/1.05
% 0.56/1.05
% 0.56/1.05 clauses generated: 7016
% 0.56/1.05 clauses kept: 4007
% 0.56/1.05 clauses selected: 1160
% 0.56/1.05 clauses deleted: 23
% 0.56/1.05 clauses inuse deleted: 1
% 0.56/1.05
% 0.56/1.05 subsentry: 3167
% 0.56/1.05 literals s-matched: 3167
% 0.56/1.05 literals matched: 3167
% 0.56/1.05 full subsumption: 0
% 0.56/1.05
% 0.56/1.05 checksum: 1556988240
% 0.56/1.05
% 0.56/1.05
% 0.56/1.05 Bliksem ended
%------------------------------------------------------------------------------