%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : COL025-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n027.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:24 EDT 2022
% Result : Unsatisfiable 0.45s 1.07s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : COL025-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n027.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 15:24:32 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/1.07 *** allocated 10000 integers for termspace/termends
% 0.45/1.07 *** allocated 10000 integers for clauses
% 0.45/1.07 *** allocated 10000 integers for justifications
% 0.45/1.07 Bliksem 1.12
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 Automatic Strategy Selection
% 0.45/1.07
% 0.45/1.07 Clauses:
% 0.45/1.07 [
% 0.45/1.07 [ =( apply( apply( apply( b, X ), Y ), Z ), apply( X, apply( Y, Z ) ) )
% 0.45/1.07 ],
% 0.45/1.07 [ =( apply( apply( w, X ), Y ), apply( apply( X, Y ), Y ) ) ],
% 0.45/1.07 [ ~( =( X, apply( combinator, X ) ) ) ]
% 0.45/1.07 ] .
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 percentage equality = 1.000000, percentage horn = 1.000000
% 0.45/1.07 This is a pure equality problem
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 Options Used:
% 0.45/1.07
% 0.45/1.07 useres = 1
% 0.45/1.07 useparamod = 1
% 0.45/1.07 useeqrefl = 1
% 0.45/1.07 useeqfact = 1
% 0.45/1.07 usefactor = 1
% 0.45/1.07 usesimpsplitting = 0
% 0.45/1.07 usesimpdemod = 5
% 0.45/1.07 usesimpres = 3
% 0.45/1.07
% 0.45/1.07 resimpinuse = 1000
% 0.45/1.07 resimpclauses = 20000
% 0.45/1.07 substype = eqrewr
% 0.45/1.07 backwardsubs = 1
% 0.45/1.07 selectoldest = 5
% 0.45/1.07
% 0.45/1.07 litorderings [0] = split
% 0.45/1.07 litorderings [1] = extend the termordering, first sorting on arguments
% 0.45/1.07
% 0.45/1.07 termordering = kbo
% 0.45/1.07
% 0.45/1.07 litapriori = 0
% 0.45/1.07 termapriori = 1
% 0.45/1.07 litaposteriori = 0
% 0.45/1.07 termaposteriori = 0
% 0.45/1.07 demodaposteriori = 0
% 0.45/1.07 ordereqreflfact = 0
% 0.45/1.07
% 0.45/1.07 litselect = negord
% 0.45/1.07
% 0.45/1.07 maxweight = 15
% 0.45/1.07 maxdepth = 30000
% 0.45/1.07 maxlength = 115
% 0.45/1.07 maxnrvars = 195
% 0.45/1.07 excuselevel = 1
% 0.45/1.07 increasemaxweight = 1
% 0.45/1.07
% 0.45/1.07 maxselected = 10000000
% 0.45/1.07 maxnrclauses = 10000000
% 0.45/1.07
% 0.45/1.07 showgenerated = 0
% 0.45/1.07 showkept = 0
% 0.45/1.07 showselected = 0
% 0.45/1.07 showdeleted = 0
% 0.45/1.07 showresimp = 1
% 0.45/1.07 showstatus = 2000
% 0.45/1.07
% 0.45/1.07 prologoutput = 1
% 0.45/1.07 nrgoals = 5000000
% 0.45/1.07 totalproof = 1
% 0.45/1.07
% 0.45/1.07 Symbols occurring in the translation:
% 0.45/1.07
% 0.45/1.07 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.45/1.07 . [1, 2] (w:1, o:20, a:1, s:1, b:0),
% 0.45/1.07 ! [4, 1] (w:0, o:15, a:1, s:1, b:0),
% 0.45/1.07 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.45/1.07 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.45/1.07 b [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.45/1.07 apply [41, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.45/1.07 w [44, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.45/1.07 combinator [45, 0] (w:1, o:14, a:1, s:1, b:0).
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 Starting Search:
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 Bliksems!, er is een bewijs:
% 0.45/1.07 % SZS status Unsatisfiable
% 0.45/1.07 % SZS output start Refutation
% 0.45/1.07
% 0.45/1.07 clause( 0, [ =( apply( apply( apply( b, X ), Y ), Z ), apply( X, apply( Y,
% 0.45/1.07 Z ) ) ) ] )
% 0.45/1.07 .
% 0.45/1.07 clause( 1, [ =( apply( apply( w, X ), Y ), apply( apply( X, Y ), Y ) ) ] )
% 0.45/1.07 .
% 0.45/1.07 clause( 2, [ ~( =( apply( combinator, X ), X ) ) ] )
% 0.45/1.07 .
% 0.45/1.07 clause( 9, [ =( apply( apply( w, apply( b, X ) ), Y ), apply( X, apply( Y,
% 0.45/1.07 Y ) ) ) ] )
% 0.45/1.07 .
% 0.45/1.07 clause( 13, [ ~( =( apply( apply( w, apply( b, combinator ) ), X ), apply(
% 0.45/1.07 X, X ) ) ) ] )
% 0.45/1.07 .
% 0.45/1.07 clause( 14, [] )
% 0.45/1.07 .
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 % SZS output end Refutation
% 0.45/1.07 found a proof!
% 0.45/1.07
% 0.45/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.45/1.07
% 0.45/1.07 initialclauses(
% 0.45/1.07 [ clause( 16, [ =( apply( apply( apply( b, X ), Y ), Z ), apply( X, apply(
% 0.45/1.07 Y, Z ) ) ) ] )
% 0.45/1.07 , clause( 17, [ =( apply( apply( w, X ), Y ), apply( apply( X, Y ), Y ) ) ]
% 0.45/1.07 )
% 0.45/1.07 , clause( 18, [ ~( =( X, apply( combinator, X ) ) ) ] )
% 0.45/1.07 ] ).
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 subsumption(
% 0.45/1.07 clause( 0, [ =( apply( apply( apply( b, X ), Y ), Z ), apply( X, apply( Y,
% 0.45/1.07 Z ) ) ) ] )
% 0.45/1.07 , clause( 16, [ =( apply( apply( apply( b, X ), Y ), Z ), apply( X, apply(
% 0.45/1.07 Y, Z ) ) ) ] )
% 0.45/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.45/1.07 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 subsumption(
% 0.45/1.07 clause( 1, [ =( apply( apply( w, X ), Y ), apply( apply( X, Y ), Y ) ) ] )
% 0.45/1.07 , clause( 17, [ =( apply( apply( w, X ), Y ), apply( apply( X, Y ), Y ) ) ]
% 0.45/1.07 )
% 0.45/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.45/1.07 )] ) ).
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 eqswap(
% 0.45/1.07 clause( 24, [ ~( =( apply( combinator, X ), X ) ) ] )
% 0.45/1.07 , clause( 18, [ ~( =( X, apply( combinator, X ) ) ) ] )
% 0.45/1.07 , 0, substitution( 0, [ :=( X, X )] )).
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 subsumption(
% 0.45/1.07 clause( 2, [ ~( =( apply( combinator, X ), X ) ) ] )
% 0.45/1.07 , clause( 24, [ ~( =( apply( combinator, X ), X ) ) ] )
% 0.45/1.07 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 eqswap(
% 0.45/1.07 clause( 25, [ =( apply( X, apply( Y, Z ) ), apply( apply( apply( b, X ), Y
% 0.45/1.07 ), Z ) ) ] )
% 0.45/1.07 , clause( 0, [ =( apply( apply( apply( b, X ), Y ), Z ), apply( X, apply( Y
% 0.45/1.07 , Z ) ) ) ] )
% 0.45/1.07 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 eqswap(
% 0.45/1.07 clause( 26, [ =( apply( apply( X, Y ), Y ), apply( apply( w, X ), Y ) ) ]
% 0.45/1.07 )
% 0.45/1.07 , clause( 1, [ =( apply( apply( w, X ), Y ), apply( apply( X, Y ), Y ) ) ]
% 0.45/1.08 )
% 0.45/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.45/1.08
% 0.45/1.08
% 0.45/1.08 paramod(
% 0.45/1.08 clause( 29, [ =( apply( X, apply( Y, Y ) ), apply( apply( w, apply( b, X )
% 0.45/1.08 ), Y ) ) ] )
% 0.45/1.08 , clause( 26, [ =( apply( apply( X, Y ), Y ), apply( apply( w, X ), Y ) ) ]
% 0.45/1.08 )
% 0.45/1.08 , 0, clause( 25, [ =( apply( X, apply( Y, Z ) ), apply( apply( apply( b, X
% 0.45/1.08 ), Y ), Z ) ) ] )
% 0.45/1.08 , 0, 6, substitution( 0, [ :=( X, apply( b, X ) ), :=( Y, Y )] ),
% 0.45/1.08 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Y )] )).
% 0.45/1.08
% 0.45/1.08
% 0.45/1.08 eqswap(
% 0.45/1.08 clause( 33, [ =( apply( apply( w, apply( b, X ) ), Y ), apply( X, apply( Y
% 0.45/1.08 , Y ) ) ) ] )
% 0.45/1.08 , clause( 29, [ =( apply( X, apply( Y, Y ) ), apply( apply( w, apply( b, X
% 0.45/1.08 ) ), Y ) ) ] )
% 0.45/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.45/1.08
% 0.45/1.08
% 0.45/1.08 subsumption(
% 0.45/1.08 clause( 9, [ =( apply( apply( w, apply( b, X ) ), Y ), apply( X, apply( Y,
% 0.45/1.08 Y ) ) ) ] )
% 0.45/1.08 , clause( 33, [ =( apply( apply( w, apply( b, X ) ), Y ), apply( X, apply(
% 0.45/1.08 Y, Y ) ) ) ] )
% 0.45/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.45/1.08 )] ) ).
% 0.45/1.08
% 0.45/1.08
% 0.45/1.08 eqswap(
% 0.45/1.08 clause( 35, [ =( apply( X, apply( Y, Y ) ), apply( apply( w, apply( b, X )
% 0.45/1.08 ), Y ) ) ] )
% 0.45/1.08 , clause( 9, [ =( apply( apply( w, apply( b, X ) ), Y ), apply( X, apply( Y
% 0.45/1.08 , Y ) ) ) ] )
% 0.45/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.45/1.08
% 0.45/1.08
% 0.45/1.08 eqswap(
% 0.45/1.08 clause( 36, [ ~( =( X, apply( combinator, X ) ) ) ] )
% 0.45/1.08 , clause( 2, [ ~( =( apply( combinator, X ), X ) ) ] )
% 0.45/1.08 , 0, substitution( 0, [ :=( X, X )] )).
% 0.45/1.08
% 0.45/1.08
% 0.45/1.08 paramod(
% 0.45/1.08 clause( 37, [ ~( =( apply( X, X ), apply( apply( w, apply( b, combinator )
% 0.45/1.08 ), X ) ) ) ] )
% 0.45/1.08 , clause( 35, [ =( apply( X, apply( Y, Y ) ), apply( apply( w, apply( b, X
% 0.45/1.08 ) ), Y ) ) ] )
% 0.45/1.08 , 0, clause( 36, [ ~( =( X, apply( combinator, X ) ) ) ] )
% 0.45/1.08 , 0, 5, substitution( 0, [ :=( X, combinator ), :=( Y, X )] ),
% 0.45/1.08 substitution( 1, [ :=( X, apply( X, X ) )] )).
% 0.45/1.08
% 0.45/1.08
% 0.45/1.08 eqswap(
% 0.45/1.08 clause( 38, [ ~( =( apply( apply( w, apply( b, combinator ) ), X ), apply(
% 0.45/1.08 X, X ) ) ) ] )
% 0.45/1.08 , clause( 37, [ ~( =( apply( X, X ), apply( apply( w, apply( b, combinator
% 0.45/1.08 ) ), X ) ) ) ] )
% 0.45/1.08 , 0, substitution( 0, [ :=( X, X )] )).
% 0.45/1.08
% 0.45/1.08
% 0.45/1.08 subsumption(
% 0.45/1.08 clause( 13, [ ~( =( apply( apply( w, apply( b, combinator ) ), X ), apply(
% 0.45/1.08 X, X ) ) ) ] )
% 0.45/1.08 , clause( 38, [ ~( =( apply( apply( w, apply( b, combinator ) ), X ), apply(
% 0.45/1.08 X, X ) ) ) ] )
% 0.45/1.08 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.45/1.08
% 0.45/1.08
% 0.45/1.08 eqswap(
% 0.45/1.08 clause( 39, [ ~( =( apply( X, X ), apply( apply( w, apply( b, combinator )
% 0.45/1.08 ), X ) ) ) ] )
% 0.45/1.08 , clause( 13, [ ~( =( apply( apply( w, apply( b, combinator ) ), X ), apply(
% 0.45/1.08 X, X ) ) ) ] )
% 0.45/1.08 , 0, substitution( 0, [ :=( X, X )] )).
% 0.45/1.08
% 0.45/1.08
% 0.45/1.08 eqrefl(
% 0.45/1.08 clause( 40, [] )
% 0.45/1.08 , clause( 39, [ ~( =( apply( X, X ), apply( apply( w, apply( b, combinator
% 0.45/1.08 ) ), X ) ) ) ] )
% 0.45/1.08 , 0, substitution( 0, [ :=( X, apply( w, apply( b, combinator ) ) )] )).
% 0.45/1.08
% 0.45/1.08
% 0.45/1.08 subsumption(
% 0.45/1.08 clause( 14, [] )
% 0.45/1.08 , clause( 40, [] )
% 0.45/1.08 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.45/1.08
% 0.45/1.08
% 0.45/1.08 end.
% 0.45/1.08
% 0.45/1.08 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.45/1.08
% 0.45/1.08 Memory use:
% 0.45/1.08
% 0.45/1.08 space for terms: 263
% 0.45/1.08 space for clauses: 1718
% 0.45/1.08
% 0.45/1.08
% 0.45/1.08 clauses generated: 88
% 0.45/1.08 clauses kept: 15
% 0.45/1.08 clauses selected: 5
% 0.45/1.08 clauses deleted: 0
% 0.45/1.08 clauses inuse deleted: 0
% 0.45/1.08
% 0.45/1.08 subsentry: 106
% 0.45/1.08 literals s-matched: 38
% 0.45/1.08 literals matched: 38
% 0.45/1.08 full subsumption: 0
% 0.45/1.08
% 0.45/1.08 checksum: -1686144226
% 0.45/1.08
% 0.45/1.08
% 0.45/1.08 Bliksem ended
%------------------------------------------------------------------------------