%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : CAT019-3 : TPTP v8.1.0. Released v1.0.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 : Thu Jul 14 23:54:15 EDT 2022
% Result : Unsatisfiable 0.71s 1.09s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : CAT019-3 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Sun May 29 19:47:24 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/1.09 *** allocated 10000 integers for termspace/termends
% 0.71/1.09 *** allocated 10000 integers for clauses
% 0.71/1.09 *** allocated 10000 integers for justifications
% 0.71/1.09 Bliksem 1.12
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Automatic Strategy Selection
% 0.71/1.09
% 0.71/1.09 Clauses:
% 0.71/1.09 [
% 0.71/1.09 [ ~( equivalent( X, Y ) ), 'there_exists'( X ) ],
% 0.71/1.09 [ ~( equivalent( X, Y ) ), =( X, Y ) ],
% 0.71/1.09 [ ~( 'there_exists'( X ) ), ~( =( X, Y ) ), equivalent( X, Y ) ],
% 0.71/1.09 [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( X ) ],
% 0.71/1.09 [ ~( 'there_exists'( codomain( X ) ) ), 'there_exists'( X ) ],
% 0.71/1.09 [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'( domain( X ) )
% 0.71/1.09 ],
% 0.71/1.09 [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ), codomain( Y )
% 0.71/1.09 ) ],
% 0.71/1.09 [ ~( 'there_exists'( domain( X ) ) ), ~( =( domain( X ), codomain( Y ) )
% 0.71/1.09 ), 'there_exists'( compose( X, Y ) ) ],
% 0.71/1.09 [ =( compose( X, compose( Y, Z ) ), compose( compose( X, Y ), Z ) ) ]
% 0.71/1.09 ,
% 0.71/1.09 [ =( compose( X, domain( X ) ), X ) ],
% 0.71/1.09 [ =( compose( codomain( X ), X ), X ) ],
% 0.71/1.09 [ ~( equivalent( X, Y ) ), 'there_exists'( Y ) ],
% 0.71/1.09 [ ~( 'there_exists'( X ) ), ~( 'there_exists'( Y ) ), ~( =( X, Y ) ),
% 0.71/1.09 equivalent( X, Y ) ],
% 0.71/1.09 [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'( codomain( X )
% 0.71/1.09 ) ],
% 0.71/1.09 [ 'there_exists'( f1( X, Y ) ), =( X, Y ) ],
% 0.71/1.09 [ =( X, f1( X, Y ) ), =( Y, f1( X, Y ) ), =( X, Y ) ],
% 0.71/1.09 [ ~( =( X, f1( X, Y ) ) ), ~( =( Y, f1( X, Y ) ) ), =( X, Y ) ],
% 0.71/1.09 [ ~( 'there_exists'( X ) ), ~( =( a, X ) ), =( b, X ) ],
% 0.71/1.09 [ ~( 'there_exists'( X ) ), =( a, X ), ~( =( b, X ) ) ],
% 0.71/1.09 [ ~( =( a, b ) ) ]
% 0.71/1.09 ] .
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 percentage equality = 0.475000, percentage horn = 0.894737
% 0.71/1.09 This is a problem with some equality
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Options Used:
% 0.71/1.09
% 0.71/1.09 useres = 1
% 0.71/1.09 useparamod = 1
% 0.71/1.09 useeqrefl = 1
% 0.71/1.09 useeqfact = 1
% 0.71/1.09 usefactor = 1
% 0.71/1.09 usesimpsplitting = 0
% 0.71/1.09 usesimpdemod = 5
% 0.71/1.09 usesimpres = 3
% 0.71/1.09
% 0.71/1.09 resimpinuse = 1000
% 0.71/1.09 resimpclauses = 20000
% 0.71/1.09 substype = eqrewr
% 0.71/1.09 backwardsubs = 1
% 0.71/1.09 selectoldest = 5
% 0.71/1.09
% 0.71/1.09 litorderings [0] = split
% 0.71/1.09 litorderings [1] = extend the termordering, first sorting on arguments
% 0.71/1.09
% 0.71/1.09 termordering = kbo
% 0.71/1.09
% 0.71/1.09 litapriori = 0
% 0.71/1.09 termapriori = 1
% 0.71/1.09 litaposteriori = 0
% 0.71/1.09 termaposteriori = 0
% 0.71/1.09 demodaposteriori = 0
% 0.71/1.09 ordereqreflfact = 0
% 0.71/1.09
% 0.71/1.09 litselect = negord
% 0.71/1.09
% 0.71/1.09 maxweight = 15
% 0.71/1.09 maxdepth = 30000
% 0.71/1.09 maxlength = 115
% 0.71/1.09 maxnrvars = 195
% 0.71/1.09 excuselevel = 1
% 0.71/1.09 increasemaxweight = 1
% 0.71/1.09
% 0.71/1.09 maxselected = 10000000
% 0.71/1.09 maxnrclauses = 10000000
% 0.71/1.09
% 0.71/1.09 showgenerated = 0
% 0.71/1.09 showkept = 0
% 0.71/1.09 showselected = 0
% 0.71/1.09 showdeleted = 0
% 0.71/1.09 showresimp = 1
% 0.71/1.09 showstatus = 2000
% 0.71/1.09
% 0.71/1.09 prologoutput = 1
% 0.71/1.09 nrgoals = 5000000
% 0.71/1.09 totalproof = 1
% 0.71/1.09
% 0.71/1.09 Symbols occurring in the translation:
% 0.71/1.09
% 0.71/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.71/1.09 . [1, 2] (w:1, o:22, a:1, s:1, b:0),
% 0.71/1.09 ! [4, 1] (w:0, o:14, a:1, s:1, b:0),
% 0.71/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.09 equivalent [41, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.71/1.09 'there_exists' [42, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.71/1.09 domain [43, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.71/1.09 codomain [44, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.71/1.09 compose [45, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.71/1.09 f1 [47, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.71/1.09 a [48, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.71/1.09 b [49, 0] (w:1, o:13, a:1, s:1, b:0).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Starting Search:
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Bliksems!, er is een bewijs:
% 0.71/1.09 % SZS status Unsatisfiable
% 0.71/1.09 % SZS output start Refutation
% 0.71/1.09
% 0.71/1.09 clause( 2, [ ~( 'there_exists'( X ) ), ~( =( X, Y ) ), equivalent( X, Y ) ]
% 0.71/1.09 )
% 0.71/1.09 .
% 0.71/1.09 clause( 11, [ ~( equivalent( X, Y ) ), 'there_exists'( Y ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 13, [ 'there_exists'( f1( X, Y ) ), =( X, Y ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 14, [ =( f1( X, Y ), X ), =( f1( X, Y ), Y ), =( X, Y ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 16, [ ~( 'there_exists'( X ) ), ~( =( a, X ) ), =( b, X ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 17, [ ~( 'there_exists'( X ) ), =( a, X ), ~( =( b, X ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 18, [ ~( =( b, a ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 21, [ ~( 'there_exists'( a ) ), =( b, a ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 22, [ ~( 'there_exists'( b ) ), =( b, a ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 25, [ ~( 'there_exists'( b ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 31, [ ~( equivalent( X, b ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 32, [ ~( 'there_exists'( X ) ), ~( =( X, b ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 38, [ ~( 'there_exists'( a ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 40, [ ~( equivalent( X, a ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 49, [ ~( 'there_exists'( X ) ), ~( =( X, a ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 257, [ =( X, Y ), ~( =( f1( X, Y ), a ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 466, [ ~( =( X, a ) ), 'there_exists'( f1( X, b ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 467, [ 'there_exists'( f1( a, b ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 486, [ ~( =( f1( a, b ), b ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 508, [ =( b, a ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 655, [] )
% 0.71/1.09 .
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 % SZS output end Refutation
% 0.71/1.09 found a proof!
% 0.71/1.09
% 0.71/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.09
% 0.71/1.09 initialclauses(
% 0.71/1.09 [ clause( 657, [ ~( equivalent( X, Y ) ), 'there_exists'( X ) ] )
% 0.71/1.09 , clause( 658, [ ~( equivalent( X, Y ) ), =( X, Y ) ] )
% 0.71/1.09 , clause( 659, [ ~( 'there_exists'( X ) ), ~( =( X, Y ) ), equivalent( X, Y
% 0.71/1.09 ) ] )
% 0.71/1.09 , clause( 660, [ ~( 'there_exists'( domain( X ) ) ), 'there_exists'( X ) ]
% 0.71/1.09 )
% 0.71/1.09 , clause( 661, [ ~( 'there_exists'( codomain( X ) ) ), 'there_exists'( X )
% 0.71/1.09 ] )
% 0.71/1.09 , clause( 662, [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'(
% 0.71/1.09 domain( X ) ) ] )
% 0.71/1.09 , clause( 663, [ ~( 'there_exists'( compose( X, Y ) ) ), =( domain( X ),
% 0.71/1.09 codomain( Y ) ) ] )
% 0.71/1.09 , clause( 664, [ ~( 'there_exists'( domain( X ) ) ), ~( =( domain( X ),
% 0.71/1.09 codomain( Y ) ) ), 'there_exists'( compose( X, Y ) ) ] )
% 0.71/1.09 , clause( 665, [ =( compose( X, compose( Y, Z ) ), compose( compose( X, Y )
% 0.71/1.09 , Z ) ) ] )
% 0.71/1.09 , clause( 666, [ =( compose( X, domain( X ) ), X ) ] )
% 0.71/1.09 , clause( 667, [ =( compose( codomain( X ), X ), X ) ] )
% 0.71/1.09 , clause( 668, [ ~( equivalent( X, Y ) ), 'there_exists'( Y ) ] )
% 0.71/1.09 , clause( 669, [ ~( 'there_exists'( X ) ), ~( 'there_exists'( Y ) ), ~( =(
% 0.71/1.09 X, Y ) ), equivalent( X, Y ) ] )
% 0.71/1.09 , clause( 670, [ ~( 'there_exists'( compose( X, Y ) ) ), 'there_exists'(
% 0.71/1.09 codomain( X ) ) ] )
% 0.71/1.09 , clause( 671, [ 'there_exists'( f1( X, Y ) ), =( X, Y ) ] )
% 0.71/1.09 , clause( 672, [ =( X, f1( X, Y ) ), =( Y, f1( X, Y ) ), =( X, Y ) ] )
% 0.71/1.09 , clause( 673, [ ~( =( X, f1( X, Y ) ) ), ~( =( Y, f1( X, Y ) ) ), =( X, Y
% 0.71/1.09 ) ] )
% 0.71/1.09 , clause( 674, [ ~( 'there_exists'( X ) ), ~( =( a, X ) ), =( b, X ) ] )
% 0.71/1.09 , clause( 675, [ ~( 'there_exists'( X ) ), =( a, X ), ~( =( b, X ) ) ] )
% 0.71/1.09 , clause( 676, [ ~( =( a, b ) ) ] )
% 0.71/1.09 ] ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 2, [ ~( 'there_exists'( X ) ), ~( =( X, Y ) ), equivalent( X, Y ) ]
% 0.71/1.09 )
% 0.71/1.09 , clause( 659, [ ~( 'there_exists'( X ) ), ~( =( X, Y ) ), equivalent( X, Y
% 0.71/1.09 ) ] )
% 0.71/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.09 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 11, [ ~( equivalent( X, Y ) ), 'there_exists'( Y ) ] )
% 0.71/1.09 , clause( 668, [ ~( equivalent( X, Y ) ), 'there_exists'( Y ) ] )
% 0.71/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.09 ), ==>( 1, 1 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 13, [ 'there_exists'( f1( X, Y ) ), =( X, Y ) ] )
% 0.71/1.09 , clause( 671, [ 'there_exists'( f1( X, Y ) ), =( X, Y ) ] )
% 0.71/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.09 ), ==>( 1, 1 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 eqswap(
% 0.71/1.09 clause( 708, [ =( Y, X ), =( X, f1( X, Y ) ), =( Y, f1( X, Y ) ) ] )
% 0.71/1.09 , clause( 672, [ =( X, f1( X, Y ) ), =( Y, f1( X, Y ) ), =( X, Y ) ] )
% 0.71/1.09 , 2, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 eqswap(
% 0.71/1.09 clause( 710, [ =( f1( Y, X ), X ), =( X, Y ), =( Y, f1( Y, X ) ) ] )
% 0.71/1.09 , clause( 708, [ =( Y, X ), =( X, f1( X, Y ) ), =( Y, f1( X, Y ) ) ] )
% 0.71/1.09 , 2, substitution( 0, [ :=( X, Y ), :=( Y, X )] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 eqswap(
% 0.71/1.09 clause( 711, [ =( f1( X, Y ), X ), =( f1( X, Y ), Y ), =( Y, X ) ] )
% 0.71/1.09 , clause( 710, [ =( f1( Y, X ), X ), =( X, Y ), =( Y, f1( Y, X ) ) ] )
% 0.71/1.09 , 2, substitution( 0, [ :=( X, Y ), :=( Y, X )] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 eqswap(
% 0.71/1.09 clause( 712, [ =( Y, X ), =( f1( Y, X ), Y ), =( f1( Y, X ), X ) ] )
% 0.71/1.09 , clause( 711, [ =( f1( X, Y ), X ), =( f1( X, Y ), Y ), =( Y, X ) ] )
% 0.71/1.09 , 2, substitution( 0, [ :=( X, Y ), :=( Y, X )] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 14, [ =( f1( X, Y ), X ), =( f1( X, Y ), Y ), =( X, Y ) ] )
% 0.71/1.09 , clause( 712, [ =( Y, X ), =( f1( Y, X ), Y ), =( f1( Y, X ), X ) ] )
% 0.71/1.09 , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 2
% 0.71/1.09 ), ==>( 1, 0 ), ==>( 2, 1 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 16, [ ~( 'there_exists'( X ) ), ~( =( a, X ) ), =( b, X ) ] )
% 0.71/1.09 , clause( 674, [ ~( 'there_exists'( X ) ), ~( =( a, X ) ), =( b, X ) ] )
% 0.71/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.71/1.09 1 ), ==>( 2, 2 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 17, [ ~( 'there_exists'( X ) ), =( a, X ), ~( =( b, X ) ) ] )
% 0.71/1.09 , clause( 675, [ ~( 'there_exists'( X ) ), =( a, X ), ~( =( b, X ) ) ] )
% 0.71/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.71/1.09 1 ), ==>( 2, 2 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 eqswap(
% 0.71/1.09 clause( 814, [ ~( =( b, a ) ) ] )
% 0.71/1.09 , clause( 676, [ ~( =( a, b ) ) ] )
% 0.71/1.09 , 0, substitution( 0, [] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 18, [ ~( =( b, a ) ) ] )
% 0.71/1.09 , clause( 814, [ ~( =( b, a ) ) ] )
% 0.71/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 eqswap(
% 0.71/1.09 clause( 815, [ ~( =( X, a ) ), ~( 'there_exists'( X ) ), =( b, X ) ] )
% 0.71/1.09 , clause( 16, [ ~( 'there_exists'( X ) ), ~( =( a, X ) ), =( b, X ) ] )
% 0.71/1.09 , 1, substitution( 0, [ :=( X, X )] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 eqrefl(
% 0.71/1.09 clause( 818, [ ~( 'there_exists'( a ) ), =( b, a ) ] )
% 0.71/1.09 , clause( 815, [ ~( =( X, a ) ), ~( 'there_exists'( X ) ), =( b, X ) ] )
% 0.71/1.09 , 0, substitution( 0, [ :=( X, a )] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 21, [ ~( 'there_exists'( a ) ), =( b, a ) ] )
% 0.71/1.09 , clause( 818, [ ~( 'there_exists'( a ) ), =( b, a ) ] )
% 0.71/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] )
% 0.71/1.09 ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 eqswap(
% 0.71/1.09 clause( 820, [ =( X, a ), ~( 'there_exists'( X ) ), ~( =( b, X ) ) ] )
% 0.71/1.09 , clause( 17, [ ~( 'there_exists'( X ) ), =( a, X ), ~( =( b, X ) ) ] )
% 0.71/1.09 , 1, substitution( 0, [ :=( X, X )] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 eqrefl(
% 0.71/1.09 clause( 823, [ =( b, a ), ~( 'there_exists'( b ) ) ] )
% 0.71/1.09 , clause( 820, [ =( X, a ), ~( 'there_exists'( X ) ), ~( =( b, X ) ) ] )
% 0.71/1.09 , 2, substitution( 0, [ :=( X, b )] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 22, [ ~( 'there_exists'( b ) ), =( b, a ) ] )
% 0.71/1.09 , clause( 823, [ =( b, a ), ~( 'there_exists'( b ) ) ] )
% 0.71/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] )
% 0.71/1.09 ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 resolution(
% 0.71/1.09 clause( 827, [ ~( 'there_exists'( b ) ) ] )
% 0.71/1.09 , clause( 18, [ ~( =( b, a ) ) ] )
% 0.71/1.09 , 0, clause( 22, [ ~( 'there_exists'( b ) ), =( b, a ) ] )
% 0.71/1.09 , 1, substitution( 0, [] ), substitution( 1, [] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 25, [ ~( 'there_exists'( b ) ) ] )
% 0.71/1.09 , clause( 827, [ ~( 'there_exists'( b ) ) ] )
% 0.71/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 resolution(
% 0.71/1.09 clause( 828, [ ~( equivalent( X, b ) ) ] )
% 0.71/1.09 , clause( 25, [ ~( 'there_exists'( b ) ) ] )
% 0.71/1.09 , 0, clause( 11, [ ~( equivalent( X, Y ) ), 'there_exists'( Y ) ] )
% 0.71/1.09 , 1, substitution( 0, [] ), substitution( 1, [ :=( X, X ), :=( Y, b )] )
% 0.71/1.09 ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 31, [ ~( equivalent( X, b ) ) ] )
% 0.71/1.09 , clause( 828, [ ~( equivalent( X, b ) ) ] )
% 0.71/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 eqswap(
% 0.71/1.09 clause( 829, [ ~( =( Y, X ) ), ~( 'there_exists'( X ) ), equivalent( X, Y )
% 0.71/1.09 ] )
% 0.71/1.09 , clause( 2, [ ~( 'there_exists'( X ) ), ~( =( X, Y ) ), equivalent( X, Y )
% 0.71/1.09 ] )
% 0.71/1.09 , 1, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 resolution(
% 0.71/1.09 clause( 830, [ ~( =( b, X ) ), ~( 'there_exists'( X ) ) ] )
% 0.71/1.09 , clause( 31, [ ~( equivalent( X, b ) ) ] )
% 0.71/1.09 , 0, clause( 829, [ ~( =( Y, X ) ), ~( 'there_exists'( X ) ), equivalent( X
% 0.71/1.09 , Y ) ] )
% 0.71/1.09 , 2, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X ), :=( Y
% 0.71/1.09 , b )] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 eqswap(
% 0.71/1.09 clause( 831, [ ~( =( X, b ) ), ~( 'there_exists'( X ) ) ] )
% 0.71/1.09 , clause( 830, [ ~( =( b, X ) ), ~( 'there_exists'( X ) ) ] )
% 0.71/1.09 , 0, substitution( 0, [ :=( X, X )] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 32, [ ~( 'there_exists'( X ) ), ~( =( X, b ) ) ] )
% 0.71/1.09 , clause( 831, [ ~( =( X, b ) ), ~( 'there_exists'( X ) ) ] )
% 0.71/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.71/1.09 0 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 resolution(
% 0.71/1.09 clause( 834, [ ~( 'there_exists'( a ) ) ] )
% 0.71/1.09 , clause( 18, [ ~( =( b, a ) ) ] )
% 0.71/1.09 , 0, clause( 21, [ ~( 'there_exists'( a ) ), =( b, a ) ] )
% 0.71/1.09 , 1, substitution( 0, [] ), substitution( 1, [] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 38, [ ~( 'there_exists'( a ) ) ] )
% 0.71/1.09 , clause( 834, [ ~( 'there_exists'( a ) ) ] )
% 0.71/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 resolution(
% 0.71/1.09 clause( 835, [ ~( equivalent( X, a ) ) ] )
% 0.71/1.09 , clause( 38, [ ~( 'there_exists'( a ) ) ] )
% 0.71/1.09 , 0, clause( 11, [ ~( equivalent( X, Y ) ), 'there_exists'( Y ) ] )
% 0.71/1.09 , 1, substitution( 0, [] ), substitution( 1, [ :=( X, X ), :=( Y, a )] )
% 0.71/1.09 ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 40, [ ~( Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------