TSTP Solution File: COL022-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : COL022-1 : 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 : Fri Jul 15 00:12:24 EDT 2022
% Result : Unsatisfiable 0.70s 1.08s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COL022-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/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 : Tue May 31 12:08:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.70/1.08 *** allocated 10000 integers for termspace/termends
% 0.70/1.08 *** allocated 10000 integers for clauses
% 0.70/1.08 *** allocated 10000 integers for justifications
% 0.70/1.08 Bliksem 1.12
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 Automatic Strategy Selection
% 0.70/1.08
% 0.70/1.08 Clauses:
% 0.70/1.08 [
% 0.70/1.08 [ =( apply( apply( apply( b, X ), Y ), Z ), apply( X, apply( Y, Z ) ) )
% 0.70/1.08 ],
% 0.70/1.08 [ =( apply( m, X ), apply( X, X ) ) ],
% 0.70/1.08 [ =( apply( apply( o, X ), Y ), apply( Y, apply( X, Y ) ) ) ],
% 0.70/1.08 [ ~( =( X, apply( combinator, X ) ) ) ]
% 0.70/1.08 ] .
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 percentage equality = 1.000000, percentage horn = 1.000000
% 0.70/1.08 This is a pure equality problem
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 Options Used:
% 0.70/1.08
% 0.70/1.08 useres = 1
% 0.70/1.08 useparamod = 1
% 0.70/1.08 useeqrefl = 1
% 0.70/1.08 useeqfact = 1
% 0.70/1.08 usefactor = 1
% 0.70/1.08 usesimpsplitting = 0
% 0.70/1.08 usesimpdemod = 5
% 0.70/1.08 usesimpres = 3
% 0.70/1.08
% 0.70/1.08 resimpinuse = 1000
% 0.70/1.08 resimpclauses = 20000
% 0.70/1.08 substype = eqrewr
% 0.70/1.08 backwardsubs = 1
% 0.70/1.08 selectoldest = 5
% 0.70/1.08
% 0.70/1.08 litorderings [0] = split
% 0.70/1.08 litorderings [1] = extend the termordering, first sorting on arguments
% 0.70/1.08
% 0.70/1.08 termordering = kbo
% 0.70/1.08
% 0.70/1.08 litapriori = 0
% 0.70/1.08 termapriori = 1
% 0.70/1.08 litaposteriori = 0
% 0.70/1.08 termaposteriori = 0
% 0.70/1.08 demodaposteriori = 0
% 0.70/1.08 ordereqreflfact = 0
% 0.70/1.08
% 0.70/1.08 litselect = negord
% 0.70/1.08
% 0.70/1.08 maxweight = 15
% 0.70/1.08 maxdepth = 30000
% 0.70/1.08 maxlength = 115
% 0.70/1.08 maxnrvars = 195
% 0.70/1.08 excuselevel = 1
% 0.70/1.08 increasemaxweight = 1
% 0.70/1.08
% 0.70/1.08 maxselected = 10000000
% 0.70/1.08 maxnrclauses = 10000000
% 0.70/1.08
% 0.70/1.08 showgenerated = 0
% 0.70/1.08 showkept = 0
% 0.70/1.08 showselected = 0
% 0.70/1.08 showdeleted = 0
% 0.70/1.08 showresimp = 1
% 0.70/1.08 showstatus = 2000
% 0.70/1.08
% 0.70/1.08 prologoutput = 1
% 0.70/1.08 nrgoals = 5000000
% 0.70/1.08 totalproof = 1
% 0.70/1.08
% 0.70/1.08 Symbols occurring in the translation:
% 0.70/1.08
% 0.70/1.08 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.70/1.08 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.70/1.08 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 0.70/1.08 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.08 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.70/1.08 b [39, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.70/1.08 apply [41, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.70/1.08 m [44, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.70/1.08 o [45, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.70/1.08 combinator [46, 0] (w:1, o:15, a:1, s:1, b:0).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 Starting Search:
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 Bliksems!, er is een bewijs:
% 0.70/1.08 % SZS status Unsatisfiable
% 0.70/1.08 % SZS output start Refutation
% 0.70/1.08
% 0.70/1.08 clause( 0, [ =( apply( apply( apply( b, X ), Y ), Z ), apply( X, apply( Y,
% 0.70/1.08 Z ) ) ) ] )
% 0.70/1.08 .
% 0.70/1.08 clause( 1, [ =( apply( m, X ), apply( X, X ) ) ] )
% 0.70/1.08 .
% 0.70/1.08 clause( 3, [ ~( =( apply( combinator, X ), X ) ) ] )
% 0.70/1.08 .
% 0.70/1.08 clause( 21, [ =( apply( X, apply( Y, apply( apply( b, X ), Y ) ) ), apply(
% 0.70/1.08 m, apply( apply( b, X ), Y ) ) ) ] )
% 0.70/1.08 .
% 0.70/1.08 clause( 71, [] )
% 0.70/1.08 .
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 % SZS output end Refutation
% 0.70/1.08 found a proof!
% 0.70/1.08
% 0.70/1.08 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.70/1.08
% 0.70/1.08 initialclauses(
% 0.70/1.08 [ clause( 73, [ =( apply( apply( apply( b, X ), Y ), Z ), apply( X, apply(
% 0.70/1.08 Y, Z ) ) ) ] )
% 0.70/1.08 , clause( 74, [ =( apply( m, X ), apply( X, X ) ) ] )
% 0.70/1.08 , clause( 75, [ =( apply( apply( o, X ), Y ), apply( Y, apply( X, Y ) ) ) ]
% 0.70/1.08 )
% 0.70/1.08 , clause( 76, [ ~( =( X, apply( combinator, X ) ) ) ] )
% 0.70/1.08 ] ).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 subsumption(
% 0.70/1.08 clause( 0, [ =( apply( apply( apply( b, X ), Y ), Z ), apply( X, apply( Y,
% 0.70/1.08 Z ) ) ) ] )
% 0.70/1.08 , clause( 73, [ =( apply( apply( apply( b, X ), Y ), Z ), apply( X, apply(
% 0.70/1.08 Y, Z ) ) ) ] )
% 0.70/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.70/1.08 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 subsumption(
% 0.70/1.08 clause( 1, [ =( apply( m, X ), apply( X, X ) ) ] )
% 0.70/1.08 , clause( 74, [ =( apply( m, X ), apply( X, X ) ) ] )
% 0.70/1.08 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 eqswap(
% 0.70/1.08 clause( 83, [ ~( =( apply( combinator, X ), X ) ) ] )
% 0.70/1.08 , clause( 76, [ ~( =( X, apply( combinator, X ) ) ) ] )
% 0.70/1.08 , 0, substitution( 0, [ :=( X, X )] )).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 subsumption(
% 0.70/1.08 clause( 3, [ ~( =( apply( combinator, X ), X ) ) ] )
% 0.70/1.08 , clause( 83, [ ~( =( apply( combinator, X ), X ) ) ] )
% 0.70/1.08 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 eqswap(
% 0.70/1.08 clause( 84, [ =( apply( X, apply( Y, Z ) ), apply( apply( apply( b, X ), Y
% 0.70/1.08 ), Z ) ) ] )
% 0.70/1.08 , clause( 0, [ =( apply( apply( apply( b, X ), Y ), Z ), apply( X, apply( Y
% 0.70/1.08 , Z ) ) ) ] )
% 0.70/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 eqswap(
% 0.70/1.08 clause( 85, [ =( apply( X, X ), apply( m, X ) ) ] )
% 0.70/1.08 , clause( 1, [ =( apply( m, X ), apply( X, X ) ) ] )
% 0.70/1.08 , 0, substitution( 0, [ :=( X, X )] )).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 paramod(
% 0.70/1.08 clause( 88, [ =( apply( X, apply( Y, apply( apply( b, X ), Y ) ) ), apply(
% 0.70/1.08 m, apply( apply( b, X ), Y ) ) ) ] )
% 0.70/1.08 , clause( 85, [ =( apply( X, X ), apply( m, X ) ) ] )
% 0.70/1.08 , 0, clause( 84, [ =( apply( X, apply( Y, Z ) ), apply( apply( apply( b, X
% 0.70/1.08 ), Y ), Z ) ) ] )
% 0.70/1.08 , 0, 10, substitution( 0, [ :=( X, apply( apply( b, X ), Y ) )] ),
% 0.70/1.08 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, apply( apply( b, X ), Y
% 0.70/1.08 ) )] )).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 subsumption(
% 0.70/1.08 clause( 21, [ =( apply( X, apply( Y, apply( apply( b, X ), Y ) ) ), apply(
% 0.70/1.08 m, apply( apply( b, X ), Y ) ) ) ] )
% 0.70/1.08 , clause( 88, [ =( apply( X, apply( Y, apply( apply( b, X ), Y ) ) ), apply(
% 0.70/1.08 m, apply( apply( b, X ), Y ) ) ) ] )
% 0.70/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.70/1.08 )] ) ).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 eqswap(
% 0.70/1.08 clause( 96, [ =( apply( m, apply( apply( b, X ), Y ) ), apply( X, apply( Y
% 0.70/1.08 , apply( apply( b, X ), Y ) ) ) ) ] )
% 0.70/1.08 , clause( 21, [ =( apply( X, apply( Y, apply( apply( b, X ), Y ) ) ), apply(
% 0.70/1.08 m, apply( apply( b, X ), Y ) ) ) ] )
% 0.70/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 eqswap(
% 0.70/1.08 clause( 97, [ ~( =( X, apply( combinator, X ) ) ) ] )
% 0.70/1.08 , clause( 3, [ ~( =( apply( combinator, X ), X ) ) ] )
% 0.70/1.08 , 0, substitution( 0, [ :=( X, X )] )).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 resolution(
% 0.70/1.08 clause( 98, [] )
% 0.70/1.08 , clause( 97, [ ~( =( X, apply( combinator, X ) ) ) ] )
% 0.70/1.08 , 0, clause( 96, [ =( apply( m, apply( apply( b, X ), Y ) ), apply( X,
% 0.70/1.08 apply( Y, apply( apply( b, X ), Y ) ) ) ) ] )
% 0.70/1.08 , 0, substitution( 0, [ :=( X, apply( m, apply( apply( b, combinator ), m )
% 0.70/1.08 ) )] ), substitution( 1, [ :=( X, combinator ), :=( Y, m )] )).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 subsumption(
% 0.70/1.08 clause( 71, [] )
% 0.70/1.08 , clause( 98, [] )
% 0.70/1.08 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 end.
% 0.70/1.08
% 0.70/1.08 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.70/1.08
% 0.70/1.08 Memory use:
% 0.70/1.08
% 0.70/1.08 space for terms: 1083
% 0.70/1.08 space for clauses: 8508
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 clauses generated: 2377
% 0.70/1.08 clauses kept: 72
% 0.70/1.08 clauses selected: 51
% 0.70/1.08 clauses deleted: 5
% 0.70/1.08 clauses inuse deleted: 0
% 0.70/1.08
% 0.70/1.08 subsentry: 295
% 0.70/1.08 literals s-matched: 206
% 0.70/1.08 literals matched: 206
% 0.70/1.08 full subsumption: 0
% 0.70/1.08
% 0.70/1.08 checksum: 1353381106
% 0.70/1.08
% 0.70/1.08
% 0.70/1.08 Bliksem ended
%------------------------------------------------------------------------------