TSTP Solution File: ANA013-2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : ANA013-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n020.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:11 EDT 2022
% Result : Unsatisfiable 0.74s 1.13s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : ANA013-2 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n020.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 : Fri Jul 8 06:42:43 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.74/1.13 *** allocated 10000 integers for termspace/termends
% 0.74/1.13 *** allocated 10000 integers for clauses
% 0.74/1.13 *** allocated 10000 integers for justifications
% 0.74/1.13 Bliksem 1.12
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 Automatic Strategy Selection
% 0.74/1.13
% 0.74/1.13 Clauses:
% 0.74/1.13 [
% 0.74/1.13 [ ~( 'c_lessequals'( 'c_times'( 'c_HOL_Oabs'( 'v_c', 't_b' ),
% 0.74/1.13 'c_HOL_Oabs'( 'v_f'( 'v_x'( X ) ), 't_b' ), 't_b' ), 'c_times'( X,
% 0.74/1.13 'c_HOL_Oabs'( 'v_f'( 'v_x'( X ) ), 't_b' ), 't_b' ), 't_b' ) ) ],
% 0.74/1.13 [ 'class_Ring__and__Field_Oordered__idom'( 't_b' ) ],
% 0.74/1.13 [ ~( 'class_Orderings_Oorder'( X ) ), 'c_lessequals'( Y, Y, X ) ],
% 0.74/1.13 [ ~( 'class_Ring__and__Field_Oordered__idom'( X ) ),
% 0.74/1.13 'class_Orderings_Oorder'( X ) ]
% 0.74/1.13 ] .
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 percentage equality = 0.000000, percentage horn = 1.000000
% 0.74/1.13 This is a near-Horn, non-equality problem
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 Options Used:
% 0.74/1.13
% 0.74/1.13 useres = 1
% 0.74/1.13 useparamod = 0
% 0.74/1.13 useeqrefl = 0
% 0.74/1.13 useeqfact = 0
% 0.74/1.13 usefactor = 1
% 0.74/1.13 usesimpsplitting = 0
% 0.74/1.13 usesimpdemod = 0
% 0.74/1.13 usesimpres = 4
% 0.74/1.13
% 0.74/1.13 resimpinuse = 1000
% 0.74/1.13 resimpclauses = 20000
% 0.74/1.13 substype = standard
% 0.74/1.13 backwardsubs = 1
% 0.74/1.13 selectoldest = 5
% 0.74/1.13
% 0.74/1.13 litorderings [0] = split
% 0.74/1.13 litorderings [1] = liftord
% 0.74/1.13
% 0.74/1.13 termordering = none
% 0.74/1.13
% 0.74/1.13 litapriori = 1
% 0.74/1.13 termapriori = 0
% 0.74/1.13 litaposteriori = 0
% 0.74/1.13 termaposteriori = 0
% 0.74/1.13 demodaposteriori = 0
% 0.74/1.13 ordereqreflfact = 0
% 0.74/1.13
% 0.74/1.13 litselect = negative
% 0.74/1.13
% 0.74/1.13 maxweight = 30000
% 0.74/1.13 maxdepth = 30000
% 0.74/1.13 maxlength = 115
% 0.74/1.13 maxnrvars = 195
% 0.74/1.13 excuselevel = 0
% 0.74/1.13 increasemaxweight = 0
% 0.74/1.13
% 0.74/1.13 maxselected = 10000000
% 0.74/1.13 maxnrclauses = 10000000
% 0.74/1.13
% 0.74/1.13 showgenerated = 0
% 0.74/1.13 showkept = 0
% 0.74/1.13 showselected = 0
% 0.74/1.13 showdeleted = 0
% 0.74/1.13 showresimp = 1
% 0.74/1.13 showstatus = 2000
% 0.74/1.13
% 0.74/1.13 prologoutput = 1
% 0.74/1.13 nrgoals = 5000000
% 0.74/1.13 totalproof = 1
% 0.74/1.13
% 0.74/1.13 Symbols occurring in the translation:
% 0.74/1.13
% 0.74/1.13 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.74/1.13 . [1, 2] (w:1, o:24, a:1, s:1, b:0),
% 0.74/1.13 ! [4, 1] (w:1, o:15, a:1, s:1, b:0),
% 0.74/1.13 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.74/1.13 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.74/1.13 'v_c' [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.74/1.13 't_b' [40, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.74/1.13 'c_HOL_Oabs' [41, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.74/1.13 'v_x' [43, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.74/1.13 'v_f' [44, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.74/1.13 'c_times' [45, 3] (w:1, o:50, a:1, s:1, b:0),
% 0.74/1.13 'c_lessequals' [46, 3] (w:1, o:51, a:1, s:1, b:0),
% 0.74/1.13 'class_Ring__and__Field_Oordered__idom' [47, 1] (w:1, o:22, a:1, s:1
% 0.74/1.13 , b:0),
% 0.74/1.13 'class_Orderings_Oorder' [49, 1] (w:1, o:23, a:1, s:1, b:0).
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 Starting Search:
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 Bliksems!, er is een bewijs:
% 0.74/1.13 % SZS status Unsatisfiable
% 0.74/1.13 % SZS output start Refutation
% 0.74/1.13
% 0.74/1.13 clause( 0, [ ~( 'c_lessequals'( 'c_times'( 'c_HOL_Oabs'( 'v_c', 't_b' ),
% 0.74/1.13 'c_HOL_Oabs'( 'v_f'( 'v_x'( X ) ), 't_b' ), 't_b' ), 'c_times'( X,
% 0.74/1.13 'c_HOL_Oabs'( 'v_f'( 'v_x'( X ) ), 't_b' ), 't_b' ), 't_b' ) ) ] )
% 0.74/1.13 .
% 0.74/1.13 clause( 1, [ 'class_Ring__and__Field_Oordered__idom'( 't_b' ) ] )
% 0.74/1.13 .
% 0.74/1.13 clause( 2, [ 'c_lessequals'( Y, Y, X ), ~( 'class_Orderings_Oorder'( X ) )
% 0.74/1.13 ] )
% 0.74/1.13 .
% 0.74/1.13 clause( 3, [ 'class_Orderings_Oorder'( X ), ~(
% 0.74/1.13 'class_Ring__and__Field_Oordered__idom'( X ) ) ] )
% 0.74/1.13 .
% 0.74/1.13 clause( 4, [ 'class_Orderings_Oorder'( 't_b' ) ] )
% 0.74/1.13 .
% 0.74/1.13 clause( 5, [ 'c_lessequals'( X, X, 't_b' ) ] )
% 0.74/1.13 .
% 0.74/1.13 clause( 6, [] )
% 0.74/1.13 .
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 % SZS output end Refutation
% 0.74/1.13 found a proof!
% 0.74/1.13
% 0.74/1.13 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.74/1.13
% 0.74/1.13 initialclauses(
% 0.74/1.13 [ clause( 8, [ ~( 'c_lessequals'( 'c_times'( 'c_HOL_Oabs'( 'v_c', 't_b' ),
% 0.74/1.13 'c_HOL_Oabs'( 'v_f'( 'v_x'( X ) ), 't_b' ), 't_b' ), 'c_times'( X,
% 0.74/1.13 'c_HOL_Oabs'( 'v_f'( 'v_x'( X ) ), 't_b' ), 't_b' ), 't_b' ) ) ] )
% 0.74/1.13 , clause( 9, [ 'class_Ring__and__Field_Oordered__idom'( 't_b' ) ] )
% 0.74/1.13 , clause( 10, [ ~( 'class_Orderings_Oorder'( X ) ), 'c_lessequals'( Y, Y, X
% 0.74/1.13 ) ] )
% 0.74/1.13 , clause( 11, [ ~( 'class_Ring__and__Field_Oordered__idom'( X ) ),
% 0.74/1.13 'class_Orderings_Oorder'( X ) ] )
% 0.74/1.13 ] ).
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 subsumption(
% 0.74/1.13 clause( 0, [ ~( 'c_lessequals'( 'c_times'( 'c_HOL_Oabs'( 'v_c', 't_b' ),
% 0.74/1.13 'c_HOL_Oabs'( 'v_f'( 'v_x'( X ) ), 't_b' ), 't_b' ), 'c_times'( X,
% 0.74/1.13 'c_HOL_Oabs'( 'v_f'( 'v_x'( X ) ), 't_b' ), 't_b' ), 't_b' ) ) ] )
% 0.74/1.13 , clause( 8, [ ~( 'c_lessequals'( 'c_times'( 'c_HOL_Oabs'( 'v_c', 't_b' ),
% 0.74/1.13 'c_HOL_Oabs'( 'v_f'( 'v_x'( X ) ), 't_b' ), 't_b' ), 'c_times'( X,
% 0.74/1.13 'c_HOL_Oabs'( 'v_f'( 'v_x'( X ) ), 't_b' ), 't_b' ), 't_b' ) ) ] )
% 0.74/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 subsumption(
% 0.74/1.13 clause( 1, [ 'class_Ring__and__Field_Oordered__idom'( 't_b' ) ] )
% 0.74/1.13 , clause( 9, [ 'class_Ring__and__Field_Oordered__idom'( 't_b' ) ] )
% 0.74/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 subsumption(
% 0.74/1.13 clause( 2, [ 'c_lessequals'( Y, Y, X ), ~( 'class_Orderings_Oorder'( X ) )
% 0.74/1.13 ] )
% 0.74/1.13 , clause( 10, [ ~( 'class_Orderings_Oorder'( X ) ), 'c_lessequals'( Y, Y, X
% 0.74/1.13 ) ] )
% 0.74/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.74/1.13 ), ==>( 1, 0 )] ) ).
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 subsumption(
% 0.74/1.13 clause( 3, [ 'class_Orderings_Oorder'( X ), ~(
% 0.74/1.13 'class_Ring__and__Field_Oordered__idom'( X ) ) ] )
% 0.74/1.13 , clause( 11, [ ~( 'class_Ring__and__Field_Oordered__idom'( X ) ),
% 0.74/1.13 'class_Orderings_Oorder'( X ) ] )
% 0.74/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.74/1.13 0 )] ) ).
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 resolution(
% 0.74/1.13 clause( 12, [ 'class_Orderings_Oorder'( 't_b' ) ] )
% 0.74/1.13 , clause( 3, [ 'class_Orderings_Oorder'( X ), ~(
% 0.74/1.13 'class_Ring__and__Field_Oordered__idom'( X ) ) ] )
% 0.74/1.13 , 1, clause( 1, [ 'class_Ring__and__Field_Oordered__idom'( 't_b' ) ] )
% 0.74/1.13 , 0, substitution( 0, [ :=( X, 't_b' )] ), substitution( 1, [] )).
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 subsumption(
% 0.74/1.13 clause( 4, [ 'class_Orderings_Oorder'( 't_b' ) ] )
% 0.74/1.13 , clause( 12, [ 'class_Orderings_Oorder'( 't_b' ) ] )
% 0.74/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 resolution(
% 0.74/1.13 clause( 13, [ 'c_lessequals'( X, X, 't_b' ) ] )
% 0.74/1.13 , clause( 2, [ 'c_lessequals'( Y, Y, X ), ~( 'class_Orderings_Oorder'( X )
% 0.74/1.13 ) ] )
% 0.74/1.13 , 1, clause( 4, [ 'class_Orderings_Oorder'( 't_b' ) ] )
% 0.74/1.13 , 0, substitution( 0, [ :=( X, 't_b' ), :=( Y, X )] ), substitution( 1, [] )
% 0.74/1.13 ).
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 subsumption(
% 0.74/1.13 clause( 5, [ 'c_lessequals'( X, X, 't_b' ) ] )
% 0.74/1.13 , clause( 13, [ 'c_lessequals'( X, X, 't_b' ) ] )
% 0.74/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 resolution(
% 0.74/1.13 clause( 14, [] )
% 0.74/1.13 , clause( 0, [ ~( 'c_lessequals'( 'c_times'( 'c_HOL_Oabs'( 'v_c', 't_b' ),
% 0.74/1.13 'c_HOL_Oabs'( 'v_f'( 'v_x'( X ) ), 't_b' ), 't_b' ), 'c_times'( X,
% 0.74/1.13 'c_HOL_Oabs'( 'v_f'( 'v_x'( X ) ), 't_b' ), 't_b' ), 't_b' ) ) ] )
% 0.74/1.13 , 0, clause( 5, [ 'c_lessequals'( X, X, 't_b' ) ] )
% 0.74/1.13 , 0, substitution( 0, [ :=( X, 'c_HOL_Oabs'( 'v_c', 't_b' ) )] ),
% 0.74/1.13 substitution( 1, [ :=( X, 'c_times'( 'c_HOL_Oabs'( 'v_c', 't_b' ),
% 0.74/1.13 'c_HOL_Oabs'( 'v_f'( 'v_x'( 'c_HOL_Oabs'( 'v_c', 't_b' ) ) ), 't_b' ),
% 0.74/1.13 't_b' ) )] )).
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 subsumption(
% 0.74/1.13 clause( 6, [] )
% 0.74/1.13 , clause( 14, [] )
% 0.74/1.13 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 end.
% 0.74/1.13
% 0.74/1.13 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.74/1.13
% 0.74/1.13 Memory use:
% 0.74/1.13
% 0.74/1.13 space for terms: 138
% 0.74/1.13 space for clauses: 486
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 clauses generated: 7
% 0.74/1.13 clauses kept: 7
% 0.74/1.13 clauses selected: 6
% 0.74/1.13 clauses deleted: 0
% 0.74/1.13 clauses inuse deleted: 0
% 0.74/1.13
% 0.74/1.13 subsentry: 0
% 0.74/1.13 literals s-matched: 0
% 0.74/1.13 literals matched: 0
% 0.74/1.13 full subsumption: 0
% 0.74/1.13
% 0.74/1.13 checksum: 539361386
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 Bliksem ended
%------------------------------------------------------------------------------