TSTP Solution File: SYN033-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN033-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n014.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:50 EDT 2022
% Result : Unsatisfiable 0.46s 1.12s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYN033-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.14 % Command : bliksem %s
% 0.14/0.35 % Computer : n014.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % DateTime : Mon Jul 11 15:40:34 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.46/1.12 *** allocated 10000 integers for termspace/termends
% 0.46/1.12 *** allocated 10000 integers for clauses
% 0.46/1.12 *** allocated 10000 integers for justifications
% 0.46/1.12 Bliksem 1.12
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 Automatic Strategy Selection
% 0.46/1.12
% 0.46/1.12 Clauses:
% 0.46/1.12 [
% 0.46/1.12 [ p( g( X, Y ), X, Y ) ],
% 0.46/1.12 [ p( X, h( X, Y ), Y ) ],
% 0.46/1.12 [ ~( p( X, Y, Z ) ), ~( p( T, U, Y ) ), ~( p( X, T, W ) ), p( W, U, Z )
% 0.46/1.12 ],
% 0.46/1.12 [ ~( p( k( X ), X, k( X ) ) ) ]
% 0.46/1.12 ] .
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 percentage equality = 0.000000, percentage horn = 1.000000
% 0.46/1.12 This is a near-Horn, non-equality problem
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 Options Used:
% 0.46/1.12
% 0.46/1.12 useres = 1
% 0.46/1.12 useparamod = 0
% 0.46/1.12 useeqrefl = 0
% 0.46/1.12 useeqfact = 0
% 0.46/1.12 usefactor = 1
% 0.46/1.12 usesimpsplitting = 0
% 0.46/1.12 usesimpdemod = 0
% 0.46/1.12 usesimpres = 4
% 0.46/1.12
% 0.46/1.12 resimpinuse = 1000
% 0.46/1.12 resimpclauses = 20000
% 0.46/1.12 substype = standard
% 0.46/1.12 backwardsubs = 1
% 0.46/1.12 selectoldest = 5
% 0.46/1.12
% 0.46/1.12 litorderings [0] = split
% 0.46/1.12 litorderings [1] = liftord
% 0.46/1.12
% 0.46/1.12 termordering = none
% 0.46/1.12
% 0.46/1.12 litapriori = 1
% 0.46/1.12 termapriori = 0
% 0.46/1.12 litaposteriori = 0
% 0.46/1.12 termaposteriori = 0
% 0.46/1.12 demodaposteriori = 0
% 0.46/1.12 ordereqreflfact = 0
% 0.46/1.12
% 0.46/1.12 litselect = negative
% 0.46/1.12
% 0.46/1.12 maxweight = 30000
% 0.46/1.12 maxdepth = 30000
% 0.46/1.12 maxlength = 115
% 0.46/1.12 maxnrvars = 195
% 0.46/1.12 excuselevel = 0
% 0.46/1.12 increasemaxweight = 0
% 0.46/1.12
% 0.46/1.12 maxselected = 10000000
% 0.46/1.12 maxnrclauses = 10000000
% 0.46/1.12
% 0.46/1.12 showgenerated = 0
% 0.46/1.12 showkept = 0
% 0.46/1.12 showselected = 0
% 0.46/1.12 showdeleted = 0
% 0.46/1.12 showresimp = 1
% 0.46/1.12 showstatus = 2000
% 0.46/1.12
% 0.46/1.12 prologoutput = 1
% 0.46/1.12 nrgoals = 5000000
% 0.46/1.12 totalproof = 1
% 0.46/1.12
% 0.46/1.12 Symbols occurring in the translation:
% 0.46/1.12
% 0.46/1.12 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.46/1.12 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.46/1.12 ! [4, 1] (w:1, o:15, a:1, s:1, b:0),
% 0.46/1.12 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.46/1.12 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.46/1.12 g [41, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.46/1.12 p [42, 3] (w:1, o:48, a:1, s:1, b:0),
% 0.46/1.12 h [43, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.46/1.12 k [48, 1] (w:1, o:20, a:1, s:1, b:0).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 Starting Search:
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 Bliksems!, er is een bewijs:
% 0.46/1.12 % SZS status Unsatisfiable
% 0.46/1.12 % SZS output start Refutation
% 0.46/1.12
% 0.46/1.12 clause( 0, [ p( g( X, Y ), X, Y ) ] )
% 0.46/1.12 .
% 0.46/1.12 clause( 1, [ p( X, h( X, Y ), Y ) ] )
% 0.46/1.12 .
% 0.46/1.12 clause( 2, [ ~( p( X, Y, Z ) ), ~( p( X, T, W ) ), p( W, U, Z ), ~( p( T, U
% 0.46/1.12 , Y ) ) ] )
% 0.46/1.12 .
% 0.46/1.12 clause( 3, [ ~( p( k( X ), X, k( X ) ) ) ] )
% 0.46/1.12 .
% 0.46/1.12 clause( 4, [ p( Z, T, Z ), ~( p( X, Y, Z ) ), ~( p( Y, T, Y ) ) ] )
% 0.46/1.12 .
% 0.46/1.12 clause( 7, [ p( X, h( Y, Y ), X ), ~( p( Z, Y, X ) ) ] )
% 0.46/1.12 .
% 0.46/1.12 clause( 8, [ p( X, h( Y, Y ), X ) ] )
% 0.46/1.12 .
% 0.46/1.12 clause( 12, [] )
% 0.46/1.12 .
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 % SZS output end Refutation
% 0.46/1.12 found a proof!
% 0.46/1.12
% 0.46/1.12 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.46/1.12
% 0.46/1.12 initialclauses(
% 0.46/1.12 [ clause( 14, [ p( g( X, Y ), X, Y ) ] )
% 0.46/1.12 , clause( 15, [ p( X, h( X, Y ), Y ) ] )
% 0.46/1.12 , clause( 16, [ ~( p( X, Y, Z ) ), ~( p( T, U, Y ) ), ~( p( X, T, W ) ), p(
% 0.46/1.12 W, U, Z ) ] )
% 0.46/1.12 , clause( 17, [ ~( p( k( X ), X, k( X ) ) ) ] )
% 0.46/1.12 ] ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 subsumption(
% 0.46/1.12 clause( 0, [ p( g( X, Y ), X, Y ) ] )
% 0.46/1.12 , clause( 14, [ p( g( X, Y ), X, Y ) ] )
% 0.46/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.46/1.12 )] ) ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 subsumption(
% 0.46/1.12 clause( 1, [ p( X, h( X, Y ), Y ) ] )
% 0.46/1.12 , clause( 15, [ p( X, h( X, Y ), Y ) ] )
% 0.46/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.46/1.12 )] ) ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 subsumption(
% 0.46/1.12 clause( 2, [ ~( p( X, Y, Z ) ), ~( p( X, T, W ) ), p( W, U, Z ), ~( p( T, U
% 0.46/1.12 , Y ) ) ] )
% 0.46/1.12 , clause( 16, [ ~( p( X, Y, Z ) ), ~( p( T, U, Y ) ), ~( p( X, T, W ) ), p(
% 0.46/1.12 W, U, Z ) ] )
% 0.46/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.46/1.12 , U ), :=( W, W )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 3 ), ==>( 2
% 0.46/1.12 , 1 ), ==>( 3, 2 )] ) ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 subsumption(
% 0.46/1.12 clause( 3, [ ~( p( k( X ), X, k( X ) ) ) ] )
% 0.46/1.12 , clause( 17, [ ~( p( k( X ), X, k( X ) ) ) ] )
% 0.46/1.12 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 factor(
% 0.46/1.12 clause( 26, [ ~( p( X, Y, Z ) ), p( Z, T, Z ), ~( p( Y, T, Y ) ) ] )
% 0.46/1.12 , clause( 2, [ ~( p( X, Y, Z ) ), ~( p( X, T, W ) ), p( W, U, Z ), ~( p( T
% 0.46/1.12 , U, Y ) ) ] )
% 0.46/1.12 , 0, 1, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, Y ),
% 0.46/1.12 :=( U, T ), :=( W, Z )] )).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 subsumption(
% 0.46/1.12 clause( 4, [ p( Z, T, Z ), ~( p( X, Y, Z ) ), ~( p( Y, T, Y ) ) ] )
% 0.46/1.12 , clause( 26, [ ~( p( X, Y, Z ) ), p( Z, T, Z ), ~( p( Y, T, Y ) ) ] )
% 0.46/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.46/1.12 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 ), ==>( 2, 2 )] ) ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 resolution(
% 0.46/1.12 clause( 31, [ p( X, h( Y, Y ), X ), ~( p( Z, Y, X ) ) ] )
% 0.46/1.12 , clause( 4, [ p( Z, T, Z ), ~( p( X, Y, Z ) ), ~( p( Y, T, Y ) ) ] )
% 0.46/1.12 , 2, clause( 1, [ p( X, h( X, Y ), Y ) ] )
% 0.46/1.12 , 0, substitution( 0, [ :=( X, Z ), :=( Y, Y ), :=( Z, X ), :=( T, h( Y, Y
% 0.46/1.12 ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, Y )] )).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 subsumption(
% 0.46/1.12 clause( 7, [ p( X, h( Y, Y ), X ), ~( p( Z, Y, X ) ) ] )
% 0.46/1.12 , clause( 31, [ p( X, h( Y, Y ), X ), ~( p( Z, Y, X ) ) ] )
% 0.46/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.46/1.12 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 resolution(
% 0.46/1.12 clause( 32, [ p( X, h( Y, Y ), X ) ] )
% 0.46/1.12 , clause( 7, [ p( X, h( Y, Y ), X ), ~( p( Z, Y, X ) ) ] )
% 0.46/1.12 , 1, clause( 0, [ p( g( X, Y ), X, Y ) ] )
% 0.46/1.12 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, g( Y, X ) )] ),
% 0.46/1.12 substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 subsumption(
% 0.46/1.12 clause( 8, [ p( X, h( Y, Y ), X ) ] )
% 0.46/1.12 , clause( 32, [ p( X, h( Y, Y ), X ) ] )
% 0.46/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.46/1.12 )] ) ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 resolution(
% 0.46/1.12 clause( 33, [] )
% 0.46/1.12 , clause( 3, [ ~( p( k( X ), X, k( X ) ) ) ] )
% 0.46/1.12 , 0, clause( 8, [ p( X, h( Y, Y ), X ) ] )
% 0.46/1.12 , 0, substitution( 0, [ :=( X, h( X, X ) )] ), substitution( 1, [ :=( X, k(
% 0.46/1.12 h( X, X ) ) ), :=( Y, X )] )).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 subsumption(
% 0.46/1.12 clause( 12, [] )
% 0.46/1.12 , clause( 33, [] )
% 0.46/1.12 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 end.
% 0.46/1.12
% 0.46/1.12 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.46/1.12
% 0.46/1.12 Memory use:
% 0.46/1.12
% 0.46/1.12 space for terms: 250
% 0.46/1.12 space for clauses: 679
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 clauses generated: 20
% 0.46/1.12 clauses kept: 13
% 0.46/1.12 clauses selected: 7
% 0.46/1.12 clauses deleted: 0
% 0.46/1.12 clauses inuse deleted: 0
% 0.46/1.12
% 0.46/1.12 subsentry: 40
% 0.46/1.12 literals s-matched: 22
% 0.46/1.12 literals matched: 12
% 0.46/1.12 full subsumption: 1
% 0.46/1.12
% 0.46/1.12 checksum: -21538
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 Bliksem ended
%------------------------------------------------------------------------------