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