TSTP Solution File: SYN728-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN728-1 : TPTP v8.1.0. Released v2.5.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 : Thu Jul 21 02:54:16 EDT 2022
% Result : Unsatisfiable 0.43s 1.06s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN728-1 : TPTP v8.1.0. Released v2.5.0.
% 0.12/0.13 % Command : bliksem %s
% 0.13/0.33 % Computer : n009.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % DateTime : Tue Jul 12 04:25:52 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.43/1.06 *** allocated 10000 integers for termspace/termends
% 0.43/1.06 *** allocated 10000 integers for clauses
% 0.43/1.06 *** allocated 10000 integers for justifications
% 0.43/1.06 Bliksem 1.12
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 Automatic Strategy Selection
% 0.43/1.06
% 0.43/1.06 Clauses:
% 0.43/1.06 [
% 0.43/1.06 [ p( X, X ), ~( p( Y, Z ) ) ],
% 0.43/1.06 [ m( X ), p( X, sk1( X ) ) ],
% 0.43/1.06 [ q( f( X, sk1( X ) ) ), p( X, sk1( X ) ) ],
% 0.43/1.06 [ ~( m( g( X ) ) ), ~( q( X ) ) ],
% 0.43/1.06 [ ~( p( sk2, sk2 ) ), ~( p( g( sk2 ), X ) ) ]
% 0.43/1.06 ] .
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 percentage equality = 0.000000, percentage horn = 0.600000
% 0.43/1.06 This a non-horn, non-equality problem
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 Options Used:
% 0.43/1.06
% 0.43/1.06 useres = 1
% 0.43/1.06 useparamod = 0
% 0.43/1.06 useeqrefl = 0
% 0.43/1.06 useeqfact = 0
% 0.43/1.06 usefactor = 1
% 0.43/1.06 usesimpsplitting = 0
% 0.43/1.06 usesimpdemod = 0
% 0.43/1.06 usesimpres = 3
% 0.43/1.06
% 0.43/1.06 resimpinuse = 1000
% 0.43/1.06 resimpclauses = 20000
% 0.43/1.06 substype = standard
% 0.43/1.06 backwardsubs = 1
% 0.43/1.06 selectoldest = 5
% 0.43/1.06
% 0.43/1.06 litorderings [0] = split
% 0.43/1.06 litorderings [1] = liftord
% 0.43/1.06
% 0.43/1.06 termordering = none
% 0.43/1.06
% 0.43/1.06 litapriori = 1
% 0.43/1.06 termapriori = 0
% 0.43/1.06 litaposteriori = 0
% 0.43/1.06 termaposteriori = 0
% 0.43/1.06 demodaposteriori = 0
% 0.43/1.06 ordereqreflfact = 0
% 0.43/1.06
% 0.43/1.06 litselect = none
% 0.43/1.06
% 0.43/1.06 maxweight = 15
% 0.43/1.06 maxdepth = 30000
% 0.43/1.06 maxlength = 115
% 0.43/1.06 maxnrvars = 195
% 0.43/1.06 excuselevel = 1
% 0.43/1.06 increasemaxweight = 1
% 0.43/1.06
% 0.43/1.06 maxselected = 10000000
% 0.43/1.06 maxnrclauses = 10000000
% 0.43/1.06
% 0.43/1.06 showgenerated = 0
% 0.43/1.06 showkept = 0
% 0.43/1.06 showselected = 0
% 0.43/1.06 showdeleted = 0
% 0.43/1.06 showresimp = 1
% 0.43/1.06 showstatus = 2000
% 0.43/1.06
% 0.43/1.06 prologoutput = 1
% 0.43/1.06 nrgoals = 5000000
% 0.43/1.06 totalproof = 1
% 0.43/1.06
% 0.43/1.06 Symbols occurring in the translation:
% 0.43/1.06
% 0.43/1.06 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.43/1.06 . [1, 2] (w:1, o:22, a:1, s:1, b:0),
% 0.43/1.06 ! [4, 1] (w:0, o:13, a:1, s:1, b:0),
% 0.43/1.06 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.43/1.06 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.43/1.06 p [40, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.43/1.06 m [43, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.43/1.06 sk1 [44, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.43/1.06 f [45, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.43/1.06 q [46, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.43/1.06 g [47, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.43/1.06 sk2 [48, 0] (w:1, o:5, a:1, s:1, b:0).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 Starting Search:
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 Bliksems!, er is een bewijs:
% 0.43/1.06 % SZS status Unsatisfiable
% 0.43/1.06 % SZS output start Refutation
% 0.43/1.06
% 0.43/1.06 clause( 0, [ ~( p( Y, Z ) ), p( X, X ) ] )
% 0.43/1.06 .
% 0.43/1.06 clause( 1, [ m( X ), p( X, sk1( X ) ) ] )
% 0.43/1.06 .
% 0.43/1.06 clause( 2, [ q( f( X, sk1( X ) ) ), p( X, sk1( X ) ) ] )
% 0.43/1.06 .
% 0.43/1.06 clause( 3, [ ~( m( g( X ) ) ), ~( q( X ) ) ] )
% 0.43/1.06 .
% 0.43/1.06 clause( 4, [ ~( p( g( sk2 ), X ) ), ~( p( sk2, sk2 ) ) ] )
% 0.43/1.06 .
% 0.43/1.06 clause( 5, [ m( X ), p( Y, Y ) ] )
% 0.43/1.06 .
% 0.43/1.06 clause( 8, [ ~( p( X, Y ) ), ~( p( sk2, sk2 ) ) ] )
% 0.43/1.06 .
% 0.43/1.06 clause( 11, [ ~( p( sk2, sk2 ) ) ] )
% 0.43/1.06 .
% 0.43/1.06 clause( 13, [ m( X ) ] )
% 0.43/1.06 .
% 0.43/1.06 clause( 14, [ ~( p( X, Y ) ) ] )
% 0.43/1.06 .
% 0.43/1.06 clause( 15, [ q( f( X, sk1( X ) ) ) ] )
% 0.43/1.06 .
% 0.43/1.06 clause( 16, [] )
% 0.43/1.06 .
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 % SZS output end Refutation
% 0.43/1.06 found a proof!
% 0.43/1.06
% 0.43/1.06 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.43/1.06
% 0.43/1.06 initialclauses(
% 0.43/1.06 [ clause( 18, [ p( X, X ), ~( p( Y, Z ) ) ] )
% 0.43/1.06 , clause( 19, [ m( X ), p( X, sk1( X ) ) ] )
% 0.43/1.06 , clause( 20, [ q( f( X, sk1( X ) ) ), p( X, sk1( X ) ) ] )
% 0.43/1.06 , clause( 21, [ ~( m( g( X ) ) ), ~( q( X ) ) ] )
% 0.43/1.06 , clause( 22, [ ~( p( sk2, sk2 ) ), ~( p( g( sk2 ), X ) ) ] )
% 0.43/1.06 ] ).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 subsumption(
% 0.43/1.06 clause( 0, [ ~( p( Y, Z ) ), p( X, X ) ] )
% 0.43/1.06 , clause( 18, [ p( X, X ), ~( p( Y, Z ) ) ] )
% 0.43/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.43/1.06 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 subsumption(
% 0.43/1.06 clause( 1, [ m( X ), p( X, sk1( X ) ) ] )
% 0.43/1.06 , clause( 19, [ m( X ), p( X, sk1( X ) ) ] )
% 0.43/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.43/1.06 1 )] ) ).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 subsumption(
% 0.43/1.06 clause( 2, [ q( f( X, sk1( X ) ) ), p( X, sk1( X ) ) ] )
% 0.43/1.06 , clause( 20, [ q( f( X, sk1( X ) ) ), p( X, sk1( X ) ) ] )
% 0.43/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.43/1.06 1 )] ) ).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 subsumption(
% 0.43/1.06 clause( 3, [ ~( m( g( X ) ) ), ~( q( X ) ) ] )
% 0.43/1.06 , clause( 21, [ ~( m( g( X ) ) ), ~( q( X ) ) ] )
% 0.43/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.43/1.06 1 )] ) ).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 subsumption(
% 0.43/1.06 clause( 4, [ ~( p( g( sk2 ), X ) ), ~( p( sk2, sk2 ) ) ] )
% 0.43/1.06 , clause( 22, [ ~( p( sk2, sk2 ) ), ~( p( g( sk2 ), X ) ) ] )
% 0.43/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.43/1.06 0 )] ) ).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 resolution(
% 0.43/1.06 clause( 23, [ p( Y, Y ), m( X ) ] )
% 0.43/1.06 , clause( 0, [ ~( p( Y, Z ) ), p( X, X ) ] )
% 0.43/1.06 , 0, clause( 1, [ m( X ), p( X, sk1( X ) ) ] )
% 0.43/1.06 , 1, substitution( 0, [ :=( X, Y ), :=( Y, X ), :=( Z, sk1( X ) )] ),
% 0.43/1.06 substitution( 1, [ :=( X, X )] )).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 subsumption(
% 0.43/1.06 clause( 5, [ m( X ), p( Y, Y ) ] )
% 0.43/1.06 , clause( 23, [ p( Y, Y ), m( X ) ] )
% 0.43/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.43/1.06 ), ==>( 1, 0 )] ) ).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 resolution(
% 0.43/1.06 clause( 24, [ ~( p( sk2, sk2 ) ), ~( p( X, Y ) ) ] )
% 0.43/1.06 , clause( 4, [ ~( p( g( sk2 ), X ) ), ~( p( sk2, sk2 ) ) ] )
% 0.43/1.06 , 0, clause( 0, [ ~( p( Y, Z ) ), p( X, X ) ] )
% 0.43/1.06 , 1, substitution( 0, [ :=( X, g( sk2 ) )] ), substitution( 1, [ :=( X, g(
% 0.43/1.06 sk2 ) ), :=( Y, X ), :=( Z, Y )] )).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 subsumption(
% 0.43/1.06 clause( 8, [ ~( p( X, Y ) ), ~( p( sk2, sk2 ) ) ] )
% 0.43/1.06 , clause( 24, [ ~( p( sk2, sk2 ) ), ~( p( X, Y ) ) ] )
% 0.43/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.43/1.06 ), ==>( 1, 0 )] ) ).
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 factor(
% 0.43/1.06 clause( 28, [ ~( p( sk2, sk2 ) ) ] )
% 0.43/1.06 , clause( 8, [ ~( p( X, Y ) ), ~( p( sk2, sk2 ) ) ] )
% 0.43/1.07 , 0, 1, substitution( 0, [ :=( X, sk2 ), :=( Y, sk2 )] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 11, [ ~( p( sk2, sk2 ) ) ] )
% 0.43/1.07 , clause( 28, [ ~( p( sk2, sk2 ) ) ] )
% 0.43/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 resolution(
% 0.43/1.07 clause( 29, [ m( X ) ] )
% 0.43/1.07 , clause( 11, [ ~( p( sk2, sk2 ) ) ] )
% 0.43/1.07 , 0, clause( 5, [ m( X ), p( Y, Y ) ] )
% 0.43/1.07 , 1, substitution( 0, [] ), substitution( 1, [ :=( X, X ), :=( Y, sk2 )] )
% 0.43/1.07 ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 13, [ m( X ) ] )
% 0.43/1.07 , clause( 29, [ m( X ) ] )
% 0.43/1.07 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 resolution(
% 0.43/1.07 clause( 30, [ ~( p( X, Y ) ) ] )
% 0.43/1.07 , clause( 11, [ ~( p( sk2, sk2 ) ) ] )
% 0.43/1.07 , 0, clause( 0, [ ~( p( Y, Z ) ), p( X, X ) ] )
% 0.43/1.07 , 1, substitution( 0, [] ), substitution( 1, [ :=( X, sk2 ), :=( Y, X ),
% 0.43/1.07 :=( Z, Y )] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 14, [ ~( p( X, Y ) ) ] )
% 0.43/1.07 , clause( 30, [ ~( p( X, Y ) ) ] )
% 0.43/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.43/1.07 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 resolution(
% 0.43/1.07 clause( 31, [ q( f( X, sk1( X ) ) ) ] )
% 0.43/1.07 , clause( 14, [ ~( p( X, Y ) ) ] )
% 0.43/1.07 , 0, clause( 2, [ q( f( X, sk1( X ) ) ), p( X, sk1( X ) ) ] )
% 0.43/1.07 , 1, substitution( 0, [ :=( X, X ), :=( Y, sk1( X ) )] ), substitution( 1
% 0.43/1.07 , [ :=( X, X )] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 15, [ q( f( X, sk1( X ) ) ) ] )
% 0.43/1.07 , clause( 31, [ q( f( X, sk1( X ) ) ) ] )
% 0.43/1.07 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 resolution(
% 0.43/1.07 clause( 32, [ ~( m( g( f( X, sk1( X ) ) ) ) ) ] )
% 0.43/1.07 , clause( 3, [ ~( m( g( X ) ) ), ~( q( X ) ) ] )
% 0.43/1.07 , 1, clause( 15, [ q( f( X, sk1( X ) ) ) ] )
% 0.43/1.07 , 0, substitution( 0, [ :=( X, f( X, sk1( X ) ) )] ), substitution( 1, [
% 0.43/1.07 :=( X, X )] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 resolution(
% 0.43/1.07 clause( 33, [] )
% 0.43/1.07 , clause( 32, [ ~( m( g( f( X, sk1( X ) ) ) ) ) ] )
% 0.43/1.07 , 0, clause( 13, [ m( X ) ] )
% 0.43/1.07 , 0, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, g( f( X,
% 0.43/1.07 sk1( X ) ) ) )] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 16, [] )
% 0.43/1.07 , clause( 33, [] )
% 0.43/1.07 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 end.
% 0.43/1.07
% 0.43/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.43/1.07
% 0.43/1.07 Memory use:
% 0.43/1.07
% 0.43/1.07 space for terms: 214
% 0.43/1.07 space for clauses: 763
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 clauses generated: 25
% 0.43/1.07 clauses kept: 17
% 0.43/1.07 clauses selected: 10
% 0.43/1.07 clauses deleted: 2
% 0.43/1.07 clauses inuse deleted: 0
% 0.43/1.07
% 0.43/1.07 subsentry: 19
% 0.43/1.07 literals s-matched: 10
% 0.43/1.07 literals matched: 10
% 0.43/1.07 full subsumption: 0
% 0.43/1.07
% 0.43/1.07 checksum: 1074058198
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 Bliksem ended
%------------------------------------------------------------------------------