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