TSTP Solution File: COM001-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : COM001-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n009.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:50:57 EDT 2022
% Result : Unsatisfiable 0.42s 1.08s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : COM001-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n009.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Thu Jun 16 16:56:22 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.42/1.08 *** allocated 10000 integers for termspace/termends
% 0.42/1.08 *** allocated 10000 integers for clauses
% 0.42/1.08 *** allocated 10000 integers for justifications
% 0.42/1.08 Bliksem 1.12
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 Automatic Strategy Selection
% 0.42/1.08
% 0.42/1.08 Clauses:
% 0.42/1.08 [
% 0.42/1.08 [ succeeds( X, Y ), ~( follows( X, Y ) ) ],
% 0.42/1.08 [ succeeds( X, Y ), ~( succeeds( X, Z ) ), ~( succeeds( Z, Y ) ) ],
% 0.42/1.08 [ succeeds( X, Y ), ~( has( Y, goto( Z ) ) ), ~( labels( Z, X ) ) ],
% 0.42/1.08 [ succeeds( X, Y ), ~( has( Y, ifthen( Z, X ) ) ) ],
% 0.42/1.08 [ labels( loop, p3 ) ],
% 0.42/1.08 [ has( p3, ifthen( 'equal_function'( 'register_j', n ), p4 ) ) ],
% 0.42/1.08 [ has( p4, goto( out ) ) ],
% 0.42/1.08 [ follows( p5, p4 ) ],
% 0.42/1.08 [ follows( p8, p3 ) ],
% 0.42/1.08 [ has( p8, goto( loop ) ) ],
% 0.42/1.08 [ ~( succeeds( p3, p3 ) ) ]
% 0.42/1.08 ] .
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 percentage equality = 0.000000, percentage horn = 1.000000
% 0.42/1.08 This is a near-Horn, non-equality problem
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 Options Used:
% 0.42/1.08
% 0.42/1.08 useres = 1
% 0.42/1.08 useparamod = 0
% 0.42/1.08 useeqrefl = 0
% 0.42/1.08 useeqfact = 0
% 0.42/1.08 usefactor = 1
% 0.42/1.08 usesimpsplitting = 0
% 0.42/1.08 usesimpdemod = 0
% 0.42/1.08 usesimpres = 4
% 0.42/1.08
% 0.42/1.08 resimpinuse = 1000
% 0.42/1.08 resimpclauses = 20000
% 0.42/1.08 substype = standard
% 0.42/1.08 backwardsubs = 1
% 0.42/1.08 selectoldest = 5
% 0.42/1.08
% 0.42/1.08 litorderings [0] = split
% 0.42/1.08 litorderings [1] = liftord
% 0.42/1.08
% 0.42/1.08 termordering = none
% 0.42/1.08
% 0.42/1.08 litapriori = 1
% 0.42/1.08 termapriori = 0
% 0.42/1.08 litaposteriori = 0
% 0.42/1.08 termaposteriori = 0
% 0.42/1.08 demodaposteriori = 0
% 0.42/1.08 ordereqreflfact = 0
% 0.42/1.08
% 0.42/1.08 litselect = negative
% 0.42/1.08
% 0.42/1.08 maxweight = 30000
% 0.42/1.08 maxdepth = 30000
% 0.42/1.08 maxlength = 115
% 0.42/1.08 maxnrvars = 195
% 0.42/1.08 excuselevel = 0
% 0.42/1.08 increasemaxweight = 0
% 0.42/1.08
% 0.42/1.08 maxselected = 10000000
% 0.42/1.08 maxnrclauses = 10000000
% 0.42/1.08
% 0.42/1.08 showgenerated = 0
% 0.42/1.08 showkept = 0
% 0.42/1.08 showselected = 0
% 0.42/1.08 showdeleted = 0
% 0.42/1.08 showresimp = 1
% 0.42/1.08 showstatus = 2000
% 0.42/1.08
% 0.42/1.08 prologoutput = 1
% 0.42/1.08 nrgoals = 5000000
% 0.42/1.08 totalproof = 1
% 0.42/1.08
% 0.42/1.08 Symbols occurring in the translation:
% 0.42/1.08
% 0.42/1.08 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.42/1.08 . [1, 2] (w:1, o:28, a:1, s:1, b:0),
% 0.42/1.08 ! [4, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.42/1.08 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.42/1.08 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.42/1.08 succeeds [41, 2] (w:1, o:53, a:1, s:1, b:0),
% 0.42/1.08 follows [42, 2] (w:1, o:55, a:1, s:1, b:0),
% 0.42/1.08 goto [45, 1] (w:1, o:27, a:1, s:1, b:0),
% 0.42/1.08 has [46, 2] (w:1, o:56, a:1, s:1, b:0),
% 0.42/1.08 labels [47, 2] (w:1, o:57, a:1, s:1, b:0),
% 0.42/1.08 ifthen [49, 2] (w:1, o:58, a:1, s:1, b:0),
% 0.42/1.08 loop [50, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.42/1.08 p3 [51, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.42/1.08 'register_j' [52, 0] (w:1, o:17, a:1, s:1, b:0),
% 0.42/1.08 n [53, 0] (w:1, o:18, a:1, s:1, b:0),
% 0.42/1.08 'equal_function' [54, 2] (w:1, o:54, a:1, s:1, b:0),
% 0.42/1.08 p4 [55, 0] (w:1, o:19, a:1, s:1, b:0),
% 0.42/1.08 out [56, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.42/1.08 p5 [57, 0] (w:1, o:20, a:1, s:1, b:0),
% 0.42/1.08 p8 [58, 0] (w:1, o:21, a:1, s:1, b:0).
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 Starting Search:
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 Bliksems!, er is een bewijs:
% 0.42/1.08 % SZS status Unsatisfiable
% 0.42/1.08 % SZS output start Refutation
% 0.42/1.08
% 0.42/1.08 clause( 0, [ succeeds( X, Y ), ~( follows( X, Y ) ) ] )
% 0.42/1.08 .
% 0.42/1.08 clause( 1, [ ~( succeeds( X, Z ) ), succeeds( X, Y ), ~( succeeds( Z, Y ) )
% 0.42/1.08 ] )
% 0.42/1.08 .
% 0.42/1.08 clause( 2, [ succeeds( X, Y ), ~( labels( Z, X ) ), ~( has( Y, goto( Z ) )
% 0.42/1.08 ) ] )
% 0.42/1.08 .
% 0.42/1.08 clause( 4, [ labels( loop, p3 ) ] )
% 0.42/1.08 .
% 0.42/1.08 clause( 8, [ follows( p8, p3 ) ] )
% 0.42/1.08 .
% 0.42/1.08 clause( 9, [ has( p8, goto( loop ) ) ] )
% 0.42/1.08 .
% 0.42/1.08 clause( 10, [ ~( succeeds( p3, p3 ) ) ] )
% 0.42/1.08 .
% 0.42/1.08 clause( 12, [ succeeds( p8, p3 ) ] )
% 0.42/1.08 .
% 0.42/1.08 clause( 13, [ succeeds( X, p3 ), ~( succeeds( X, p8 ) ) ] )
% 0.42/1.08 .
% 0.42/1.08 clause( 18, [ succeeds( X, p8 ), ~( labels( loop, X ) ) ] )
% 0.42/1.08 .
% 0.42/1.08 clause( 19, [ succeeds( p3, p8 ) ] )
% 0.42/1.08 .
% 0.42/1.08 clause( 20, [] )
% 0.42/1.08 .
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 % SZS output end Refutation
% 0.42/1.08 found a proof!
% 0.42/1.08
% 0.42/1.08 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.42/1.08
% 0.42/1.08 initialclauses(
% 0.42/1.08 [ clause( 22, [ succeeds( X, Y ), ~( follows( X, Y ) ) ] )
% 0.42/1.08 , clause( 23, [ succeeds( X, Y ), ~( succeeds( X, Z ) ), ~( succeeds( Z, Y
% 0.42/1.08 ) ) ] )
% 0.42/1.08 , clause( 24, [ succeeds( X, Y ), ~( has( Y, goto( Z ) ) ), ~( labels( Z, X
% 0.42/1.08 ) ) ] )
% 0.42/1.08 , clause( 25, [ succeeds( X, Y ), ~( has( Y, ifthen( Z, X ) ) ) ] )
% 0.42/1.08 , clause( 26, [ labels( loop, p3 ) ] )
% 0.42/1.08 , clause( 27, [ has( p3, ifthen( 'equal_function'( 'register_j', n ), p4 )
% 0.42/1.08 ) ] )
% 0.42/1.08 , clause( 28, [ has( p4, goto( out ) ) ] )
% 0.42/1.08 , clause( 29, [ follows( p5, p4 ) ] )
% 0.42/1.08 , clause( 30, [ follows( p8, p3 ) ] )
% 0.42/1.08 , clause( 31, [ has( p8, goto( loop ) ) ] )
% 0.42/1.08 , clause( 32, [ ~( succeeds( p3, p3 ) ) ] )
% 0.42/1.08 ] ).
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 subsumption(
% 0.42/1.08 clause( 0, [ succeeds( X, Y ), ~( follows( X, Y ) ) ] )
% 0.42/1.08 , clause( 22, [ succeeds( X, Y ), ~( follows( X, Y ) ) ] )
% 0.42/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.42/1.08 ), ==>( 1, 1 )] ) ).
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 subsumption(
% 0.42/1.08 clause( 1, [ ~( succeeds( X, Z ) ), succeeds( X, Y ), ~( succeeds( Z, Y ) )
% 0.42/1.08 ] )
% 0.42/1.08 , clause( 23, [ succeeds( X, Y ), ~( succeeds( X, Z ) ), ~( succeeds( Z, Y
% 0.42/1.08 ) ) ] )
% 0.42/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.42/1.08 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 ), ==>( 2, 2 )] ) ).
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 subsumption(
% 0.42/1.08 clause( 2, [ succeeds( X, Y ), ~( labels( Z, X ) ), ~( has( Y, goto( Z ) )
% 0.42/1.08 ) ] )
% 0.42/1.08 , clause( 24, [ succeeds( X, Y ), ~( has( Y, goto( Z ) ) ), ~( labels( Z, X
% 0.42/1.08 ) ) ] )
% 0.42/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.42/1.08 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 subsumption(
% 0.42/1.08 clause( 4, [ labels( loop, p3 ) ] )
% 0.42/1.08 , clause( 26, [ labels( loop, p3 ) ] )
% 0.42/1.08 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 subsumption(
% 0.42/1.08 clause( 8, [ follows( p8, p3 ) ] )
% 0.42/1.08 , clause( 30, [ follows( p8, p3 ) ] )
% 0.42/1.08 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 subsumption(
% 0.42/1.08 clause( 9, [ has( p8, goto( loop ) ) ] )
% 0.42/1.08 , clause( 31, [ has( p8, goto( loop ) ) ] )
% 0.42/1.08 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 subsumption(
% 0.42/1.08 clause( 10, [ ~( succeeds( p3, p3 ) ) ] )
% 0.42/1.08 , clause( 32, [ ~( succeeds( p3, p3 ) ) ] )
% 0.42/1.08 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 resolution(
% 0.42/1.08 clause( 39, [ succeeds( p8, p3 ) ] )
% 0.42/1.08 , clause( 0, [ succeeds( X, Y ), ~( follows( X, Y ) ) ] )
% 0.42/1.08 , 1, clause( 8, [ follows( p8, p3 ) ] )
% 0.42/1.08 , 0, substitution( 0, [ :=( X, p8 ), :=( Y, p3 )] ), substitution( 1, [] )
% 0.42/1.08 ).
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 subsumption(
% 0.42/1.08 clause( 12, [ succeeds( p8, p3 ) ] )
% 0.42/1.08 , clause( 39, [ succeeds( p8, p3 ) ] )
% 0.42/1.08 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 resolution(
% 0.42/1.08 clause( 41, [ ~( succeeds( X, p8 ) ), succeeds( X, p3 ) ] )
% 0.42/1.08 , clause( 1, [ ~( succeeds( X, Z ) ), succeeds( X, Y ), ~( succeeds( Z, Y )
% 0.42/1.08 ) ] )
% 0.42/1.08 , 2, clause( 12, [ succeeds( p8, p3 ) ] )
% 0.42/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, p3 ), :=( Z, p8 )] ),
% 0.42/1.08 substitution( 1, [] )).
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 subsumption(
% 0.42/1.08 clause( 13, [ succeeds( X, p3 ), ~( succeeds( X, p8 ) ) ] )
% 0.42/1.08 , clause( 41, [ ~( succeeds( X, p8 ) ), succeeds( X, p3 ) ] )
% 0.42/1.08 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.42/1.08 0 )] ) ).
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 resolution(
% 0.42/1.08 clause( 42, [ succeeds( X, p8 ), ~( labels( loop, X ) ) ] )
% 0.42/1.08 , clause( 2, [ succeeds( X, Y ), ~( labels( Z, X ) ), ~( has( Y, goto( Z )
% 0.42/1.08 ) ) ] )
% 0.42/1.08 , 2, clause( 9, [ has( p8, goto( loop ) ) ] )
% 0.42/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, p8 ), :=( Z, loop )] ),
% 0.42/1.08 substitution( 1, [] )).
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 subsumption(
% 0.42/1.08 clause( 18, [ succeeds( X, p8 ), ~( labels( loop, X ) ) ] )
% 0.42/1.08 , clause( 42, [ succeeds( X, p8 ), ~( labels( loop, X ) ) ] )
% 0.42/1.08 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.42/1.08 1 )] ) ).
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 resolution(
% 0.42/1.08 clause( 43, [ succeeds( p3, p8 ) ] )
% 0.42/1.08 , clause( 18, [ succeeds( X, p8 ), ~( labels( loop, X ) ) ] )
% 0.42/1.08 , 1, clause( 4, [ labels( loop, p3 ) ] )
% 0.42/1.08 , 0, substitution( 0, [ :=( X, p3 )] ), substitution( 1, [] )).
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 subsumption(
% 0.42/1.08 clause( 19, [ succeeds( p3, p8 ) ] )
% 0.42/1.08 , clause( 43, [ succeeds( p3, p8 ) ] )
% 0.42/1.08 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 resolution(
% 0.42/1.08 clause( 44, [ succeeds( p3, p3 ) ] )
% 0.42/1.08 , clause( 13, [ succeeds( X, p3 ), ~( succeeds( X, p8 ) ) ] )
% 0.42/1.08 , 1, clause( 19, [ succeeds( p3, p8 ) ] )
% 0.42/1.08 , 0, substitution( 0, [ :=( X, p3 )] ), substitution( 1, [] )).
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 resolution(
% 0.42/1.08 clause( 45, [] )
% 0.42/1.08 , clause( 10, [ ~( succeeds( p3, p3 ) ) ] )
% 0.42/1.08 , 0, clause( 44, [ succeeds( p3, p3 ) ] )
% 0.42/1.08 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 subsumption(
% 0.42/1.08 clause( 20, [] )
% 0.42/1.08 , clause( 45, [] )
% 0.42/1.08 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 end.
% 0.42/1.08
% 0.42/1.08 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.42/1.08
% 0.42/1.08 Memory use:
% 0.42/1.08
% 0.42/1.08 space for terms: 311
% 0.42/1.08 space for clauses: 1160
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 clauses generated: 22
% 0.42/1.08 clauses kept: 21
% 0.42/1.08 clauses selected: 19
% 0.42/1.08 clauses deleted: 0
% 0.42/1.08 clauses inuse deleted: 0
% 0.42/1.08
% 0.42/1.08 subsentry: 6
% 0.42/1.08 literals s-matched: 0
% 0.42/1.08 literals matched: 0
% 0.42/1.08 full subsumption: 0
% 0.42/1.08
% 0.42/1.08 checksum: -1697350323
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 Bliksem ended
%------------------------------------------------------------------------------