TSTP Solution File: COL075-2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : COL075-2 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n023.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 : Fri Jul 15 00:12:36 EDT 2022
% Result : Unsatisfiable 0.47s 1.13s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : COL075-2 : TPTP v8.1.0. Released v1.2.0.
% 0.06/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % DateTime : Tue May 31 12:41:26 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.47/1.13 *** allocated 10000 integers for termspace/termends
% 0.47/1.13 *** allocated 10000 integers for clauses
% 0.47/1.13 *** allocated 10000 integers for justifications
% 0.47/1.13 Bliksem 1.12
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 Automatic Strategy Selection
% 0.47/1.13
% 0.47/1.13 Clauses:
% 0.47/1.13 [
% 0.47/1.13 [ =( apply( apply( k, X ), Y ), X ) ],
% 0.47/1.13 [ =( apply( apply( apply( abstraction, X ), Y ), Z ), apply( apply( X,
% 0.47/1.13 apply( k, Z ) ), apply( Y, Z ) ) ) ],
% 0.47/1.13 [ ~( =( apply( apply( X, b( X ) ), c( X ) ), apply( b( X ), b( X ) ) ) )
% 0.47/1.13 ]
% 0.47/1.13 ] .
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 percentage equality = 1.000000, percentage horn = 1.000000
% 0.47/1.13 This is a pure equality problem
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 Options Used:
% 0.47/1.13
% 0.47/1.13 useres = 1
% 0.47/1.13 useparamod = 1
% 0.47/1.13 useeqrefl = 1
% 0.47/1.13 useeqfact = 1
% 0.47/1.13 usefactor = 1
% 0.47/1.13 usesimpsplitting = 0
% 0.47/1.13 usesimpdemod = 5
% 0.47/1.13 usesimpres = 3
% 0.47/1.13
% 0.47/1.13 resimpinuse = 1000
% 0.47/1.13 resimpclauses = 20000
% 0.47/1.13 substype = eqrewr
% 0.47/1.13 backwardsubs = 1
% 0.47/1.13 selectoldest = 5
% 0.47/1.13
% 0.47/1.13 litorderings [0] = split
% 0.47/1.13 litorderings [1] = extend the termordering, first sorting on arguments
% 0.47/1.13
% 0.47/1.13 termordering = kbo
% 0.47/1.13
% 0.47/1.13 litapriori = 0
% 0.47/1.13 termapriori = 1
% 0.47/1.13 litaposteriori = 0
% 0.47/1.13 termaposteriori = 0
% 0.47/1.13 demodaposteriori = 0
% 0.47/1.13 ordereqreflfact = 0
% 0.47/1.13
% 0.47/1.13 litselect = negord
% 0.47/1.13
% 0.47/1.13 maxweight = 15
% 0.47/1.13 maxdepth = 30000
% 0.47/1.13 maxlength = 115
% 0.47/1.13 maxnrvars = 195
% 0.47/1.13 excuselevel = 1
% 0.47/1.13 increasemaxweight = 1
% 0.47/1.13
% 0.47/1.13 maxselected = 10000000
% 0.47/1.13 maxnrclauses = 10000000
% 0.47/1.13
% 0.47/1.13 showgenerated = 0
% 0.47/1.13 showkept = 0
% 0.47/1.13 showselected = 0
% 0.47/1.13 showdeleted = 0
% 0.47/1.13 showresimp = 1
% 0.47/1.13 showstatus = 2000
% 0.47/1.13
% 0.47/1.13 prologoutput = 1
% 0.47/1.13 nrgoals = 5000000
% 0.47/1.13 totalproof = 1
% 0.47/1.13
% 0.47/1.13 Symbols occurring in the translation:
% 0.47/1.13
% 0.47/1.13 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.47/1.13 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.47/1.13 ! [4, 1] (w:0, o:14, a:1, s:1, b:0),
% 0.47/1.13 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.47/1.13 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.47/1.13 k [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.47/1.13 apply [41, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.47/1.13 abstraction [43, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.47/1.13 b [45, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.47/1.13 c [46, 1] (w:1, o:20, a:1, s:1, b:0).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 Starting Search:
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 Bliksems!, er is een bewijs:
% 0.47/1.13 % SZS status Unsatisfiable
% 0.47/1.13 % SZS output start Refutation
% 0.47/1.13
% 0.47/1.13 clause( 0, [ =( apply( apply( k, X ), Y ), X ) ] )
% 0.47/1.13 .
% 0.47/1.13 clause( 1, [ =( apply( apply( X, apply( k, Z ) ), apply( Y, Z ) ), apply(
% 0.47/1.13 apply( apply( abstraction, X ), Y ), Z ) ) ] )
% 0.47/1.13 .
% 0.47/1.13 clause( 2, [ ~( =( apply( apply( X, b( X ) ), c( X ) ), apply( b( X ), b( X
% 0.47/1.13 ) ) ) ) ] )
% 0.47/1.13 .
% 0.47/1.13 clause( 9, [ =( apply( apply( apply( abstraction, Z ), apply( k, X ) ), Y )
% 0.47/1.13 , apply( apply( Z, apply( k, Y ) ), X ) ) ] )
% 0.47/1.13 .
% 0.47/1.13 clause( 14, [ =( apply( apply( apply( apply( abstraction, abstraction ), k
% 0.47/1.13 ), X ), Y ), apply( X, X ) ) ] )
% 0.47/1.13 .
% 0.47/1.13 clause( 17, [] )
% 0.47/1.13 .
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 % SZS output end Refutation
% 0.47/1.13 found a proof!
% 0.47/1.13
% 0.47/1.13 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.47/1.13
% 0.47/1.13 initialclauses(
% 0.47/1.13 [ clause( 19, [ =( apply( apply( k, X ), Y ), X ) ] )
% 0.47/1.13 , clause( 20, [ =( apply( apply( apply( abstraction, X ), Y ), Z ), apply(
% 0.47/1.13 apply( X, apply( k, Z ) ), apply( Y, Z ) ) ) ] )
% 0.47/1.13 , clause( 21, [ ~( =( apply( apply( X, b( X ) ), c( X ) ), apply( b( X ), b(
% 0.47/1.13 X ) ) ) ) ] )
% 0.47/1.13 ] ).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 subsumption(
% 0.47/1.13 clause( 0, [ =( apply( apply( k, X ), Y ), X ) ] )
% 0.47/1.13 , clause( 19, [ =( apply( apply( k, X ), Y ), X ) ] )
% 0.47/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.47/1.13 )] ) ).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 eqswap(
% 0.47/1.13 clause( 24, [ =( apply( apply( X, apply( k, Z ) ), apply( Y, Z ) ), apply(
% 0.47/1.13 apply( apply( abstraction, X ), Y ), Z ) ) ] )
% 0.47/1.13 , clause( 20, [ =( apply( apply( apply( abstraction, X ), Y ), Z ), apply(
% 0.47/1.13 apply( X, apply( k, Z ) ), apply( Y, Z ) ) ) ] )
% 0.47/1.13 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 subsumption(
% 0.47/1.13 clause( 1, [ =( apply( apply( X, apply( k, Z ) ), apply( Y, Z ) ), apply(
% 0.47/1.13 apply( apply( abstraction, X ), Y ), Z ) ) ] )
% 0.47/1.13 , clause( 24, [ =( apply( apply( X, apply( k, Z ) ), apply( Y, Z ) ), apply(
% 0.47/1.13 apply( apply( abstraction, X ), Y ), Z ) ) ] )
% 0.47/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.47/1.13 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 subsumption(
% 0.47/1.13 clause( 2, [ ~( =( apply( apply( X, b( X ) ), c( X ) ), apply( b( X ), b( X
% 0.47/1.13 ) ) ) ) ] )
% 0.47/1.13 , clause( 21, [ ~( =( apply( apply( X, b( X ) ), c( X ) ), apply( b( X ), b(
% 0.47/1.13 X ) ) ) ) ] )
% 0.47/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 eqswap(
% 0.47/1.13 clause( 29, [ =( apply( apply( apply( abstraction, X ), Z ), Y ), apply(
% 0.47/1.13 apply( X, apply( k, Y ) ), apply( Z, Y ) ) ) ] )
% 0.47/1.13 , clause( 1, [ =( apply( apply( X, apply( k, Z ) ), apply( Y, Z ) ), apply(
% 0.47/1.13 apply( apply( abstraction, X ), Y ), Z ) ) ] )
% 0.47/1.13 , 0, substitution( 0, [ :=( X, X ), :=( Y, Z ), :=( Z, Y )] )).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 paramod(
% 0.47/1.13 clause( 34, [ =( apply( apply( apply( abstraction, X ), apply( k, Y ) ), Z
% 0.47/1.13 ), apply( apply( X, apply( k, Z ) ), Y ) ) ] )
% 0.47/1.13 , clause( 0, [ =( apply( apply( k, X ), Y ), X ) ] )
% 0.47/1.13 , 0, clause( 29, [ =( apply( apply( apply( abstraction, X ), Z ), Y ),
% 0.47/1.13 apply( apply( X, apply( k, Y ) ), apply( Z, Y ) ) ) ] )
% 0.47/1.13 , 0, 16, substitution( 0, [ :=( X, Y ), :=( Y, Z )] ), substitution( 1, [
% 0.47/1.13 :=( X, X ), :=( Y, Z ), :=( Z, apply( k, Y ) )] )).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 subsumption(
% 0.47/1.13 clause( 9, [ =( apply( apply( apply( abstraction, Z ), apply( k, X ) ), Y )
% 0.47/1.13 , apply( apply( Z, apply( k, Y ) ), X ) ) ] )
% 0.47/1.13 , clause( 34, [ =( apply( apply( apply( abstraction, X ), apply( k, Y ) ),
% 0.47/1.13 Z ), apply( apply( X, apply( k, Z ) ), Y ) ) ] )
% 0.47/1.13 , substitution( 0, [ :=( X, Z ), :=( Y, X ), :=( Z, Y )] ),
% 0.47/1.13 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 eqswap(
% 0.47/1.13 clause( 39, [ =( apply( apply( X, apply( k, Z ) ), Y ), apply( apply( apply(
% 0.47/1.13 abstraction, X ), apply( k, Y ) ), Z ) ) ] )
% 0.47/1.13 , clause( 9, [ =( apply( apply( apply( abstraction, Z ), apply( k, X ) ), Y
% 0.47/1.13 ), apply( apply( Z, apply( k, Y ) ), X ) ) ] )
% 0.47/1.13 , 0, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, X )] )).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 paramod(
% 0.47/1.13 clause( 49, [ =( apply( apply( apply( k, X ), apply( k, Y ) ), X ), apply(
% 0.47/1.13 apply( apply( apply( abstraction, abstraction ), k ), X ), Y ) ) ] )
% 0.47/1.13 , clause( 1, [ =( apply( apply( X, apply( k, Z ) ), apply( Y, Z ) ), apply(
% 0.47/1.13 apply( apply( abstraction, X ), Y ), Z ) ) ] )
% 0.47/1.13 , 0, clause( 39, [ =( apply( apply( X, apply( k, Z ) ), Y ), apply( apply(
% 0.47/1.13 apply( abstraction, X ), apply( k, Y ) ), Z ) ) ] )
% 0.47/1.13 , 0, 11, substitution( 0, [ :=( X, abstraction ), :=( Y, k ), :=( Z, X )] )
% 0.47/1.13 , substitution( 1, [ :=( X, apply( k, X ) ), :=( Y, X ), :=( Z, Y )] )
% 0.47/1.13 ).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 paramod(
% 0.47/1.13 clause( 50, [ =( apply( X, X ), apply( apply( apply( apply( abstraction,
% 0.47/1.13 abstraction ), k ), X ), Y ) ) ] )
% 0.47/1.13 , clause( 0, [ =( apply( apply( k, X ), Y ), X ) ] )
% 0.47/1.13 , 0, clause( 49, [ =( apply( apply( apply( k, X ), apply( k, Y ) ), X ),
% 0.47/1.13 apply( apply( apply( apply( abstraction, abstraction ), k ), X ), Y ) ) ]
% 0.47/1.13 )
% 0.47/1.13 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, apply( k, Y ) )] ),
% 0.47/1.13 substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 eqswap(
% 0.47/1.13 clause( 51, [ =( apply( apply( apply( apply( abstraction, abstraction ), k
% 0.47/1.13 ), X ), Y ), apply( X, X ) ) ] )
% 0.47/1.13 , clause( 50, [ =( apply( X, X ), apply( apply( apply( apply( abstraction,
% 0.47/1.13 abstraction ), k ), X ), Y ) ) ] )
% 0.47/1.13 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 subsumption(
% 0.47/1.13 clause( 14, [ =( apply( apply( apply( apply( abstraction, abstraction ), k
% 0.47/1.13 ), X ), Y ), apply( X, X ) ) ] )
% 0.47/1.13 , clause( 51, [ =( apply( apply( apply( apply( abstraction, abstraction ),
% 0.47/1.13 k ), X ), Y ), apply( X, X ) ) ] )
% 0.47/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.47/1.13 )] ) ).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 eqswap(
% 0.47/1.13 clause( 53, [ ~( =( apply( b( X ), b( X ) ), apply( apply( X, b( X ) ), c(
% 0.47/1.13 X ) ) ) ) ] )
% 0.47/1.13 , clause( 2, [ ~( =( apply( apply( X, b( X ) ), c( X ) ), apply( b( X ), b(
% 0.47/1.13 X ) ) ) ) ] )
% 0.47/1.13 , 0, substitution( 0, [ :=( X, X )] )).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 paramod(
% 0.47/1.13 clause( 76, [ ~( =( apply( b( apply( apply( abstraction, abstraction ), k )
% 0.47/1.13 ), b( apply( apply( abstraction, abstraction ), k ) ) ), apply( b( apply(
% 0.47/1.13 apply( abstraction, abstraction ), k ) ), b( apply( apply( abstraction,
% 0.47/1.13 abstraction ), k ) ) ) ) ) ] )
% 0.47/1.13 , clause( 14, [ =( apply( apply( apply( apply( abstraction, abstraction ),
% 0.47/1.13 k ), X ), Y ), apply( X, X ) ) ] )
% 0.47/1.13 , 0, clause( 53, [ ~( =( apply( b( X ), b( X ) ), apply( apply( X, b( X ) )
% 0.47/1.13 , c( X ) ) ) ) ] )
% 0.47/1.13 , 0, 15, substitution( 0, [ :=( X, b( apply( apply( abstraction,
% 0.47/1.13 abstraction ), k ) ) ), :=( Y, c( apply( apply( abstraction, abstraction
% 0.47/1.13 ), k ) ) )] ), substitution( 1, [ :=( X, apply( apply( abstraction,
% 0.47/1.13 abstraction ), k ) )] )).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 eqrefl(
% 0.47/1.13 clause( 78, [] )
% 0.47/1.13 , clause( 76, [ ~( =( apply( b( apply( apply( abstraction, abstraction ), k
% 0.47/1.13 ) ), b( apply( apply( abstraction, abstraction ), k ) ) ), apply( b(
% 0.47/1.13 apply( apply( abstraction, abstraction ), k ) ), b( apply( apply(
% 0.47/1.13 abstraction, abstraction ), k ) ) ) ) ) ] )
% 0.47/1.13 , 0, substitution( 0, [] )).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 subsumption(
% 0.47/1.13 clause( 17, [] )
% 0.47/1.13 , clause( 78, [] )
% 0.47/1.13 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 end.
% 0.47/1.13
% 0.47/1.13 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.47/1.13
% 0.47/1.13 Memory use:
% 0.47/1.13
% 0.47/1.13 space for terms: 354
% 0.47/1.13 space for clauses: 2518
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 clauses generated: 229
% 0.47/1.13 clauses kept: 18
% 0.47/1.13 clauses selected: 15
% 0.47/1.13 clauses deleted: 0
% 0.47/1.13 clauses inuse deleted: 0
% 0.47/1.13
% 0.47/1.13 subsentry: 211
% 0.47/1.13 literals s-matched: 31
% 0.47/1.13 literals matched: 31
% 0.47/1.13 full subsumption: 0
% 0.47/1.13
% 0.47/1.13 checksum: -1731616517
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 Bliksem ended
%------------------------------------------------------------------------------