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