TSTP Solution File: KRS017-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : KRS017-1 : TPTP v8.1.0. Released v2.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 : Sun Jul 17 02:41:58 EDT 2022
% Result : Unsatisfiable 0.44s 1.07s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KRS017-1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n024.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 Jun 7 13:50:50 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/1.07 *** allocated 10000 integers for termspace/termends
% 0.44/1.07 *** allocated 10000 integers for clauses
% 0.44/1.07 *** allocated 10000 integers for justifications
% 0.44/1.07 Bliksem 1.12
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 Automatic Strategy Selection
% 0.44/1.07
% 0.44/1.07 Clauses:
% 0.44/1.07 [
% 0.44/1.07 [ e( exists ) ],
% 0.44/1.07 [ ~( a( exists ) ) ],
% 0.44/1.07 [ r( X, u0r3( X ) ), ~( e( X ) ) ],
% 0.44/1.07 [ a( X ), ~( e( Y ) ), ~( r( Y, Z ) ), ~( r( X, Z ) ) ],
% 0.44/1.07 [ e( X ), ~( a( u0r2( X ) ) ), ~( r( X, Y ) ) ],
% 0.44/1.07 [ e( X ), r( u0r2( X ), u0r1( X ) ), ~( r( X, Y ) ) ],
% 0.44/1.07 [ e( X ), r( X, u0r1( X ) ), ~( r( X, Y ) ) ]
% 0.44/1.07 ] .
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 percentage equality = 0.000000, percentage horn = 0.714286
% 0.44/1.07 This a non-horn, non-equality problem
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 Options Used:
% 0.44/1.07
% 0.44/1.07 useres = 1
% 0.44/1.07 useparamod = 0
% 0.44/1.07 useeqrefl = 0
% 0.44/1.07 useeqfact = 0
% 0.44/1.07 usefactor = 1
% 0.44/1.07 usesimpsplitting = 0
% 0.44/1.07 usesimpdemod = 0
% 0.44/1.07 usesimpres = 3
% 0.44/1.07
% 0.44/1.07 resimpinuse = 1000
% 0.44/1.07 resimpclauses = 20000
% 0.44/1.07 substype = standard
% 0.44/1.07 backwardsubs = 1
% 0.44/1.07 selectoldest = 5
% 0.44/1.07
% 0.44/1.07 litorderings [0] = split
% 0.44/1.07 litorderings [1] = liftord
% 0.44/1.07
% 0.44/1.07 termordering = none
% 0.44/1.07
% 0.44/1.07 litapriori = 1
% 0.44/1.07 termapriori = 0
% 0.44/1.07 litaposteriori = 0
% 0.44/1.07 termaposteriori = 0
% 0.44/1.07 demodaposteriori = 0
% 0.44/1.07 ordereqreflfact = 0
% 0.44/1.07
% 0.44/1.07 litselect = none
% 0.44/1.07
% 0.44/1.07 maxweight = 15
% 0.44/1.07 maxdepth = 30000
% 0.44/1.07 maxlength = 115
% 0.44/1.07 maxnrvars = 195
% 0.44/1.07 excuselevel = 1
% 0.44/1.07 increasemaxweight = 1
% 0.44/1.07
% 0.44/1.07 maxselected = 10000000
% 0.44/1.07 maxnrclauses = 10000000
% 0.44/1.07
% 0.44/1.07 showgenerated = 0
% 0.44/1.07 showkept = 0
% 0.44/1.07 showselected = 0
% 0.44/1.07 showdeleted = 0
% 0.44/1.07 showresimp = 1
% 0.44/1.07 showstatus = 2000
% 0.44/1.07
% 0.44/1.07 prologoutput = 1
% 0.44/1.07 nrgoals = 5000000
% 0.44/1.07 totalproof = 1
% 0.44/1.07
% 0.44/1.07 Symbols occurring in the translation:
% 0.44/1.07
% 0.44/1.07 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.44/1.07 . [1, 2] (w:1, o:24, a:1, s:1, b:0),
% 0.44/1.07 ! [4, 1] (w:0, o:14, a:1, s:1, b:0),
% 0.44/1.07 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.44/1.07 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.44/1.07 exists [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.44/1.07 e [40, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.44/1.07 a [41, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.44/1.07 u0r3 [43, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.44/1.07 r [44, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.44/1.07 u0r2 [47, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.44/1.07 u0r1 [49, 1] (w:1, o:21, a:1, s:1, b:0).
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 Starting Search:
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 Bliksems!, er is een bewijs:
% 0.44/1.07 % SZS status Unsatisfiable
% 0.44/1.07 % SZS output start Refutation
% 0.44/1.07
% 0.44/1.07 clause( 0, [ e( exists ) ] )
% 0.44/1.07 .
% 0.44/1.07 clause( 1, [ ~( a( exists ) ) ] )
% 0.44/1.07 .
% 0.44/1.07 clause( 2, [ ~( e( X ) ), r( X, u0r3( X ) ) ] )
% 0.44/1.07 .
% 0.44/1.07 clause( 3, [ ~( e( Y ) ), a( X ), ~( r( X, Z ) ), ~( r( Y, Z ) ) ] )
% 0.44/1.07 .
% 0.44/1.07 clause( 7, [ ~( e( X ) ), a( X ), ~( r( X, Y ) ) ] )
% 0.44/1.07 .
% 0.44/1.07 clause( 8, [ ~( e( X ) ), a( X ) ] )
% 0.44/1.07 .
% 0.44/1.07 clause( 9, [] )
% 0.44/1.07 .
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 % SZS output end Refutation
% 0.44/1.07 found a proof!
% 0.44/1.07
% 0.44/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.44/1.07
% 0.44/1.07 initialclauses(
% 0.44/1.07 [ clause( 11, [ e( exists ) ] )
% 0.44/1.07 , clause( 12, [ ~( a( exists ) ) ] )
% 0.44/1.07 , clause( 13, [ r( X, u0r3( X ) ), ~( e( X ) ) ] )
% 0.44/1.07 , clause( 14, [ a( X ), ~( e( Y ) ), ~( r( Y, Z ) ), ~( r( X, Z ) ) ] )
% 0.44/1.07 , clause( 15, [ e( X ), ~( a( u0r2( X ) ) ), ~( r( X, Y ) ) ] )
% 0.44/1.07 , clause( 16, [ e( X ), r( u0r2( X ), u0r1( X ) ), ~( r( X, Y ) ) ] )
% 0.44/1.07 , clause( 17, [ e( X ), r( X, u0r1( X ) ), ~( r( X, Y ) ) ] )
% 0.44/1.07 ] ).
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 subsumption(
% 0.44/1.07 clause( 0, [ e( exists ) ] )
% 0.44/1.07 , clause( 11, [ e( exists ) ] )
% 0.44/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 subsumption(
% 0.44/1.07 clause( 1, [ ~( a( exists ) ) ] )
% 0.44/1.07 , clause( 12, [ ~( a( exists ) ) ] )
% 0.44/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 subsumption(
% 0.44/1.07 clause( 2, [ ~( e( X ) ), r( X, u0r3( X ) ) ] )
% 0.44/1.07 , clause( 13, [ r( X, u0r3( X ) ), ~( e( X ) ) ] )
% 0.44/1.07 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.44/1.07 0 )] ) ).
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 subsumption(
% 0.44/1.07 clause( 3, [ ~( e( Y ) ), a( X ), ~( r( X, Z ) ), ~( r( Y, Z ) ) ] )
% 0.44/1.07 , clause( 14, [ a( X ), ~( e( Y ) ), ~( r( Y, Z ) ), ~( r( X, Z ) ) ] )
% 0.44/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.44/1.07 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 ), ==>( 2, 3 ), ==>( 3, 2 )] )
% 0.44/1.07 ).
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 factor(
% 0.44/1.07 clause( 19, [ ~( e( X ) ), a( X ), ~( r( X, Y ) ) ] )
% 0.44/1.07 , clause( 3, [ ~( e( Y ) ), a( X ), ~( r( X, Z ) ), ~( r( Y, Z ) ) ] )
% 0.44/1.07 , 2, 3, substitution( 0, [ :=( X, X ), :=( Y, X ), :=( Z, Y )] )).
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 subsumption(
% 0.44/1.07 clause( 7, [ ~( e( X ) ), a( X ), ~( r( X, Y ) ) ] )
% 0.44/1.07 , clause( 19, [ ~( e( X ) ), a( X ), ~( r( X, Y ) ) ] )
% 0.44/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.44/1.07 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 resolution(
% 0.44/1.07 clause( 20, [ ~( e( X ) ), a( X ), ~( e( X ) ) ] )
% 0.44/1.07 , clause( 7, [ ~( e( X ) ), a( X ), ~( r( X, Y ) ) ] )
% 0.44/1.07 , 2, clause( 2, [ ~( e( X ) ), r( X, u0r3( X ) ) ] )
% 0.44/1.07 , 1, substitution( 0, [ :=( X, X ), :=( Y, u0r3( X ) )] ), substitution( 1
% 0.44/1.07 , [ :=( X, X )] )).
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 factor(
% 0.44/1.07 clause( 21, [ ~( e( X ) ), a( X ) ] )
% 0.44/1.07 , clause( 20, [ ~( e( X ) ), a( X ), ~( e( X ) ) ] )
% 0.44/1.07 , 0, 2, substitution( 0, [ :=( X, X )] )).
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 subsumption(
% 0.44/1.07 clause( 8, [ ~( e( X ) ), a( X ) ] )
% 0.44/1.07 , clause( 21, [ ~( e( X ) ), a( X ) ] )
% 0.44/1.07 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.44/1.07 1 )] ) ).
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 resolution(
% 0.44/1.07 clause( 22, [ ~( e( exists ) ) ] )
% 0.44/1.07 , clause( 1, [ ~( a( exists ) ) ] )
% 0.44/1.07 , 0, clause( 8, [ ~( e( X ) ), a( X ) ] )
% 0.44/1.07 , 1, substitution( 0, [] ), substitution( 1, [ :=( X, exists )] )).
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 resolution(
% 0.44/1.07 clause( 23, [] )
% 0.44/1.07 , clause( 22, [ ~( e( exists ) ) ] )
% 0.44/1.07 , 0, clause( 0, [ e( exists ) ] )
% 0.44/1.07 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 subsumption(
% 0.44/1.07 clause( 9, [] )
% 0.44/1.07 , clause( 23, [] )
% 0.44/1.07 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 end.
% 0.44/1.07
% 0.44/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.44/1.07
% 0.44/1.07 Memory use:
% 0.44/1.07
% 0.44/1.07 space for terms: 237
% 0.44/1.07 space for clauses: 494
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 clauses generated: 10
% 0.44/1.07 clauses kept: 10
% 0.44/1.07 clauses selected: 5
% 0.44/1.07 clauses deleted: 0
% 0.44/1.07 clauses inuse deleted: 0
% 0.44/1.07
% 0.44/1.07 subsentry: 3
% 0.44/1.07 literals s-matched: 1
% 0.44/1.07 literals matched: 1
% 0.44/1.07 full subsumption: 0
% 0.44/1.07
% 0.44/1.07 checksum: -139559845
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 Bliksem ended
%------------------------------------------------------------------------------