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