TSTP Solution File: COL085-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : COL085-1 : TPTP v8.1.0. Released v2.6.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:38 EDT 2022
% Result : Unsatisfiable 0.45s 1.07s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COL085-1 : TPTP v8.1.0. Released v2.6.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 14:27:15 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/1.07 *** allocated 10000 integers for termspace/termends
% 0.45/1.07 *** allocated 10000 integers for clauses
% 0.45/1.07 *** allocated 10000 integers for justifications
% 0.45/1.07 Bliksem 1.12
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 Automatic Strategy Selection
% 0.45/1.07
% 0.45/1.07 Clauses:
% 0.45/1.07 [
% 0.45/1.07 [ =( response( a, b ), b ) ],
% 0.45/1.07 [ ~( =( response( a, X ), Y ) ) ]
% 0.45/1.07 ] .
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 percentage equality = 1.000000, percentage horn = 1.000000
% 0.45/1.07 This is a pure equality problem
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 Options Used:
% 0.45/1.07
% 0.45/1.07 useres = 1
% 0.45/1.07 useparamod = 1
% 0.45/1.07 useeqrefl = 1
% 0.45/1.07 useeqfact = 1
% 0.45/1.07 usefactor = 1
% 0.45/1.07 usesimpsplitting = 0
% 0.45/1.07 usesimpdemod = 5
% 0.45/1.07 usesimpres = 3
% 0.45/1.07
% 0.45/1.07 resimpinuse = 1000
% 0.45/1.07 resimpclauses = 20000
% 0.45/1.07 substype = eqrewr
% 0.45/1.07 backwardsubs = 1
% 0.45/1.07 selectoldest = 5
% 0.45/1.07
% 0.45/1.07 litorderings [0] = split
% 0.45/1.07 litorderings [1] = extend the termordering, first sorting on arguments
% 0.45/1.07
% 0.45/1.07 termordering = kbo
% 0.45/1.07
% 0.45/1.07 litapriori = 0
% 0.45/1.07 termapriori = 1
% 0.45/1.07 litaposteriori = 0
% 0.45/1.07 termaposteriori = 0
% 0.45/1.07 demodaposteriori = 0
% 0.45/1.07 ordereqreflfact = 0
% 0.45/1.07
% 0.45/1.07 litselect = negord
% 0.45/1.07
% 0.45/1.07 maxweight = 15
% 0.45/1.07 maxdepth = 30000
% 0.45/1.07 maxlength = 115
% 0.45/1.07 maxnrvars = 195
% 0.45/1.07 excuselevel = 1
% 0.45/1.07 increasemaxweight = 1
% 0.45/1.07
% 0.45/1.07 maxselected = 10000000
% 0.45/1.07 maxnrclauses = 10000000
% 0.45/1.07
% 0.45/1.07 showgenerated = 0
% 0.45/1.07 showkept = 0
% 0.45/1.07 showselected = 0
% 0.45/1.07 showdeleted = 0
% 0.45/1.07 showresimp = 1
% 0.45/1.07 showstatus = 2000
% 0.45/1.07
% 0.45/1.07 prologoutput = 1
% 0.45/1.07 nrgoals = 5000000
% 0.45/1.07 totalproof = 1
% 0.45/1.07
% 0.45/1.07 Symbols occurring in the translation:
% 0.45/1.07
% 0.45/1.07 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.45/1.07 . [1, 2] (w:1, o:18, a:1, s:1, b:0),
% 0.45/1.07 ! [4, 1] (w:0, o:13, a:1, s:1, b:0),
% 0.45/1.07 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.45/1.07 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.45/1.07 a [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.45/1.07 b [40, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.45/1.07 response [41, 2] (w:1, o:43, a:1, s:1, b:0).
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 Starting Search:
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 Bliksems!, er is een bewijs:
% 0.45/1.07 % SZS status Unsatisfiable
% 0.45/1.07 % SZS output start Refutation
% 0.45/1.07
% 0.45/1.07 clause( 1, [ ~( =( response( a, X ), Y ) ) ] )
% 0.45/1.07 .
% 0.45/1.07 clause( 2, [] )
% 0.45/1.07 .
% 0.45/1.07
% 0.45/1.07
% 0.45/1.07 % SZS output end Refutation
% 0.45/1.07 found a proof!
% 0.45/1.07
% 0.45/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.45/1.07
% 0.45/1.07 initialclauses(
% 0.45/1.07 [ clause( 4, [ =( response( a, b ), b ) ] )
% 0.45/1.08 , clause( 5, [ ~( =( response( a, X ), Y ) ) ] )
% 0.45/1.08 ] ).
% 0.45/1.08
% 0.45/1.08
% 0.45/1.08
% 0.45/1.08 subsumption(
% 0.45/1.08 clause( 1, [ ~( =( response( a, X ), Y ) ) ] )
% 0.45/1.08 , clause( 5, [ ~( =( response( a, X ), Y ) ) ] )
% 0.45/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.45/1.08 )] ) ).
% 0.45/1.08
% 0.45/1.08
% 0.45/1.08 eqswap(
% 0.45/1.08 clause( 8, [ ~( =( Y, response( a, X ) ) ) ] )
% 0.45/1.08 , clause( 1, [ ~( =( response( a, X ), Y ) ) ] )
% 0.45/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.45/1.08
% 0.45/1.08
% 0.45/1.08 eqrefl(
% 0.45/1.08 clause( 9, [] )
% 0.45/1.08 , clause( 8, [ ~( =( Y, response( a, X ) ) ) ] )
% 0.45/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, response( a, X ) )] )).
% 0.45/1.08
% 0.45/1.08
% 0.45/1.08 subsumption(
% 0.45/1.08 clause( 2, [] )
% 0.45/1.08 , clause( 9, [] )
% 0.45/1.08 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.45/1.08
% 0.45/1.08
% 0.45/1.08 end.
% 0.45/1.08
% 0.45/1.08 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.45/1.08
% 0.45/1.08 Memory use:
% 0.45/1.08
% 0.45/1.08 space for terms: 48
% 0.45/1.08 space for clauses: 188
% 0.45/1.08
% 0.45/1.08
% 0.45/1.08 clauses generated: 3
% 0.45/1.08 clauses kept: 3
% 0.45/1.08 clauses selected: 0
% 0.45/1.08 clauses deleted: 0
% 0.45/1.08 clauses inuse deleted: 0
% 0.45/1.08
% 0.45/1.08 subsentry: 15
% 0.45/1.08 literals s-matched: 7
% 0.45/1.08 literals matched: 7
% 0.45/1.08 full subsumption: 0
% 0.45/1.08
% 0.45/1.08 checksum: -410176
% 0.72/1.08
% 0.72/1.08
% 0.72/1.08 Bliksem ended
%------------------------------------------------------------------------------