%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : COL008-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n021.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:22 EDT 2022
% Result : Unsatisfiable 0.46s 1.12s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : COL008-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.14 % Command : bliksem %s
% 0.13/0.35 % Computer : n021.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % DateTime : Tue May 31 12:19:44 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.46/1.11 *** allocated 10000 integers for termspace/termends
% 0.46/1.11 *** allocated 10000 integers for clauses
% 0.46/1.11 *** allocated 10000 integers for justifications
% 0.46/1.11 Bliksem 1.12
% 0.46/1.11
% 0.46/1.11
% 0.46/1.11 Automatic Strategy Selection
% 0.46/1.11
% 0.46/1.11 Clauses:
% 0.46/1.11 [
% 0.46/1.11 [ =( apply( apply( apply( b, X ), Y ), Z ), apply( X, apply( Y, Z ) ) )
% 0.46/1.11 ],
% 0.46/1.11 [ =( apply( m, X ), apply( X, X ) ) ],
% 0.46/1.11 [ ~( =( X, apply( combinator, X ) ) ) ]
% 0.46/1.11 ] .
% 0.46/1.11
% 0.46/1.11
% 0.46/1.11 percentage equality = 1.000000, percentage horn = 1.000000
% 0.46/1.11 This is a pure equality problem
% 0.46/1.11
% 0.46/1.11
% 0.46/1.11
% 0.46/1.11 Options Used:
% 0.46/1.11
% 0.46/1.11 useres = 1
% 0.46/1.11 useparamod = 1
% 0.46/1.11 useeqrefl = 1
% 0.46/1.11 useeqfact = 1
% 0.46/1.11 usefactor = 1
% 0.46/1.11 usesimpsplitting = 0
% 0.46/1.11 usesimpdemod = 5
% 0.46/1.11 usesimpres = 3
% 0.46/1.11
% 0.46/1.11 resimpinuse = 1000
% 0.46/1.11 resimpclauses = 20000
% 0.46/1.11 substype = eqrewr
% 0.46/1.11 backwardsubs = 1
% 0.46/1.11 selectoldest = 5
% 0.46/1.11
% 0.46/1.11 litorderings [0] = split
% 0.46/1.11 litorderings [1] = extend the termordering, first sorting on arguments
% 0.46/1.11
% 0.46/1.11 termordering = kbo
% 0.46/1.11
% 0.46/1.11 litapriori = 0
% 0.46/1.11 termapriori = 1
% 0.46/1.11 litaposteriori = 0
% 0.46/1.11 termaposteriori = 0
% 0.46/1.11 demodaposteriori = 0
% 0.46/1.11 ordereqreflfact = 0
% 0.46/1.12
% 0.46/1.12 litselect = negord
% 0.46/1.12
% 0.46/1.12 maxweight = 15
% 0.46/1.12 maxdepth = 30000
% 0.46/1.12 maxlength = 115
% 0.46/1.12 maxnrvars = 195
% 0.46/1.12 excuselevel = 1
% 0.46/1.12 increasemaxweight = 1
% 0.46/1.12
% 0.46/1.12 maxselected = 10000000
% 0.46/1.12 maxnrclauses = 10000000
% 0.46/1.12
% 0.46/1.12 showgenerated = 0
% 0.46/1.12 showkept = 0
% 0.46/1.12 showselected = 0
% 0.46/1.12 showdeleted = 0
% 0.46/1.12 showresimp = 1
% 0.46/1.12 showstatus = 2000
% 0.46/1.12
% 0.46/1.12 prologoutput = 1
% 0.46/1.12 nrgoals = 5000000
% 0.46/1.12 totalproof = 1
% 0.46/1.12
% 0.46/1.12 Symbols occurring in the translation:
% 0.46/1.12
% 0.46/1.12 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.46/1.12 . [1, 2] (w:1, o:20, a:1, s:1, b:0),
% 0.46/1.12 ! [4, 1] (w:0, o:15, a:1, s:1, b:0),
% 0.46/1.12 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.46/1.12 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.46/1.12 b [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.46/1.12 apply [41, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.46/1.12 m [44, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.46/1.12 combinator [45, 0] (w:1, o:14, a:1, s:1, b:0).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 Starting Search:
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 Bliksems!, er is een bewijs:
% 0.46/1.12 % SZS status Unsatisfiable
% 0.46/1.12 % SZS output start Refutation
% 0.46/1.12
% 0.46/1.12 clause( 0, [ =( apply( apply( apply( b, X ), Y ), Z ), apply( X, apply( Y,
% 0.46/1.12 Z ) ) ) ] )
% 0.46/1.12 .
% 0.46/1.12 clause( 1, [ =( apply( m, X ), apply( X, X ) ) ] )
% 0.46/1.12 .
% 0.46/1.12 clause( 2, [ ~( =( apply( combinator, X ), X ) ) ] )
% 0.46/1.12 .
% 0.46/1.12 clause( 4, [ =( apply( X, apply( Y, apply( apply( b, X ), Y ) ) ), apply( m
% 0.46/1.12 , apply( apply( b, X ), Y ) ) ) ] )
% 0.46/1.12 .
% 0.46/1.12 clause( 8, [] )
% 0.46/1.12 .
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 % SZS output end Refutation
% 0.46/1.12 found a proof!
% 0.46/1.12
% 0.46/1.12 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.46/1.12
% 0.46/1.12 initialclauses(
% 0.46/1.12 [ clause( 10, [ =( apply( apply( apply( b, X ), Y ), Z ), apply( X, apply(
% 0.46/1.12 Y, Z ) ) ) ] )
% 0.46/1.12 , clause( 11, [ =( apply( m, X ), apply( X, X ) ) ] )
% 0.46/1.12 , clause( 12, [ ~( =( X, apply( combinator, X ) ) ) ] )
% 0.46/1.12 ] ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 subsumption(
% 0.46/1.12 clause( 0, [ =( apply( apply( apply( b, X ), Y ), Z ), apply( X, apply( Y,
% 0.46/1.12 Z ) ) ) ] )
% 0.46/1.12 , clause( 10, [ =( apply( apply( apply( b, X ), Y ), Z ), apply( X, apply(
% 0.46/1.12 Y, Z ) ) ) ] )
% 0.46/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.46/1.12 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 subsumption(
% 0.46/1.12 clause( 1, [ =( apply( m, X ), apply( X, X ) ) ] )
% 0.46/1.12 , clause( 11, [ =( apply( m, X ), apply( X, X ) ) ] )
% 0.46/1.12 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 eqswap(
% 0.46/1.12 clause( 18, [ ~( =( apply( combinator, X ), X ) ) ] )
% 0.46/1.12 , clause( 12, [ ~( =( X, apply( combinator, X ) ) ) ] )
% 0.46/1.12 , 0, substitution( 0, [ :=( X, X )] )).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 subsumption(
% 0.46/1.12 clause( 2, [ ~( =( apply( combinator, X ), X ) ) ] )
% 0.46/1.12 , clause( 18, [ ~( =( apply( combinator, X ), X ) ) ] )
% 0.46/1.12 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 eqswap(
% 0.46/1.12 clause( 19, [ =( apply( X, apply( Y, Z ) ), apply( apply( apply( b, X ), Y
% 0.46/1.12 ), Z ) ) ] )
% 0.46/1.12 , clause( 0, [ =( apply( apply( apply( b, X ), Y ), Z ), apply( X, apply( Y
% 0.46/1.12 , Z ) ) ) ] )
% 0.46/1.12 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 eqswap(
% 0.46/1.12 clause( 20, [ =( apply( X, X ), apply( m, X ) ) ] )
% 0.46/1.12 , clause( 1, [ =( apply( m, X ), apply( X, X ) ) ] )
% 0.46/1.12 , 0, substitution( 0, [ :=( X, X )] )).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 paramod(
% 0.46/1.12 clause( 23, [ =( apply( X, apply( Y, apply( apply( b, X ), Y ) ) ), apply(
% 0.46/1.12 m, apply( apply( b, X ), Y ) ) ) ] )
% 0.46/1.12 , clause( 20, [ =( apply( X, X ), apply( m, X ) ) ] )
% 0.46/1.12 , 0, clause( 19, [ =( apply( X, apply( Y, Z ) ), apply( apply( apply( b, X
% 0.46/1.12 ), Y ), Z ) ) ] )
% 0.46/1.12 , 0, 10, substitution( 0, [ :=( X, apply( apply( b, X ), Y ) )] ),
% 0.46/1.12 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, apply( apply( b, X ), Y
% 0.46/1.12 ) )] )).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 subsumption(
% 0.46/1.12 clause( 4, [ =( apply( X, apply( Y, apply( apply( b, X ), Y ) ) ), apply( m
% 0.46/1.12 , apply( apply( b, X ), Y ) ) ) ] )
% 0.46/1.12 , clause( 23, [ =( apply( X, apply( Y, apply( apply( b, X ), Y ) ) ), apply(
% 0.46/1.12 m, apply( apply( b, X ), Y ) ) ) ] )
% 0.46/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.46/1.12 )] ) ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 eqswap(
% 0.46/1.12 clause( 31, [ =( apply( m, apply( apply( b, X ), Y ) ), apply( X, apply( Y
% 0.46/1.12 , apply( apply( b, X ), Y ) ) ) ) ] )
% 0.46/1.12 , clause( 4, [ =( apply( X, apply( Y, apply( apply( b, X ), Y ) ) ), apply(
% 0.46/1.12 m, apply( apply( b, X ), Y ) ) ) ] )
% 0.46/1.12 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 eqswap(
% 0.46/1.12 clause( 32, [ ~( =( X, apply( combinator, X ) ) ) ] )
% 0.46/1.12 , clause( 2, [ ~( =( apply( combinator, X ), X ) ) ] )
% 0.46/1.12 , 0, substitution( 0, [ :=( X, X )] )).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 resolution(
% 0.46/1.12 clause( 33, [] )
% 0.46/1.12 , clause( 32, [ ~( =( X, apply( combinator, X ) ) ) ] )
% 0.46/1.12 , 0, clause( 31, [ =( apply( m, apply( apply( b, X ), Y ) ), apply( X,
% 0.46/1.12 apply( Y, apply( apply( b, X ), Y ) ) ) ) ] )
% 0.46/1.12 , 0, substitution( 0, [ :=( X, apply( m, apply( apply( b, combinator ), m )
% 0.46/1.12 ) )] ), substitution( 1, [ :=( X, combinator ), :=( Y, m )] )).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 subsumption(
% 0.46/1.12 clause( 8, [] )
% 0.46/1.12 , clause( 33, [] )
% 0.46/1.12 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 end.
% 0.46/1.12
% 0.46/1.12 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.46/1.12
% 0.46/1.12 Memory use:
% 0.46/1.12
% 0.46/1.12 space for terms: 163
% 0.46/1.12 space for clauses: 1060
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 clauses generated: 26
% 0.46/1.12 clauses kept: 9
% 0.46/1.12 clauses selected: 6
% 0.46/1.12 clauses deleted: 0
% 0.46/1.12 clauses inuse deleted: 0
% 0.46/1.12
% 0.46/1.12 subsentry: 114
% 0.46/1.12 literals s-matched: 28
% 0.46/1.12 literals matched: 28
% 0.46/1.12 full subsumption: 0
% 0.46/1.12
% 0.46/1.12 checksum: 13151717
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 Bliksem ended
%------------------------------------------------------------------------------