TSTP Solution File: LCL035-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL035-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:27 EDT 2022
% Result : Unsatisfiable 0.62s 1.04s
% Output : Refutation 0.62s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : LCL035-1 : TPTP v8.1.0. Released v1.0.0.
% 0.02/0.09 % Command : bliksem %s
% 0.08/0.29 % Computer : n011.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 300
% 0.08/0.29 % DateTime : Sat Jul 2 10:33:34 EDT 2022
% 0.08/0.29 % CPUTime :
% 0.62/1.04 *** allocated 10000 integers for termspace/termends
% 0.62/1.04 *** allocated 10000 integers for clauses
% 0.62/1.04 *** allocated 10000 integers for justifications
% 0.62/1.04 Bliksem 1.12
% 0.62/1.04
% 0.62/1.04
% 0.62/1.04 Automatic Strategy Selection
% 0.62/1.04
% 0.62/1.04 Clauses:
% 0.62/1.04 [
% 0.62/1.04 [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'( X ) ),
% 0.62/1.04 'is_a_theorem'( Y ) ],
% 0.62/1.04 [ 'is_a_theorem'( implies( implies( implies( implies( implies( X, Y ),
% 0.62/1.04 implies( Z, falsehood ) ), T ), U ), implies( implies( U, X ), implies( Z
% 0.62/1.04 , X ) ) ) ) ],
% 0.62/1.04 [ ~( 'is_a_theorem'( implies( falsehood, a ) ) ) ]
% 0.62/1.04 ] .
% 0.62/1.04
% 0.62/1.04
% 0.62/1.04 percentage equality = 0.000000, percentage horn = 1.000000
% 0.62/1.04 This is a near-Horn, non-equality problem
% 0.62/1.04
% 0.62/1.04
% 0.62/1.04 Options Used:
% 0.62/1.04
% 0.62/1.04 useres = 1
% 0.62/1.04 useparamod = 0
% 0.62/1.04 useeqrefl = 0
% 0.62/1.04 useeqfact = 0
% 0.62/1.04 usefactor = 1
% 0.62/1.04 usesimpsplitting = 0
% 0.62/1.04 usesimpdemod = 0
% 0.62/1.04 usesimpres = 4
% 0.62/1.04
% 0.62/1.04 resimpinuse = 1000
% 0.62/1.04 resimpclauses = 20000
% 0.62/1.04 substype = standard
% 0.62/1.04 backwardsubs = 1
% 0.62/1.04 selectoldest = 5
% 0.62/1.04
% 0.62/1.04 litorderings [0] = split
% 0.62/1.04 litorderings [1] = liftord
% 0.62/1.04
% 0.62/1.04 termordering = none
% 0.62/1.04
% 0.62/1.04 litapriori = 1
% 0.62/1.04 termapriori = 0
% 0.62/1.04 litaposteriori = 0
% 0.62/1.04 termaposteriori = 0
% 0.62/1.04 demodaposteriori = 0
% 0.62/1.04 ordereqreflfact = 0
% 0.62/1.04
% 0.62/1.04 litselect = negative
% 0.62/1.04
% 0.62/1.04 maxweight = 30000
% 0.62/1.04 maxdepth = 30000
% 0.62/1.04 maxlength = 115
% 0.62/1.04 maxnrvars = 195
% 0.62/1.04 excuselevel = 0
% 0.62/1.04 increasemaxweight = 0
% 0.62/1.04
% 0.62/1.04 maxselected = 10000000
% 0.62/1.04 maxnrclauses = 10000000
% 0.62/1.04
% 0.62/1.04 showgenerated = 0
% 0.62/1.04 showkept = 0
% 0.62/1.04 showselected = 0
% 0.62/1.04 showdeleted = 0
% 0.62/1.04 showresimp = 1
% 0.62/1.04 showstatus = 2000
% 0.62/1.04
% 0.62/1.04 prologoutput = 1
% 0.62/1.04 nrgoals = 5000000
% 0.62/1.04 totalproof = 1
% 0.62/1.04
% 0.62/1.04 Symbols occurring in the translation:
% 0.62/1.04
% 0.62/1.04 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.62/1.04 . [1, 2] (w:1, o:22, a:1, s:1, b:0),
% 0.62/1.04 ! [4, 1] (w:1, o:16, a:1, s:1, b:0),
% 0.62/1.04 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.62/1.04 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.62/1.04 implies [41, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.62/1.04 'is_a_theorem' [42, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.62/1.04 falsehood [44, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.62/1.04 a [47, 0] (w:1, o:15, a:1, s:1, b:0).
% 0.62/1.04
% 0.62/1.04
% 0.62/1.04 Starting Search:
% 0.62/1.04
% 0.62/1.04
% 0.62/1.04 Bliksems!, er is een bewijs:
% 0.62/1.04 % SZS status Unsatisfiable
% 0.62/1.04 % SZS output start Refutation
% 0.62/1.04
% 0.62/1.04 clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y ),
% 0.62/1.04 ~( 'is_a_theorem'( X ) ) ] )
% 0.62/1.04 .
% 0.62/1.04 clause( 1, [ 'is_a_theorem'( implies( implies( implies( implies( implies( X
% 0.62/1.04 , Y ), implies( Z, falsehood ) ), T ), U ), implies( implies( U, X ),
% 0.62/1.04 implies( Z, X ) ) ) ) ] )
% 0.62/1.04 .
% 0.62/1.04 clause( 2, [ ~( 'is_a_theorem'( implies( falsehood, a ) ) ) ] )
% 0.62/1.04 .
% 0.62/1.04 clause( 3, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( implies( implies(
% 0.62/1.04 implies( implies( implies( implies( X, Y ), implies( Z, falsehood ) ), T
% 0.62/1.04 ), U ), implies( implies( U, X ), implies( Z, X ) ) ), W ) ) ) ] )
% 0.62/1.04 .
% 0.62/1.04 clause( 4, [ 'is_a_theorem'( implies( implies( implies( implies( X, Y ),
% 0.62/1.04 implies( Z, Y ) ), implies( Y, T ) ), implies( U, implies( Y, T ) ) ) ) ]
% 0.62/1.04 )
% 0.62/1.04 .
% 0.62/1.04 clause( 5, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( implies( implies(
% 0.62/1.04 implies( implies( implies( X, Y ), implies( Z, Y ) ), implies( Y, T ) ),
% 0.62/1.04 implies( U, implies( Y, T ) ) ), W ) ) ) ] )
% 0.62/1.04 .
% 0.62/1.04 clause( 7, [ 'is_a_theorem'( implies( implies( implies( X, implies(
% 0.62/1.04 falsehood, Y ) ), Z ), implies( T, Z ) ) ) ] )
% 0.62/1.04 .
% 0.62/1.04 clause( 8, [ 'is_a_theorem'( implies( X, implies( Y, implies( falsehood, Z
% 0.62/1.04 ) ) ) ) ] )
% 0.62/1.04 .
% 0.62/1.04 clause( 11, [ 'is_a_theorem'( implies( X, implies( falsehood, Y ) ) ) ] )
% 0.62/1.04 .
% 0.62/1.04 clause( 13, [ 'is_a_theorem'( implies( falsehood, X ) ) ] )
% 0.62/1.04 .
% 0.62/1.04 clause( 16, [] )
% 0.62/1.04 .
% 0.62/1.04
% 0.62/1.04
% 0.62/1.04 % SZS output end Refutation
% 0.62/1.04 found a proof!
% 0.62/1.04
% 0.62/1.04 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.62/1.04
% 0.62/1.04 initialclauses(
% 0.62/1.04 [ clause( 18, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'(
% 0.62/1.04 X ) ), 'is_a_theorem'( Y ) ] )
% 0.62/1.04 , clause( 19, [ 'is_a_theorem'( implies( implies( implies( implies( implies(
% 0.62/1.04 X, Y ), implies( Z, falsehood ) ), T ), U ), implies( implies( U, X ),
% 0.62/1.04 implies( Z, X ) ) ) ) ] )
% 0.62/1.04 , clause( 20, [ ~( 'is_a_theorem'( implies( falsehood, a ) ) ) ] )
% 0.62/1.04 ] ).
% 0.62/1.04
% 0.62/1.04
% 0.62/1.04
% 0.62/1.04 subsumption(
% 0.62/1.04 clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y ),
% 0.62/1.04 ~( 'is_a_theorem'( X ) ) ] )
% 0.62/1.04 , clause( 18, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'(
% 0.62/1.04 X ) ), 'is_a_theorem'( Y ) ] )
% 0.62/1.04 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.62/1.04 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.62/1.04
% 0.62/1.04
% 0.62/1.04 subsumption(
% 0.62/1.04 clause( 1, [ 'is_a_theorem'( implies( implies( implies( implies( implies( X
% 0.62/1.04 , Y ), implies( Z, falsehood ) ), T ), U ), implies( implies( U, X ),
% 0.62/1.04 implies( Z, X ) ) ) ) ] )
% 0.62/1.04 , clause( 19, [ 'is_a_theorem'( implies( implies( implies( implies( implies(
% 0.62/1.04 X, Y ), implies( Z, falsehood ) ), T ), U ), implies( implies( U, X ),
% 0.62/1.04 implies( Z, X ) ) ) ) ] )
% 0.62/1.04 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.62/1.04 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.62/1.04
% 0.62/1.04
% 0.62/1.04 subsumption(
% 0.62/1.04 clause( 2, [ ~( 'is_a_theorem'( implies( falsehood, a ) ) ) ] )
% 0.62/1.04 , clause( 20, [ ~( 'is_a_theorem'( implies( falsehood, a ) ) ) ] )
% 0.62/1.04 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.62/1.04
% 0.62/1.04
% 0.62/1.04 resolution(
% 0.62/1.04 clause( 22, [ ~( 'is_a_theorem'( implies( implies( implies( implies(
% 0.62/1.04 implies( implies( X, Y ), implies( Z, falsehood ) ), T ), U ), implies(
% 0.62/1.04 implies( U, X ), implies( Z, X ) ) ), W ) ) ), 'is_a_theorem'( W ) ] )
% 0.62/1.05 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.62/1.05 , ~( 'is_a_theorem'( X ) ) ] )
% 0.62/1.05 , 2, clause( 1, [ 'is_a_theorem'( implies( implies( implies( implies(
% 0.62/1.05 implies( X, Y ), implies( Z, falsehood ) ), T ), U ), implies( implies( U
% 0.62/1.05 , X ), implies( Z, X ) ) ) ) ] )
% 0.62/1.05 , 0, substitution( 0, [ :=( X, implies( implies( implies( implies( implies(
% 0.62/1.05 X, Y ), implies( Z, falsehood ) ), T ), U ), implies( implies( U, X ),
% 0.62/1.05 implies( Z, X ) ) ) ), :=( Y, W )] ), substitution( 1, [ :=( X, X ), :=(
% 0.62/1.05 Y, Y ), :=( Z, Z ), :=( T, T ), :=( U, U )] )).
% 0.62/1.05
% 0.62/1.05
% 0.62/1.05 subsumption(
% 0.62/1.05 clause( 3, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( implies( implies(
% 0.62/1.05 implies( implies( implies( implies( X, Y ), implies( Z, falsehood ) ), T
% 0.62/1.05 ), U ), implies( implies( U, X ), implies( Z, X ) ) ), W ) ) ) ] )
% 0.62/1.05 , clause( 22, [ ~( 'is_a_theorem'( implies( implies( implies( implies(
% 0.62/1.05 implies( implies( X, Y ), implies( Z, falsehood ) ), T ), U ), implies(
% 0.62/1.05 implies( U, X ), implies( Z, X ) ) ), W ) ) ), 'is_a_theorem'( W ) ] )
% 0.62/1.05 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.62/1.05 , U ), :=( W, W )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.62/1.05
% 0.62/1.05
% 0.62/1.05 resolution(
% 0.62/1.05 clause( 23, [ 'is_a_theorem'( implies( implies( implies( implies( X, Y ),
% 0.62/1.05 implies( Z, Y ) ), implies( Y, T ) ), implies( U, implies( Y, T ) ) ) ) ]
% 0.62/1.05 )
% 0.62/1.05 , clause( 3, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( implies( implies(
% 0.62/1.05 implies( implies( implies( implies( X, Y ), implies( Z, falsehood ) ), T
% 0.62/1.05 ), U ), implies( implies( U, X ), implies( Z, X ) ) ), W ) ) ) ] )
% 0.62/1.05 , 1, clause( 1, [ 'is_a_theorem'( implies( implies( implies( implies(
% 0.62/1.05 implies( X, Y ), implies( Z, falsehood ) ), T ), U ), implies( implies( U
% 0.62/1.05 , X ), implies( Z, X ) ) ) ) ] )
% 0.62/1.05 , 0, substitution( 0, [ :=( X, Y ), :=( Y, T ), :=( Z, Z ), :=( T, implies(
% 0.62/1.05 U, falsehood ) ), :=( U, X ), :=( W, implies( implies( implies( implies(
% 0.62/1.05 X, Y ), implies( Z, Y ) ), implies( Y, T ) ), implies( U, implies( Y, T )
% 0.62/1.05 ) ) )] ), substitution( 1, [ :=( X, implies( Y, T ) ), :=( Y, implies( Z
% 0.62/1.05 , falsehood ) ), :=( Z, U ), :=( T, X ), :=( U, implies( implies( X, Y )
% 0.62/1.05 , implies( Z, Y ) ) )] )).
% 0.62/1.05
% 0.62/1.05
% 0.62/1.05 subsumption(
% 0.62/1.05 clause( 4, [ 'is_a_theorem'( implies( implies( implies( implies( X, Y ),
% 0.62/1.05 implies( Z, Y ) ), implies( Y, T ) ), implies( U, implies( Y, T ) ) ) ) ]
% 0.62/1.05 )
% 0.62/1.05 , clause( 23, [ 'is_a_theorem'( implies( implies( implies( implies( X, Y )
% 0.62/1.05 , implies( Z, Y ) ), implies( Y, T ) ), implies( U, implies( Y, T ) ) ) )
% 0.62/1.05 ] )
% 0.62/1.05 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.62/1.05 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.62/1.05
% 0.62/1.05
% 0.62/1.05 resolution(
% 0.62/1.05 clause( 25, [ ~( 'is_a_theorem'( implies( implies( implies( implies(
% 0.62/1.05 implies( X, Y ), implies( Z, Y ) ), implies( Y, T ) ), implies( U,
% 0.62/1.05 implies( Y, T ) ) ), W ) ) ), 'is_a_theorem'( W ) ] )
% 0.62/1.05 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.62/1.05 , ~( 'is_a_theorem'( X ) ) ] )
% 0.62/1.05 , 2, clause( 4, [ 'is_a_theorem'( implies( implies( implies( implies( X, Y
% 0.62/1.05 ), implies( Z, Y ) ), implies( Y, T ) ), implies( U, implies( Y, T ) ) )
% 0.62/1.05 ) ] )
% 0.62/1.05 , 0, substitution( 0, [ :=( X, implies( implies( implies( implies( X, Y ),
% 0.62/1.05 implies( Z, Y ) ), implies( Y, T ) ), implies( U, implies( Y, T ) ) ) ),
% 0.62/1.05 :=( Y, W )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ),
% 0.62/1.05 :=( T, T ), :=( U, U )] )).
% 0.62/1.05
% 0.62/1.05
% 0.62/1.05 subsumption(
% 0.62/1.05 clause( 5, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( implies( implies(
% 0.62/1.05 implies( implies( implies( X, Y ), implies( Z, Y ) ), implies( Y, T ) ),
% 0.62/1.05 implies( U, implies( Y, T ) ) ), W ) ) ) ] )
% 0.62/1.05 , clause( 25, [ ~( 'is_a_theorem'( implies( implies( implies( implies(
% 0.62/1.05 implies( X, Y ), implies( Z, Y ) ), implies( Y, T ) ), implies( U,
% 0.62/1.05 implies( Y, T ) ) ), W ) ) ), 'is_a_theorem'( W ) ] )
% 0.62/1.05 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.62/1.05 , U ), :=( W, W )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.62/1.05
% 0.62/1.05
% 0.62/1.05 resolution(
% 0.62/1.05 clause( 26, [ 'is_a_theorem'( implies( implies( implies( X, implies(
% 0.62/1.05 falsehood, Y ) ), Z ), implies( T, Z ) ) ) ] )
% 0.62/1.05 , clause( 5, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( implies( implies(
% 0.62/1.05 implies( implies( implies( X, Y ), implies( Z, Y ) ), implies( Y, T ) ),
% 0.62/1.05 implies( U, implies( Y, T ) ) ), W ) ) ) ] )
% 0.62/1.05 , 1, clause( 1, [ 'is_a_theorem'( implies( implies( implies( implies(
% 0.62/1.05 implies( X, Y ), implies( Z, falsehood ) ), T ), U ), implies( implies( U
% 0.62/1.05 , X ), implies( Z, X ) ) ) ) ] )
% 0.62/1.05 , 0, substitution( 0, [ :=( X, Z ), :=( Y, falsehood ), :=( Z, T ), :=( T,
% 0.62/1.05 Y ), :=( U, X ), :=( W, implies( implies( implies( X, implies( falsehood
% 0.62/1.05 , Y ) ), Z ), implies( T, Z ) ) )] ), substitution( 1, [ :=( X, Z ), :=(
% 0.62/1.05 Y, falsehood ), :=( Z, T ), :=( T, implies( falsehood, Y ) ), :=( U,
% 0.62/1.05 implies( X, implies( falsehood, Y ) ) )] )).
% 0.62/1.05
% 0.62/1.05
% 0.62/1.05 subsumption(
% 0.62/1.05 clause( 7, [ 'is_a_theorem'( implies( implies( implies( X, implies(
% 0.62/1.05 falsehood, Y ) ), Z ), implies( T, Z ) ) ) ] )
% 0.62/1.05 , clause( 26, [ 'is_a_theorem'( implies( implies( implies( X, implies(
% 0.62/1.05 falsehood, Y ) ), Z ), implies( T, Z ) ) ) ] )
% 0.62/1.05 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.62/1.05 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.62/1.05
% 0.62/1.05
% 0.62/1.05 resolution(
% 0.62/1.05 clause( 27, [ 'is_a_theorem'( implies( X, implies( Y, implies( falsehood, Z
% 0.62/1.05 ) ) ) ) ] )
% 0.62/1.05 , clause( 5, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( implies( implies(
% 0.62/1.05 implies( implies( implies( X, Y ), implies( Z, Y ) ), implies( Y, T ) ),
% 0.62/1.05 implies( U, implies( Y, T ) ) ), W ) ) ) ] )
% 0.62/1.05 , 1, clause( 7, [ 'is_a_theorem'( implies( implies( implies( X, implies(
% 0.62/1.05 falsehood, Y ) ), Z ), implies( T, Z ) ) ) ] )
% 0.62/1.05 , 0, substitution( 0, [ :=( X, T ), :=( Y, falsehood ), :=( Z, U ), :=( T,
% 0.62/1.05 Z ), :=( U, Y ), :=( W, implies( X, implies( Y, implies( falsehood, Z ) )
% 0.62/1.05 ) )] ), substitution( 1, [ :=( X, implies( implies( T, falsehood ),
% 0.62/1.05 implies( U, falsehood ) ) ), :=( Y, Z ), :=( Z, implies( Y, implies(
% 0.62/1.05 falsehood, Z ) ) ), :=( T, X )] )).
% 0.62/1.05
% 0.62/1.05
% 0.62/1.05 subsumption(
% 0.62/1.05 clause( 8, [ 'is_a_theorem'( implies( X, implies( Y, implies( falsehood, Z
% 0.62/1.05 ) ) ) ) ] )
% 0.62/1.05 , clause( 27, [ 'is_a_theorem'( implies( X, implies( Y, implies( falsehood
% 0.62/1.05 , Z ) ) ) ) ] )
% 0.62/1.05 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.62/1.05 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.62/1.05
% 0.62/1.05
% 0.62/1.05 resolution(
% 0.62/1.05 clause( 28, [ 'is_a_theorem'( implies( X, implies( falsehood, Y ) ) ) ] )
% 0.62/1.05 , clause( 5, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( implies( implies(
% 0.62/1.05 implies( implies( implies( X, Y ), implies( Z, Y ) ), implies( Y, T ) ),
% 0.62/1.05 implies( U, implies( Y, T ) ) ), W ) ) ) ] )
% 0.62/1.05 , 1, clause( 8, [ 'is_a_theorem'( implies( X, implies( Y, implies(
% 0.62/1.05 falsehood, Z ) ) ) ) ] )
% 0.62/1.05 , 0, substitution( 0, [ :=( X, Z ), :=( Y, T ), :=( Z, U ), :=( T, W ),
% 0.62/1.05 :=( U, V0 ), :=( W, implies( X, implies( falsehood, Y ) ) )] ),
% 0.62/1.05 substitution( 1, [ :=( X, implies( implies( implies( implies( Z, T ),
% 0.62/1.05 implies( U, T ) ), implies( T, W ) ), implies( V0, implies( T, W ) ) ) )
% 0.62/1.05 , :=( Y, X ), :=( Z, Y )] )).
% 0.62/1.05
% 0.62/1.05
% 0.62/1.05 subsumption(
% 0.62/1.05 clause( 11, [ 'is_a_theorem'( implies( X, implies( falsehood, Y ) ) ) ] )
% 0.62/1.05 , clause( 28, [ 'is_a_theorem'( implies( X, implies( falsehood, Y ) ) ) ]
% 0.62/1.05 )
% 0.62/1.05 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.62/1.05 )] ) ).
% 0.62/1.05
% 0.62/1.05
% 0.62/1.05 resolution(
% 0.62/1.05 clause( 29, [ 'is_a_theorem'( implies( falsehood, X ) ) ] )
% 0.62/1.05 , clause( 5, [ 'is_a_theorem'( W ), ~( 'is_a_theorem'( implies( implies(
% 0.62/1.05 implies( implies( implies( X, Y ), implies( Z, Y ) ), implies( Y, T ) ),
% 0.62/1.05 implies( U, implies( Y, T ) ) ), W ) ) ) ] )
% 0.62/1.05 , 1, clause( 11, [ 'is_a_theorem'( implies( X, implies( falsehood, Y ) ) )
% 0.62/1.05 ] )
% 0.62/1.05 , 0, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, T ), :=( T, U ),
% 0.62/1.05 :=( U, W ), :=( W, implies( falsehood, X ) )] ), substitution( 1, [ :=( X
% 0.62/1.05 , implies( implies( implies( implies( Y, Z ), implies( T, Z ) ), implies(
% 0.62/1.05 Z, U ) ), implies( W, implies( Z, U ) ) ) ), :=( Y, X )] )).
% 0.62/1.05
% 0.62/1.05
% 0.62/1.05 subsumption(
% 0.62/1.05 clause( 13, [ 'is_a_theorem'( implies( falsehood, X ) ) ] )
% 0.62/1.05 , clause( 29, [ 'is_a_theorem'( implies( falsehood, X ) ) ] )
% 0.62/1.05 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.62/1.05
% 0.62/1.05
% 0.62/1.05 resolution(
% 0.62/1.05 clause( 30, [] )
% 0.62/1.05 , clause( 2, [ ~( 'is_a_theorem'( implies( falsehood, a ) ) ) ] )
% 0.62/1.05 , 0, clause( 13, [ 'is_a_theorem'( implies( falsehood, X ) ) ] )
% 0.62/1.05 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a )] )).
% 0.62/1.05
% 0.62/1.05
% 0.62/1.05 subsumption(
% 0.62/1.05 clause( 16, [] )
% 0.62/1.05 , clause( 30, [] )
% 0.62/1.05 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.62/1.05
% 0.62/1.05
% 0.62/1.05 end.
% 0.62/1.05
% 0.62/1.05 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.62/1.05
% 0.62/1.05 Memory use:
% 0.62/1.05
% 0.62/1.05 space for terms: 298
% 0.62/1.05 space for clauses: 1690
% 0.62/1.05
% 0.62/1.05
% 0.62/1.05 clauses generated: 19
% 0.62/1.05 clauses kept: 17
% 0.62/1.05 clauses selected: 10
% 0.62/1.05 clauses deleted: 0
% 0.62/1.05 clauses inuse deleted: 0
% 0.62/1.05
% 0.62/1.05 subsentry: 12
% 0.62/1.05 literals s-matched: 2
% 0.62/1.05 literals matched: 2
% 0.62/1.05 full subsumption: 0
% 0.62/1.05
% 0.62/1.05 checksum: -1484794820
% 0.62/1.05
% 0.62/1.05
% 0.62/1.05 Bliksem ended
%------------------------------------------------------------------------------