TSTP Solution File: LCL161-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL161-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 0s
% DateTime : Sun Jul 17 07:51:07 EDT 2022
% Result : Unsatisfiable 0.40s 1.07s
% Output : Refutation 0.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL161-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.11 % Command : bliksem %s
% 0.11/0.32 % Computer : n005.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % DateTime : Mon Jul 4 13:35:07 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.40/1.07 *** allocated 10000 integers for termspace/termends
% 0.40/1.07 *** allocated 10000 integers for clauses
% 0.40/1.07 *** allocated 10000 integers for justifications
% 0.40/1.07 Bliksem 1.12
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 Automatic Strategy Selection
% 0.40/1.07
% 0.40/1.07 Clauses:
% 0.40/1.07 [
% 0.40/1.07 [ =( not( X ), xor( X, truth ) ) ],
% 0.40/1.07 [ =( xor( X, falsehood ), X ) ],
% 0.40/1.07 [ =( xor( X, X ), falsehood ) ],
% 0.40/1.07 [ =( 'and_star'( X, truth ), X ) ],
% 0.40/1.07 [ =( 'and_star'( X, falsehood ), falsehood ) ],
% 0.40/1.07 [ =( 'and_star'( xor( truth, X ), X ), falsehood ) ],
% 0.40/1.07 [ =( xor( X, xor( truth, Y ) ), xor( xor( X, truth ), Y ) ) ],
% 0.40/1.07 [ =( 'and_star'( xor( 'and_star'( xor( truth, X ), Y ), truth ), Y ),
% 0.40/1.07 'and_star'( xor( 'and_star'( xor( truth, Y ), X ), truth ), X ) ) ],
% 0.40/1.07 [ =( xor( X, Y ), xor( Y, X ) ) ],
% 0.40/1.07 [ =( 'and_star'( 'and_star'( X, Y ), Z ), 'and_star'( X, 'and_star'( Y,
% 0.40/1.07 Z ) ) ) ],
% 0.40/1.07 [ =( 'and_star'( X, Y ), 'and_star'( Y, X ) ) ],
% 0.40/1.07 [ =( not( truth ), falsehood ) ],
% 0.40/1.07 [ =( implies( X, Y ), xor( truth, 'and_star'( X, xor( truth, Y ) ) ) ) ]
% 0.40/1.07 ,
% 0.40/1.07 [ ~( =( implies( truth, x ), x ) ) ]
% 0.40/1.07 ] .
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 percentage equality = 1.000000, percentage horn = 1.000000
% 0.40/1.07 This is a pure equality problem
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 Options Used:
% 0.40/1.07
% 0.40/1.07 useres = 1
% 0.40/1.07 useparamod = 1
% 0.40/1.07 useeqrefl = 1
% 0.40/1.07 useeqfact = 1
% 0.40/1.07 usefactor = 1
% 0.40/1.07 usesimpsplitting = 0
% 0.40/1.07 usesimpdemod = 5
% 0.40/1.07 usesimpres = 3
% 0.40/1.07
% 0.40/1.07 resimpinuse = 1000
% 0.40/1.07 resimpclauses = 20000
% 0.40/1.07 substype = eqrewr
% 0.40/1.07 backwardsubs = 1
% 0.40/1.07 selectoldest = 5
% 0.40/1.07
% 0.40/1.07 litorderings [0] = split
% 0.40/1.07 litorderings [1] = extend the termordering, first sorting on arguments
% 0.40/1.07
% 0.40/1.07 termordering = kbo
% 0.40/1.07
% 0.40/1.07 litapriori = 0
% 0.40/1.07 termapriori = 1
% 0.40/1.07 litaposteriori = 0
% 0.40/1.07 termaposteriori = 0
% 0.40/1.07 demodaposteriori = 0
% 0.40/1.07 ordereqreflfact = 0
% 0.40/1.07
% 0.40/1.07 litselect = negord
% 0.40/1.07
% 0.40/1.07 maxweight = 15
% 0.40/1.07 maxdepth = 30000
% 0.40/1.07 maxlength = 115
% 0.40/1.07 maxnrvars = 195
% 0.40/1.07 excuselevel = 1
% 0.40/1.07 increasemaxweight = 1
% 0.40/1.07
% 0.40/1.07 maxselected = 10000000
% 0.40/1.07 maxnrclauses = 10000000
% 0.40/1.07
% 0.40/1.07 showgenerated = 0
% 0.40/1.07 showkept = 0
% 0.40/1.07 showselected = 0
% 0.40/1.07 showdeleted = 0
% 0.40/1.07 showresimp = 1
% 0.40/1.07 showstatus = 2000
% 0.40/1.07
% 0.40/1.07 prologoutput = 1
% 0.40/1.07 nrgoals = 5000000
% 0.40/1.07 totalproof = 1
% 0.40/1.07
% 0.40/1.07 Symbols occurring in the translation:
% 0.40/1.07
% 0.40/1.07 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.40/1.07 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.40/1.07 ! [4, 1] (w:0, o:15, a:1, s:1, b:0),
% 0.40/1.07 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.40/1.07 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.40/1.07 not [40, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.40/1.07 truth [41, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.40/1.07 xor [42, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.40/1.07 falsehood [43, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.40/1.07 'and_star' [44, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.40/1.07 implies [47, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.40/1.07 x [48, 0] (w:1, o:14, a:1, s:1, b:0).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 Starting Search:
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 Bliksems!, er is een bewijs:
% 0.40/1.07 % SZS status Unsatisfiable
% 0.40/1.07 % SZS output start Refutation
% 0.40/1.07
% 0.40/1.07 clause( 0, [ =( xor( X, truth ), not( X ) ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 1, [ =( xor( X, falsehood ), X ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 3, [ =( 'and_star'( X, truth ), X ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 6, [ =( xor( X, xor( truth, Y ) ), xor( not( X ), Y ) ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 8, [ =( xor( X, Y ), xor( Y, X ) ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 10, [ =( 'and_star'( X, Y ), 'and_star'( Y, X ) ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 11, [ =( not( truth ), falsehood ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 12, [ =( xor( truth, 'and_star'( X, xor( truth, Y ) ) ), implies( X
% 0.40/1.07 , Y ) ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 13, [ ~( =( implies( truth, x ), x ) ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 14, [ =( 'and_star'( truth, X ), X ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 18, [ =( xor( truth, X ), not( X ) ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 19, [ =( xor( falsehood, X ), X ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 21, [ =( xor( X, not( Y ) ), xor( not( X ), Y ) ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 23, [ =( not( not( X ) ), X ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 34, [ =( not( 'and_star'( X, not( Y ) ) ), implies( X, Y ) ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 55, [ =( implies( truth, X ), X ) ] )
% 0.40/1.07 .
% 0.40/1.07 clause( 59, [] )
% 0.40/1.07 .
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 % SZS output end Refutation
% 0.40/1.07 found a proof!
% 0.40/1.07
% 0.40/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.40/1.07
% 0.40/1.07 initialclauses(
% 0.40/1.07 [ clause( 61, [ =( not( X ), xor( X, truth ) ) ] )
% 0.40/1.07 , clause( 62, [ =( xor( X, falsehood ), X ) ] )
% 0.40/1.07 , clause( 63, [ =( xor( X, X ), falsehood ) ] )
% 0.40/1.07 , clause( 64, [ =( 'and_star'( X, truth ), X ) ] )
% 0.40/1.07 , clause( 65, [ =( 'and_star'( X, falsehood ), falsehood ) ] )
% 0.40/1.07 , clause( 66, [ =( 'and_star'( xor( truth, X ), X ), falsehood ) ] )
% 0.40/1.07 , clause( 67, [ =( xor( X, xor( truth, Y ) ), xor( xor( X, truth ), Y ) ) ]
% 0.40/1.07 )
% 0.40/1.07 , clause( 68, [ =( 'and_star'( xor( 'and_star'( xor( truth, X ), Y ), truth
% 0.40/1.07 ), Y ), 'and_star'( xor( 'and_star'( xor( truth, Y ), X ), truth ), X )
% 0.40/1.07 ) ] )
% 0.40/1.07 , clause( 69, [ =( xor( X, Y ), xor( Y, X ) ) ] )
% 0.40/1.07 , clause( 70, [ =( 'and_star'( 'and_star'( X, Y ), Z ), 'and_star'( X,
% 0.40/1.07 'and_star'( Y, Z ) ) ) ] )
% 0.40/1.07 , clause( 71, [ =( 'and_star'( X, Y ), 'and_star'( Y, X ) ) ] )
% 0.40/1.07 , clause( 72, [ =( not( truth ), falsehood ) ] )
% 0.40/1.07 , clause( 73, [ =( implies( X, Y ), xor( truth, 'and_star'( X, xor( truth,
% 0.40/1.07 Y ) ) ) ) ] )
% 0.40/1.07 , clause( 74, [ ~( =( implies( truth, x ), x ) ) ] )
% 0.40/1.07 ] ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 eqswap(
% 0.40/1.07 clause( 75, [ =( xor( X, truth ), not( X ) ) ] )
% 0.40/1.07 , clause( 61, [ =( not( X ), xor( X, truth ) ) ] )
% 0.40/1.07 , 0, substitution( 0, [ :=( X, X )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 0, [ =( xor( X, truth ), not( X ) ) ] )
% 0.40/1.07 , clause( 75, [ =( xor( X, truth ), not( X ) ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 1, [ =( xor( X, falsehood ), X ) ] )
% 0.40/1.07 , clause( 62, [ =( xor( X, falsehood ), X ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 3, [ =( 'and_star'( X, truth ), X ) ] )
% 0.40/1.07 , clause( 64, [ =( 'and_star'( X, truth ), X ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 paramod(
% 0.40/1.07 clause( 98, [ =( xor( X, xor( truth, Y ) ), xor( not( X ), Y ) ) ] )
% 0.40/1.07 , clause( 0, [ =( xor( X, truth ), not( X ) ) ] )
% 0.40/1.07 , 0, clause( 67, [ =( xor( X, xor( truth, Y ) ), xor( xor( X, truth ), Y )
% 0.40/1.07 ) ] )
% 0.40/1.07 , 0, 7, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X ),
% 0.40/1.07 :=( Y, Y )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 6, [ =( xor( X, xor( truth, Y ) ), xor( not( X ), Y ) ) ] )
% 0.40/1.07 , clause( 98, [ =( xor( X, xor( truth, Y ) ), xor( not( X ), Y ) ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.40/1.07 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 8, [ =( xor( X, Y ), xor( Y, X ) ) ] )
% 0.40/1.07 , clause( 69, [ =( xor( X, Y ), xor( Y, X ) ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.40/1.07 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 10, [ =( 'and_star'( X, Y ), 'and_star'( Y, X ) ) ] )
% 0.40/1.07 , clause( 71, [ =( 'and_star'( X, Y ), 'and_star'( Y, X ) ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.40/1.07 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 11, [ =( not( truth ), falsehood ) ] )
% 0.40/1.07 , clause( 72, [ =( not( truth ), falsehood ) ] )
% 0.40/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 eqswap(
% 0.40/1.07 clause( 133, [ =( xor( truth, 'and_star'( X, xor( truth, Y ) ) ), implies(
% 0.40/1.07 X, Y ) ) ] )
% 0.40/1.07 , clause( 73, [ =( implies( X, Y ), xor( truth, 'and_star'( X, xor( truth,
% 0.40/1.07 Y ) ) ) ) ] )
% 0.40/1.07 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 12, [ =( xor( truth, 'and_star'( X, xor( truth, Y ) ) ), implies( X
% 0.40/1.07 , Y ) ) ] )
% 0.40/1.07 , clause( 133, [ =( xor( truth, 'and_star'( X, xor( truth, Y ) ) ), implies(
% 0.40/1.07 X, Y ) ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.40/1.07 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 13, [ ~( =( implies( truth, x ), x ) ) ] )
% 0.40/1.07 , clause( 74, [ ~( =( implies( truth, x ), x ) ) ] )
% 0.40/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 eqswap(
% 0.40/1.07 clause( 145, [ =( X, 'and_star'( X, truth ) ) ] )
% 0.40/1.07 , clause( 3, [ =( 'and_star'( X, truth ), X ) ] )
% 0.40/1.07 , 0, substitution( 0, [ :=( X, X )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 paramod(
% 0.40/1.07 clause( 146, [ =( X, 'and_star'( truth, X ) ) ] )
% 0.40/1.07 , clause( 10, [ =( 'and_star'( X, Y ), 'and_star'( Y, X ) ) ] )
% 0.40/1.07 , 0, clause( 145, [ =( X, 'and_star'( X, truth ) ) ] )
% 0.40/1.07 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, truth )] ), substitution( 1
% 0.40/1.07 , [ :=( X, X )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 eqswap(
% 0.40/1.07 clause( 149, [ =( 'and_star'( truth, X ), X ) ] )
% 0.40/1.07 , clause( 146, [ =( X, 'and_star'( truth, X ) ) ] )
% 0.40/1.07 , 0, substitution( 0, [ :=( X, X )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 14, [ =( 'and_star'( truth, X ), X ) ] )
% 0.40/1.07 , clause( 149, [ =( 'and_star'( truth, X ), X ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 eqswap(
% 0.40/1.07 clause( 150, [ =( not( X ), xor( X, truth ) ) ] )
% 0.40/1.07 , clause( 0, [ =( xor( X, truth ), not( X ) ) ] )
% 0.40/1.07 , 0, substitution( 0, [ :=( X, X )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 paramod(
% 0.40/1.07 clause( 151, [ =( not( X ), xor( truth, X ) ) ] )
% 0.40/1.07 , clause( 8, [ =( xor( X, Y ), xor( Y, X ) ) ] )
% 0.40/1.07 , 0, clause( 150, [ =( not( X ), xor( X, truth ) ) ] )
% 0.40/1.07 , 0, 3, substitution( 0, [ :=( X, X ), :=( Y, truth )] ), substitution( 1
% 0.40/1.07 , [ :=( X, X )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 eqswap(
% 0.40/1.07 clause( 154, [ =( xor( truth, X ), not( X ) ) ] )
% 0.40/1.07 , clause( 151, [ =( not( X ), xor( truth, X ) ) ] )
% 0.40/1.07 , 0, substitution( 0, [ :=( X, X )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 18, [ =( xor( truth, X ), not( X ) ) ] )
% 0.40/1.07 , clause( 154, [ =( xor( truth, X ), not( X ) ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 eqswap(
% 0.40/1.07 clause( 155, [ =( X, xor( X, falsehood ) ) ] )
% 0.40/1.07 , clause( 1, [ =( xor( X, falsehood ), X ) ] )
% 0.40/1.07 , 0, substitution( 0, [ :=( X, X )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 paramod(
% 0.40/1.07 clause( 156, [ =( X, xor( falsehood, X ) ) ] )
% 0.40/1.07 , clause( 8, [ =( xor( X, Y ), xor( Y, X ) ) ] )
% 0.40/1.07 , 0, clause( 155, [ =( X, xor( X, falsehood ) ) ] )
% 0.40/1.07 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, falsehood )] ),
% 0.40/1.07 substitution( 1, [ :=( X, X )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 eqswap(
% 0.40/1.07 clause( 159, [ =( xor( falsehood, X ), X ) ] )
% 0.40/1.07 , clause( 156, [ =( X, xor( falsehood, X ) ) ] )
% 0.40/1.07 , 0, substitution( 0, [ :=( X, X )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 19, [ =( xor( falsehood, X ), X ) ] )
% 0.40/1.07 , clause( 159, [ =( xor( falsehood, X ), X ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 paramod(
% 0.40/1.07 clause( 162, [ =( xor( X, not( Y ) ), xor( not( X ), Y ) ) ] )
% 0.40/1.07 , clause( 18, [ =( xor( truth, X ), not( X ) ) ] )
% 0.40/1.07 , 0, clause( 6, [ =( xor( X, xor( truth, Y ) ), xor( not( X ), Y ) ) ] )
% 0.40/1.07 , 0, 3, substitution( 0, [ :=( X, Y )] ), substitution( 1, [ :=( X, X ),
% 0.40/1.07 :=( Y, Y )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 21, [ =( xor( X, not( Y ) ), xor( not( X ), Y ) ) ] )
% 0.40/1.07 , clause( 162, [ =( xor( X, not( Y ) ), xor( not( X ), Y ) ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.40/1.07 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 eqswap(
% 0.40/1.07 clause( 164, [ =( xor( not( X ), Y ), xor( X, not( Y ) ) ) ] )
% 0.40/1.07 , clause( 21, [ =( xor( X, not( Y ) ), xor( not( X ), Y ) ) ] )
% 0.40/1.07 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 paramod(
% 0.40/1.07 clause( 168, [ =( xor( not( truth ), X ), not( not( X ) ) ) ] )
% 0.40/1.07 , clause( 18, [ =( xor( truth, X ), not( X ) ) ] )
% 0.40/1.07 , 0, clause( 164, [ =( xor( not( X ), Y ), xor( X, not( Y ) ) ) ] )
% 0.40/1.07 , 0, 5, substitution( 0, [ :=( X, not( X ) )] ), substitution( 1, [ :=( X,
% 0.40/1.07 truth ), :=( Y, X )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 paramod(
% 0.40/1.07 clause( 169, [ =( xor( falsehood, X ), not( not( X ) ) ) ] )
% 0.40/1.07 , clause( 11, [ =( not( truth ), falsehood ) ] )
% 0.40/1.07 , 0, clause( 168, [ =( xor( not( truth ), X ), not( not( X ) ) ) ] )
% 0.40/1.07 , 0, 2, substitution( 0, [] ), substitution( 1, [ :=( X, X )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 paramod(
% 0.40/1.07 clause( 170, [ =( X, not( not( X ) ) ) ] )
% 0.40/1.07 , clause( 19, [ =( xor( falsehood, X ), X ) ] )
% 0.40/1.07 , 0, clause( 169, [ =( xor( falsehood, X ), not( not( X ) ) ) ] )
% 0.40/1.07 , 0, 1, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X )] )
% 0.40/1.07 ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 eqswap(
% 0.40/1.07 clause( 171, [ =( not( not( X ) ), X ) ] )
% 0.40/1.07 , clause( 170, [ =( X, not( not( X ) ) ) ] )
% 0.40/1.07 , 0, substitution( 0, [ :=( X, X )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 23, [ =( not( not( X ) ), X ) ] )
% 0.40/1.07 , clause( 171, [ =( not( not( X ) ), X ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 paramod(
% 0.40/1.07 clause( 176, [ =( xor( truth, 'and_star'( X, not( Y ) ) ), implies( X, Y )
% 0.40/1.07 ) ] )
% 0.40/1.07 , clause( 18, [ =( xor( truth, X ), not( X ) ) ] )
% 0.40/1.07 , 0, clause( 12, [ =( xor( truth, 'and_star'( X, xor( truth, Y ) ) ),
% 0.40/1.07 implies( X, Y ) ) ] )
% 0.40/1.07 , 0, 5, substitution( 0, [ :=( X, Y )] ), substitution( 1, [ :=( X, X ),
% 0.40/1.07 :=( Y, Y )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 paramod(
% 0.40/1.07 clause( 178, [ =( not( 'and_star'( X, not( Y ) ) ), implies( X, Y ) ) ] )
% 0.40/1.07 , clause( 18, [ =( xor( truth, X ), not( X ) ) ] )
% 0.40/1.07 , 0, clause( 176, [ =( xor( truth, 'and_star'( X, not( Y ) ) ), implies( X
% 0.40/1.07 , Y ) ) ] )
% 0.40/1.07 , 0, 1, substitution( 0, [ :=( X, 'and_star'( X, not( Y ) ) )] ),
% 0.40/1.07 substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 34, [ =( not( 'and_star'( X, not( Y ) ) ), implies( X, Y ) ) ] )
% 0.40/1.07 , clause( 178, [ =( not( 'and_star'( X, not( Y ) ) ), implies( X, Y ) ) ]
% 0.40/1.07 )
% 0.40/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.40/1.07 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 eqswap(
% 0.40/1.07 clause( 181, [ =( implies( X, Y ), not( 'and_star'( X, not( Y ) ) ) ) ] )
% 0.40/1.07 , clause( 34, [ =( not( 'and_star'( X, not( Y ) ) ), implies( X, Y ) ) ] )
% 0.40/1.07 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 paramod(
% 0.40/1.07 clause( 183, [ =( implies( truth, X ), not( not( X ) ) ) ] )
% 0.40/1.07 , clause( 14, [ =( 'and_star'( truth, X ), X ) ] )
% 0.40/1.07 , 0, clause( 181, [ =( implies( X, Y ), not( 'and_star'( X, not( Y ) ) ) )
% 0.40/1.07 ] )
% 0.40/1.07 , 0, 5, substitution( 0, [ :=( X, not( X ) )] ), substitution( 1, [ :=( X,
% 0.40/1.07 truth ), :=( Y, X )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 paramod(
% 0.40/1.07 clause( 184, [ =( implies( truth, X ), X ) ] )
% 0.40/1.07 , clause( 23, [ =( not( not( X ) ), X ) ] )
% 0.40/1.07 , 0, clause( 183, [ =( implies( truth, X ), not( not( X ) ) ) ] )
% 0.40/1.07 , 0, 4, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X )] )
% 0.40/1.07 ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 55, [ =( implies( truth, X ), X ) ] )
% 0.40/1.07 , clause( 184, [ =( implies( truth, X ), X ) ] )
% 0.40/1.07 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 eqswap(
% 0.40/1.07 clause( 186, [ =( X, implies( truth, X ) ) ] )
% 0.40/1.07 , clause( 55, [ =( implies( truth, X ), X ) ] )
% 0.40/1.07 , 0, substitution( 0, [ :=( X, X )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 eqswap(
% 0.40/1.07 clause( 187, [ ~( =( x, implies( truth, x ) ) ) ] )
% 0.40/1.07 , clause( 13, [ ~( =( implies( truth, x ), x ) ) ] )
% 0.40/1.07 , 0, substitution( 0, [] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 resolution(
% 0.40/1.07 clause( 188, [] )
% 0.40/1.07 , clause( 187, [ ~( =( x, implies( truth, x ) ) ) ] )
% 0.40/1.07 , 0, clause( 186, [ =( X, implies( truth, X ) ) ] )
% 0.40/1.07 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, x )] )).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 subsumption(
% 0.40/1.07 clause( 59, [] )
% 0.40/1.07 , clause( 188, [] )
% 0.40/1.07 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 end.
% 0.40/1.07
% 0.40/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.40/1.07
% 0.40/1.07 Memory use:
% 0.40/1.07
% 0.40/1.07 space for terms: 780
% 0.40/1.07 space for clauses: 5728
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 clauses generated: 388
% 0.40/1.07 clauses kept: 60
% 0.40/1.07 clauses selected: 29
% 0.40/1.07 clauses deleted: 5
% 0.40/1.07 clauses inuse deleted: 0
% 0.40/1.07
% 0.40/1.07 subsentry: 511
% 0.40/1.07 literals s-matched: 249
% 0.40/1.07 literals matched: 249
% 0.40/1.07 full subsumption: 0
% 0.40/1.07
% 0.40/1.07 checksum: 16790020
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 Bliksem ended
%------------------------------------------------------------------------------