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