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