TSTP Solution File: COL048-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : COL048-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n029.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:29 EDT 2022
% Result : Unsatisfiable 0.69s 1.09s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COL048-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n029.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 04:41:14 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.69/1.09 *** allocated 10000 integers for termspace/termends
% 0.69/1.09 *** allocated 10000 integers for clauses
% 0.69/1.09 *** allocated 10000 integers for justifications
% 0.69/1.09 Bliksem 1.12
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Automatic Strategy Selection
% 0.69/1.09
% 0.69/1.09 Clauses:
% 0.69/1.09 [
% 0.69/1.09 [ =( apply( apply( apply( b, X ), Y ), Z ), apply( X, apply( Y, Z ) ) )
% 0.69/1.09 ],
% 0.69/1.09 [ =( apply( apply( w, X ), Y ), apply( apply( X, Y ), Y ) ) ],
% 0.69/1.09 [ =( apply( m, X ), apply( X, X ) ) ],
% 0.69/1.09 [ ~( =( X, apply( combinator, X ) ) ) ]
% 0.69/1.09 ] .
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 percentage equality = 1.000000, percentage horn = 1.000000
% 0.69/1.09 This is a pure equality problem
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Options Used:
% 0.69/1.09
% 0.69/1.09 useres = 1
% 0.69/1.09 useparamod = 1
% 0.69/1.09 useeqrefl = 1
% 0.69/1.09 useeqfact = 1
% 0.69/1.09 usefactor = 1
% 0.69/1.09 usesimpsplitting = 0
% 0.69/1.09 usesimpdemod = 5
% 0.69/1.09 usesimpres = 3
% 0.69/1.09
% 0.69/1.09 resimpinuse = 1000
% 0.69/1.09 resimpclauses = 20000
% 0.69/1.09 substype = eqrewr
% 0.69/1.09 backwardsubs = 1
% 0.69/1.09 selectoldest = 5
% 0.69/1.09
% 0.69/1.09 litorderings [0] = split
% 0.69/1.09 litorderings [1] = extend the termordering, first sorting on arguments
% 0.69/1.09
% 0.69/1.09 termordering = kbo
% 0.69/1.09
% 0.69/1.09 litapriori = 0
% 0.69/1.09 termapriori = 1
% 0.69/1.09 litaposteriori = 0
% 0.69/1.09 termaposteriori = 0
% 0.69/1.09 demodaposteriori = 0
% 0.69/1.09 ordereqreflfact = 0
% 0.69/1.09
% 0.69/1.09 litselect = negord
% 0.69/1.09
% 0.69/1.09 maxweight = 15
% 0.69/1.09 maxdepth = 30000
% 0.69/1.09 maxlength = 115
% 0.69/1.09 maxnrvars = 195
% 0.69/1.09 excuselevel = 1
% 0.69/1.09 increasemaxweight = 1
% 0.69/1.09
% 0.69/1.09 maxselected = 10000000
% 0.69/1.09 maxnrclauses = 10000000
% 0.69/1.09
% 0.69/1.09 showgenerated = 0
% 0.69/1.09 showkept = 0
% 0.69/1.09 showselected = 0
% 0.69/1.09 showdeleted = 0
% 0.69/1.09 showresimp = 1
% 0.69/1.09 showstatus = 2000
% 0.69/1.09
% 0.69/1.09 prologoutput = 1
% 0.69/1.09 nrgoals = 5000000
% 0.69/1.09 totalproof = 1
% 0.69/1.09
% 0.69/1.09 Symbols occurring in the translation:
% 0.69/1.09
% 0.69/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.69/1.09 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.69/1.09 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 0.69/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.09 b [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.69/1.09 apply [41, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.69/1.09 w [44, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.69/1.09 m [45, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.69/1.09 combinator [46, 0] (w:1, o:15, a:1, s:1, b:0).
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Starting Search:
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Bliksems!, er is een bewijs:
% 0.69/1.09 % SZS status Unsatisfiable
% 0.69/1.09 % SZS output start Refutation
% 0.69/1.09
% 0.69/1.09 clause( 0, [ =( apply( apply( apply( b, X ), Y ), Z ), apply( X, apply( Y,
% 0.69/1.09 Z ) ) ) ] )
% 0.69/1.09 .
% 0.69/1.09 clause( 2, [ =( apply( m, X ), apply( X, X ) ) ] )
% 0.69/1.09 .
% 0.69/1.09 clause( 3, [ ~( =( apply( combinator, X ), X ) ) ] )
% 0.69/1.09 .
% 0.69/1.09 clause( 19, [ =( apply( X, apply( Y, apply( apply( b, X ), Y ) ) ), apply(
% 0.69/1.09 m, apply( apply( b, X ), Y ) ) ) ] )
% 0.69/1.09 .
% 0.69/1.09 clause( 103, [] )
% 0.69/1.09 .
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 % SZS output end Refutation
% 0.69/1.09 found a proof!
% 0.69/1.09
% 0.69/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.69/1.09
% 0.69/1.09 initialclauses(
% 0.69/1.09 [ clause( 105, [ =( apply( apply( apply( b, X ), Y ), Z ), apply( X, apply(
% 0.69/1.09 Y, Z ) ) ) ] )
% 0.69/1.09 , clause( 106, [ =( apply( apply( w, X ), Y ), apply( apply( X, Y ), Y ) )
% 0.69/1.09 ] )
% 0.69/1.09 , clause( 107, [ =( apply( m, X ), apply( X, X ) ) ] )
% 0.69/1.09 , clause( 108, [ ~( =( X, apply( combinator, X ) ) ) ] )
% 0.69/1.09 ] ).
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 subsumption(
% 0.69/1.09 clause( 0, [ =( apply( apply( apply( b, X ), Y ), Z ), apply( X, apply( Y,
% 0.69/1.09 Z ) ) ) ] )
% 0.69/1.09 , clause( 105, [ =( apply( apply( apply( b, X ), Y ), Z ), apply( X, apply(
% 0.69/1.09 Y, Z ) ) ) ] )
% 0.69/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.69/1.09 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 subsumption(
% 0.69/1.09 clause( 2, [ =( apply( m, X ), apply( X, X ) ) ] )
% 0.69/1.09 , clause( 107, [ =( apply( m, X ), apply( X, X ) ) ] )
% 0.69/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 eqswap(
% 0.69/1.09 clause( 116, [ ~( =( apply( combinator, X ), X ) ) ] )
% 0.69/1.09 , clause( 108, [ ~( =( X, apply( combinator, X ) ) ) ] )
% 0.69/1.09 , 0, substitution( 0, [ :=( X, X )] )).
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 subsumption(
% 0.69/1.09 clause( 3, [ ~( =( apply( combinator, X ), X ) ) ] )
% 0.69/1.09 , clause( 116, [ ~( =( apply( combinator, X ), X ) ) ] )
% 0.69/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 eqswap(
% 0.69/1.09 clause( 117, [ =( apply( X, apply( Y, Z ) ), apply( apply( apply( b, X ), Y
% 0.69/1.09 ), Z ) ) ] )
% 0.69/1.09 , clause( 0, [ =( apply( apply( apply( b, X ), Y ), Z ), apply( X, apply( Y
% 0.69/1.09 , Z ) ) ) ] )
% 0.69/1.09 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 eqswap(
% 0.69/1.09 clause( 118, [ =( apply( X, X ), apply( m, X ) ) ] )
% 0.69/1.09 , clause( 2, [ =( apply( m, X ), apply( X, X ) ) ] )
% 0.69/1.09 , 0, substitution( 0, [ :=( X, X )] )).
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 paramod(
% 0.69/1.09 clause( 121, [ =( apply( X, apply( Y, apply( apply( b, X ), Y ) ) ), apply(
% 0.69/1.09 m, apply( apply( b, X ), Y ) ) ) ] )
% 0.69/1.09 , clause( 118, [ =( apply( X, X ), apply( m, X ) ) ] )
% 0.69/1.09 , 0, clause( 117, [ =( apply( X, apply( Y, Z ) ), apply( apply( apply( b, X
% 0.69/1.09 ), Y ), Z ) ) ] )
% 0.69/1.09 , 0, 10, substitution( 0, [ :=( X, apply( apply( b, X ), Y ) )] ),
% 0.69/1.09 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, apply( apply( b, X ), Y
% 0.69/1.09 ) )] )).
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 subsumption(
% 0.69/1.09 clause( 19, [ =( apply( X, apply( Y, apply( apply( b, X ), Y ) ) ), apply(
% 0.69/1.09 m, apply( apply( b, X ), Y ) ) ) ] )
% 0.69/1.09 , clause( 121, [ =( apply( X, apply( Y, apply( apply( b, X ), Y ) ) ),
% 0.69/1.09 apply( m, apply( apply( b, X ), Y ) ) ) ] )
% 0.69/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.69/1.09 )] ) ).
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 eqswap(
% 0.69/1.09 clause( 129, [ =( apply( m, apply( apply( b, X ), Y ) ), apply( X, apply( Y
% 0.69/1.09 , apply( apply( b, X ), Y ) ) ) ) ] )
% 0.69/1.09 , clause( 19, [ =( apply( X, apply( Y, apply( apply( b, X ), Y ) ) ), apply(
% 0.69/1.09 m, apply( apply( b, X ), Y ) ) ) ] )
% 0.69/1.09 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 eqswap(
% 0.69/1.09 clause( 130, [ ~( =( X, apply( combinator, X ) ) ) ] )
% 0.69/1.09 , clause( 3, [ ~( =( apply( combinator, X ), X ) ) ] )
% 0.69/1.09 , 0, substitution( 0, [ :=( X, X )] )).
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 resolution(
% 0.69/1.09 clause( 131, [] )
% 0.69/1.09 , clause( 130, [ ~( =( X, apply( combinator, X ) ) ) ] )
% 0.69/1.09 , 0, clause( 129, [ =( apply( m, apply( apply( b, X ), Y ) ), apply( X,
% 0.69/1.09 apply( Y, apply( apply( b, X ), Y ) ) ) ) ] )
% 0.69/1.09 , 0, substitution( 0, [ :=( X, apply( m, apply( apply( b, combinator ), m )
% 0.69/1.09 ) )] ), substitution( 1, [ :=( X, combinator ), :=( Y, m )] )).
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 subsumption(
% 0.69/1.09 clause( 103, [] )
% 0.69/1.09 , clause( 131, [] )
% 0.69/1.09 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 end.
% 0.69/1.09
% 0.69/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.69/1.09
% 0.69/1.09 Memory use:
% 0.69/1.09
% 0.69/1.09 space for terms: 1526
% 0.69/1.09 space for clauses: 11247
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 clauses generated: 1931
% 0.69/1.09 clauses kept: 104
% 0.69/1.09 clauses selected: 41
% 0.69/1.09 clauses deleted: 5
% 0.69/1.09 clauses inuse deleted: 0
% 0.69/1.09
% 0.69/1.09 subsentry: 484
% 0.69/1.09 literals s-matched: 392
% 0.69/1.09 literals matched: 392
% 0.69/1.09 full subsumption: 0
% 0.69/1.09
% 0.69/1.09 checksum: -400868921
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Bliksem ended
%------------------------------------------------------------------------------