%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN083-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:47:35 EDT 2022
% Result : Unsatisfiable 0.41s 1.06s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SYN083-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 13:35:18 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/1.06 *** allocated 10000 integers for termspace/termends
% 0.41/1.06 *** allocated 10000 integers for clauses
% 0.41/1.06 *** allocated 10000 integers for justifications
% 0.41/1.06 Bliksem 1.12
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 Automatic Strategy Selection
% 0.41/1.06
% 0.41/1.06 Clauses:
% 0.41/1.06 [
% 0.41/1.06 [ =( f( X, f( Y, Z ) ), f( f( X, Y ), Z ) ) ],
% 0.41/1.06 [ ~( =( f( a, f( b, f( c, d ) ) ), f( f( f( a, b ), c ), d ) ) ) ]
% 0.41/1.06 ] .
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 percentage equality = 1.000000, percentage horn = 1.000000
% 0.41/1.06 This is a pure equality problem
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 Options Used:
% 0.41/1.06
% 0.41/1.06 useres = 1
% 0.41/1.06 useparamod = 1
% 0.41/1.06 useeqrefl = 1
% 0.41/1.06 useeqfact = 1
% 0.41/1.06 usefactor = 1
% 0.41/1.06 usesimpsplitting = 0
% 0.41/1.06 usesimpdemod = 5
% 0.41/1.06 usesimpres = 3
% 0.41/1.06
% 0.41/1.06 resimpinuse = 1000
% 0.41/1.06 resimpclauses = 20000
% 0.41/1.06 substype = eqrewr
% 0.41/1.06 backwardsubs = 1
% 0.41/1.06 selectoldest = 5
% 0.41/1.06
% 0.41/1.06 litorderings [0] = split
% 0.41/1.06 litorderings [1] = extend the termordering, first sorting on arguments
% 0.41/1.06
% 0.41/1.06 termordering = kbo
% 0.41/1.06
% 0.41/1.06 litapriori = 0
% 0.41/1.06 termapriori = 1
% 0.41/1.06 litaposteriori = 0
% 0.41/1.06 termaposteriori = 0
% 0.41/1.06 demodaposteriori = 0
% 0.41/1.06 ordereqreflfact = 0
% 0.41/1.06
% 0.41/1.06 litselect = negord
% 0.41/1.06
% 0.41/1.06 maxweight = 15
% 0.41/1.06 maxdepth = 30000
% 0.41/1.06 maxlength = 115
% 0.41/1.06 maxnrvars = 195
% 0.41/1.06 excuselevel = 1
% 0.41/1.06 increasemaxweight = 1
% 0.41/1.06
% 0.41/1.06 maxselected = 10000000
% 0.41/1.06 maxnrclauses = 10000000
% 0.41/1.06
% 0.41/1.06 showgenerated = 0
% 0.41/1.06 showkept = 0
% 0.41/1.06 showselected = 0
% 0.41/1.06 showdeleted = 0
% 0.41/1.06 showresimp = 1
% 0.41/1.06 showstatus = 2000
% 0.41/1.06
% 0.41/1.06 prologoutput = 1
% 0.41/1.06 nrgoals = 5000000
% 0.41/1.06 totalproof = 1
% 0.41/1.06
% 0.41/1.06 Symbols occurring in the translation:
% 0.41/1.06
% 0.41/1.06 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.41/1.06 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.41/1.06 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 0.41/1.06 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.41/1.06 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.41/1.06 f [42, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.41/1.06 a [43, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.41/1.06 b [44, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.41/1.06 c [45, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.41/1.06 d [46, 0] (w:1, o:15, a:1, s:1, b:0).
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 Starting Search:
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 Bliksems!, er is een bewijs:
% 0.41/1.06 % SZS status Unsatisfiable
% 0.41/1.06 % SZS output start Refutation
% 0.41/1.06
% 0.41/1.06 clause( 0, [ =( f( X, f( Y, Z ) ), f( f( X, Y ), Z ) ) ] )
% 0.41/1.06 .
% 0.41/1.06 clause( 1, [] )
% 0.41/1.06 .
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 % SZS output end Refutation
% 0.41/1.06 found a proof!
% 0.41/1.06
% 0.41/1.06 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.41/1.06
% 0.41/1.06 initialclauses(
% 0.41/1.06 [ clause( 3, [ =( f( X, f( Y, Z ) ), f( f( X, Y ), Z ) ) ] )
% 0.41/1.06 , clause( 4, [ ~( =( f( a, f( b, f( c, d ) ) ), f( f( f( a, b ), c ), d ) )
% 0.41/1.06 ) ] )
% 0.41/1.06 ] ).
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 subsumption(
% 0.41/1.06 clause( 0, [ =( f( X, f( Y, Z ) ), f( f( X, Y ), Z ) ) ] )
% 0.41/1.06 , clause( 3, [ =( f( X, f( Y, Z ) ), f( f( X, Y ), Z ) ) ] )
% 0.41/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.41/1.06 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 paramod(
% 0.41/1.06 clause( 15, [ ~( =( f( a, f( f( b, c ), d ) ), f( f( f( a, b ), c ), d ) )
% 0.41/1.06 ) ] )
% 0.41/1.06 , clause( 0, [ =( f( X, f( Y, Z ) ), f( f( X, Y ), Z ) ) ] )
% 0.41/1.06 , 0, clause( 4, [ ~( =( f( a, f( b, f( c, d ) ) ), f( f( f( a, b ), c ), d
% 0.41/1.06 ) ) ) ] )
% 0.41/1.06 , 0, 4, substitution( 0, [ :=( X, b ), :=( Y, c ), :=( Z, d )] ),
% 0.41/1.06 substitution( 1, [] )).
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 paramod(
% 0.41/1.06 clause( 18, [ ~( =( f( f( a, f( b, c ) ), d ), f( f( f( a, b ), c ), d ) )
% 0.41/1.06 ) ] )
% 0.41/1.06 , clause( 0, [ =( f( X, f( Y, Z ) ), f( f( X, Y ), Z ) ) ] )
% 0.41/1.06 , 0, clause( 15, [ ~( =( f( a, f( f( b, c ), d ) ), f( f( f( a, b ), c ), d
% 0.41/1.06 ) ) ) ] )
% 0.41/1.06 , 0, 2, substitution( 0, [ :=( X, a ), :=( Y, f( b, c ) ), :=( Z, d )] ),
% 0.41/1.06 substitution( 1, [] )).
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 paramod(
% 0.41/1.06 clause( 19, [ ~( =( f( f( f( a, b ), c ), d ), f( f( f( a, b ), c ), d ) )
% 0.41/1.06 ) ] )
% 0.41/1.06 , clause( 0, [ =( f( X, f( Y, Z ) ), f( f( X, Y ), Z ) ) ] )
% 0.41/1.06 , 0, clause( 18, [ ~( =( f( f( a, f( b, c ) ), d ), f( f( f( a, b ), c ), d
% 0.41/1.06 ) ) ) ] )
% 0.41/1.06 , 0, 3, substitution( 0, [ :=( X, a ), :=( Y, b ), :=( Z, c )] ),
% 0.41/1.06 substitution( 1, [] )).
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 eqrefl(
% 0.41/1.06 clause( 20, [] )
% 0.41/1.06 , clause( 19, [ ~( =( f( f( f( a, b ), c ), d ), f( f( f( a, b ), c ), d )
% 0.41/1.06 ) ) ] )
% 0.41/1.06 , 0, substitution( 0, [] )).
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 subsumption(
% 0.41/1.06 clause( 1, [] )
% 0.41/1.06 , clause( 20, [] )
% 0.41/1.06 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 end.
% 0.41/1.06
% 0.41/1.06 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.41/1.06
% 0.41/1.06 Memory use:
% 0.41/1.06
% 0.41/1.06 space for terms: 80
% 0.41/1.06 space for clauses: 178
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 clauses generated: 2
% 0.41/1.06 clauses kept: 2
% 0.41/1.06 clauses selected: 0
% 0.41/1.06 clauses deleted: 0
% 0.41/1.06 clauses inuse deleted: 0
% 0.41/1.06
% 0.41/1.06 subsentry: 33
% 0.41/1.06 literals s-matched: 10
% 0.41/1.06 literals matched: 10
% 0.41/1.06 full subsumption: 0
% 0.41/1.06
% 0.41/1.06 checksum: -41253
% 0.41/1.06
% 0.41/1.06
% 0.41/1.06 Bliksem ended
%------------------------------------------------------------------------------