%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWV487+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n022.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 : Wed Jul 20 16:25:19 EDT 2022
% Result : Timeout 300.02s 300.41s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWV487+3 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n022.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % DateTime : Thu Jun 16 01:35:02 EDT 2022
% 0.12/0.34 % CPUTime :
% 34.05/34.42 *** allocated 10000 integers for termspace/termends
% 34.05/34.42 *** allocated 10000 integers for clauses
% 34.05/34.42 *** allocated 10000 integers for justifications
% 34.05/34.42 Bliksem 1.12
% 34.05/34.42
% 34.05/34.42
% 34.05/34.42 Automatic Strategy Selection
% 34.05/34.42
% 34.05/34.42
% 34.05/34.42 Clauses:
% 34.05/34.42
% 34.05/34.42 { ! int_leq( X, Y ), int_less( X, Y ), X = Y }.
% 34.05/34.42 { ! int_less( X, Y ), int_leq( X, Y ) }.
% 34.05/34.42 { ! X = Y, int_leq( X, Y ) }.
% 34.05/34.42 { ! int_less( X, Z ), ! int_less( Z, Y ), int_less( X, Y ) }.
% 34.05/34.42 { ! int_less( X, Y ), ! X = Y }.
% 34.05/34.42 { int_less( X, Y ), int_leq( Y, X ) }.
% 34.05/34.42 { int_less( int_zero, int_one ) }.
% 34.05/34.42 { plus( X, Y ) = plus( Y, X ) }.
% 34.05/34.42 { plus( X, int_zero ) = X }.
% 34.05/34.42 { ! int_less( X, Y ), ! int_leq( Z, T ), int_leq( plus( X, Z ), plus( Y, T
% 34.05/34.42 ) ) }.
% 34.05/34.42 { ! int_less( X, Y ), int_less( int_zero, skol1( Z, T ) ) }.
% 34.05/34.42 { ! int_less( X, Y ), plus( X, skol1( X, Y ) ) = Y }.
% 34.05/34.42 { ! plus( X, Z ) = Y, ! int_less( int_zero, Z ), int_less( X, Y ) }.
% 34.05/34.42 { ! int_less( int_zero, X ), int_leq( int_one, X ) }.
% 34.05/34.42 { ! int_leq( int_one, X ), int_less( int_zero, X ) }.
% 34.05/34.42 { ! real_zero = real_one }.
% 34.05/34.42 { ! int_leq( int_one, X ), ! int_leq( X, n ), ! int_leq( int_one, Y ), !
% 34.05/34.42 int_leq( Y, n ), ! int_less( int_zero, Z ), ! X = plus( Y, Z ), ! int_leq
% 34.05/34.42 ( int_one, T ), ! int_leq( T, Y ), a( plus( T, Z ), T ) = real_zero }.
% 34.05/34.42 { ! int_leq( int_one, X ), ! int_leq( X, n ), ! int_leq( int_one, Y ), !
% 34.05/34.42 int_leq( Y, n ), ! int_leq( int_one, Z ), ! int_leq( Z, Y ), a( Z, Z ) =
% 34.05/34.42 real_one }.
% 34.05/34.42 { ! int_leq( int_one, X ), ! int_leq( X, n ), ! int_leq( int_one, Y ), !
% 34.05/34.42 int_leq( Y, n ), ! int_less( int_zero, Z ), ! Y = plus( X, Z ), ! int_leq
% 34.05/34.42 ( int_one, T ), ! int_leq( T, X ), a( T, plus( T, Z ) ) = real_zero }.
% 34.05/34.42 { int_leq( int_one, skol3 ) }.
% 34.05/34.42 { int_less( skol3, skol2 ) }.
% 34.05/34.42 { int_leq( skol2, n ) }.
% 34.05/34.42 { ! a( skol2, skol3 ) = real_zero }.
% 34.05/34.42
% 34.05/34.42 percentage equality = 0.229508, percentage horn = 0.913043
% 34.05/34.42 This is a problem with some equality
% 34.05/34.42
% 34.05/34.42
% 34.05/34.42
% 34.05/34.42 Options Used:
% 34.05/34.42
% 34.05/34.42 useres = 1
% 34.05/34.42 useparamod = 1
% 34.05/34.42 useeqrefl = 1
% 34.05/34.42 useeqfact = 1
% 34.05/34.42 usefactor = 1
% 34.05/34.42 usesimpsplitting = 0
% 34.05/34.42 usesimpdemod = 5
% 34.05/34.42 usesimpres = 3
% 34.05/34.42
% 34.05/34.42 resimpinuse = 1000
% 34.05/34.42 resimpclauses = 20000
% 34.05/34.42 substype = eqrewr
% 34.05/34.42 backwardsubs = 1
% 34.05/34.42 selectoldest = 5
% 34.05/34.42
% 34.05/34.42 litorderings [0] = split
% 34.05/34.42 litorderings [1] = extend the termordering, first sorting on arguments
% 34.05/34.42
% 34.05/34.42 termordering = kbo
% 34.05/34.42
% 34.05/34.42 litapriori = 0
% 34.05/34.42 termapriori = 1
% 34.05/34.42 litaposteriori = 0
% 34.05/34.42 termaposteriori = 0
% 34.05/34.42 demodaposteriori = 0
% 34.05/34.42 ordereqreflfact = 0
% 34.05/34.42
% 34.05/34.42 litselect = negord
% 34.05/34.42
% 34.05/34.42 maxweight = 15
% 34.05/34.42 maxdepth = 30000
% 34.05/34.42 maxlength = 115
% 34.05/34.42 maxnrvars = 195
% 34.05/34.42 excuselevel = 1
% 34.05/34.42 increasemaxweight = 1
% 34.05/34.42
% 34.05/34.42 maxselected = 10000000
% 34.05/34.42 maxnrclauses = 10000000
% 34.05/34.42
% 34.05/34.42 showgenerated = 0
% 34.05/34.42 showkept = 0
% 34.05/34.42 showselected = 0
% 34.05/34.42 showdeleted = 0
% 34.05/34.42 showresimp = 1
% 34.05/34.42 showstatus = 2000
% 34.05/34.42
% 34.05/34.42 prologoutput = 0
% 34.05/34.42 nrgoals = 5000000
% 34.05/34.42 totalproof = 1
% 34.05/34.42
% 34.05/34.42 Symbols occurring in the translation:
% 34.05/34.42
% 34.05/34.42 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 34.05/34.42 . [1, 2] (w:1, o:26, a:1, s:1, b:0),
% 34.05/34.42 ! [4, 1] (w:0, o:21, a:1, s:1, b:0),
% 34.05/34.42 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 34.05/34.42 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 34.05/34.42 int_leq [37, 2] (w:1, o:50, a:1, s:1, b:0),
% 34.05/34.42 int_less [38, 2] (w:1, o:51, a:1, s:1, b:0),
% 34.05/34.42 int_zero [40, 0] (w:1, o:13, a:1, s:1, b:0),
% 34.05/34.42 int_one [41, 0] (w:1, o:14, a:1, s:1, b:0),
% 34.05/34.42 plus [42, 2] (w:1, o:52, a:1, s:1, b:0),
% 34.05/34.42 real_zero [47, 0] (w:1, o:15, a:1, s:1, b:0),
% 34.05/34.42 real_one [48, 0] (w:1, o:16, a:1, s:1, b:0),
% 34.05/34.42 n [49, 0] (w:1, o:17, a:1, s:1, b:0),
% 34.05/34.42 a [51, 2] (w:1, o:53, a:1, s:1, b:0),
% 34.05/34.42 skol1 [52, 2] (w:1, o:54, a:1, s:1, b:1),
% 34.05/34.42 skol2 [53, 0] (w:1, o:19, a:1, s:1, b:1),
% 34.05/34.42 skol3 [54, 0] (w:1, o:20, a:1, s:1, b:1).
% 34.05/34.42
% 34.05/34.42
% 34.05/34.42 Starting Search:
% 34.05/34.42
% 34.05/34.42 *** allocated 15000 integers for clauses
% 34.05/34.42 *** allocated 22500 integers for clauses
% 34.05/34.42 *** allocated 33750 integers for clauses
% 34.05/34.42 *** allocated 15000 integers for termspace/termends
% 34.05/34.42 *** allocated 50625 integers for clauses
% 34.05/34.42 *** allocated 22500 integers for termspace/termends
% 34.05/34.42 *** allocated 75937 integers for clauses
% 34.05/34.42 Resimplifying inuse:
% 34.05/34.42 Done
% 34.05/34.42
% 34.05/34.42 *** allocated 113905 integers for clauses
% 34.05/34.42 *** allocated 33750 integers for termspace/termends
% 34.05/34.42
% 34.05/34.42 IntCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------