TSTP Solution File: SYN310-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN310-1 : TPTP v8.1.0. Released v1.2.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:49:26 EDT 2022
% Result : Unsatisfiable 0.67s 1.06s
% Output : Refutation 0.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SYN310-1 : TPTP v8.1.0. Released v1.2.0.
% 0.07/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n018.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 : Tue Jul 12 02:59:14 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.67/1.06 *** allocated 10000 integers for termspace/termends
% 0.67/1.06 *** allocated 10000 integers for clauses
% 0.67/1.06 *** allocated 10000 integers for justifications
% 0.67/1.06 Bliksem 1.12
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 Automatic Strategy Selection
% 0.67/1.06
% 0.67/1.06 Clauses:
% 0.67/1.06 [
% 0.67/1.06 [ ~( p( X, Y, Z ) ), p( Z, Y, X ) ],
% 0.67/1.06 [ ~( p( X, Y, Z ) ), p( Y, X, Z ) ],
% 0.67/1.06 [ ~( p( X, Y, g( Z ) ) ), p( X, Y, Z ) ],
% 0.67/1.06 [ ~( p( f( X ), Y, Z ) ), p( X, Y, Z ) ],
% 0.67/1.06 [ ~( p( a, b, c ) ) ],
% 0.67/1.06 [ p( f( g( a ) ), f( g( b ) ), f( g( c ) ) ) ]
% 0.67/1.06 ] .
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 percentage equality = 0.000000, percentage horn = 1.000000
% 0.67/1.06 This is a near-Horn, non-equality problem
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 Options Used:
% 0.67/1.06
% 0.67/1.06 useres = 1
% 0.67/1.06 useparamod = 0
% 0.67/1.06 useeqrefl = 0
% 0.67/1.06 useeqfact = 0
% 0.67/1.06 usefactor = 1
% 0.67/1.06 usesimpsplitting = 0
% 0.67/1.06 usesimpdemod = 0
% 0.67/1.06 usesimpres = 4
% 0.67/1.06
% 0.67/1.06 resimpinuse = 1000
% 0.67/1.06 resimpclauses = 20000
% 0.67/1.06 substype = standard
% 0.67/1.06 backwardsubs = 1
% 0.67/1.06 selectoldest = 5
% 0.67/1.06
% 0.67/1.06 litorderings [0] = split
% 0.67/1.06 litorderings [1] = liftord
% 0.67/1.06
% 0.67/1.06 termordering = none
% 0.67/1.06
% 0.67/1.06 litapriori = 1
% 0.67/1.06 termapriori = 0
% 0.67/1.06 litaposteriori = 0
% 0.67/1.06 termaposteriori = 0
% 0.67/1.06 demodaposteriori = 0
% 0.67/1.06 ordereqreflfact = 0
% 0.67/1.06
% 0.67/1.06 litselect = negative
% 0.67/1.06
% 0.67/1.06 maxweight = 30000
% 0.67/1.06 maxdepth = 30000
% 0.67/1.06 maxlength = 115
% 0.67/1.06 maxnrvars = 195
% 0.67/1.06 excuselevel = 0
% 0.67/1.06 increasemaxweight = 0
% 0.67/1.06
% 0.67/1.06 maxselected = 10000000
% 0.67/1.06 maxnrclauses = 10000000
% 0.67/1.06
% 0.67/1.06 showgenerated = 0
% 0.67/1.06 showkept = 0
% 0.67/1.06 showselected = 0
% 0.67/1.06 showdeleted = 0
% 0.67/1.06 showresimp = 1
% 0.67/1.06 showstatus = 2000
% 0.67/1.06
% 0.67/1.06 prologoutput = 1
% 0.67/1.06 nrgoals = 5000000
% 0.67/1.06 totalproof = 1
% 0.67/1.06
% 0.67/1.06 Symbols occurring in the translation:
% 0.67/1.06
% 0.67/1.06 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.67/1.06 . [1, 2] (w:1, o:22, a:1, s:1, b:0),
% 0.67/1.06 ! [4, 1] (w:1, o:15, a:1, s:1, b:0),
% 0.67/1.06 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.67/1.06 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.67/1.06 p [42, 3] (w:1, o:47, a:1, s:1, b:0),
% 0.67/1.06 g [43, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.67/1.06 f [44, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.67/1.06 a [45, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.67/1.06 b [46, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.67/1.06 c [47, 0] (w:1, o:14, a:1, s:1, b:0).
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 Starting Search:
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 Bliksems!, er is een bewijs:
% 0.67/1.06 % SZS status Unsatisfiable
% 0.67/1.06 % SZS output start Refutation
% 0.67/1.06
% 0.67/1.06 clause( 0, [ p( Z, Y, X ), ~( p( X, Y, Z ) ) ] )
% 0.67/1.06 .
% 0.67/1.06 clause( 1, [ p( Y, X, Z ), ~( p( X, Y, Z ) ) ] )
% 0.67/1.06 .
% 0.67/1.06 clause( 2, [ p( X, Y, Z ), ~( p( X, Y, g( Z ) ) ) ] )
% 0.67/1.06 .
% 0.67/1.06 clause( 3, [ p( X, Y, Z ), ~( p( f( X ), Y, Z ) ) ] )
% 0.67/1.06 .
% 0.67/1.06 clause( 4, [ ~( p( a, b, c ) ) ] )
% 0.67/1.06 .
% 0.67/1.06 clause( 5, [ p( f( g( a ) ), f( g( b ) ), f( g( c ) ) ) ] )
% 0.67/1.06 .
% 0.67/1.06 clause( 6, [ p( g( a ), f( g( b ) ), f( g( c ) ) ) ] )
% 0.67/1.06 .
% 0.67/1.06 clause( 9, [ p( f( g( c ) ), f( g( b ) ), g( a ) ) ] )
% 0.67/1.06 .
% 0.67/1.06 clause( 11, [ p( f( g( c ) ), f( g( b ) ), a ) ] )
% 0.67/1.06 .
% 0.67/1.06 clause( 14, [ p( g( c ), f( g( b ) ), a ) ] )
% 0.67/1.06 .
% 0.67/1.06 clause( 17, [ p( a, f( g( b ) ), g( c ) ) ] )
% 0.67/1.06 .
% 0.67/1.06 clause( 21, [ p( a, f( g( b ) ), c ) ] )
% 0.67/1.06 .
% 0.67/1.06 clause( 23, [ p( c, f( g( b ) ), a ) ] )
% 0.67/1.06 .
% 0.67/1.06 clause( 25, [ p( f( g( b ) ), c, a ) ] )
% 0.67/1.06 .
% 0.67/1.06 clause( 26, [ p( g( b ), c, a ) ] )
% 0.67/1.06 .
% 0.67/1.06 clause( 30, [ p( a, c, g( b ) ) ] )
% 0.67/1.06 .
% 0.67/1.06 clause( 32, [ p( a, c, b ) ] )
% 0.67/1.06 .
% 0.67/1.06 clause( 34, [ p( b, c, a ) ] )
% 0.67/1.06 .
% 0.67/1.06 clause( 36, [ p( c, b, a ) ] )
% 0.67/1.06 .
% 0.67/1.06 clause( 39, [] )
% 0.67/1.06 .
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 % SZS output end Refutation
% 0.67/1.06 found a proof!
% 0.67/1.06
% 0.67/1.06 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.67/1.06
% 0.67/1.06 initialclauses(
% 0.67/1.06 [ clause( 41, [ ~( p( X, Y, Z ) ), p( Z, Y, X ) ] )
% 0.67/1.06 , clause( 42, [ ~( p( X, Y, Z ) ), p( Y, X, Z ) ] )
% 0.67/1.06 , clause( 43, [ ~( p( X, Y, g( Z ) ) ), p( X, Y, Z ) ] )
% 0.67/1.06 , clause( 44, [ ~( p( f( X ), Y, Z ) ), p( X, Y, Z ) ] )
% 0.67/1.06 , clause( 45, [ ~( p( a, b, c ) ) ] )
% 0.67/1.06 , clause( 46, [ p( f( g( a ) ), f( g( b ) ), f( g( c ) ) ) ] )
% 0.67/1.06 ] ).
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 subsumption(
% 0.67/1.06 clause( 0, [ p( Z, Y, X ), ~( p( X, Y, Z ) ) ] )
% 0.67/1.06 , clause( 41, [ ~( p( X, Y, Z ) ), p( Z, Y, X ) ] )
% 0.67/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.67/1.06 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 subsumption(
% 0.67/1.06 clause( 1, [ p( Y, X, Z ), ~( p( X, Y, Z ) ) ] )
% 0.67/1.06 , clause( 42, [ ~( p( X, Y, Z ) ), p( Y, X, Z ) ] )
% 0.67/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.67/1.06 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 subsumption(
% 0.67/1.06 clause( 2, [ p( X, Y, Z ), ~( p( X, Y, g( Z ) ) ) ] )
% 0.67/1.06 , clause( 43, [ ~( p( X, Y, g( Z ) ) ), p( X, Y, Z ) ] )
% 0.67/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.67/1.06 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 subsumption(
% 0.67/1.06 clause( 3, [ p( X, Y, Z ), ~( p( f( X ), Y, Z ) ) ] )
% 0.67/1.06 , clause( 44, [ ~( p( f( X ), Y, Z ) ), p( X, Y, Z ) ] )
% 0.67/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.67/1.06 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 subsumption(
% 0.67/1.06 clause( 4, [ ~( p( a, b, c ) ) ] )
% 0.67/1.06 , clause( 45, [ ~( p( a, b, c ) ) ] )
% 0.67/1.06 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 subsumption(
% 0.67/1.06 clause( 5, [ p( f( g( a ) ), f( g( b ) ), f( g( c ) ) ) ] )
% 0.67/1.06 , clause( 46, [ p( f( g( a ) ), f( g( b ) ), f( g( c ) ) ) ] )
% 0.67/1.06 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 resolution(
% 0.67/1.06 clause( 47, [ p( g( a ), f( g( b ) ), f( g( c ) ) ) ] )
% 0.67/1.06 , clause( 3, [ p( X, Y, Z ), ~( p( f( X ), Y, Z ) ) ] )
% 0.67/1.06 , 1, clause( 5, [ p( f( g( a ) ), f( g( b ) ), f( g( c ) ) ) ] )
% 0.67/1.06 , 0, substitution( 0, [ :=( X, g( a ) ), :=( Y, f( g( b ) ) ), :=( Z, f( g(
% 0.67/1.06 c ) ) )] ), substitution( 1, [] )).
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 subsumption(
% 0.67/1.06 clause( 6, [ p( g( a ), f( g( b ) ), f( g( c ) ) ) ] )
% 0.67/1.06 , clause( 47, [ p( g( a ), f( g( b ) ), f( g( c ) ) ) ] )
% 0.67/1.06 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 resolution(
% 0.67/1.06 clause( 48, [ p( f( g( c ) ), f( g( b ) ), g( a ) ) ] )
% 0.67/1.06 , clause( 0, [ p( Z, Y, X ), ~( p( X, Y, Z ) ) ] )
% 0.67/1.06 , 1, clause( 6, [ p( g( a ), f( g( b ) ), f( g( c ) ) ) ] )
% 0.67/1.06 , 0, substitution( 0, [ :=( X, g( a ) ), :=( Y, f( g( b ) ) ), :=( Z, f( g(
% 0.67/1.06 c ) ) )] ), substitution( 1, [] )).
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 subsumption(
% 0.67/1.06 clause( 9, [ p( f( g( c ) ), f( g( b ) ), g( a ) ) ] )
% 0.67/1.06 , clause( 48, [ p( f( g( c ) ), f( g( b ) ), g( a ) ) ] )
% 0.67/1.06 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 resolution(
% 0.67/1.06 clause( 49, [ p( f( g( c ) ), f( g( b ) ), a ) ] )
% 0.67/1.06 , clause( 2, [ p( X, Y, Z ), ~( p( X, Y, g( Z ) ) ) ] )
% 0.67/1.06 , 1, clause( 9, [ p( f( g( c ) ), f( g( b ) ), g( a ) ) ] )
% 0.67/1.06 , 0, substitution( 0, [ :=( X, f( g( c ) ) ), :=( Y, f( g( b ) ) ), :=( Z,
% 0.67/1.06 a )] ), substitution( 1, [] )).
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 subsumption(
% 0.67/1.06 clause( 11, [ p( f( g( c ) ), f( g( b ) ), a ) ] )
% 0.67/1.06 , clause( 49, [ p( f( g( c ) ), f( g( b ) ), a ) ] )
% 0.67/1.06 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 resolution(
% 0.67/1.06 clause( 50, [ p( g( c ), f( g( b ) ), a ) ] )
% 0.67/1.06 , clause( 3, [ p( X, Y, Z ), ~( p( f( X ), Y, Z ) ) ] )
% 0.67/1.06 , 1, clause( 11, [ p( f( g( c ) ), f( g( b ) ), a ) ] )
% 0.67/1.06 , 0, substitution( 0, [ :=( X, g( c ) ), :=( Y, f( g( b ) ) ), :=( Z, a )] )
% 0.67/1.06 , substitution( 1, [] )).
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 subsumption(
% 0.67/1.06 clause( 14, [ p( g( c ), f( g( b ) ), a ) ] )
% 0.67/1.06 , clause( 50, [ p( g( c ), f( g( b ) ), a ) ] )
% 0.67/1.06 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 resolution(
% 0.67/1.06 clause( 51, [ p( a, f( g( b ) ), g( c ) ) ] )
% 0.67/1.06 , clause( 0, [ p( Z, Y, X ), ~( p( X, Y, Z ) ) ] )
% 0.67/1.06 , 1, clause( 14, [ p( g( c ), f( g( b ) ), a ) ] )
% 0.67/1.06 , 0, substitution( 0, [ :=( X, g( c ) ), :=( Y, f( g( b ) ) ), :=( Z, a )] )
% 0.67/1.06 , substitution( 1, [] )).
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 subsumption(
% 0.67/1.06 clause( 17, [ p( a, f( g( b ) ), g( c ) ) ] )
% 0.67/1.06 , clause( 51, [ p( a, f( g( b ) ), g( c ) ) ] )
% 0.67/1.06 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 resolution(
% 0.67/1.06 clause( 52, [ p( a, f( g( b ) ), c ) ] )
% 0.67/1.06 , clause( 2, [ p( X, Y, Z ), ~( p( X, Y, g( Z ) ) ) ] )
% 0.67/1.06 , 1, clause( 17, [ p( a, f( g( b ) ), g( c ) ) ] )
% 0.67/1.06 , 0, substitution( 0, [ :=( X, a ), :=( Y, f( g( b ) ) ), :=( Z, c )] ),
% 0.67/1.06 substitution( 1, [] )).
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 subsumption(
% 0.67/1.06 clause( 21, [ p( a, f( g( b ) ), c ) ] )
% 0.67/1.06 , clause( 52, [ p( a, f( g( b ) ), c ) ] )
% 0.67/1.06 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 resolution(
% 0.67/1.06 clause( 53, [ p( c, f( g( b ) ), a ) ] )
% 0.67/1.06 , clause( 0, [ p( Z, Y, X ), ~( p( X, Y, Z ) ) ] )
% 0.67/1.06 , 1, clause( 21, [ p( a, f( g( b ) ), c ) ] )
% 0.67/1.06 , 0, substitution( 0, [ :=( X, a ), :=( Y, f( g( b ) ) ), :=( Z, c )] ),
% 0.67/1.06 substitution( 1, [] )).
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 subsumption(
% 0.67/1.06 clause( 23, [ p( c, f( g( b ) ), a ) ] )
% 0.67/1.06 , clause( 53, [ p( c, f( g( b ) ), a ) ] )
% 0.67/1.06 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 resolution(
% 0.67/1.06 clause( 54, [ p( f( g( b ) ), c, a ) ] )
% 0.67/1.06 , clause( 1, [ p( Y, X, Z ), ~( p( X, Y, Z ) ) ] )
% 0.67/1.06 , 1, clause( 23, [ p( c, f( g( b ) ), a ) ] )
% 0.67/1.06 , 0, substitution( 0, [ :=( X, c ), :=( Y, f( g( b ) ) ), :=( Z, a )] ),
% 0.67/1.06 substitution( 1, [] )).
% 0.67/1.06
% 0.67/1.06
% 0.67/1.06 subsumption(
% 0.67/1.06 clause( 25, [ p( f( g( b ) ), c, a ) ] )
% 0.71/1.06 , clause( 54, [ p( f( g( b ) ), c, a ) ] )
% 0.71/1.06 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 resolution(
% 0.71/1.06 clause( 55, [ p( g( b ), c, a ) ] )
% 0.71/1.06 , clause( 3, [ p( X, Y, Z ), ~( p( f( X ), Y, Z ) ) ] )
% 0.71/1.06 , 1, clause( 25, [ p( f( g( b ) ), c, a ) ] )
% 0.71/1.06 , 0, substitution( 0, [ :=( X, g( b ) ), :=( Y, c ), :=( Z, a )] ),
% 0.71/1.06 substitution( 1, [] )).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 26, [ p( g( b ), c, a ) ] )
% 0.71/1.06 , clause( 55, [ p( g( b ), c, a ) ] )
% 0.71/1.06 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 resolution(
% 0.71/1.06 clause( 56, [ p( a, c, g( b ) ) ] )
% 0.71/1.06 , clause( 0, [ p( Z, Y, X ), ~( p( X, Y, Z ) ) ] )
% 0.71/1.06 , 1, clause( 26, [ p( g( b ), c, a ) ] )
% 0.71/1.06 , 0, substitution( 0, [ :=( X, g( b ) ), :=( Y, c ), :=( Z, a )] ),
% 0.71/1.06 substitution( 1, [] )).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 30, [ p( a, c, g( b ) ) ] )
% 0.71/1.06 , clause( 56, [ p( a, c, g( b ) ) ] )
% 0.71/1.06 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 resolution(
% 0.71/1.06 clause( 57, [ p( a, c, b ) ] )
% 0.71/1.06 , clause( 2, [ p( X, Y, Z ), ~( p( X, Y, g( Z ) ) ) ] )
% 0.71/1.06 , 1, clause( 30, [ p( a, c, g( b ) ) ] )
% 0.71/1.06 , 0, substitution( 0, [ :=( X, a ), :=( Y, c ), :=( Z, b )] ),
% 0.71/1.06 substitution( 1, [] )).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 32, [ p( a, c, b ) ] )
% 0.71/1.06 , clause( 57, [ p( a, c, b ) ] )
% 0.71/1.06 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 resolution(
% 0.71/1.06 clause( 58, [ p( b, c, a ) ] )
% 0.71/1.06 , clause( 0, [ p( Z, Y, X ), ~( p( X, Y, Z ) ) ] )
% 0.71/1.06 , 1, clause( 32, [ p( a, c, b ) ] )
% 0.71/1.06 , 0, substitution( 0, [ :=( X, a ), :=( Y, c ), :=( Z, b )] ),
% 0.71/1.06 substitution( 1, [] )).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 34, [ p( b, c, a ) ] )
% 0.71/1.06 , clause( 58, [ p( b, c, a ) ] )
% 0.71/1.06 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 resolution(
% 0.71/1.06 clause( 59, [ p( c, b, a ) ] )
% 0.71/1.06 , clause( 1, [ p( Y, X, Z ), ~( p( X, Y, Z ) ) ] )
% 0.71/1.06 , 1, clause( 34, [ p( b, c, a ) ] )
% 0.71/1.06 , 0, substitution( 0, [ :=( X, b ), :=( Y, c ), :=( Z, a )] ),
% 0.71/1.06 substitution( 1, [] )).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 36, [ p( c, b, a ) ] )
% 0.71/1.06 , clause( 59, [ p( c, b, a ) ] )
% 0.71/1.06 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 resolution(
% 0.71/1.06 clause( 60, [ p( a, b, c ) ] )
% 0.71/1.06 , clause( 0, [ p( Z, Y, X ), ~( p( X, Y, Z ) ) ] )
% 0.71/1.06 , 1, clause( 36, [ p( c, b, a ) ] )
% 0.71/1.06 , 0, substitution( 0, [ :=( X, c ), :=( Y, b ), :=( Z, a )] ),
% 0.71/1.06 substitution( 1, [] )).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 resolution(
% 0.71/1.06 clause( 61, [] )
% 0.71/1.06 , clause( 4, [ ~( p( a, b, c ) ) ] )
% 0.71/1.06 , 0, clause( 60, [ p( a, b, c ) ] )
% 0.71/1.06 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 subsumption(
% 0.71/1.06 clause( 39, [] )
% 0.71/1.06 , clause( 61, [] )
% 0.71/1.06 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 end.
% 0.71/1.06
% 0.71/1.06 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.06
% 0.71/1.06 Memory use:
% 0.71/1.06
% 0.71/1.06 space for terms: 435
% 0.71/1.06 space for clauses: 2455
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 clauses generated: 49
% 0.71/1.06 clauses kept: 40
% 0.71/1.06 clauses selected: 22
% 0.71/1.06 clauses deleted: 0
% 0.71/1.06 clauses inuse deleted: 0
% 0.71/1.06
% 0.71/1.06 subsentry: 20
% 0.71/1.06 literals s-matched: 20
% 0.71/1.06 literals matched: 20
% 0.71/1.06 full subsumption: 0
% 0.71/1.06
% 0.71/1.06 checksum: 28233854
% 0.71/1.06
% 0.71/1.06
% 0.71/1.06 Bliksem ended
%------------------------------------------------------------------------------