TSTP Solution File: SYN009-2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN009-2 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n011.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 : Thu Jul 21 02:46:40 EDT 2022
% Result : Unsatisfiable 0.67s 1.07s
% Output : Refutation 0.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SYN009-2 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n011.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 : Mon Jul 11 23:01:12 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.67/1.07 *** allocated 10000 integers for termspace/termends
% 0.67/1.07 *** allocated 10000 integers for clauses
% 0.67/1.07 *** allocated 10000 integers for justifications
% 0.67/1.07 Bliksem 1.12
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 Automatic Strategy Selection
% 0.67/1.07
% 0.67/1.07 Clauses:
% 0.67/1.07 [
% 0.67/1.07 [ ~( p( X, Y, Z ) ), ~( t( X, Y, Z ) ) ],
% 0.67/1.07 [ ~( q( X, Y, Z ) ), ~( t( Y, Z, X ) ) ],
% 0.67/1.07 [ ~( r( X, Y, Z ) ), ~( t( Z, X, Y ) ) ],
% 0.67/1.07 [ s( a ) ],
% 0.67/1.07 [ s( b ) ],
% 0.67/1.07 [ s( c ) ],
% 0.67/1.07 [ t( c, c, c ) ],
% 0.67/1.07 [ ~( s( X ) ), ~( s( Y ) ), ~( s( Z ) ), p( X, Y, Z ), q( Y, Z, X ), r(
% 0.67/1.07 Z, X, Y ) ]
% 0.67/1.07 ] .
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 percentage equality = 0.000000, percentage horn = 0.875000
% 0.67/1.07 This a non-horn, non-equality problem
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 Options Used:
% 0.67/1.07
% 0.67/1.07 useres = 1
% 0.67/1.07 useparamod = 0
% 0.67/1.07 useeqrefl = 0
% 0.67/1.07 useeqfact = 0
% 0.67/1.07 usefactor = 1
% 0.67/1.07 usesimpsplitting = 0
% 0.67/1.07 usesimpdemod = 0
% 0.67/1.07 usesimpres = 3
% 0.67/1.07
% 0.67/1.07 resimpinuse = 1000
% 0.67/1.07 resimpclauses = 20000
% 0.67/1.07 substype = standard
% 0.67/1.07 backwardsubs = 1
% 0.67/1.07 selectoldest = 5
% 0.67/1.07
% 0.67/1.07 litorderings [0] = split
% 0.67/1.07 litorderings [1] = liftord
% 0.67/1.07
% 0.67/1.07 termordering = none
% 0.67/1.07
% 0.67/1.07 litapriori = 1
% 0.67/1.07 termapriori = 0
% 0.67/1.07 litaposteriori = 0
% 0.67/1.07 termaposteriori = 0
% 0.67/1.07 demodaposteriori = 0
% 0.67/1.07 ordereqreflfact = 0
% 0.67/1.07
% 0.67/1.07 litselect = none
% 0.67/1.07
% 0.67/1.07 maxweight = 15
% 0.67/1.07 maxdepth = 30000
% 0.67/1.07 maxlength = 115
% 0.67/1.07 maxnrvars = 195
% 0.67/1.07 excuselevel = 1
% 0.67/1.07 increasemaxweight = 1
% 0.67/1.07
% 0.67/1.07 maxselected = 10000000
% 0.67/1.07 maxnrclauses = 10000000
% 0.67/1.07
% 0.67/1.07 showgenerated = 0
% 0.67/1.07 showkept = 0
% 0.67/1.07 showselected = 0
% 0.67/1.07 showdeleted = 0
% 0.67/1.07 showresimp = 1
% 0.67/1.07 showstatus = 2000
% 0.67/1.07
% 0.67/1.07 prologoutput = 1
% 0.67/1.07 nrgoals = 5000000
% 0.67/1.07 totalproof = 1
% 0.67/1.07
% 0.67/1.07 Symbols occurring in the translation:
% 0.67/1.07
% 0.67/1.07 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.67/1.07 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.67/1.07 ! [4, 1] (w:0, o:15, a:1, s:1, b:0),
% 0.67/1.07 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.67/1.07 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.67/1.07 p [42, 3] (w:1, o:46, a:1, s:1, b:0),
% 0.67/1.07 t [43, 3] (w:1, o:47, a:1, s:1, b:0),
% 0.67/1.07 q [44, 3] (w:1, o:48, a:1, s:1, b:0),
% 0.67/1.07 r [45, 3] (w:1, o:49, a:1, s:1, b:0),
% 0.67/1.07 a [46, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.67/1.07 s [47, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.67/1.07 b [48, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.67/1.07 c [49, 0] (w:1, o:14, a:1, s:1, b:0).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 Starting Search:
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 Bliksems!, er is een bewijs:
% 0.67/1.07 % SZS status Unsatisfiable
% 0.67/1.07 % SZS output start Refutation
% 0.67/1.07
% 0.67/1.07 clause( 0, [ ~( p( X, Y, Z ) ), ~( t( X, Y, Z ) ) ] )
% 0.67/1.07 .
% 0.67/1.07 clause( 1, [ ~( t( Y, Z, X ) ), ~( q( X, Y, Z ) ) ] )
% 0.67/1.07 .
% 0.67/1.07 clause( 2, [ ~( t( Z, X, Y ) ), ~( r( X, Y, Z ) ) ] )
% 0.67/1.07 .
% 0.67/1.07 clause( 5, [ s( c ) ] )
% 0.67/1.07 .
% 0.67/1.07 clause( 6, [ t( c, c, c ) ] )
% 0.67/1.07 .
% 0.67/1.07 clause( 7, [ ~( s( X ) ), ~( s( Y ) ), ~( s( Z ) ), p( X, Y, Z ), q( Y, Z,
% 0.67/1.07 X ), r( Z, X, Y ) ] )
% 0.67/1.07 .
% 0.67/1.07 clause( 10, [ ~( s( X ) ), ~( s( Y ) ), p( X, Y, Y ), q( Y, Y, X ), r( Y, X
% 0.67/1.07 , Y ) ] )
% 0.67/1.07 .
% 0.67/1.07 clause( 11, [ ~( s( X ) ), p( X, X, X ), q( X, X, X ), r( X, X, X ) ] )
% 0.67/1.07 .
% 0.67/1.07 clause( 13, [ ~( s( X ) ), ~( t( X, X, X ) ), q( X, X, X ) ] )
% 0.67/1.07 .
% 0.67/1.07 clause( 14, [ ~( s( X ) ), ~( t( X, X, X ) ) ] )
% 0.67/1.07 .
% 0.67/1.07 clause( 16, [] )
% 0.67/1.07 .
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 % SZS output end Refutation
% 0.67/1.07 found a proof!
% 0.67/1.07
% 0.67/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.67/1.07
% 0.67/1.07 initialclauses(
% 0.67/1.07 [ clause( 18, [ ~( p( X, Y, Z ) ), ~( t( X, Y, Z ) ) ] )
% 0.67/1.07 , clause( 19, [ ~( q( X, Y, Z ) ), ~( t( Y, Z, X ) ) ] )
% 0.67/1.07 , clause( 20, [ ~( r( X, Y, Z ) ), ~( t( Z, X, Y ) ) ] )
% 0.67/1.07 , clause( 21, [ s( a ) ] )
% 0.67/1.07 , clause( 22, [ s( b ) ] )
% 0.67/1.07 , clause( 23, [ s( c ) ] )
% 0.67/1.07 , clause( 24, [ t( c, c, c ) ] )
% 0.67/1.07 , clause( 25, [ ~( s( X ) ), ~( s( Y ) ), ~( s( Z ) ), p( X, Y, Z ), q( Y,
% 0.67/1.07 Z, X ), r( Z, X, Y ) ] )
% 0.67/1.07 ] ).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 subsumption(
% 0.67/1.07 clause( 0, [ ~( p( X, Y, Z ) ), ~( t( X, Y, Z ) ) ] )
% 0.67/1.07 , clause( 18, [ ~( p( X, Y, Z ) ), ~( t( X, Y, Z ) ) ] )
% 0.67/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.67/1.07 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 subsumption(
% 0.67/1.07 clause( 1, [ ~( t( Y, Z, X ) ), ~( q( X, Y, Z ) ) ] )
% 0.67/1.07 , clause( 19, [ ~( q( X, Y, Z ) ), ~( t( Y, Z, X ) ) ] )
% 0.67/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.67/1.07 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 subsumption(
% 0.67/1.07 clause( 2, [ ~( t( Z, X, Y ) ), ~( r( X, Y, Z ) ) ] )
% 0.67/1.07 , clause( 20, [ ~( r( X, Y, Z ) ), ~( t( Z, X, Y ) ) ] )
% 0.67/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.67/1.07 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 subsumption(
% 0.67/1.07 clause( 5, [ s( c ) ] )
% 0.67/1.07 , clause( 23, [ s( c ) ] )
% 0.67/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 subsumption(
% 0.67/1.07 clause( 6, [ t( c, c, c ) ] )
% 0.67/1.07 , clause( 24, [ t( c, c, c ) ] )
% 0.67/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 subsumption(
% 0.67/1.07 clause( 7, [ ~( s( X ) ), ~( s( Y ) ), ~( s( Z ) ), p( X, Y, Z ), q( Y, Z,
% 0.67/1.07 X ), r( Z, X, Y ) ] )
% 0.67/1.07 , clause( 25, [ ~( s( X ) ), ~( s( Y ) ), ~( s( Z ) ), p( X, Y, Z ), q( Y,
% 0.67/1.07 Z, X ), r( Z, X, Y ) ] )
% 0.67/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.67/1.07 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 ), ==>( 2, 2 ), ==>( 3, 3 ),
% 0.67/1.07 ==>( 4, 4 ), ==>( 5, 5 )] ) ).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 factor(
% 0.67/1.07 clause( 32, [ ~( s( X ) ), ~( s( Y ) ), p( X, Y, Y ), q( Y, Y, X ), r( Y, X
% 0.67/1.07 , Y ) ] )
% 0.67/1.07 , clause( 7, [ ~( s( X ) ), ~( s( Y ) ), ~( s( Z ) ), p( X, Y, Z ), q( Y, Z
% 0.67/1.07 , X ), r( Z, X, Y ) ] )
% 0.67/1.07 , 1, 2, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Y )] )).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 subsumption(
% 0.67/1.07 clause( 10, [ ~( s( X ) ), ~( s( Y ) ), p( X, Y, Y ), q( Y, Y, X ), r( Y, X
% 0.67/1.07 , Y ) ] )
% 0.67/1.07 , clause( 32, [ ~( s( X ) ), ~( s( Y ) ), p( X, Y, Y ), q( Y, Y, X ), r( Y
% 0.67/1.07 , X, Y ) ] )
% 0.67/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.67/1.07 ), ==>( 1, 1 ), ==>( 2, 2 ), ==>( 3, 3 ), ==>( 4, 4 )] ) ).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 factor(
% 0.67/1.07 clause( 34, [ ~( s( X ) ), p( X, X, X ), q( X, X, X ), r( X, X, X ) ] )
% 0.67/1.07 , clause( 10, [ ~( s( X ) ), ~( s( Y ) ), p( X, Y, Y ), q( Y, Y, X ), r( Y
% 0.67/1.07 , X, Y ) ] )
% 0.67/1.07 , 0, 1, substitution( 0, [ :=( X, X ), :=( Y, X )] )).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 subsumption(
% 0.67/1.07 clause( 11, [ ~( s( X ) ), p( X, X, X ), q( X, X, X ), r( X, X, X ) ] )
% 0.67/1.07 , clause( 34, [ ~( s( X ) ), p( X, X, X ), q( X, X, X ), r( X, X, X ) ] )
% 0.67/1.07 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.67/1.07 1 ), ==>( 2, 2 ), ==>( 3, 3 )] ) ).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 resolution(
% 0.67/1.07 clause( 35, [ ~( t( X, X, X ) ), ~( s( X ) ), p( X, X, X ), q( X, X, X ) ]
% 0.67/1.07 )
% 0.67/1.07 , clause( 2, [ ~( t( Z, X, Y ) ), ~( r( X, Y, Z ) ) ] )
% 0.67/1.07 , 1, clause( 11, [ ~( s( X ) ), p( X, X, X ), q( X, X, X ), r( X, X, X ) ]
% 0.67/1.07 )
% 0.67/1.07 , 3, substitution( 0, [ :=( X, X ), :=( Y, X ), :=( Z, X )] ),
% 0.67/1.07 substitution( 1, [ :=( X, X )] )).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 resolution(
% 0.67/1.07 clause( 36, [ ~( t( X, X, X ) ), ~( t( X, X, X ) ), ~( s( X ) ), q( X, X, X
% 0.67/1.07 ) ] )
% 0.67/1.07 , clause( 0, [ ~( p( X, Y, Z ) ), ~( t( X, Y, Z ) ) ] )
% 0.67/1.07 , 0, clause( 35, [ ~( t( X, X, X ) ), ~( s( X ) ), p( X, X, X ), q( X, X, X
% 0.67/1.07 ) ] )
% 0.67/1.07 , 2, substitution( 0, [ :=( X, X ), :=( Y, X ), :=( Z, X )] ),
% 0.67/1.07 substitution( 1, [ :=( X, X )] )).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 factor(
% 0.67/1.07 clause( 37, [ ~( t( X, X, X ) ), ~( s( X ) ), q( X, X, X ) ] )
% 0.67/1.07 , clause( 36, [ ~( t( X, X, X ) ), ~( t( X, X, X ) ), ~( s( X ) ), q( X, X
% 0.67/1.07 , X ) ] )
% 0.67/1.07 , 0, 1, substitution( 0, [ :=( X, X )] )).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 subsumption(
% 0.67/1.07 clause( 13, [ ~( s( X ) ), ~( t( X, X, X ) ), q( X, X, X ) ] )
% 0.67/1.07 , clause( 37, [ ~( t( X, X, X ) ), ~( s( X ) ), q( X, X, X ) ] )
% 0.67/1.07 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.67/1.07 0 ), ==>( 2, 2 )] ) ).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 resolution(
% 0.67/1.07 clause( 38, [ ~( t( X, X, X ) ), ~( s( X ) ), ~( t( X, X, X ) ) ] )
% 0.67/1.07 , clause( 1, [ ~( t( Y, Z, X ) ), ~( q( X, Y, Z ) ) ] )
% 0.67/1.07 , 1, clause( 13, [ ~( s( X ) ), ~( t( X, X, X ) ), q( X, X, X ) ] )
% 0.67/1.07 , 2, substitution( 0, [ :=( X, X ), :=( Y, X ), :=( Z, X )] ),
% 0.67/1.07 substitution( 1, [ :=( X, X )] )).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 factor(
% 0.67/1.07 clause( 39, [ ~( t( X, X, X ) ), ~( s( X ) ) ] )
% 0.67/1.07 , clause( 38, [ ~( t( X, X, X ) ), ~( s( X ) ), ~( t( X, X, X ) ) ] )
% 0.67/1.07 , 0, 2, substitution( 0, [ :=( X, X )] )).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 subsumption(
% 0.67/1.07 clause( 14, [ ~( s( X ) ), ~( t( X, X, X ) ) ] )
% 0.67/1.07 , clause( 39, [ ~( t( X, X, X ) ), ~( s( X ) ) ] )
% 0.67/1.07 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.67/1.07 0 )] ) ).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 resolution(
% 0.67/1.07 clause( 40, [ ~( s( c ) ) ] )
% 0.67/1.07 , clause( 14, [ ~( s( X ) ), ~( t( X, X, X ) ) ] )
% 0.67/1.07 , 1, clause( 6, [ t( c, c, c ) ] )
% 0.67/1.07 , 0, substitution( 0, [ :=( X, c )] ), substitution( 1, [] )).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 resolution(
% 0.67/1.07 clause( 41, [] )
% 0.67/1.07 , clause( 40, [ ~( s( c ) ) ] )
% 0.67/1.07 , 0, clause( 5, [ s( c ) ] )
% 0.67/1.07 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 subsumption(
% 0.67/1.07 clause( 16, [] )
% 0.67/1.07 , clause( 41, [] )
% 0.67/1.07 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 end.
% 0.67/1.07
% 0.67/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.67/1.07
% 0.67/1.07 Memory use:
% 0.67/1.07
% 0.67/1.07 space for terms: 354
% 0.67/1.07 space for clauses: 901
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 clauses generated: 22
% 0.67/1.07 clauses kept: 17
% 0.67/1.07 clauses selected: 11
% 0.67/1.07 clauses deleted: 1
% 0.67/1.07 clauses inuse deleted: 0
% 0.67/1.07
% 0.67/1.07 subsentry: 33
% 0.67/1.07 literals s-matched: 12
% 0.67/1.07 literals matched: 6
% 0.67/1.07 full subsumption: 0
% 0.67/1.07
% 0.67/1.07 checksum: 219427
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 Bliksem ended
%------------------------------------------------------------------------------