TSTP Solution File: LCL072-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL072-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 0s
% DateTime : Sun Jul 17 07:49:56 EDT 2022
% Result : Unsatisfiable 0.69s 1.10s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL072-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n011.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % DateTime : Sat Jul 2 10:13:34 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.69/1.10 *** allocated 10000 integers for termspace/termends
% 0.69/1.10 *** allocated 10000 integers for clauses
% 0.69/1.10 *** allocated 10000 integers for justifications
% 0.69/1.10 Bliksem 1.12
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Automatic Strategy Selection
% 0.69/1.10
% 0.69/1.10 Clauses:
% 0.69/1.10 [
% 0.69/1.10 [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'( X ) ),
% 0.69/1.10 'is_a_theorem'( Y ) ],
% 0.69/1.10 [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ), implies( Y, Z
% 0.69/1.10 ) ) ) ],
% 0.69/1.10 [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ), implies( not(
% 0.69/1.10 X ), Z ) ) ) ],
% 0.69/1.10 [ 'is_a_theorem'( implies( implies( X, implies( not( Y ), Z ) ), implies(
% 0.69/1.10 X, implies( implies( T, Z ), implies( implies( Y, T ), Z ) ) ) ) ) ],
% 0.69/1.10 [ ~( 'is_a_theorem'( implies( a, implies( not( a ), b ) ) ) ) ]
% 0.69/1.10 ] .
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 percentage equality = 0.000000, percentage horn = 1.000000
% 0.69/1.10 This is a near-Horn, non-equality problem
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Options Used:
% 0.69/1.10
% 0.69/1.10 useres = 1
% 0.69/1.10 useparamod = 0
% 0.69/1.10 useeqrefl = 0
% 0.69/1.10 useeqfact = 0
% 0.69/1.10 usefactor = 1
% 0.69/1.10 usesimpsplitting = 0
% 0.69/1.10 usesimpdemod = 0
% 0.69/1.10 usesimpres = 4
% 0.69/1.10
% 0.69/1.10 resimpinuse = 1000
% 0.69/1.10 resimpclauses = 20000
% 0.69/1.10 substype = standard
% 0.69/1.10 backwardsubs = 1
% 0.69/1.10 selectoldest = 5
% 0.69/1.10
% 0.69/1.10 litorderings [0] = split
% 0.69/1.10 litorderings [1] = liftord
% 0.69/1.10
% 0.69/1.10 termordering = none
% 0.69/1.10
% 0.69/1.10 litapriori = 1
% 0.69/1.10 termapriori = 0
% 0.69/1.10 litaposteriori = 0
% 0.69/1.10 termaposteriori = 0
% 0.69/1.10 demodaposteriori = 0
% 0.69/1.10 ordereqreflfact = 0
% 0.69/1.10
% 0.69/1.10 litselect = negative
% 0.69/1.10
% 0.69/1.10 maxweight = 30000
% 0.69/1.10 maxdepth = 30000
% 0.69/1.10 maxlength = 115
% 0.69/1.10 maxnrvars = 195
% 0.69/1.10 excuselevel = 0
% 0.69/1.10 increasemaxweight = 0
% 0.69/1.10
% 0.69/1.10 maxselected = 10000000
% 0.69/1.10 maxnrclauses = 10000000
% 0.69/1.10
% 0.69/1.10 showgenerated = 0
% 0.69/1.10 showkept = 0
% 0.69/1.10 showselected = 0
% 0.69/1.10 showdeleted = 0
% 0.69/1.10 showresimp = 1
% 0.69/1.10 showstatus = 2000
% 0.69/1.10
% 0.69/1.10 prologoutput = 1
% 0.69/1.10 nrgoals = 5000000
% 0.69/1.10 totalproof = 1
% 0.69/1.10
% 0.69/1.10 Symbols occurring in the translation:
% 0.69/1.10
% 0.69/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.69/1.10 . [1, 2] (w:1, o:22, a:1, s:1, b:0),
% 0.69/1.10 ! [4, 1] (w:1, o:15, a:1, s:1, b:0),
% 0.69/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.10 implies [41, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.69/1.10 'is_a_theorem' [42, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.69/1.10 not [44, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.69/1.10 a [46, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.69/1.10 b [47, 0] (w:1, o:14, a:1, s:1, b:0).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Starting Search:
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Bliksems!, er is een bewijs:
% 0.69/1.10 % SZS status Unsatisfiable
% 0.69/1.10 % SZS output start Refutation
% 0.69/1.10
% 0.69/1.10 clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y ),
% 0.69/1.10 ~( 'is_a_theorem'( X ) ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 1, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ),
% 0.69/1.10 implies( Y, Z ) ) ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 2, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ),
% 0.69/1.10 implies( not( X ), Z ) ) ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 3, [ 'is_a_theorem'( implies( implies( X, implies( not( Y ), Z ) )
% 0.69/1.10 , implies( X, implies( implies( T, Z ), implies( implies( Y, T ), Z ) ) )
% 0.69/1.10 ) ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 4, [ ~( 'is_a_theorem'( implies( a, implies( not( a ), b ) ) ) ) ]
% 0.69/1.10 )
% 0.69/1.10 .
% 0.69/1.10 clause( 5, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.69/1.10 implies( implies( X, Y ), Z ), implies( Y, Z ) ), T ) ) ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 6, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.69/1.10 implies( implies( X, Y ), Z ), implies( not( X ), Z ) ), T ) ) ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 7, [ 'is_a_theorem'( implies( not( implies( X, Y ) ), implies( Y, Z
% 0.69/1.10 ) ) ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 8, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 12, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X,
% 0.69/1.10 implies( Y, X ) ), Z ) ) ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 13, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( not(
% 0.69/1.10 implies( X, Y ) ), implies( Y, Z ) ), T ) ) ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 16, [ 'is_a_theorem'( implies( not( X ), implies( Y, implies( X, Z
% 0.69/1.10 ) ) ) ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 17, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, X ) ) ) )
% 0.69/1.10 ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 20, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ),
% 0.69/1.10 implies( implies( T, Z ), implies( implies( X, T ), Z ) ) ) ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 25, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( X,
% 0.69/1.10 implies( Y, implies( Z, X ) ) ), T ) ) ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 26, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( not(
% 0.69/1.10 X ), implies( Y, implies( X, Z ) ) ), T ) ) ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 56, [ 'is_a_theorem'( implies( X, implies( Y, implies( not( implies(
% 0.69/1.10 Z, T ) ), implies( T, U ) ) ) ) ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 63, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( implies( implies( X,
% 0.69/1.10 implies( Y, implies( not( implies( Z, T ) ), implies( T, U ) ) ) ), W ) )
% 0.69/1.10 ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 65, [ 'is_a_theorem'( implies( implies( X, implies( Y, implies( Z,
% 0.69/1.10 implies( T, U ) ) ) ), implies( implies( T, X ), implies( Y, implies( Z,
% 0.69/1.10 implies( T, U ) ) ) ) ) ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 67, [ 'is_a_theorem'( implies( implies( X, implies( Y, implies( Z,
% 0.69/1.10 T ) ) ), implies( implies( Z, X ), implies( Y, implies( Z, T ) ) ) ) ) ]
% 0.69/1.10 )
% 0.69/1.10 .
% 0.69/1.10 clause( 72, [ 'is_a_theorem'( implies( X, implies( not( Y ), implies( Z,
% 0.69/1.10 implies( Y, T ) ) ) ) ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 73, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( implies( implies( X,
% 0.69/1.10 implies( not( Y ), implies( Z, implies( Y, T ) ) ) ), U ) ) ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 447, [ 'is_a_theorem'( implies( implies( X, not( Y ) ), implies( Z
% 0.69/1.10 , implies( Y, implies( X, T ) ) ) ) ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 518, [ 'is_a_theorem'( implies( implies( X, implies( X, Y ) ),
% 0.69/1.10 implies( Z, implies( X, Y ) ) ) ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 525, [ 'is_a_theorem'( implies( X, implies( Y, Y ) ) ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 527, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 529, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies( X
% 0.69/1.10 , X ), Y ) ) ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 548, [ 'is_a_theorem'( implies( X, implies( Y, implies( not( Y ), Z
% 0.69/1.10 ) ) ) ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 620, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ] )
% 0.69/1.10 .
% 0.69/1.10 clause( 644, [] )
% 0.69/1.10 .
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 % SZS output end Refutation
% 0.69/1.10 found a proof!
% 0.69/1.10
% 0.69/1.10 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.69/1.10
% 0.69/1.10 initialclauses(
% 0.69/1.10 [ clause( 646, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'(
% 0.69/1.10 X ) ), 'is_a_theorem'( Y ) ] )
% 0.69/1.10 , clause( 647, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ),
% 0.69/1.10 implies( Y, Z ) ) ) ] )
% 0.69/1.10 , clause( 648, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ),
% 0.69/1.10 implies( not( X ), Z ) ) ) ] )
% 0.69/1.10 , clause( 649, [ 'is_a_theorem'( implies( implies( X, implies( not( Y ), Z
% 0.69/1.10 ) ), implies( X, implies( implies( T, Z ), implies( implies( Y, T ), Z )
% 0.69/1.10 ) ) ) ) ] )
% 0.69/1.10 , clause( 650, [ ~( 'is_a_theorem'( implies( a, implies( not( a ), b ) ) )
% 0.69/1.10 ) ] )
% 0.69/1.10 ] ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y ),
% 0.69/1.10 ~( 'is_a_theorem'( X ) ) ] )
% 0.69/1.10 , clause( 646, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'(
% 0.69/1.10 X ) ), 'is_a_theorem'( Y ) ] )
% 0.69/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.69/1.10 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 1, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ),
% 0.69/1.10 implies( Y, Z ) ) ) ] )
% 0.69/1.10 , clause( 647, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ),
% 0.69/1.10 implies( Y, Z ) ) ) ] )
% 0.69/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.69/1.10 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 2, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ),
% 0.69/1.10 implies( not( X ), Z ) ) ) ] )
% 0.69/1.10 , clause( 648, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ),
% 0.69/1.10 implies( not( X ), Z ) ) ) ] )
% 0.69/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.69/1.10 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 3, [ 'is_a_theorem'( implies( implies( X, implies( not( Y ), Z ) )
% 0.69/1.10 , implies( X, implies( implies( T, Z ), implies( implies( Y, T ), Z ) ) )
% 0.69/1.10 ) ) ] )
% 0.69/1.10 , clause( 649, [ 'is_a_theorem'( implies( implies( X, implies( not( Y ), Z
% 0.69/1.10 ) ), implies( X, implies( implies( T, Z ), implies( implies( Y, T ), Z )
% 0.69/1.10 ) ) ) ) ] )
% 0.69/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.69/1.10 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 4, [ ~( 'is_a_theorem'( implies( a, implies( not( a ), b ) ) ) ) ]
% 0.69/1.10 )
% 0.69/1.10 , clause( 650, [ ~( 'is_a_theorem'( implies( a, implies( not( a ), b ) ) )
% 0.69/1.10 ) ] )
% 0.69/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 resolution(
% 0.69/1.10 clause( 652, [ ~( 'is_a_theorem'( implies( implies( implies( implies( X, Y
% 0.69/1.10 ), Z ), implies( Y, Z ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 0.69/1.10 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.69/1.10 , ~( 'is_a_theorem'( X ) ) ] )
% 0.69/1.10 , 2, clause( 1, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ),
% 0.69/1.10 implies( Y, Z ) ) ) ] )
% 0.69/1.10 , 0, substitution( 0, [ :=( X, implies( implies( implies( X, Y ), Z ),
% 0.69/1.10 implies( Y, Z ) ) ), :=( Y, T )] ), substitution( 1, [ :=( X, X ), :=( Y
% 0.69/1.10 , Y ), :=( Z, Z )] )).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 5, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.69/1.10 implies( implies( X, Y ), Z ), implies( Y, Z ) ), T ) ) ) ] )
% 0.69/1.10 , clause( 652, [ ~( 'is_a_theorem'( implies( implies( implies( implies( X,
% 0.69/1.10 Y ), Z ), implies( Y, Z ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 0.69/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.69/1.10 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 resolution(
% 0.69/1.10 clause( 654, [ ~( 'is_a_theorem'( implies( implies( implies( implies( X, Y
% 0.69/1.10 ), Z ), implies( not( X ), Z ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 0.69/1.10 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.69/1.10 , ~( 'is_a_theorem'( X ) ) ] )
% 0.69/1.10 , 2, clause( 2, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ),
% 0.69/1.10 implies( not( X ), Z ) ) ) ] )
% 0.69/1.10 , 0, substitution( 0, [ :=( X, implies( implies( implies( X, Y ), Z ),
% 0.69/1.10 implies( not( X ), Z ) ) ), :=( Y, T )] ), substitution( 1, [ :=( X, X )
% 0.69/1.10 , :=( Y, Y ), :=( Z, Z )] )).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 6, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.69/1.10 implies( implies( X, Y ), Z ), implies( not( X ), Z ) ), T ) ) ) ] )
% 0.69/1.10 , clause( 654, [ ~( 'is_a_theorem'( implies( implies( implies( implies( X,
% 0.69/1.10 Y ), Z ), implies( not( X ), Z ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 0.69/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.69/1.10 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 resolution(
% 0.69/1.10 clause( 655, [ 'is_a_theorem'( implies( not( implies( X, Y ) ), implies( Y
% 0.69/1.10 , Z ) ) ) ] )
% 0.69/1.10 , clause( 5, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.69/1.10 implies( implies( X, Y ), Z ), implies( Y, Z ) ), T ) ) ) ] )
% 0.69/1.10 , 1, clause( 2, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ),
% 0.69/1.10 implies( not( X ), Z ) ) ) ] )
% 0.69/1.10 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, implies(
% 0.69/1.10 not( implies( X, Y ) ), implies( Y, Z ) ) )] ), substitution( 1, [ :=( X
% 0.69/1.10 , implies( X, Y ) ), :=( Y, Z ), :=( Z, implies( Y, Z ) )] )).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 7, [ 'is_a_theorem'( implies( not( implies( X, Y ) ), implies( Y, Z
% 0.69/1.10 ) ) ) ] )
% 0.69/1.10 , clause( 655, [ 'is_a_theorem'( implies( not( implies( X, Y ) ), implies(
% 0.69/1.10 Y, Z ) ) ) ] )
% 0.69/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.69/1.10 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 resolution(
% 0.69/1.10 clause( 656, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.69/1.10 , clause( 5, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.69/1.10 implies( implies( X, Y ), Z ), implies( Y, Z ) ), T ) ) ) ] )
% 0.69/1.10 , 1, clause( 1, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ),
% 0.69/1.10 implies( Y, Z ) ) ) ] )
% 0.69/1.10 , 0, substitution( 0, [ :=( X, Z ), :=( Y, Y ), :=( Z, X ), :=( T, implies(
% 0.69/1.10 X, implies( Y, X ) ) )] ), substitution( 1, [ :=( X, implies( Z, Y ) ),
% 0.69/1.10 :=( Y, X ), :=( Z, implies( Y, X ) )] )).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 8, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.69/1.10 , clause( 656, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.69/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.69/1.10 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 resolution(
% 0.69/1.10 clause( 658, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y, X ) ), Z
% 0.69/1.10 ) ) ), 'is_a_theorem'( Z ) ] )
% 0.69/1.10 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.69/1.10 , ~( 'is_a_theorem'( X ) ) ] )
% 0.69/1.10 , 2, clause( 8, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.69/1.10 , 0, substitution( 0, [ :=( X, implies( X, implies( Y, X ) ) ), :=( Y, Z )] )
% 0.69/1.10 , substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 12, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X,
% 0.69/1.10 implies( Y, X ) ), Z ) ) ) ] )
% 0.69/1.10 , clause( 658, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y, X ) )
% 0.69/1.10 , Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.69/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.69/1.10 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 resolution(
% 0.69/1.10 clause( 660, [ ~( 'is_a_theorem'( implies( implies( not( implies( X, Y ) )
% 0.69/1.10 , implies( Y, Z ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 0.69/1.10 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.69/1.10 , ~( 'is_a_theorem'( X ) ) ] )
% 0.69/1.10 , 2, clause( 7, [ 'is_a_theorem'( implies( not( implies( X, Y ) ), implies(
% 0.69/1.10 Y, Z ) ) ) ] )
% 0.69/1.10 , 0, substitution( 0, [ :=( X, implies( not( implies( X, Y ) ), implies( Y
% 0.69/1.10 , Z ) ) ), :=( Y, T )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=(
% 0.69/1.10 Z, Z )] )).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 13, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( not(
% 0.69/1.10 implies( X, Y ) ), implies( Y, Z ) ), T ) ) ) ] )
% 0.69/1.10 , clause( 660, [ ~( 'is_a_theorem'( implies( implies( not( implies( X, Y )
% 0.69/1.10 ), implies( Y, Z ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 0.69/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.69/1.10 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 resolution(
% 0.69/1.10 clause( 661, [ 'is_a_theorem'( implies( not( X ), implies( Y, implies( X, Z
% 0.69/1.10 ) ) ) ) ] )
% 0.69/1.10 , clause( 12, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X
% 0.69/1.10 , implies( Y, X ) ), Z ) ) ) ] )
% 0.69/1.10 , 1, clause( 2, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ),
% 0.69/1.10 implies( not( X ), Z ) ) ) ] )
% 0.69/1.10 , 0, substitution( 0, [ :=( X, implies( X, Z ) ), :=( Y, Y ), :=( Z,
% 0.69/1.10 implies( not( X ), implies( Y, implies( X, Z ) ) ) )] ), substitution( 1
% 0.69/1.10 , [ :=( X, X ), :=( Y, Z ), :=( Z, implies( Y, implies( X, Z ) ) )] )
% 0.69/1.10 ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 16, [ 'is_a_theorem'( implies( not( X ), implies( Y, implies( X, Z
% 0.69/1.10 ) ) ) ) ] )
% 0.69/1.10 , clause( 661, [ 'is_a_theorem'( implies( not( X ), implies( Y, implies( X
% 0.69/1.10 , Z ) ) ) ) ] )
% 0.69/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.69/1.10 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 resolution(
% 0.69/1.10 clause( 662, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, X ) ) )
% 0.69/1.10 ) ] )
% 0.69/1.10 , clause( 12, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X
% 0.69/1.10 , implies( Y, X ) ), Z ) ) ) ] )
% 0.69/1.10 , 1, clause( 1, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ),
% 0.69/1.10 implies( Y, Z ) ) ) ] )
% 0.69/1.10 , 0, substitution( 0, [ :=( X, implies( Z, X ) ), :=( Y, Y ), :=( Z,
% 0.69/1.10 implies( X, implies( Y, implies( Z, X ) ) ) )] ), substitution( 1, [ :=(
% 0.69/1.10 X, Z ), :=( Y, X ), :=( Z, implies( Y, implies( Z, X ) ) )] )).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 17, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, X ) ) ) )
% 0.69/1.10 ] )
% 0.69/1.10 , clause( 662, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, X ) )
% 0.69/1.10 ) ) ] )
% 0.69/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.69/1.10 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 resolution(
% 0.69/1.10 clause( 663, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ),
% 0.69/1.10 implies( implies( T, Z ), implies( implies( X, T ), Z ) ) ) ) ] )
% 0.69/1.10 , clause( 6, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.69/1.10 implies( implies( X, Y ), Z ), implies( not( X ), Z ) ), T ) ) ) ] )
% 0.69/1.10 , 1, clause( 3, [ 'is_a_theorem'( implies( implies( X, implies( not( Y ), Z
% 0.69/1.10 ) ), implies( X, implies( implies( T, Z ), implies( implies( Y, T ), Z )
% 0.69/1.10 ) ) ) ) ] )
% 0.69/1.10 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, implies(
% 0.69/1.10 implies( implies( X, Y ), Z ), implies( implies( T, Z ), implies( implies(
% 0.69/1.10 X, T ), Z ) ) ) )] ), substitution( 1, [ :=( X, implies( implies( X, Y )
% 0.69/1.10 , Z ) ), :=( Y, X ), :=( Z, Z ), :=( T, T )] )).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 20, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ),
% 0.69/1.10 implies( implies( T, Z ), implies( implies( X, T ), Z ) ) ) ) ] )
% 0.69/1.10 , clause( 663, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ),
% 0.69/1.10 implies( implies( T, Z ), implies( implies( X, T ), Z ) ) ) ) ] )
% 0.69/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.69/1.10 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 resolution(
% 0.69/1.10 clause( 665, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y, implies(
% 0.69/1.10 Z, X ) ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 0.69/1.10 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.69/1.10 , ~( 'is_a_theorem'( X ) ) ] )
% 0.69/1.10 , 2, clause( 17, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, X )
% 0.69/1.10 ) ) ) ] )
% 0.69/1.10 , 0, substitution( 0, [ :=( X, implies( X, implies( Y, implies( Z, X ) ) )
% 0.69/1.10 ), :=( Y, T )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )
% 0.69/1.10 ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 25, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( X,
% 0.69/1.10 implies( Y, implies( Z, X ) ) ), T ) ) ) ] )
% 0.69/1.10 , clause( 665, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y,
% 0.69/1.10 implies( Z, X ) ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 0.69/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.69/1.10 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 resolution(
% 0.69/1.10 clause( 667, [ ~( 'is_a_theorem'( implies( implies( not( X ), implies( Y,
% 0.69/1.10 implies( X, Z ) ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 0.69/1.10 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.69/1.10 , ~( 'is_a_theorem'( X ) ) ] )
% 0.69/1.10 , 2, clause( 16, [ 'is_a_theorem'( implies( not( X ), implies( Y, implies(
% 0.69/1.10 X, Z ) ) ) ) ] )
% 0.69/1.10 , 0, substitution( 0, [ :=( X, implies( not( X ), implies( Y, implies( X, Z
% 0.69/1.10 ) ) ) ), :=( Y, T )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z
% 0.69/1.10 , Z )] )).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 26, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( not(
% 0.69/1.10 X ), implies( Y, implies( X, Z ) ) ), T ) ) ) ] )
% 0.69/1.10 , clause( 667, [ ~( 'is_a_theorem'( implies( implies( not( X ), implies( Y
% 0.69/1.10 , implies( X, Z ) ) ), T ) ) ), 'is_a_theorem'( T ) ] )
% 0.69/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.69/1.10 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 resolution(
% 0.69/1.10 clause( 668, [ 'is_a_theorem'( implies( X, implies( Y, implies( not(
% 0.69/1.10 implies( Z, T ) ), implies( T, U ) ) ) ) ) ] )
% 0.69/1.10 , clause( 13, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.69/1.10 not( implies( X, Y ) ), implies( Y, Z ) ), T ) ) ) ] )
% 0.69/1.10 , 1, clause( 17, [ 'is_a_theorem'( implies( X, implies( Y, implies( Z, X )
% 0.69/1.10 ) ) ) ] )
% 0.69/1.10 , 0, substitution( 0, [ :=( X, Z ), :=( Y, T ), :=( Z, U ), :=( T, implies(
% 0.69/1.10 X, implies( Y, implies( not( implies( Z, T ) ), implies( T, U ) ) ) ) )] )
% 0.69/1.10 , substitution( 1, [ :=( X, implies( not( implies( Z, T ) ), implies( T,
% 0.69/1.10 U ) ) ), :=( Y, X ), :=( Z, Y )] )).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 56, [ 'is_a_theorem'( implies( X, implies( Y, implies( not( implies(
% 0.69/1.10 Z, T ) ), implies( T, U ) ) ) ) ) ] )
% 0.69/1.10 , clause( 668, [ 'is_a_theorem'( implies( X, implies( Y, implies( not(
% 0.69/1.10 implies( Z, T ) ), implies( T, U ) ) ) ) ) ] )
% 0.69/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.69/1.10 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 resolution(
% 0.69/1.10 clause( 670, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y, implies(
% 0.69/1.10 not( implies( Z, T ) ), implies( T, U ) ) ) ), W ) ) ), 'is_a_theorem'( W
% 0.69/1.10 ) ] )
% 0.69/1.10 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.69/1.10 , ~( 'is_a_theorem'( X ) ) ] )
% 0.69/1.10 , 2, clause( 56, [ 'is_a_theorem'( implies( X, implies( Y, implies( not(
% 0.69/1.10 implies( Z, T ) ), implies( T, U ) ) ) ) ) ] )
% 0.69/1.10 , 0, substitution( 0, [ :=( X, implies( X, implies( Y, implies( not(
% 0.69/1.10 implies( Z, T ) ), implies( T, U ) ) ) ) ), :=( Y, W )] ), substitution(
% 0.69/1.10 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U, U )] )).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 63, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( implies( implies( X,
% 0.69/1.10 implies( Y, implies( not( implies( Z, T ) ), implies( T, U ) ) ) ), W ) )
% 0.69/1.10 ) ] )
% 0.69/1.10 , clause( 670, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y,
% 0.69/1.10 implies( not( implies( Z, T ) ), implies( T, U ) ) ) ), W ) ) ),
% 0.69/1.10 'is_a_theorem'( W ) ] )
% 0.69/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.69/1.10 , U ), :=( W, W )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 resolution(
% 0.69/1.10 clause( 671, [ 'is_a_theorem'( implies( implies( X, implies( Y, implies( Z
% 0.69/1.10 , implies( T, U ) ) ) ), implies( implies( T, X ), implies( Y, implies( Z
% 0.69/1.10 , implies( T, U ) ) ) ) ) ) ] )
% 0.69/1.10 , clause( 25, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies( X
% 0.69/1.10 , implies( Y, implies( Z, X ) ) ), T ) ) ) ] )
% 0.69/1.10 , 1, clause( 20, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ),
% 0.69/1.10 implies( implies( T, Z ), implies( implies( X, T ), Z ) ) ) ) ] )
% 0.69/1.10 , 0, substitution( 0, [ :=( X, implies( T, U ) ), :=( Y, Y ), :=( Z, Z ),
% 0.69/1.10 :=( T, implies( implies( X, implies( Y, implies( Z, implies( T, U ) ) ) )
% 0.69/1.10 , implies( implies( T, X ), implies( Y, implies( Z, implies( T, U ) ) ) )
% 0.69/1.10 ) )] ), substitution( 1, [ :=( X, T ), :=( Y, U ), :=( Z, implies( Y,
% 0.69/1.10 implies( Z, implies( T, U ) ) ) ), :=( T, X )] )).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 65, [ 'is_a_theorem'( implies( implies( X, implies( Y, implies( Z,
% 0.69/1.10 implies( T, U ) ) ) ), implies( implies( T, X ), implies( Y, implies( Z,
% 0.69/1.10 implies( T, U ) ) ) ) ) ) ] )
% 0.69/1.10 , clause( 671, [ 'is_a_theorem'( implies( implies( X, implies( Y, implies(
% 0.69/1.10 Z, implies( T, U ) ) ) ), implies( implies( T, X ), implies( Y, implies(
% 0.69/1.10 Z, implies( T, U ) ) ) ) ) ) ] )
% 0.69/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.69/1.10 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 resolution(
% 0.69/1.10 clause( 672, [ 'is_a_theorem'( implies( implies( X, implies( Y, implies( Z
% 0.69/1.10 , T ) ) ), implies( implies( Z, X ), implies( Y, implies( Z, T ) ) ) ) )
% 0.69/1.10 ] )
% 0.69/1.10 , clause( 12, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X
% 0.69/1.10 , implies( Y, X ) ), Z ) ) ) ] )
% 0.69/1.10 , 1, clause( 20, [ 'is_a_theorem'( implies( implies( implies( X, Y ), Z ),
% 0.69/1.10 implies( implies( T, Z ), implies( implies( X, T ), Z ) ) ) ) ] )
% 0.69/1.10 , 0, substitution( 0, [ :=( X, implies( Z, T ) ), :=( Y, Y ), :=( Z,
% 0.69/1.10 implies( implies( X, implies( Y, implies( Z, T ) ) ), implies( implies( Z
% 0.69/1.10 , X ), implies( Y, implies( Z, T ) ) ) ) )] ), substitution( 1, [ :=( X,
% 0.69/1.10 Z ), :=( Y, T ), :=( Z, implies( Y, implies( Z, T ) ) ), :=( T, X )] )
% 0.69/1.10 ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 67, [ 'is_a_theorem'( implies( implies( X, implies( Y, implies( Z,
% 0.69/1.10 T ) ) ), implies( implies( Z, X ), implies( Y, implies( Z, T ) ) ) ) ) ]
% 0.69/1.10 )
% 0.69/1.10 , clause( 672, [ 'is_a_theorem'( implies( implies( X, implies( Y, implies(
% 0.69/1.10 Z, T ) ) ), implies( implies( Z, X ), implies( Y, implies( Z, T ) ) ) ) )
% 0.69/1.10 ] )
% 0.69/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.69/1.10 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 resolution(
% 0.69/1.10 clause( 673, [ 'is_a_theorem'( implies( X, implies( not( Y ), implies( Z,
% 0.69/1.10 implies( Y, T ) ) ) ) ) ] )
% 0.69/1.10 , clause( 26, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.69/1.10 not( X ), implies( Y, implies( X, Z ) ) ), T ) ) ) ] )
% 0.69/1.10 , 1, clause( 8, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.69/1.10 , 0, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, T ), :=( T, implies(
% 0.69/1.10 X, implies( not( Y ), implies( Z, implies( Y, T ) ) ) ) )] ),
% 0.69/1.10 substitution( 1, [ :=( X, implies( not( Y ), implies( Z, implies( Y, T )
% 0.69/1.10 ) ) ), :=( Y, X )] )).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 72, [ 'is_a_theorem'( implies( X, implies( not( Y ), implies( Z,
% 0.69/1.10 implies( Y, T ) ) ) ) ) ] )
% 0.69/1.10 , clause( 673, [ 'is_a_theorem'( implies( X, implies( not( Y ), implies( Z
% 0.69/1.10 , implies( Y, T ) ) ) ) ) ] )
% 0.69/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.69/1.10 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 resolution(
% 0.69/1.10 clause( 675, [ ~( 'is_a_theorem'( implies( implies( X, implies( not( Y ),
% 0.69/1.10 implies( Z, implies( Y, T ) ) ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.69/1.10 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.69/1.10 , ~( 'is_a_theorem'( X ) ) ] )
% 0.69/1.10 , 2, clause( 72, [ 'is_a_theorem'( implies( X, implies( not( Y ), implies(
% 0.69/1.10 Z, implies( Y, T ) ) ) ) ) ] )
% 0.69/1.10 , 0, substitution( 0, [ :=( X, implies( X, implies( not( Y ), implies( Z,
% 0.69/1.10 implies( Y, T ) ) ) ) ), :=( Y, U )] ), substitution( 1, [ :=( X, X ),
% 0.69/1.10 :=( Y, Y ), :=( Z, Z ), :=( T, T )] )).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 73, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( implies( implies( X,
% 0.69/1.10 implies( not( Y ), implies( Z, implies( Y, T ) ) ) ), U ) ) ) ] )
% 0.69/1.10 , clause( 675, [ ~( 'is_a_theorem'( implies( implies( X, implies( not( Y )
% 0.69/1.10 , implies( Z, implies( Y, T ) ) ) ), U ) ) ), 'is_a_theorem'( U ) ] )
% 0.69/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.69/1.10 , U )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 resolution(
% 0.69/1.10 clause( 676, [ 'is_a_theorem'( implies( implies( X, not( Y ) ), implies( Z
% 0.69/1.10 , implies( Y, implies( X, T ) ) ) ) ) ] )
% 0.69/1.10 , clause( 26, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.69/1.10 not( X ), implies( Y, implies( X, Z ) ) ), T ) ) ) ] )
% 0.69/1.10 , 1, clause( 65, [ 'is_a_theorem'( implies( implies( X, implies( Y, implies(
% 0.69/1.10 Z, implies( T, U ) ) ) ), implies( implies( T, X ), implies( Y, implies(
% 0.69/1.10 Z, implies( T, U ) ) ) ) ) ) ] )
% 0.69/1.10 , 0, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, implies( X, T ) ),
% 0.69/1.10 :=( T, implies( implies( X, not( Y ) ), implies( Z, implies( Y, implies(
% 0.69/1.10 X, T ) ) ) ) )] ), substitution( 1, [ :=( X, not( Y ) ), :=( Y, Z ), :=(
% 0.69/1.10 Z, Y ), :=( T, X ), :=( U, T )] )).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 447, [ 'is_a_theorem'( implies( implies( X, not( Y ) ), implies( Z
% 0.69/1.10 , implies( Y, implies( X, T ) ) ) ) ) ] )
% 0.69/1.10 , clause( 676, [ 'is_a_theorem'( implies( implies( X, not( Y ) ), implies(
% 0.69/1.10 Z, implies( Y, implies( X, T ) ) ) ) ) ] )
% 0.69/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.69/1.10 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 resolution(
% 0.69/1.10 clause( 677, [ 'is_a_theorem'( implies( implies( X, implies( X, Y ) ),
% 0.69/1.10 implies( Z, implies( X, Y ) ) ) ) ] )
% 0.69/1.10 , clause( 12, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X
% 0.69/1.10 , implies( Y, X ) ), Z ) ) ) ] )
% 0.69/1.10 , 1, clause( 67, [ 'is_a_theorem'( implies( implies( X, implies( Y, implies(
% 0.69/1.10 Z, T ) ) ), implies( implies( Z, X ), implies( Y, implies( Z, T ) ) ) ) )
% 0.69/1.10 ] )
% 0.69/1.10 , 0, substitution( 0, [ :=( X, implies( X, Y ) ), :=( Y, Z ), :=( Z,
% 0.69/1.10 implies( implies( X, implies( X, Y ) ), implies( Z, implies( X, Y ) ) ) )] )
% 0.69/1.10 , substitution( 1, [ :=( X, implies( X, Y ) ), :=( Y, Z ), :=( Z, X ),
% 0.69/1.10 :=( T, Y )] )).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 518, [ 'is_a_theorem'( implies( implies( X, implies( X, Y ) ),
% 0.69/1.10 implies( Z, implies( X, Y ) ) ) ) ] )
% 0.69/1.10 , clause( 677, [ 'is_a_theorem'( implies( implies( X, implies( X, Y ) ),
% 0.69/1.10 implies( Z, implies( X, Y ) ) ) ) ] )
% 0.69/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.69/1.10 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 resolution(
% 0.69/1.10 clause( 678, [ 'is_a_theorem'( implies( X, implies( Y, Y ) ) ) ] )
% 0.69/1.10 , clause( 12, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X
% 0.69/1.10 , implies( Y, X ) ), Z ) ) ) ] )
% 0.69/1.10 , 1, clause( 518, [ 'is_a_theorem'( implies( implies( X, implies( X, Y ) )
% 0.69/1.10 , implies( Z, implies( X, Y ) ) ) ) ] )
% 0.69/1.10 , 0, substitution( 0, [ :=( X, Y ), :=( Y, Y ), :=( Z, implies( X, implies(
% 0.69/1.10 Y, Y ) ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, Y ), :=( Z, X )] )
% 0.69/1.10 ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 525, [ 'is_a_theorem'( implies( X, implies( Y, Y ) ) ) ] )
% 0.69/1.10 , clause( 678, [ 'is_a_theorem'( implies( X, implies( Y, Y ) ) ) ] )
% 0.69/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.69/1.10 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 resolution(
% 0.69/1.10 clause( 679, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.69/1.10 , clause( 63, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( implies( implies( X
% 0.69/1.10 , implies( Y, implies( not( implies( Z, T ) ), implies( T, U ) ) ) ), W )
% 0.69/1.10 ) ) ] )
% 0.69/1.10 , 1, clause( 525, [ 'is_a_theorem'( implies( X, implies( Y, Y ) ) ) ] )
% 0.69/1.10 , 0, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, T ), :=( T, U ),
% 0.69/1.10 :=( U, W ), :=( W, implies( X, X ) )] ), substitution( 1, [ :=( X,
% 0.69/1.10 implies( Y, implies( Z, implies( not( implies( T, U ) ), implies( U, W )
% 0.69/1.10 ) ) ) ), :=( Y, X )] )).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 527, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.69/1.10 , clause( 679, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.69/1.10 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 resolution(
% 0.69/1.10 clause( 681, [ ~( 'is_a_theorem'( implies( implies( X, X ), Y ) ) ),
% 0.69/1.10 'is_a_theorem'( Y ) ] )
% 0.69/1.10 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.69/1.10 , ~( 'is_a_theorem'( X ) ) ] )
% 0.69/1.10 , 2, clause( 527, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.69/1.10 , 0, substitution( 0, [ :=( X, implies( X, X ) ), :=( Y, Y )] ),
% 0.69/1.10 substitution( 1, [ :=( X, X )] )).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 529, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies( X
% 0.69/1.10 , X ), Y ) ) ) ] )
% 0.69/1.10 , clause( 681, [ ~( 'is_a_theorem'( implies( implies( X, X ), Y ) ) ),
% 0.69/1.10 'is_a_theorem'( Y ) ] )
% 0.69/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.69/1.10 ), ==>( 1, 0 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 resolution(
% 0.69/1.10 clause( 682, [ 'is_a_theorem'( implies( X, implies( Y, implies( not( Y ), Z
% 0.69/1.10 ) ) ) ) ] )
% 0.69/1.10 , clause( 529, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies(
% 0.69/1.10 X, X ), Y ) ) ) ] )
% 0.69/1.10 , 1, clause( 447, [ 'is_a_theorem'( implies( implies( X, not( Y ) ),
% 0.69/1.10 implies( Z, implies( Y, implies( X, T ) ) ) ) ) ] )
% 0.69/1.10 , 0, substitution( 0, [ :=( X, not( Y ) ), :=( Y, implies( X, implies( Y,
% 0.69/1.10 implies( not( Y ), Z ) ) ) )] ), substitution( 1, [ :=( X, not( Y ) ),
% 0.69/1.10 :=( Y, Y ), :=( Z, X ), :=( T, Z )] )).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 548, [ 'is_a_theorem'( implies( X, implies( Y, implies( not( Y ), Z
% 0.69/1.10 ) ) ) ) ] )
% 0.69/1.10 , clause( 682, [ 'is_a_theorem'( implies( X, implies( Y, implies( not( Y )
% 0.69/1.10 , Z ) ) ) ) ] )
% 0.69/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.69/1.10 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 resolution(
% 0.69/1.10 clause( 683, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ] )
% 0.69/1.10 , clause( 73, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( implies( implies( X
% 0.69/1.10 , implies( not( Y ), implies( Z, implies( Y, T ) ) ) ), U ) ) ) ] )
% 0.69/1.10 , 1, clause( 548, [ 'is_a_theorem'( implies( X, implies( Y, implies( not( Y
% 0.69/1.10 ), Z ) ) ) ) ] )
% 0.69/1.10 , 0, substitution( 0, [ :=( X, Z ), :=( Y, T ), :=( Z, U ), :=( T, W ),
% 0.69/1.10 :=( U, implies( X, implies( not( X ), Y ) ) )] ), substitution( 1, [ :=(
% 0.69/1.10 X, implies( Z, implies( not( T ), implies( U, implies( T, W ) ) ) ) ),
% 0.69/1.10 :=( Y, X ), :=( Z, Y )] )).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 620, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ] )
% 0.69/1.10 , clause( 683, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ]
% 0.69/1.10 )
% 0.69/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.69/1.10 )] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 resolution(
% 0.69/1.10 clause( 684, [] )
% 0.69/1.10 , clause( 4, [ ~( 'is_a_theorem'( implies( a, implies( not( a ), b ) ) ) )
% 0.69/1.10 ] )
% 0.69/1.10 , 0, clause( 620, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) )
% 0.69/1.10 ] )
% 0.69/1.10 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a ), :=( Y, b )] )
% 0.69/1.10 ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 subsumption(
% 0.69/1.10 clause( 644, [] )
% 0.69/1.10 , clause( 684, [] )
% 0.69/1.10 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 end.
% 0.69/1.10
% 0.69/1.10 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.69/1.10
% 0.69/1.10 Memory use:
% 0.69/1.10
% 0.69/1.10 space for terms: 10785
% 0.69/1.10 space for clauses: 60127
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 clauses generated: 3059
% 0.69/1.10 clauses kept: 645
% 0.69/1.10 clauses selected: 197
% 0.69/1.10 clauses deleted: 3
% 0.69/1.10 clauses inuse deleted: 0
% 0.69/1.10
% 0.69/1.10 subsentry: 2621
% 0.69/1.10 literals s-matched: 2418
% 0.69/1.10 literals matched: 2418
% 0.69/1.10 full subsumption: 0
% 0.69/1.10
% 0.69/1.10 checksum: 763615058
% 0.69/1.10
% 0.69/1.10
% 0.69/1.10 Bliksem ended
%------------------------------------------------------------------------------