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