TSTP Solution File: ANA002-3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : ANA002-3 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n026.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 14 18:37:57 EDT 2022
% Result : Timeout 300.04s 300.40s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : ANA002-3 : TPTP v8.1.0. Released v1.1.0.
% 0.06/0.12 % Command : bliksem %s
% 0.11/0.33 % Computer : n026.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % DateTime : Fri Jul 8 06:53:24 EDT 2022
% 0.11/0.33 % CPUTime :
% 219.39/219.79 *** allocated 10000 integers for termspace/termends
% 219.39/219.79 *** allocated 10000 integers for clauses
% 219.39/219.79 *** allocated 10000 integers for justifications
% 219.39/219.79 Bliksem 1.12
% 219.39/219.79
% 219.39/219.79
% 219.39/219.79 Automatic Strategy Selection
% 219.39/219.79
% 219.39/219.79 Clauses:
% 219.39/219.79 [
% 219.39/219.79 [ 'less_than_or_equal'( X, X ) ],
% 219.39/219.79 [ 'less_than_or_equal'( X, Y ), 'less_than_or_equal'( Y, X ) ],
% 219.39/219.79 [ 'less_than_or_equal'( X, Y ), ~( 'less_than_or_equal'( X, Z ) ), ~(
% 219.39/219.79 'less_than_or_equal'( Z, Y ) ) ],
% 219.39/219.79 [ ~( 'less_than_or_equal'( X, q( Y, X ) ) ), 'less_than_or_equal'( X, Y
% 219.39/219.79 ) ],
% 219.39/219.79 [ ~( 'less_than_or_equal'( q( X, Y ), X ) ), 'less_than_or_equal'( Y, X
% 219.39/219.79 ) ],
% 219.39/219.79 [ 'less_than_or_equal'( f( X ), n0 ), ~( 'less_than_or_equal'( X, h( X )
% 219.39/219.79 ) ), ~( 'less_than_or_equal'( 'lower_bound', X ) ), ~(
% 219.39/219.79 'less_than_or_equal'( X, 'upper_bound' ) ) ],
% 219.39/219.79 [ 'less_than_or_equal'( f( X ), n0 ), ~( 'less_than_or_equal'( Y, X ) )
% 219.39/219.79 , ~( 'less_than_or_equal'( f( Y ), n0 ) ), 'less_than_or_equal'( Y, h( X
% 219.39/219.79 ) ), ~( 'less_than_or_equal'( 'lower_bound', X ) ), ~(
% 219.39/219.79 'less_than_or_equal'( X, 'upper_bound' ) ) ],
% 219.39/219.79 [ 'less_than_or_equal'( n0, f( X ) ), ~( 'less_than_or_equal'( k( X ), X
% 219.39/219.79 ) ), ~( 'less_than_or_equal'( 'lower_bound', X ) ), ~(
% 219.39/219.79 'less_than_or_equal'( X, 'upper_bound' ) ) ],
% 219.39/219.79 [ 'less_than_or_equal'( n0, f( X ) ), ~( 'less_than_or_equal'( X, Y ) )
% 219.39/219.79 , ~( 'less_than_or_equal'( n0, f( Y ) ) ), 'less_than_or_equal'( k( X ),
% 219.39/219.79 Y ), ~( 'less_than_or_equal'( 'lower_bound', X ) ), ~(
% 219.39/219.79 'less_than_or_equal'( X, 'upper_bound' ) ) ],
% 219.39/219.79 [ 'less_than_or_equal'( X, l ), ~( 'less_than_or_equal'( X,
% 219.39/219.79 'upper_bound' ) ), ~( 'less_than_or_equal'( f( X ), n0 ) ) ],
% 219.39/219.79 [ 'less_than_or_equal'( g( X ), 'upper_bound' ), 'less_than_or_equal'( l
% 219.39/219.79 , X ) ],
% 219.39/219.79 [ 'less_than_or_equal'( f( g( X ) ), n0 ), 'less_than_or_equal'( l, X )
% 219.39/219.79 ],
% 219.39/219.79 [ ~( 'less_than_or_equal'( g( X ), X ) ), 'less_than_or_equal'( l, X ) ]
% 219.39/219.79 ,
% 219.39/219.79 [ 'less_than_or_equal'( 'lower_bound', 'upper_bound' ) ],
% 219.39/219.79 [ 'less_than_or_equal'( f( 'lower_bound' ), n0 ) ],
% 219.39/219.79 [ 'less_than_or_equal'( n0, f( 'upper_bound' ) ) ],
% 219.39/219.79 [ ~( 'less_than_or_equal'( f( X ), n0 ) ), ~( 'less_than_or_equal'( n0,
% 219.39/219.79 f( X ) ) ) ]
% 219.39/219.79 ] .
% 219.39/219.79
% 219.39/219.79
% 219.39/219.79 percentage equality = 0.000000, percentage horn = 0.705882
% 219.39/219.79 This a non-horn, non-equality problem
% 219.39/219.79
% 219.39/219.79
% 219.39/219.79 Options Used:
% 219.39/219.79
% 219.39/219.79 useres = 1
% 219.39/219.79 useparamod = 0
% 219.39/219.79 useeqrefl = 0
% 219.39/219.79 useeqfact = 0
% 219.39/219.79 usefactor = 1
% 219.39/219.79 usesimpsplitting = 0
% 219.39/219.79 usesimpdemod = 0
% 219.39/219.79 usesimpres = 3
% 219.39/219.79
% 219.39/219.79 resimpinuse = 1000
% 219.39/219.79 resimpclauses = 20000
% 219.39/219.79 substype = standard
% 219.39/219.79 backwardsubs = 1
% 219.39/219.79 selectoldest = 5
% 219.39/219.79
% 219.39/219.79 litorderings [0] = split
% 219.39/219.79 litorderings [1] = liftord
% 219.39/219.79
% 219.39/219.79 termordering = none
% 219.39/219.79
% 219.39/219.79 litapriori = 1
% 219.39/219.79 termapriori = 0
% 219.39/219.79 litaposteriori = 0
% 219.39/219.79 termaposteriori = 0
% 219.39/219.79 demodaposteriori = 0
% 219.39/219.79 ordereqreflfact = 0
% 219.39/219.79
% 219.39/219.79 litselect = none
% 219.39/219.79
% 219.39/219.79 maxweight = 15
% 219.39/219.79 maxdepth = 30000
% 219.39/219.79 maxlength = 115
% 219.39/219.79 maxnrvars = 195
% 219.39/219.79 excuselevel = 1
% 219.39/219.79 increasemaxweight = 1
% 219.39/219.79
% 219.39/219.79 maxselected = 10000000
% 219.39/219.79 maxnrclauses = 10000000
% 219.39/219.79
% 219.39/219.79 showgenerated = 0
% 219.39/219.79 showkept = 0
% 219.39/219.79 showselected = 0
% 219.39/219.79 showdeleted = 0
% 219.39/219.79 showresimp = 1
% 219.39/219.79 showstatus = 2000
% 219.39/219.79
% 219.39/219.79 prologoutput = 1
% 219.39/219.79 nrgoals = 5000000
% 219.39/219.79 totalproof = 1
% 219.39/219.79
% 219.39/219.79 Symbols occurring in the translation:
% 219.39/219.79
% 219.39/219.79 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 219.39/219.79 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 219.39/219.79 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 219.39/219.79 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 219.39/219.79 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 219.39/219.79 'less_than_or_equal' [40, 2] (w:1, o:50, a:1, s:1, b:0),
% 219.39/219.79 q [43, 2] (w:1, o:51, a:1, s:1, b:0),
% 219.39/219.79 f [44, 1] (w:1, o:21, a:1, s:1, b:0),
% 219.39/219.79 n0 [45, 0] (w:1, o:12, a:1, s:1, b:0),
% 219.39/219.79 h [46, 1] (w:1, o:23, a:1, s:1, b:0),
% 219.39/219.79 'lower_bound' [47, 0] (w:1, o:13, a:1, s:1, b:0),
% 219.39/219.79 'upper_bound' [48, 0] (w:1, o:14, a:1, s:1, b:0),
% 219.39/219.79 k [49, 1] (w:1, o:24, a:1, s:1, b:0),
% 219.39/219.79 l [50, 0] (w:1, o:15, a:1, s:1, b:0),
% 219.39/219.79 g [51, 1] (w:1, o:22, a:1, s:1, b:0).
% 219.39/219.79
% 219.39/219.79
% 219.39/219.79 Starting Search:
% 219.39/219.79
% 219.39/219.79 Resimplifying inuse:
% 219.39/219.79 Done
% 219.39/219.79
% 219.39/219.79
% 219.39/219.79 Intermediate Status:
% 219.39/219.79 Generated: 5654
% 219.39/219.79 Kept: 2007
% 219.39/219.79 Inuse: 140
% 219.39/219.79 Deleted: 10
% 219.39/219.79 Deletedinuse: 2
% 219.39/219.79
% 219.39/219.79 Resimplifying inuse:
% 219.39/219.79 DoneCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------