TSTP Solution File: ANA025-2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : ANA025-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n027.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:38:26 EDT 2022
% Result : Unsatisfiable 0.69s 1.11s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ANA025-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n027.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 : Fri Jul 8 06:52:30 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.69/1.11 *** allocated 10000 integers for termspace/termends
% 0.69/1.11 *** allocated 10000 integers for clauses
% 0.69/1.11 *** allocated 10000 integers for justifications
% 0.69/1.11 Bliksem 1.12
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 Automatic Strategy Selection
% 0.69/1.11
% 0.69/1.11 Clauses:
% 0.69/1.11 [
% 0.69/1.11 [ ~( 'class_OrderedGroup_Olordered__ab__group__abs'( X ) ),
% 0.69/1.11 'c_lessequals'( 'c_0', 'c_HOL_Oabs'( Y, X ), X ) ],
% 0.69/1.11 [ ~( 'class_Orderings_Olinorder'( X ) ), 'c_less'( Y, Z, X ),
% 0.69/1.11 'c_lessequals'( Z, Y, X ) ],
% 0.69/1.11 [ ~( 'class_Orderings_Olinorder'( X ) ), ~( 'c_lessequals'( Y, Z, X ) )
% 0.69/1.11 , ~( 'c_lessequals'( T, Z, X ) ), 'c_lessequals'( 'c_Orderings_Omax'( T,
% 0.69/1.11 Y, X ), Z, X ) ],
% 0.69/1.11 [ ~( 'class_Orderings_Oorder'( X ) ), ~( 'c_lessequals'( Y, Z, X ) ),
% 0.69/1.11 ~( 'c_lessequals'( T, Y, X ) ), 'c_lessequals'( T, Z, X ) ],
% 0.69/1.11 [ ~( 'class_Orderings_Oorder'( X ) ), ~( 'c_less'( Y, Z, X ) ),
% 0.69/1.11 'c_lessequals'( Y, Z, X ) ],
% 0.69/1.11 [ ~( 'c_lessequals'( 'c_0', 'c_minus'( 'v_k'( 'v_x' ), 'v_g'( 'v_x' ),
% 0.69/1.11 't_b' ), 't_b' ) ) ],
% 0.69/1.11 [ ~( 'c_lessequals'( 'c_Orderings_Omax'( 'c_minus'( 'v_k'( 'v_x' ),
% 0.69/1.11 'v_g'( 'v_x' ), 't_b' ), 'c_0', 't_b' ), 'c_HOL_Oabs'( 'c_minus'( 'v_f'(
% 0.69/1.11 'v_x' ), 'v_g'( 'v_x' ), 't_b' ), 't_b' ), 't_b' ) ) ],
% 0.69/1.11 [ ~( 'class_LOrder_Ojoin__semilorder'( X ) ), 'class_Orderings_Oorder'(
% 0.69/1.11 X ) ],
% 0.69/1.11 [ ~( 'class_OrderedGroup_Olordered__ab__group__abs'( X ) ),
% 0.69/1.11 'class_LOrder_Ojoin__semilorder'( X ) ],
% 0.69/1.11 [ ~( 'class_Ring__and__Field_Oordered__idom'( X ) ),
% 0.69/1.11 'class_Orderings_Olinorder'( X ) ],
% 0.69/1.11 [ ~( 'class_Ring__and__Field_Oordered__idom'( X ) ),
% 0.69/1.11 'class_OrderedGroup_Olordered__ab__group__abs'( X ) ],
% 0.69/1.11 [ 'class_Ring__and__Field_Oordered__idom'( 't_b' ) ]
% 0.69/1.11 ] .
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 percentage equality = 0.000000, percentage horn = 0.916667
% 0.69/1.11 This is a near-Horn, non-equality problem
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 Options Used:
% 0.69/1.11
% 0.69/1.11 useres = 1
% 0.69/1.11 useparamod = 0
% 0.69/1.11 useeqrefl = 0
% 0.69/1.11 useeqfact = 0
% 0.69/1.11 usefactor = 1
% 0.69/1.11 usesimpsplitting = 0
% 0.69/1.11 usesimpdemod = 0
% 0.69/1.11 usesimpres = 4
% 0.69/1.11
% 0.69/1.11 resimpinuse = 1000
% 0.69/1.11 resimpclauses = 20000
% 0.69/1.11 substype = standard
% 0.69/1.11 backwardsubs = 1
% 0.69/1.11 selectoldest = 5
% 0.69/1.11
% 0.69/1.11 litorderings [0] = split
% 0.69/1.11 litorderings [1] = liftord
% 0.69/1.11
% 0.69/1.11 termordering = none
% 0.69/1.11
% 0.69/1.11 litapriori = 1
% 0.69/1.11 termapriori = 0
% 0.69/1.11 litaposteriori = 0
% 0.69/1.11 termaposteriori = 0
% 0.69/1.11 demodaposteriori = 0
% 0.69/1.11 ordereqreflfact = 0
% 0.69/1.11
% 0.69/1.11 litselect = negative
% 0.69/1.11
% 0.69/1.11 maxweight = 30000
% 0.69/1.11 maxdepth = 30000
% 0.69/1.11 maxlength = 115
% 0.69/1.11 maxnrvars = 195
% 0.69/1.11 excuselevel = 0
% 0.69/1.11 increasemaxweight = 0
% 0.69/1.11
% 0.69/1.11 maxselected = 10000000
% 0.69/1.11 maxnrclauses = 10000000
% 0.69/1.11
% 0.69/1.11 showgenerated = 0
% 0.69/1.11 showkept = 0
% 0.69/1.11 showselected = 0
% 0.69/1.11 showdeleted = 0
% 0.69/1.11 showresimp = 1
% 0.69/1.11 showstatus = 2000
% 0.69/1.11
% 0.69/1.11 prologoutput = 1
% 0.69/1.11 nrgoals = 5000000
% 0.69/1.11 totalproof = 1
% 0.69/1.11
% 0.69/1.11 Symbols occurring in the translation:
% 0.69/1.11
% 0.69/1.11 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.69/1.11 . [1, 2] (w:1, o:32, a:1, s:1, b:0),
% 0.69/1.11 ! [4, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.69/1.11 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.11 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.11 'class_OrderedGroup_Olordered__ab__group__abs' [40, 1] (w:1, o:24, a:
% 0.69/1.11 1, s:1, b:0),
% 0.69/1.11 'c_0' [41, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.69/1.11 'c_HOL_Oabs' [43, 2] (w:1, o:57, a:1, s:1, b:0),
% 0.69/1.11 'c_lessequals' [44, 3] (w:1, o:58, a:1, s:1, b:0),
% 0.69/1.11 'class_Orderings_Olinorder' [45, 1] (w:1, o:25, a:1, s:1, b:0),
% 0.69/1.11 'c_less' [48, 3] (w:1, o:59, a:1, s:1, b:0),
% 0.69/1.11 'c_Orderings_Omax' [51, 3] (w:1, o:60, a:1, s:1, b:0),
% 0.69/1.11 'class_Orderings_Oorder' [52, 1] (w:1, o:26, a:1, s:1, b:0),
% 0.69/1.11 'v_x' [53, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.69/1.11 'v_k' [54, 1] (w:1, o:27, a:1, s:1, b:0),
% 0.69/1.11 'v_g' [55, 1] (w:1, o:29, a:1, s:1, b:0),
% 0.69/1.11 't_b' [56, 0] (w:1, o:17, a:1, s:1, b:0),
% 0.69/1.11 'c_minus' [57, 3] (w:1, o:61, a:1, s:1, b:0),
% 0.69/1.11 'v_f' [58, 1] (w:1, o:28, a:1, s:1, b:0),
% 0.69/1.11 'class_LOrder_Ojoin__semilorder' [60, 1] (w:1, o:30, a:1, s:1, b:0),
% 0.69/1.11
% 0.69/1.11 'class_Ring__and__Field_Oordered__idom' [61, 1] (w:1, o:31, a:1, s:1
% 0.69/1.11 , b:0).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 Starting Search:
% 0.69/1.11
% 0.69/1.11 Resimplifying inuse:
% 0.69/1.11 Done
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 Bliksems!, er is een bewijs:
% 0.69/1.11 % SZS status Unsatisfiable
% 0.69/1.11 % SZS output start Refutation
% 0.69/1.11
% 0.69/1.11 clause( 0, [ 'c_lessequals'( 'c_0', 'c_HOL_Oabs'( Y, X ), X ), ~(
% 0.69/1.11 'class_OrderedGroup_Olordered__ab__group__abs'( X ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 1, [ 'c_less'( Y, Z, X ), 'c_lessequals'( Z, Y, X ), ~(
% 0.69/1.11 'class_Orderings_Olinorder'( X ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 2, [ ~( 'class_Orderings_Olinorder'( X ) ), ~( 'c_lessequals'( Y, Z
% 0.69/1.11 , X ) ), 'c_lessequals'( 'c_Orderings_Omax'( T, Y, X ), Z, X ), ~(
% 0.69/1.11 'c_lessequals'( T, Z, X ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 3, [ ~( 'class_Orderings_Oorder'( X ) ), ~( 'c_lessequals'( Y, Z, X
% 0.69/1.11 ) ), 'c_lessequals'( T, Z, X ), ~( 'c_lessequals'( T, Y, X ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 4, [ ~( 'class_Orderings_Oorder'( X ) ), 'c_lessequals'( Y, Z, X )
% 0.69/1.11 , ~( 'c_less'( Y, Z, X ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 5, [ ~( 'c_lessequals'( 'c_0', 'c_minus'( 'v_k'( 'v_x' ), 'v_g'(
% 0.69/1.11 'v_x' ), 't_b' ), 't_b' ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 6, [ ~( 'c_lessequals'( 'c_Orderings_Omax'( 'c_minus'( 'v_k'( 'v_x'
% 0.69/1.11 ), 'v_g'( 'v_x' ), 't_b' ), 'c_0', 't_b' ), 'c_HOL_Oabs'( 'c_minus'(
% 0.69/1.11 'v_f'( 'v_x' ), 'v_g'( 'v_x' ), 't_b' ), 't_b' ), 't_b' ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 7, [ 'class_Orderings_Oorder'( X ), ~(
% 0.69/1.11 'class_LOrder_Ojoin__semilorder'( X ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 8, [ 'class_LOrder_Ojoin__semilorder'( X ), ~(
% 0.69/1.11 'class_OrderedGroup_Olordered__ab__group__abs'( X ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 9, [ 'class_Orderings_Olinorder'( X ), ~(
% 0.69/1.11 'class_Ring__and__Field_Oordered__idom'( X ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 10, [ 'class_OrderedGroup_Olordered__ab__group__abs'( X ), ~(
% 0.69/1.11 'class_Ring__and__Field_Oordered__idom'( X ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 11, [ 'class_Ring__and__Field_Oordered__idom'( 't_b' ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 13, [ 'class_OrderedGroup_Olordered__ab__group__abs'( 't_b' ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 14, [ 'class_Orderings_Olinorder'( 't_b' ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 15, [ 'c_lessequals'( 'c_0', 'c_HOL_Oabs'( X, 't_b' ), 't_b' ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 16, [ 'class_LOrder_Ojoin__semilorder'( 't_b' ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 17, [ 'class_Orderings_Oorder'( 't_b' ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 18, [ 'c_lessequals'( Y, X, 't_b' ), 'c_less'( X, Y, 't_b' ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 19, [ 'c_lessequals'( Y, X, 't_b' ), 'c_lessequals'( X, Y, 't_b' )
% 0.69/1.11 ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 32, [ 'c_lessequals'( 'c_0', Y, 't_b' ), ~( 'c_lessequals'(
% 0.69/1.11 'c_HOL_Oabs'( X, 't_b' ), Y, 't_b' ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 39, [ 'c_lessequals'( X, 'c_HOL_Oabs'( Y, 't_b' ), 't_b' ),
% 0.69/1.11 'c_lessequals'( 'c_0', X, 't_b' ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 44, [ 'c_lessequals'( 'c_0', X, 't_b' ), 'c_lessequals'(
% 0.69/1.11 'c_Orderings_Omax'( X, Y, 't_b' ), 'c_HOL_Oabs'( Z, 't_b' ), 't_b' ), ~(
% 0.69/1.11 'c_lessequals'( Y, 'c_HOL_Oabs'( Z, 't_b' ), 't_b' ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 1030, [ 'c_lessequals'( 'c_Orderings_Omax'( X, 'c_0', 't_b' ),
% 0.69/1.11 'c_HOL_Oabs'( Y, 't_b' ), 't_b' ), 'c_lessequals'( 'c_0', X, 't_b' ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 1049, [] )
% 0.69/1.11 .
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 % SZS output end Refutation
% 0.69/1.11 found a proof!
% 0.69/1.11
% 0.69/1.11 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.69/1.11
% 0.69/1.11 initialclauses(
% 0.69/1.11 [ clause( 1051, [ ~( 'class_OrderedGroup_Olordered__ab__group__abs'( X ) )
% 0.69/1.11 , 'c_lessequals'( 'c_0', 'c_HOL_Oabs'( Y, X ), X ) ] )
% 0.69/1.11 , clause( 1052, [ ~( 'class_Orderings_Olinorder'( X ) ), 'c_less'( Y, Z, X
% 0.69/1.11 ), 'c_lessequals'( Z, Y, X ) ] )
% 0.69/1.11 , clause( 1053, [ ~( 'class_Orderings_Olinorder'( X ) ), ~( 'c_lessequals'(
% 0.69/1.11 Y, Z, X ) ), ~( 'c_lessequals'( T, Z, X ) ), 'c_lessequals'(
% 0.69/1.11 'c_Orderings_Omax'( T, Y, X ), Z, X ) ] )
% 0.69/1.11 , clause( 1054, [ ~( 'class_Orderings_Oorder'( X ) ), ~( 'c_lessequals'( Y
% 0.69/1.11 , Z, X ) ), ~( 'c_lessequals'( T, Y, X ) ), 'c_lessequals'( T, Z, X ) ]
% 0.69/1.11 )
% 0.69/1.11 , clause( 1055, [ ~( 'class_Orderings_Oorder'( X ) ), ~( 'c_less'( Y, Z, X
% 0.69/1.11 ) ), 'c_lessequals'( Y, Z, X ) ] )
% 0.69/1.11 , clause( 1056, [ ~( 'c_lessequals'( 'c_0', 'c_minus'( 'v_k'( 'v_x' ),
% 0.69/1.11 'v_g'( 'v_x' ), 't_b' ), 't_b' ) ) ] )
% 0.69/1.11 , clause( 1057, [ ~( 'c_lessequals'( 'c_Orderings_Omax'( 'c_minus'( 'v_k'(
% 0.69/1.11 'v_x' ), 'v_g'( 'v_x' ), 't_b' ), 'c_0', 't_b' ), 'c_HOL_Oabs'( 'c_minus'(
% 0.69/1.11 'v_f'( 'v_x' ), 'v_g'( 'v_x' ), 't_b' ), 't_b' ), 't_b' ) ) ] )
% 0.69/1.11 , clause( 1058, [ ~( 'class_LOrder_Ojoin__semilorder'( X ) ),
% 0.69/1.11 'class_Orderings_Oorder'( X ) ] )
% 0.69/1.11 , clause( 1059, [ ~( 'class_OrderedGroup_Olordered__ab__group__abs'( X ) )
% 0.69/1.11 , 'class_LOrder_Ojoin__semilorder'( X ) ] )
% 0.69/1.11 , clause( 1060, [ ~( 'class_Ring__and__Field_Oordered__idom'( X ) ),
% 0.69/1.11 'class_Orderings_Olinorder'( X ) ] )
% 0.69/1.11 , clause( 1061, [ ~( 'class_Ring__and__Field_Oordered__idom'( X ) ),
% 0.69/1.11 'class_OrderedGroup_Olordered__ab__group__abs'( X ) ] )
% 0.69/1.11 , clause( 1062, [ 'class_Ring__and__Field_Oordered__idom'( 't_b' ) ] )
% 0.69/1.11 ] ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 0, [ 'c_lessequals'( 'c_0', 'c_HOL_Oabs'( Y, X ), X ), ~(
% 0.69/1.11 'class_OrderedGroup_Olordered__ab__group__abs'( X ) ) ] )
% 0.69/1.11 , clause( 1051, [ ~( 'class_OrderedGroup_Olordered__ab__group__abs'( X ) )
% 0.69/1.11 , 'c_lessequals'( 'c_0', 'c_HOL_Oabs'( Y, X ), X ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.69/1.11 ), ==>( 1, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 1, [ 'c_less'( Y, Z, X ), 'c_lessequals'( Z, Y, X ), ~(
% 0.69/1.11 'class_Orderings_Olinorder'( X ) ) ] )
% 0.69/1.11 , clause( 1052, [ ~( 'class_Orderings_Olinorder'( X ) ), 'c_less'( Y, Z, X
% 0.69/1.11 ), 'c_lessequals'( Z, Y, X ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.69/1.11 permutation( 0, [ ==>( 0, 2 ), ==>( 1, 0 ), ==>( 2, 1 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 2, [ ~( 'class_Orderings_Olinorder'( X ) ), ~( 'c_lessequals'( Y, Z
% 0.69/1.11 , X ) ), 'c_lessequals'( 'c_Orderings_Omax'( T, Y, X ), Z, X ), ~(
% 0.69/1.11 'c_lessequals'( T, Z, X ) ) ] )
% 0.69/1.11 , clause( 1053, [ ~( 'class_Orderings_Olinorder'( X ) ), ~( 'c_lessequals'(
% 0.69/1.11 Y, Z, X ) ), ~( 'c_lessequals'( T, Z, X ) ), 'c_lessequals'(
% 0.69/1.11 'c_Orderings_Omax'( T, Y, X ), Z, X ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.69/1.11 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 ), ==>( 2, 3 ), ==>( 3, 2 )] )
% 0.69/1.11 ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 3, [ ~( 'class_Orderings_Oorder'( X ) ), ~( 'c_lessequals'( Y, Z, X
% 0.69/1.11 ) ), 'c_lessequals'( T, Z, X ), ~( 'c_lessequals'( T, Y, X ) ) ] )
% 0.69/1.11 , clause( 1054, [ ~( 'class_Orderings_Oorder'( X ) ), ~( 'c_lessequals'( Y
% 0.69/1.11 , Z, X ) ), ~( 'c_lessequals'( T, Y, X ) ), 'c_lessequals'( T, Z, X ) ]
% 0.69/1.11 )
% 0.69/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.69/1.11 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 ), ==>( 2, 3 ), ==>( 3, 2 )] )
% 0.69/1.11 ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 4, [ ~( 'class_Orderings_Oorder'( X ) ), 'c_lessequals'( Y, Z, X )
% 0.69/1.11 , ~( 'c_less'( Y, Z, X ) ) ] )
% 0.69/1.11 , clause( 1055, [ ~( 'class_Orderings_Oorder'( X ) ), ~( 'c_less'( Y, Z, X
% 0.69/1.11 ) ), 'c_lessequals'( Y, Z, X ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.69/1.11 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 5, [ ~( 'c_lessequals'( 'c_0', 'c_minus'( 'v_k'( 'v_x' ), 'v_g'(
% 0.69/1.11 'v_x' ), 't_b' ), 't_b' ) ) ] )
% 0.69/1.11 , clause( 1056, [ ~( 'c_lessequals'( 'c_0', 'c_minus'( 'v_k'( 'v_x' ),
% 0.69/1.11 'v_g'( 'v_x' ), 't_b' ), 't_b' ) ) ] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 6, [ ~( 'c_lessequals'( 'c_Orderings_Omax'( 'c_minus'( 'v_k'( 'v_x'
% 0.69/1.11 ), 'v_g'( 'v_x' ), 't_b' ), 'c_0', 't_b' ), 'c_HOL_Oabs'( 'c_minus'(
% 0.69/1.11 'v_f'( 'v_x' ), 'v_g'( 'v_x' ), 't_b' ), 't_b' ), 't_b' ) ) ] )
% 0.69/1.11 , clause( 1057, [ ~( 'c_lessequals'( 'c_Orderings_Omax'( 'c_minus'( 'v_k'(
% 0.69/1.11 'v_x' ), 'v_g'( 'v_x' ), 't_b' ), 'c_0', 't_b' ), 'c_HOL_Oabs'( 'c_minus'(
% 0.69/1.11 'v_f'( 'v_x' ), 'v_g'( 'v_x' ), 't_b' ), 't_b' ), 't_b' ) ) ] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 7, [ 'class_Orderings_Oorder'( X ), ~(
% 0.69/1.11 'class_LOrder_Ojoin__semilorder'( X ) ) ] )
% 0.69/1.11 , clause( 1058, [ ~( 'class_LOrder_Ojoin__semilorder'( X ) ),
% 0.69/1.11 'class_Orderings_Oorder'( X ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.69/1.11 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 8, [ 'class_LOrder_Ojoin__semilorder'( X ), ~(
% 0.69/1.11 'class_OrderedGroup_Olordered__ab__group__abs'( X ) ) ] )
% 0.69/1.11 , clause( 1059, [ ~( 'class_OrderedGroup_Olordered__ab__group__abs'( X ) )
% 0.69/1.11 , 'class_LOrder_Ojoin__semilorder'( X ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.69/1.11 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 9, [ 'class_Orderings_Olinorder'( X ), ~(
% 0.69/1.11 'class_Ring__and__Field_Oordered__idom'( X ) ) ] )
% 0.69/1.11 , clause( 1060, [ ~( 'class_Ring__and__Field_Oordered__idom'( X ) ),
% 0.69/1.11 'class_Orderings_Olinorder'( X ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.69/1.11 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 10, [ 'class_OrderedGroup_Olordered__ab__group__abs'( X ), ~(
% 0.69/1.11 'class_Ring__and__Field_Oordered__idom'( X ) ) ] )
% 0.69/1.11 , clause( 1061, [ ~( 'class_Ring__and__Field_Oordered__idom'( X ) ),
% 0.69/1.11 'class_OrderedGroup_Olordered__ab__group__abs'( X ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.69/1.11 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 11, [ 'class_Ring__and__Field_Oordered__idom'( 't_b' ) ] )
% 0.69/1.11 , clause( 1062, [ 'class_Ring__and__Field_Oordered__idom'( 't_b' ) ] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 1082, [ 'class_OrderedGroup_Olordered__ab__group__abs'( 't_b' ) ]
% 0.69/1.11 )
% 0.69/1.11 , clause( 10, [ 'class_OrderedGroup_Olordered__ab__group__abs'( X ), ~(
% 0.69/1.11 'class_Ring__and__Field_Oordered__idom'( X ) ) ] )
% 0.69/1.11 , 1, clause( 11, [ 'class_Ring__and__Field_Oordered__idom'( 't_b' ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, 't_b' )] ), substitution( 1, [] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 13, [ 'class_OrderedGroup_Olordered__ab__group__abs'( 't_b' ) ] )
% 0.69/1.11 , clause( 1082, [ 'class_OrderedGroup_Olordered__ab__group__abs'( 't_b' ) ]
% 0.69/1.11 )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 1083, [ 'class_Orderings_Olinorder'( 't_b' ) ] )
% 0.69/1.11 , clause( 9, [ 'class_Orderings_Olinorder'( X ), ~(
% 0.69/1.11 'class_Ring__and__Field_Oordered__idom'( X ) ) ] )
% 0.69/1.11 , 1, clause( 11, [ 'class_Ring__and__Field_Oordered__idom'( 't_b' ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, 't_b' )] ), substitution( 1, [] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 14, [ 'class_Orderings_Olinorder'( 't_b' ) ] )
% 0.69/1.11 , clause( 1083, [ 'class_Orderings_Olinorder'( 't_b' ) ] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 1084, [ 'c_lessequals'( 'c_0', 'c_HOL_Oabs'( X, 't_b' ), 't_b' ) ]
% 0.69/1.11 )
% 0.69/1.11 , clause( 0, [ 'c_lessequals'( 'c_0', 'c_HOL_Oabs'( Y, X ), X ), ~(
% 0.69/1.11 'class_OrderedGroup_Olordered__ab__group__abs'( X ) ) ] )
% 0.69/1.11 , 1, clause( 13, [ 'class_OrderedGroup_Olordered__ab__group__abs'( 't_b' )
% 0.69/1.11 ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, 't_b' ), :=( Y, X )] ), substitution( 1, [] )
% 0.69/1.11 ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 15, [ 'c_lessequals'( 'c_0', 'c_HOL_Oabs'( X, 't_b' ), 't_b' ) ] )
% 0.69/1.11 , clause( 1084, [ 'c_lessequals'( 'c_0', 'c_HOL_Oabs'( X, 't_b' ), 't_b' )
% 0.69/1.11 ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 1085, [ 'class_LOrder_Ojoin__semilorder'( 't_b' ) ] )
% 0.69/1.11 , clause( 8, [ 'class_LOrder_Ojoin__semilorder'( X ), ~(
% 0.69/1.11 'class_OrderedGroup_Olordered__ab__group__abs'( X ) ) ] )
% 0.69/1.11 , 1, clause( 13, [ 'class_OrderedGroup_Olordered__ab__group__abs'( 't_b' )
% 0.69/1.11 ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, 't_b' )] ), substitution( 1, [] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 16, [ 'class_LOrder_Ojoin__semilorder'( 't_b' ) ] )
% 0.69/1.11 , clause( 1085, [ 'class_LOrder_Ojoin__semilorder'( 't_b' ) ] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 1086, [ 'class_Orderings_Oorder'( 't_b' ) ] )
% 0.69/1.11 , clause( 7, [ 'class_Orderings_Oorder'( X ), ~(
% 0.69/1.11 'class_LOrder_Ojoin__semilorder'( X ) ) ] )
% 0.69/1.11 , 1, clause( 16, [ 'class_LOrder_Ojoin__semilorder'( 't_b' ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, 't_b' )] ), substitution( 1, [] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 17, [ 'class_Orderings_Oorder'( 't_b' ) ] )
% 0.69/1.11 , clause( 1086, [ 'class_Orderings_Oorder'( 't_b' ) ] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 1087, [ 'c_less'( X, Y, 't_b' ), 'c_lessequals'( Y, X, 't_b' ) ] )
% 0.69/1.11 , clause( 1, [ 'c_less'( Y, Z, X ), 'c_lessequals'( Z, Y, X ), ~(
% 0.69/1.11 'class_Orderings_Olinorder'( X ) ) ] )
% 0.69/1.11 , 2, clause( 14, [ 'class_Orderings_Olinorder'( 't_b' ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, 't_b' ), :=( Y, X ), :=( Z, Y )] ),
% 0.69/1.11 substitution( 1, [] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 18, [ 'c_lessequals'( Y, X, 't_b' ), 'c_less'( X, Y, 't_b' ) ] )
% 0.69/1.11 , clause( 1087, [ 'c_less'( X, Y, 't_b' ), 'c_lessequals'( Y, X, 't_b' ) ]
% 0.69/1.11 )
% 0.69/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.69/1.11 ), ==>( 1, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 1088, [ ~( 'class_Orderings_Oorder'( 't_b' ) ), 'c_lessequals'( X,
% 0.69/1.11 Y, 't_b' ), 'c_lessequals'( Y, X, 't_b' ) ] )
% 0.69/1.11 , clause( 4, [ ~( 'class_Orderings_Oorder'( X ) ), 'c_lessequals'( Y, Z, X
% 0.69/1.11 ), ~( 'c_less'( Y, Z, X ) ) ] )
% 0.69/1.11 , 2, clause( 18, [ 'c_lessequals'( Y, X, 't_b' ), 'c_less'( X, Y, 't_b' ) ]
% 0.69/1.11 )
% 0.69/1.11 , 1, substitution( 0, [ :=( X, 't_b' ), :=( Y, X ), :=( Z, Y )] ),
% 0.69/1.11 substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 1091, [ 'c_lessequals'( X, Y, 't_b' ), 'c_lessequals'( Y, X, 't_b'
% 0.69/1.11 ) ] )
% 0.69/1.11 , clause( 1088, [ ~( 'class_Orderings_Oorder'( 't_b' ) ), 'c_lessequals'( X
% 0.69/1.11 , Y, 't_b' ), 'c_lessequals'( Y, X, 't_b' ) ] )
% 0.69/1.11 , 0, clause( 17, [ 'class_Orderings_Oorder'( 't_b' ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [] )
% 0.69/1.11 ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 19, [ 'c_lessequals'( Y, X, 't_b' ), 'c_lessequals'( X, Y, 't_b' )
% 0.69/1.11 ] )
% 0.69/1.11 , clause( 1091, [ 'c_lessequals'( X, Y, 't_b' ), 'c_lessequals'( Y, X,
% 0.69/1.11 't_b' ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 0
% 0.69/1.11 ), ==>( 1, 1 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 1094, [ ~( 'class_Orderings_Oorder'( 't_b' ) ), ~( 'c_lessequals'(
% 0.69/1.11 'c_HOL_Oabs'( X, 't_b' ), Y, 't_b' ) ), 'c_lessequals'( 'c_0', Y, 't_b' )
% 0.69/1.11 ] )
% 0.69/1.11 , clause( 3, [ ~( 'class_Orderings_Oorder'( X ) ), ~( 'c_lessequals'( Y, Z
% 0.69/1.11 , X ) ), 'c_lessequals'( T, Z, X ), ~( 'c_lessequals'( T, Y, X ) ) ] )
% 0.69/1.11 , 3, clause( 15, [ 'c_lessequals'( 'c_0', 'c_HOL_Oabs'( X, 't_b' ), 't_b' )
% 0.69/1.11 ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, 't_b' ), :=( Y, 'c_HOL_Oabs'( X, 't_b' ) ),
% 0.69/1.11 :=( Z, Y ), :=( T, 'c_0' )] ), substitution( 1, [ :=( X, X )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 1096, [ ~( 'c_lessequals'( 'c_HOL_Oabs'( X, 't_b' ), Y, 't_b' ) ),
% 0.69/1.11 'c_lessequals'( 'c_0', Y, 't_b' ) ] )
% 0.69/1.11 , clause( 1094, [ ~( 'class_Orderings_Oorder'( 't_b' ) ), ~( 'c_lessequals'(
% 0.69/1.11 'c_HOL_Oabs'( X, 't_b' ), Y, 't_b' ) ), 'c_lessequals'( 'c_0', Y, 't_b' )
% 0.69/1.11 ] )
% 0.69/1.11 , 0, clause( 17, [ 'class_Orderings_Oorder'( 't_b' ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [] )
% 0.69/1.11 ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 32, [ 'c_lessequals'( 'c_0', Y, 't_b' ), ~( 'c_lessequals'(
% 0.69/1.11 'c_HOL_Oabs'( X, 't_b' ), Y, 't_b' ) ) ] )
% 0.69/1.11 , clause( 1096, [ ~( 'c_lessequals'( 'c_HOL_Oabs'( X, 't_b' ), Y, 't_b' ) )
% 0.69/1.11 , 'c_lessequals'( 'c_0', Y, 't_b' ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.69/1.11 ), ==>( 1, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 1097, [ 'c_lessequals'( 'c_0', X, 't_b' ), 'c_lessequals'( X,
% 0.69/1.11 'c_HOL_Oabs'( Y, 't_b' ), 't_b' ) ] )
% 0.69/1.11 , clause( 32, [ 'c_lessequals'( 'c_0', Y, 't_b' ), ~( 'c_lessequals'(
% 0.69/1.11 'c_HOL_Oabs'( X, 't_b' ), Y, 't_b' ) ) ] )
% 0.69/1.11 , 1, clause( 19, [ 'c_lessequals'( Y, X, 't_b' ), 'c_lessequals'( X, Y,
% 0.69/1.11 't_b' ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, Y ), :=( Y, X )] ), substitution( 1, [ :=( X
% 0.69/1.11 , X ), :=( Y, 'c_HOL_Oabs'( Y, 't_b' ) )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 39, [ 'c_lessequals'( X, 'c_HOL_Oabs'( Y, 't_b' ), 't_b' ),
% 0.69/1.11 'c_lessequals'( 'c_0', X, 't_b' ) ] )
% 0.69/1.11 , clause( 1097, [ 'c_lessequals'( 'c_0', X, 't_b' ), 'c_lessequals'( X,
% 0.69/1.11 'c_HOL_Oabs'( Y, 't_b' ), 't_b' ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.69/1.11 ), ==>( 1, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 1100, [ ~( 'class_Orderings_Olinorder'( 't_b' ) ), ~(
% 0.69/1.11 'c_lessequals'( X, 'c_HOL_Oabs'( Y, 't_b' ), 't_b' ) ), 'c_lessequals'(
% 0.69/1.11 'c_Orderings_Omax'( Z, X, 't_b' ), 'c_HOL_Oabs'( Y, 't_b' ), 't_b' ),
% 0.69/1.11 'c_lessequals'( 'c_0', Z, 't_b' ) ] )
% 0.69/1.11 , clause( 2, [ ~( 'class_Orderings_Olinorder'( X ) ), ~( 'c_lessequals'( Y
% 0.69/1.11 , Z, X ) ), 'c_lessequals'( 'c_Orderings_Omax'( T, Y, X ), Z, X ), ~(
% 0.69/1.11 'c_lessequals'( T, Z, X ) ) ] )
% 0.69/1.11 , 3, clause( 39, [ 'c_lessequals'( X, 'c_HOL_Oabs'( Y, 't_b' ), 't_b' ),
% 0.69/1.11 'c_lessequals'( 'c_0', X, 't_b' ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, 't_b' ), :=( Y, X ), :=( Z, 'c_HOL_Oabs'( Y
% 0.69/1.11 , 't_b' ) ), :=( T, Z )] ), substitution( 1, [ :=( X, Z ), :=( Y, Y )] )
% 0.69/1.11 ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 1104, [ ~( 'c_lessequals'( X, 'c_HOL_Oabs'( Y, 't_b' ), 't_b' ) ),
% 0.69/1.11 'c_lessequals'( 'c_Orderings_Omax'( Z, X, 't_b' ), 'c_HOL_Oabs'( Y, 't_b'
% 0.69/1.11 ), 't_b' ), 'c_lessequals'( 'c_0', Z, 't_b' ) ] )
% 0.69/1.11 , clause( 1100, [ ~( 'class_Orderings_Olinorder'( 't_b' ) ), ~(
% 0.69/1.11 'c_lessequals'( X, 'c_HOL_Oabs'( Y, 't_b' ), 't_b' ) ), 'c_lessequals'(
% 0.69/1.11 'c_Orderings_Omax'( Z, X, 't_b' ), 'c_HOL_Oabs'( Y, 't_b' ), 't_b' ),
% 0.69/1.11 'c_lessequals'( 'c_0', Z, 't_b' ) ] )
% 0.69/1.11 , 0, clause( 14, [ 'class_Orderings_Olinorder'( 't_b' ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.69/1.11 substitution( 1, [] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 44, [ 'c_lessequals'( 'c_0', X, 't_b' ), 'c_lessequals'(
% 0.69/1.11 'c_Orderings_Omax'( X, Y, 't_b' ), 'c_HOL_Oabs'( Z, 't_b' ), 't_b' ), ~(
% 0.69/1.11 'c_lessequals'( Y, 'c_HOL_Oabs'( Z, 't_b' ), 't_b' ) ) ] )
% 0.69/1.11 , clause( 1104, [ ~( 'c_lessequals'( X, 'c_HOL_Oabs'( Y, 't_b' ), 't_b' ) )
% 0.69/1.11 , 'c_lessequals'( 'c_Orderings_Omax'( Z, X, 't_b' ), 'c_HOL_Oabs'( Y,
% 0.69/1.11 't_b' ), 't_b' ), 'c_lessequals'( 'c_0', Z, 't_b' ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, X )] ),
% 0.69/1.11 permutation( 0, [ ==>( 0, 2 ), ==>( 1, 1 ), ==>( 2, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 1105, [ 'c_lessequals'( 'c_0', X, 't_b' ), 'c_lessequals'(
% 0.69/1.11 'c_Orderings_Omax'( X, 'c_0', 't_b' ), 'c_HOL_Oabs'( Y, 't_b' ), 't_b' )
% 0.69/1.11 ] )
% 0.69/1.11 , clause( 44, [ 'c_lessequals'( 'c_0', X, 't_b' ), 'c_lessequals'(
% 0.69/1.11 'c_Orderings_Omax'( X, Y, 't_b' ), 'c_HOL_Oabs'( Z, 't_b' ), 't_b' ), ~(
% 0.69/1.11 'c_lessequals'( Y, 'c_HOL_Oabs'( Z, 't_b' ), 't_b' ) ) ] )
% 0.69/1.11 , 2, clause( 15, [ 'c_lessequals'( 'c_0', 'c_HOL_Oabs'( X, 't_b' ), 't_b' )
% 0.69/1.11 ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, X ), :=( Y, 'c_0' ), :=( Z, Y )] ),
% 0.69/1.11 substitution( 1, [ :=( X, Y )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 1030, [ 'c_lessequals'( 'c_Orderings_Omax'( X, 'c_0', 't_b' ),
% 0.69/1.11 'c_HOL_Oabs'( Y, 't_b' ), 't_b' ), 'c_lessequals'( 'c_0', X, 't_b' ) ] )
% 0.69/1.11 , clause( 1105, [ 'c_lessequals'( 'c_0', X, 't_b' ), 'c_lessequals'(
% 0.69/1.11 'c_Orderings_Omax'( X, 'c_0', 't_b' ), 'c_HOL_Oabs'( Y, 't_b' ), 't_b' )
% 0.69/1.11 ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.69/1.11 ), ==>( 1, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 1106, [ 'c_lessequals'( 'c_0', 'c_minus'( 'v_k'( 'v_x' ), 'v_g'(
% 0.69/1.11 'v_x' ), 't_b' ), 't_b' ) ] )
% 0.69/1.11 , clause( 6, [ ~( 'c_lessequals'( 'c_Orderings_Omax'( 'c_minus'( 'v_k'(
% 0.69/1.11 'v_x' ), 'v_g'( 'v_x' ), 't_b' ), 'c_0', 't_b' ), 'c_HOL_Oabs'( 'c_minus'(
% 0.69/1.11 'v_f'( 'v_x' ), 'v_g'( 'v_x' ), 't_b' ), 't_b' ), 't_b' ) ) ] )
% 0.69/1.11 , 0, clause( 1030, [ 'c_lessequals'( 'c_Orderings_Omax'( X, 'c_0', 't_b' )
% 0.69/1.11 , 'c_HOL_Oabs'( Y, 't_b' ), 't_b' ), 'c_lessequals'( 'c_0', X, 't_b' ) ]
% 0.69/1.11 )
% 0.69/1.11 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, 'c_minus'( 'v_k'(
% 0.69/1.11 'v_x' ), 'v_g'( 'v_x' ), 't_b' ) ), :=( Y, 'c_minus'( 'v_f'( 'v_x' ),
% 0.69/1.11 'v_g'( 'v_x' ), 't_b' ) )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 1107, [] )
% 0.69/1.11 , clause( 5, [ ~( 'c_lessequals'( 'c_0', 'c_minus'( 'v_k'( 'v_x' ), 'v_g'(
% 0.69/1.11 'v_x' ), 't_b' ), 't_b' ) ) ] )
% 0.69/1.11 , 0, clause( 1106, [ 'c_lessequals'( 'c_0', 'c_minus'( 'v_k'( 'v_x' ),
% 0.69/1.11 'v_g'( 'v_x' ), 't_b' ), 't_b' ) ] )
% 0.69/1.11 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 1049, [] )
% 0.69/1.11 , clause( 1107, [] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 end.
% 0.69/1.11
% 0.69/1.11 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.69/1.11
% 0.69/1.11 Memory use:
% 0.69/1.11
% 0.69/1.11 space for terms: 21494
% 0.69/1.11 space for clauses: 75394
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 clauses generated: 1779
% 0.69/1.11 clauses kept: 1050
% 0.69/1.11 clauses selected: 87
% 0.69/1.11 clauses deleted: 0
% 0.69/1.11 clauses inuse deleted: 0
% 0.69/1.11
% 0.69/1.11 subsentry: 34164
% 0.69/1.11 literals s-matched: 14247
% 0.69/1.11 literals matched: 11359
% 0.69/1.11 full subsumption: 8936
% 0.69/1.11
% 0.69/1.11 checksum: -1123031607
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 Bliksem ended
%------------------------------------------------------------------------------