%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN072-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:26 EDT 2022
% Result : Unsatisfiable 0.71s 1.13s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN072-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n018.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 04:13:29 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.71/1.13 *** allocated 10000 integers for termspace/termends
% 0.71/1.13 *** allocated 10000 integers for clauses
% 0.71/1.13 *** allocated 10000 integers for justifications
% 0.71/1.13 Bliksem 1.12
% 0.71/1.13
% 0.71/1.13
% 0.71/1.13 Automatic Strategy Selection
% 0.71/1.13
% 0.71/1.13 Clauses:
% 0.71/1.13 [
% 0.71/1.13 [ =( X, c ), =( X, d ) ],
% 0.71/1.13 [ 'big_p'( a ) ],
% 0.71/1.13 [ 'big_p'( b ) ],
% 0.71/1.13 [ ~( =( a, b ) ) ],
% 0.71/1.13 [ ~( 'big_p'( e ) ) ]
% 0.71/1.13 ] .
% 0.71/1.13
% 0.71/1.13
% 0.71/1.13 percentage equality = 0.500000, percentage horn = 0.800000
% 0.71/1.13 This is a problem with some equality
% 0.71/1.13
% 0.71/1.13
% 0.71/1.13
% 0.71/1.13 Options Used:
% 0.71/1.13
% 0.71/1.13 useres = 1
% 0.71/1.13 useparamod = 1
% 0.71/1.13 useeqrefl = 1
% 0.71/1.13 useeqfact = 1
% 0.71/1.13 usefactor = 1
% 0.71/1.13 usesimpsplitting = 0
% 0.71/1.13 usesimpdemod = 5
% 0.71/1.13 usesimpres = 3
% 0.71/1.13
% 0.71/1.13 resimpinuse = 1000
% 0.71/1.13 resimpclauses = 20000
% 0.71/1.13 substype = eqrewr
% 0.71/1.13 backwardsubs = 1
% 0.71/1.13 selectoldest = 5
% 0.71/1.13
% 0.71/1.13 litorderings [0] = split
% 0.71/1.13 litorderings [1] = extend the termordering, first sorting on arguments
% 0.71/1.13
% 0.71/1.13 termordering = kbo
% 0.71/1.13
% 0.71/1.13 litapriori = 0
% 0.71/1.13 termapriori = 1
% 0.71/1.13 litaposteriori = 0
% 0.71/1.13 termaposteriori = 0
% 0.71/1.13 demodaposteriori = 0
% 0.71/1.13 ordereqreflfact = 0
% 0.71/1.13
% 0.71/1.13 litselect = negord
% 0.71/1.13
% 0.71/1.13 maxweight = 15
% 0.71/1.13 maxdepth = 30000
% 0.71/1.13 maxlength = 115
% 0.71/1.13 maxnrvars = 195
% 0.71/1.13 excuselevel = 1
% 0.71/1.13 increasemaxweight = 1
% 0.71/1.13
% 0.71/1.13 maxselected = 10000000
% 0.71/1.13 maxnrclauses = 10000000
% 0.71/1.13
% 0.71/1.13 showgenerated = 0
% 0.71/1.13 showkept = 0
% 0.71/1.13 showselected = 0
% 0.71/1.13 showdeleted = 0
% 0.71/1.13 showresimp = 1
% 0.71/1.13 showstatus = 2000
% 0.71/1.13
% 0.71/1.13 prologoutput = 1
% 0.71/1.13 nrgoals = 5000000
% 0.71/1.13 totalproof = 1
% 0.71/1.13
% 0.71/1.13 Symbols occurring in the translation:
% 0.71/1.13
% 0.71/1.13 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.71/1.13 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.71/1.13 ! [4, 1] (w:0, o:15, a:1, s:1, b:0),
% 0.71/1.13 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.13 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.13 c [40, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.71/1.13 d [41, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.71/1.13 a [42, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.71/1.13 'big_p' [43, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.71/1.13 b [44, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.71/1.13 e [45, 0] (w:1, o:14, a:1, s:1, b:0).
% 0.71/1.13
% 0.71/1.13
% 0.71/1.13 Starting Search:
% 0.71/1.13
% 0.71/1.13
% 0.71/1.13 Bliksems!, er is een bewijs:
% 0.71/1.13 % SZS status Unsatisfiable
% 0.71/1.13 % SZS output start Refutation
% 0.71/1.13
% 0.71/1.13 clause( 0, [ =( X, c ), =( X, d ) ] )
% 0.71/1.13 .
% 0.71/1.13 clause( 1, [ 'big_p'( a ) ] )
% 0.71/1.13 .
% 0.71/1.13 clause( 2, [ 'big_p'( b ) ] )
% 0.71/1.13 .
% 0.71/1.13 clause( 3, [ ~( =( a, b ) ) ] )
% 0.71/1.13 .
% 0.71/1.13 clause( 4, [ ~( 'big_p'( e ) ) ] )
% 0.71/1.13 .
% 0.71/1.13 clause( 16, [ 'big_p'( c ), =( a, d ) ] )
% 0.71/1.13 .
% 0.71/1.13 clause( 18, [ 'big_p'( c ), =( d, b ) ] )
% 0.71/1.13 .
% 0.71/1.13 clause( 33, [ 'big_p'( c ) ] )
% 0.71/1.13 .
% 0.71/1.13 clause( 34, [ 'big_p'( X ), =( X, d ) ] )
% 0.71/1.13 .
% 0.71/1.13 clause( 36, [ =( e, d ) ] )
% 0.71/1.13 .
% 0.71/1.13 clause( 41, [ ~( 'big_p'( d ) ) ] )
% 0.71/1.13 .
% 0.71/1.13 clause( 42, [ ~( 'big_p'( X ) ), =( X, c ) ] )
% 0.71/1.13 .
% 0.71/1.13 clause( 43, [ =( a, c ) ] )
% 0.71/1.13 .
% 0.71/1.13 clause( 44, [ =( c, b ) ] )
% 0.71/1.13 .
% 0.71/1.13 clause( 50, [] )
% 0.71/1.13 .
% 0.71/1.13
% 0.71/1.13
% 0.71/1.13 % SZS output end Refutation
% 0.71/1.13 found a proof!
% 0.71/1.13
% 0.71/1.13 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.13
% 0.71/1.13 initialclauses(
% 0.71/1.13 [ clause( 52, [ =( X, c ), =( X, d ) ] )
% 0.71/1.13 , clause( 53, [ 'big_p'( a ) ] )
% 0.71/1.13 , clause( 54, [ 'big_p'( b ) ] )
% 0.71/1.13 , clause( 55, [ ~( =( a, b ) ) ] )
% 0.71/1.13 , clause( 56, [ ~( 'big_p'( e ) ) ] )
% 0.71/1.13 ] ).
% 0.71/1.13
% 0.71/1.13
% 0.71/1.13
% 0.71/1.13 subsumption(
% 0.71/1.13 clause( 0, [ =( X, c ), =( X, d ) ] )
% 0.71/1.13 , clause( 52, [ =( X, c ), =( X, d ) ] )
% 0.71/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.71/1.13 1 )] ) ).
% 0.71/1.13
% 0.71/1.13
% 0.71/1.13 subsumption(
% 0.71/1.13 clause( 1, [ 'big_p'( a ) ] )
% 0.71/1.13 , clause( 53, [ 'big_p'( a ) ] )
% 0.71/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.13
% 0.71/1.13
% 0.71/1.13 subsumption(
% 0.71/1.13 clause( 2, [ 'big_p'( b ) ] )
% 0.71/1.13 , clause( 54, [ 'big_p'( b ) ] )
% 0.71/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.13
% 0.71/1.13
% 0.71/1.13 subsumption(
% 0.71/1.13 clause( 3, [ ~( =( a, b ) ) ] )
% 0.71/1.13 , clause( 55, [ ~( =( a, b ) ) ] )
% 0.71/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.13
% 0.71/1.13
% 0.71/1.13 subsumption(
% 0.71/1.13 clause( 4, [ ~( 'big_p'( e ) ) ] )
% 0.71/1.13 , clause( 56, [ ~( 'big_p'( e ) ) ] )
% 0.71/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.13
% 0.71/1.13
% 0.71/1.13 eqswap(
% 0.71/1.13 clause( 75, [ =( d, X ), =( X, c ) ] )
% 0.71/1.13 , clause( 0, [ =( X, c ), =( X, d ) ] )
% 0.71/1.13 , 1, substitution( 0, [ :=( X, X )] )).
% 0.71/1.13
% 0.71/1.13
% 0.71/1.13 paramod(
% 0.71/1.13 clause( 428, [ 'big_p'( c ), =( d, a ) ] )
% 0.71/1.13 , clause( 75, [ =( d, X ), =( X, c ) ] )
% 0.71/1.13 , 1, clause( 1, [ 'big_p'( a ) ] )
% 0.71/1.13 , 0, 1, substitution( 0, [ :=( X, a )] ), substitution( 1, [] )).
% 0.71/1.13
% 0.71/1.13
% 0.71/1.13 eqswap(
% 0.71/1.13 clause( 574, [ =( a, d ), 'big_p'( c ) ] )
% 0.71/1.13 , clause( 428, [ 'big_p'( c ), =( d, a ) ] )
% 0.71/1.13 , 1, substitution( 0, [] )).
% 0.71/1.13
% 0.71/1.13
% 0.71/1.13 subsumptioCputime limit exceeded (core dumped) (core dumped)
% 300.07/300.49 Bliksem ended
%------------------------------------------------------------------------------