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