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