TSTP Solution File: COL018-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : COL018-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:23 EDT 2022
% Result : Unsatisfiable 0.42s 1.06s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COL018-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/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 06:43:14 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.42/1.06 *** allocated 10000 integers for termspace/termends
% 0.42/1.06 *** allocated 10000 integers for clauses
% 0.42/1.06 *** allocated 10000 integers for justifications
% 0.42/1.06 Bliksem 1.12
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Automatic Strategy Selection
% 0.42/1.06
% 0.42/1.06 Clauses:
% 0.42/1.06 [
% 0.42/1.06 [ =( apply( apply( l, X ), Y ), apply( X, apply( Y, Y ) ) ) ],
% 0.42/1.06 [ =( apply( apply( w, X ), Y ), apply( apply( X, Y ), Y ) ) ],
% 0.42/1.06 [ =( apply( apply( apply( q, X ), Y ), Z ), apply( Y, apply( X, Z ) ) )
% 0.42/1.06 ],
% 0.42/1.06 [ ~( =( X, apply( combinator, X ) ) ) ]
% 0.42/1.06 ] .
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 percentage equality = 1.000000, percentage horn = 1.000000
% 0.42/1.06 This is a pure equality problem
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Options Used:
% 0.42/1.06
% 0.42/1.06 useres = 1
% 0.42/1.06 useparamod = 1
% 0.42/1.06 useeqrefl = 1
% 0.42/1.06 useeqfact = 1
% 0.42/1.06 usefactor = 1
% 0.42/1.06 usesimpsplitting = 0
% 0.42/1.06 usesimpdemod = 5
% 0.42/1.06 usesimpres = 3
% 0.42/1.06
% 0.42/1.06 resimpinuse = 1000
% 0.42/1.06 resimpclauses = 20000
% 0.42/1.06 substype = eqrewr
% 0.42/1.06 backwardsubs = 1
% 0.42/1.06 selectoldest = 5
% 0.42/1.06
% 0.42/1.06 litorderings [0] = split
% 0.42/1.06 litorderings [1] = extend the termordering, first sorting on arguments
% 0.42/1.06
% 0.42/1.06 termordering = kbo
% 0.42/1.06
% 0.42/1.06 litapriori = 0
% 0.42/1.06 termapriori = 1
% 0.42/1.06 litaposteriori = 0
% 0.42/1.06 termaposteriori = 0
% 0.42/1.06 demodaposteriori = 0
% 0.42/1.06 ordereqreflfact = 0
% 0.42/1.06
% 0.42/1.06 litselect = negord
% 0.42/1.06
% 0.42/1.06 maxweight = 15
% 0.42/1.06 maxdepth = 30000
% 0.42/1.06 maxlength = 115
% 0.42/1.06 maxnrvars = 195
% 0.42/1.06 excuselevel = 1
% 0.42/1.06 increasemaxweight = 1
% 0.42/1.06
% 0.42/1.06 maxselected = 10000000
% 0.42/1.06 maxnrclauses = 10000000
% 0.42/1.06
% 0.42/1.06 showgenerated = 0
% 0.42/1.06 showkept = 0
% 0.42/1.06 showselected = 0
% 0.42/1.06 showdeleted = 0
% 0.42/1.06 showresimp = 1
% 0.42/1.06 showstatus = 2000
% 0.42/1.06
% 0.42/1.06 prologoutput = 1
% 0.42/1.06 nrgoals = 5000000
% 0.42/1.06 totalproof = 1
% 0.42/1.06
% 0.42/1.06 Symbols occurring in the translation:
% 0.42/1.06
% 0.42/1.06 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.42/1.06 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.42/1.06 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 0.42/1.06 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.42/1.06 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.42/1.06 l [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.42/1.06 apply [41, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.42/1.06 w [43, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.42/1.06 q [44, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.42/1.06 combinator [46, 0] (w:1, o:15, a:1, s:1, b:0).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Starting Search:
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Bliksems!, er is een bewijs:
% 0.42/1.06 % SZS status Unsatisfiable
% 0.42/1.06 % SZS output start Refutation
% 0.42/1.06
% 0.42/1.06 clause( 0, [ =( apply( apply( l, X ), Y ), apply( X, apply( Y, Y ) ) ) ] )
% 0.42/1.06 .
% 0.42/1.06 clause( 3, [ ~( =( apply( combinator, X ), X ) ) ] )
% 0.42/1.06 .
% 0.42/1.06 clause( 18, [ ~( =( apply( apply( l, combinator ), X ), apply( X, X ) ) ) ]
% 0.42/1.06 )
% 0.42/1.06 .
% 0.42/1.06 clause( 19, [] )
% 0.42/1.06 .
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 % SZS output end Refutation
% 0.42/1.06 found a proof!
% 0.42/1.06
% 0.42/1.06 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.42/1.06
% 0.42/1.06 initialclauses(
% 0.42/1.06 [ clause( 21, [ =( apply( apply( l, X ), Y ), apply( X, apply( Y, Y ) ) ) ]
% 0.42/1.06 )
% 0.42/1.06 , clause( 22, [ =( apply( apply( w, X ), Y ), apply( apply( X, Y ), Y ) ) ]
% 0.42/1.06 )
% 0.42/1.06 , clause( 23, [ =( apply( apply( apply( q, X ), Y ), Z ), apply( Y, apply(
% 0.42/1.06 X, Z ) ) ) ] )
% 0.42/1.06 , clause( 24, [ ~( =( X, apply( combinator, X ) ) ) ] )
% 0.42/1.06 ] ).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 subsumption(
% 0.42/1.06 clause( 0, [ =( apply( apply( l, X ), Y ), apply( X, apply( Y, Y ) ) ) ] )
% 0.42/1.06 , clause( 21, [ =( apply( apply( l, X ), Y ), apply( X, apply( Y, Y ) ) ) ]
% 0.42/1.06 )
% 0.42/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.42/1.06 )] ) ).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 eqswap(
% 0.42/1.06 clause( 29, [ ~( =( apply( combinator, X ), X ) ) ] )
% 0.42/1.06 , clause( 24, [ ~( =( X, apply( combinator, X ) ) ) ] )
% 0.42/1.06 , 0, substitution( 0, [ :=( X, X )] )).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 subsumption(
% 0.42/1.06 clause( 3, [ ~( =( apply( combinator, X ), X ) ) ] )
% 0.42/1.06 , clause( 29, [ ~( =( apply( combinator, X ), X ) ) ] )
% 0.42/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 eqswap(
% 0.42/1.06 clause( 30, [ =( apply( X, apply( Y, Y ) ), apply( apply( l, X ), Y ) ) ]
% 0.42/1.06 )
% 0.42/1.06 , clause( 0, [ =( apply( apply( l, X ), Y ), apply( X, apply( Y, Y ) ) ) ]
% 0.42/1.06 )
% 0.42/1.06 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 eqswap(
% 0.42/1.06 clause( 31, [ ~( =( X, apply( combinator, X ) ) ) ] )
% 0.42/1.06 , clause( 3, [ ~( =( apply( combinator, X ), X ) ) ] )
% 0.42/1.06 , 0, substitution( 0, [ :=( X, X )] )).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 paramod(
% 0.42/1.06 clause( 32, [ ~( =( apply( X, X ), apply( apply( l, combinator ), X ) ) ) ]
% 0.42/1.06 )
% 0.42/1.06 , clause( 30, [ =( apply( X, apply( Y, Y ) ), apply( apply( l, X ), Y ) ) ]
% 0.42/1.06 )
% 0.42/1.06 , 0, clause( 31, [ ~( =( X, apply( combinator, X ) ) ) ] )
% 0.42/1.06 , 0, 5, substitution( 0, [ :=( X, combinator ), :=( Y, X )] ),
% 0.42/1.06 substitution( 1, [ :=( X, apply( X, X ) )] )).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 eqswap(
% 0.42/1.06 clause( 33, [ ~( =( apply( apply( l, combinator ), X ), apply( X, X ) ) ) ]
% 0.42/1.06 )
% 0.42/1.06 , clause( 32, [ ~( =( apply( X, X ), apply( apply( l, combinator ), X ) ) )
% 0.42/1.06 ] )
% 0.42/1.06 , 0, substitution( 0, [ :=( X, X )] )).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 subsumption(
% 0.42/1.06 clause( 18, [ ~( =( apply( apply( l, combinator ), X ), apply( X, X ) ) ) ]
% 0.42/1.06 )
% 0.42/1.06 , clause( 33, [ ~( =( apply( apply( l, combinator ), X ), apply( X, X ) ) )
% 0.42/1.06 ] )
% 0.42/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 eqswap(
% 0.42/1.06 clause( 34, [ ~( =( apply( X, X ), apply( apply( l, combinator ), X ) ) ) ]
% 0.42/1.06 )
% 0.42/1.06 , clause( 18, [ ~( =( apply( apply( l, combinator ), X ), apply( X, X ) ) )
% 0.42/1.06 ] )
% 0.42/1.06 , 0, substitution( 0, [ :=( X, X )] )).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 eqrefl(
% 0.42/1.06 clause( 35, [] )
% 0.42/1.06 , clause( 34, [ ~( =( apply( X, X ), apply( apply( l, combinator ), X ) ) )
% 0.42/1.06 ] )
% 0.42/1.06 , 0, substitution( 0, [ :=( X, apply( l, combinator ) )] )).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 subsumption(
% 0.42/1.06 clause( 19, [] )
% 0.42/1.06 , clause( 35, [] )
% 0.42/1.06 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 end.
% 0.42/1.06
% 0.42/1.06 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.42/1.06
% 0.42/1.06 Memory use:
% 0.42/1.06
% 0.42/1.06 space for terms: 376
% 0.42/1.06 space for clauses: 2702
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 clauses generated: 42
% 0.42/1.06 clauses kept: 20
% 0.42/1.06 clauses selected: 3
% 0.42/1.06 clauses deleted: 0
% 0.42/1.06 clauses inuse deleted: 0
% 0.42/1.06
% 0.42/1.06 subsentry: 48
% 0.42/1.06 literals s-matched: 25
% 0.42/1.06 literals matched: 25
% 0.42/1.06 full subsumption: 0
% 0.42/1.06
% 0.42/1.06 checksum: 618728263
% 0.42/1.06
% 0.42/1.06
% 0.42/1.06 Bliksem ended
%------------------------------------------------------------------------------