TSTP Solution File: HEN002-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : HEN002-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n029.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 : Sat Jul 16 12:46:58 EDT 2022
% Result : Unsatisfiable 0.46s 1.11s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : HEN002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : bliksem %s
% 0.14/0.34 % Computer : n029.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % DateTime : Fri Jul 1 14:07:54 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.46/1.11 *** allocated 10000 integers for termspace/termends
% 0.46/1.11 *** allocated 10000 integers for clauses
% 0.46/1.11 *** allocated 10000 integers for justifications
% 0.46/1.11 Bliksem 1.12
% 0.46/1.11
% 0.46/1.11
% 0.46/1.11 Automatic Strategy Selection
% 0.46/1.11
% 0.46/1.11 Clauses:
% 0.46/1.11 [
% 0.46/1.11 [ ~( 'less_equal'( X, Y ) ), quotient( X, Y, zero ) ],
% 0.46/1.11 [ ~( quotient( X, Y, zero ) ), 'less_equal'( X, Y ) ],
% 0.46/1.11 [ ~( quotient( X, Y, Z ) ), 'less_equal'( Z, X ) ],
% 0.46/1.11 [ ~( quotient( X, Y, Z ) ), ~( quotient( Y, T, U ) ), ~( quotient( X, T
% 0.46/1.11 , W ) ), ~( quotient( W, U, V0 ) ), ~( quotient( Z, T, V1 ) ),
% 0.46/1.11 'less_equal'( V0, V1 ) ],
% 0.46/1.11 [ 'less_equal'( zero, X ) ],
% 0.46/1.11 [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X, Y ) ],
% 0.46/1.11 [ 'less_equal'( X, identity ) ],
% 0.46/1.11 [ quotient( X, Y, divide( X, Y ) ) ],
% 0.46/1.11 [ ~( quotient( X, Y, Z ) ), ~( quotient( X, Y, T ) ), =( Z, T ) ],
% 0.46/1.11 [ ~( quotient( zero, x, zero ) ) ]
% 0.46/1.11 ] .
% 0.46/1.11
% 0.46/1.11
% 0.46/1.11 percentage equality = 0.090909, percentage horn = 1.000000
% 0.46/1.11 This is a problem with some equality
% 0.46/1.11
% 0.46/1.11
% 0.46/1.11
% 0.46/1.11 Options Used:
% 0.46/1.11
% 0.46/1.11 useres = 1
% 0.46/1.11 useparamod = 1
% 0.46/1.11 useeqrefl = 1
% 0.46/1.11 useeqfact = 1
% 0.46/1.11 usefactor = 1
% 0.46/1.11 usesimpsplitting = 0
% 0.46/1.11 usesimpdemod = 5
% 0.46/1.11 usesimpres = 3
% 0.46/1.11
% 0.46/1.11 resimpinuse = 1000
% 0.46/1.11 resimpclauses = 20000
% 0.46/1.11 substype = eqrewr
% 0.46/1.11 backwardsubs = 1
% 0.46/1.11 selectoldest = 5
% 0.46/1.11
% 0.46/1.11 litorderings [0] = split
% 0.46/1.11 litorderings [1] = extend the termordering, first sorting on arguments
% 0.46/1.11
% 0.46/1.11 termordering = kbo
% 0.46/1.11
% 0.46/1.11 litapriori = 0
% 0.46/1.11 termapriori = 1
% 0.46/1.11 litaposteriori = 0
% 0.46/1.11 termaposteriori = 0
% 0.46/1.11 demodaposteriori = 0
% 0.46/1.11 ordereqreflfact = 0
% 0.46/1.11
% 0.46/1.11 litselect = negord
% 0.46/1.11
% 0.46/1.11 maxweight = 15
% 0.46/1.11 maxdepth = 30000
% 0.46/1.11 maxlength = 115
% 0.46/1.11 maxnrvars = 195
% 0.46/1.11 excuselevel = 1
% 0.46/1.11 increasemaxweight = 1
% 0.46/1.11
% 0.46/1.11 maxselected = 10000000
% 0.46/1.11 maxnrclauses = 10000000
% 0.46/1.11
% 0.46/1.11 showgenerated = 0
% 0.46/1.11 showkept = 0
% 0.46/1.11 showselected = 0
% 0.46/1.11 showdeleted = 0
% 0.46/1.11 showresimp = 1
% 0.46/1.11 showstatus = 2000
% 0.46/1.11
% 0.46/1.11 prologoutput = 1
% 0.46/1.11 nrgoals = 5000000
% 0.46/1.11 totalproof = 1
% 0.46/1.11
% 0.46/1.11 Symbols occurring in the translation:
% 0.46/1.11
% 0.46/1.11 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.46/1.11 . [1, 2] (w:1, o:26, a:1, s:1, b:0),
% 0.46/1.11 ! [4, 1] (w:0, o:21, a:1, s:1, b:0),
% 0.46/1.11 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.46/1.11 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.46/1.11 'less_equal' [41, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.46/1.11 zero [42, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.46/1.11 quotient [43, 3] (w:1, o:53, a:1, s:1, b:0),
% 0.46/1.11 identity [50, 0] (w:1, o:19, a:1, s:1, b:0),
% 0.46/1.11 divide [51, 2] (w:1, o:52, a:1, s:1, b:0),
% 0.46/1.11 x [53, 0] (w:1, o:20, a:1, s:1, b:0).
% 0.46/1.11
% 0.46/1.11
% 0.46/1.11 Starting Search:
% 0.46/1.11
% 0.46/1.11
% 0.46/1.11 Bliksems!, er is een bewijs:
% 0.46/1.11 % SZS status Unsatisfiable
% 0.46/1.11 % SZS output start Refutation
% 0.46/1.11
% 0.46/1.11 clause( 0, [ ~( 'less_equal'( X, Y ) ), quotient( X, Y, zero ) ] )
% 0.46/1.11 .
% 0.46/1.11 clause( 4, [ 'less_equal'( zero, X ) ] )
% 0.46/1.11 .
% 0.46/1.11 clause( 9, [ ~( quotient( zero, x, zero ) ) ] )
% 0.46/1.11 .
% 0.46/1.11 clause( 34, [] )
% 0.46/1.11 .
% 0.46/1.11
% 0.46/1.11
% 0.46/1.11 % SZS output end Refutation
% 0.46/1.11 found a proof!
% 0.46/1.11
% 0.46/1.11 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.46/1.11
% 0.46/1.11 initialclauses(
% 0.46/1.11 [ clause( 36, [ ~( 'less_equal'( X, Y ) ), quotient( X, Y, zero ) ] )
% 0.46/1.11 , clause( 37, [ ~( quotient( X, Y, zero ) ), 'less_equal'( X, Y ) ] )
% 0.46/1.11 , clause( 38, [ ~( quotient( X, Y, Z ) ), 'less_equal'( Z, X ) ] )
% 0.46/1.11 , clause( 39, [ ~( quotient( X, Y, Z ) ), ~( quotient( Y, T, U ) ), ~(
% 0.46/1.11 quotient( X, T, W ) ), ~( quotient( W, U, V0 ) ), ~( quotient( Z, T, V1 )
% 0.46/1.11 ), 'less_equal'( V0, V1 ) ] )
% 0.46/1.11 , clause( 40, [ 'less_equal'( zero, X ) ] )
% 0.46/1.11 , clause( 41, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X
% 0.46/1.11 , Y ) ] )
% 0.46/1.11 , clause( 42, [ 'less_equal'( X, identity ) ] )
% 0.46/1.11 , clause( 43, [ quotient( X, Y, divide( X, Y ) ) ] )
% 0.46/1.11 , clause( 44, [ ~( quotient( X, Y, Z ) ), ~( quotient( X, Y, T ) ), =( Z, T
% 0.46/1.11 ) ] )
% 0.46/1.11 , clause( 45, [ ~( quotient( zero, x, zero ) ) ] )
% 0.46/1.11 ] ).
% 0.46/1.11
% 0.46/1.11
% 0.46/1.11
% 0.46/1.11 subsumption(
% 0.46/1.11 clause( 0, [ ~( 'less_equal'( X, Y ) ), quotient( X, Y, zero ) ] )
% 0.46/1.11 , clause( 36, [ ~( 'less_equal'( X, Y ) ), quotient( X, Y, zero ) ] )
% 0.46/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.46/1.11 ), ==>( 1, 1 )] ) ).
% 0.46/1.11
% 0.46/1.11
% 0.46/1.11 subsumption(
% 0.46/1.11 clause( 4, [ 'less_equal'( zero, X ) ] )
% 0.46/1.11 , clause( 40, [ 'less_equal'( zero, X ) ] )
% 0.46/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.46/1.11
% 0.46/1.11
% 0.46/1.11 subsumption(
% 0.46/1.11 clause( 9, [ ~( quotient( zero, x, zero ) ) ] )
% 0.46/1.11 , clause( 45, [ ~( quotient( zero, x, zero ) ) ] )
% 0.46/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.46/1.11
% 0.46/1.11
% 0.46/1.11 resolution(
% 0.46/1.11 clause( 120, [ ~( 'less_equal'( zero, x ) ) ] )
% 0.46/1.11 , clause( 9, [ ~( quotient( zero, x, zero ) ) ] )
% 0.46/1.11 , 0, clause( 0, [ ~( 'less_equal'( X, Y ) ), quotient( X, Y, zero ) ] )
% 0.46/1.11 , 1, substitution( 0, [] ), substitution( 1, [ :=( X, zero ), :=( Y, x )] )
% 0.46/1.11 ).
% 0.46/1.11
% 0.46/1.11
% 0.46/1.11 resolution(
% 0.46/1.11 clause( 121, [] )
% 0.46/1.11 , clause( 120, [ ~( 'less_equal'( zero, x ) ) ] )
% 0.46/1.11 , 0, clause( 4, [ 'less_equal'( zero, X ) ] )
% 0.46/1.11 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, x )] )).
% 0.46/1.11
% 0.46/1.11
% 0.46/1.11 subsumption(
% 0.46/1.11 clause( 34, [] )
% 0.46/1.11 , clause( 121, [] )
% 0.46/1.11 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.46/1.11
% 0.46/1.11
% 0.46/1.11 end.
% 0.46/1.11
% 0.46/1.11 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.46/1.11
% 0.46/1.11 Memory use:
% 0.46/1.11
% 0.46/1.11 space for terms: 795
% 0.46/1.11 space for clauses: 1460
% 0.46/1.11
% 0.46/1.11
% 0.46/1.11 clauses generated: 115
% 0.46/1.11 clauses kept: 35
% 0.46/1.11 clauses selected: 6
% 0.46/1.11 clauses deleted: 0
% 0.46/1.11 clauses inuse deleted: 0
% 0.46/1.11
% 0.46/1.11 subsentry: 2185
% 0.46/1.11 literals s-matched: 1614
% 0.46/1.11 literals matched: 910
% 0.46/1.11 full subsumption: 677
% 0.46/1.11
% 0.46/1.11 checksum: -1312821
% 0.46/1.11
% 0.46/1.11
% 0.46/1.11 Bliksem ended
%------------------------------------------------------------------------------