TSTP Solution File: HEN004-3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : HEN004-3 : 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:47:01 EDT 2022
% Result : Unsatisfiable 0.69s 1.13s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : HEN004-3 : TPTP v8.1.0. Released v1.0.0.
% 0.13/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n024.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 1 13:18:30 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.69/1.13 *** allocated 10000 integers for termspace/termends
% 0.69/1.13 *** allocated 10000 integers for clauses
% 0.69/1.13 *** allocated 10000 integers for justifications
% 0.69/1.13 Bliksem 1.12
% 0.69/1.13
% 0.69/1.13
% 0.69/1.13 Automatic Strategy Selection
% 0.69/1.13
% 0.69/1.13 Clauses:
% 0.69/1.13 [
% 0.69/1.13 [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ],
% 0.69/1.13 [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ],
% 0.69/1.13 [ 'less_equal'( divide( X, Y ), X ) ],
% 0.69/1.13 [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ), divide( divide(
% 0.69/1.13 X, Z ), Y ) ) ],
% 0.69/1.13 [ 'less_equal'( zero, X ) ],
% 0.69/1.13 [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X, Y ) ],
% 0.69/1.13 [ 'less_equal'( X, identity ) ],
% 0.69/1.13 [ ~( =( divide( a, zero ), a ) ) ]
% 0.69/1.13 ] .
% 0.69/1.13
% 0.69/1.13
% 0.69/1.13 percentage equality = 0.333333, percentage horn = 1.000000
% 0.69/1.13 This is a problem with some equality
% 0.69/1.13
% 0.69/1.13
% 0.69/1.13
% 0.69/1.13 Options Used:
% 0.69/1.13
% 0.69/1.13 useres = 1
% 0.69/1.13 useparamod = 1
% 0.69/1.13 useeqrefl = 1
% 0.69/1.13 useeqfact = 1
% 0.69/1.13 usefactor = 1
% 0.69/1.13 usesimpsplitting = 0
% 0.69/1.13 usesimpdemod = 5
% 0.69/1.13 usesimpres = 3
% 0.69/1.13
% 0.69/1.13 resimpinuse = 1000
% 0.69/1.13 resimpclauses = 20000
% 0.69/1.13 substype = eqrewr
% 0.69/1.13 backwardsubs = 1
% 0.69/1.13 selectoldest = 5
% 0.69/1.13
% 0.69/1.13 litorderings [0] = split
% 0.69/1.13 litorderings [1] = extend the termordering, first sorting on arguments
% 0.69/1.13
% 0.69/1.13 termordering = kbo
% 0.69/1.13
% 0.69/1.13 litapriori = 0
% 0.69/1.13 termapriori = 1
% 0.69/1.13 litaposteriori = 0
% 0.69/1.13 termaposteriori = 0
% 0.69/1.13 demodaposteriori = 0
% 0.69/1.13 ordereqreflfact = 0
% 0.69/1.13
% 0.69/1.13 litselect = negord
% 0.69/1.13
% 0.69/1.13 maxweight = 15
% 0.69/1.13 maxdepth = 30000
% 0.69/1.13 maxlength = 115
% 0.69/1.13 maxnrvars = 195
% 0.69/1.13 excuselevel = 1
% 0.69/1.13 increasemaxweight = 1
% 0.69/1.13
% 0.69/1.13 maxselected = 10000000
% 0.69/1.13 maxnrclauses = 10000000
% 0.69/1.13
% 0.69/1.13 showgenerated = 0
% 0.69/1.13 showkept = 0
% 0.69/1.13 showselected = 0
% 0.69/1.13 showdeleted = 0
% 0.69/1.13 showresimp = 1
% 0.69/1.13 showstatus = 2000
% 0.69/1.13
% 0.69/1.13 prologoutput = 1
% 0.69/1.13 nrgoals = 5000000
% 0.69/1.13 totalproof = 1
% 0.69/1.13
% 0.69/1.13 Symbols occurring in the translation:
% 0.69/1.13
% 0.69/1.13 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.69/1.13 . [1, 2] (w:1, o:20, a:1, s:1, b:0),
% 0.69/1.13 ! [4, 1] (w:0, o:15, a:1, s:1, b:0),
% 0.69/1.13 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.13 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.13 'less_equal' [41, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.69/1.13 divide [42, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.69/1.13 zero [43, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.69/1.13 identity [45, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.69/1.13 a [46, 0] (w:1, o:14, a:1, s:1, b:0).
% 0.69/1.13
% 0.69/1.13
% 0.69/1.13 Starting Search:
% 0.69/1.13
% 0.69/1.13
% 0.69/1.13 Bliksems!, er is een bewijs:
% 0.69/1.13 % SZS status Unsatisfiable
% 0.69/1.13 % SZS output start Refutation
% 0.69/1.13
% 0.69/1.13 clause( 0, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 0.69/1.13 .
% 0.69/1.13 clause( 1, [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ] )
% 0.69/1.13 .
% 0.69/1.13 clause( 2, [ 'less_equal'( divide( X, Y ), X ) ] )
% 0.69/1.13 .
% 0.69/1.13 clause( 3, [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ), divide(
% 0.69/1.13 divide( X, Z ), Y ) ) ] )
% 0.69/1.13 .
% 0.69/1.13 clause( 4, [ 'less_equal'( zero, X ) ] )
% 0.69/1.13 .
% 0.69/1.13 clause( 5, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X, Y
% 0.69/1.13 ) ] )
% 0.69/1.13 .
% 0.69/1.13 clause( 7, [ ~( =( divide( a, zero ), a ) ) ] )
% 0.69/1.13 .
% 0.69/1.13 clause( 8, [ =( divide( divide( X, Y ), X ), zero ) ] )
% 0.69/1.13 .
% 0.69/1.13 clause( 9, [ =( divide( zero, X ), zero ) ] )
% 0.69/1.13 .
% 0.69/1.13 clause( 14, [ 'less_equal'( divide( divide( Z, X ), zero ), divide( divide(
% 0.69/1.13 Z, divide( X, Y ) ), X ) ) ] )
% 0.69/1.13 .
% 0.69/1.13 clause( 18, [ 'less_equal'( divide( divide( Y, X ), zero ), divide( divide(
% 0.69/1.13 Y, zero ), X ) ) ] )
% 0.69/1.13 .
% 0.69/1.13 clause( 23, [ ~( 'less_equal'( X, Y ) ), =( Y, X ), ~( =( divide( Y, X ),
% 0.69/1.13 zero ) ) ] )
% 0.69/1.13 .
% 0.69/1.13 clause( 25, [ ~( 'less_equal'( X, zero ) ), =( zero, X ) ] )
% 0.69/1.13 .
% 0.69/1.13 clause( 39, [ ~( =( Z, zero ) ), 'less_equal'( X, Y ), ~( 'less_equal'(
% 0.69/1.13 divide( X, Y ), Z ) ), ~( 'less_equal'( Z, divide( X, Y ) ) ) ] )
% 0.69/1.13 .
% 0.69/1.13 clause( 47, [ 'less_equal'( X, Y ), ~( 'less_equal'( divide( X, Y ), zero )
% 0.69/1.13 ) ] )
% 0.69/1.13 .
% 0.69/1.13 clause( 76, [ 'less_equal'( divide( divide( X, X ), zero ), zero ) ] )
% 0.69/1.13 .
% 0.69/1.13 clause( 109, [ =( divide( divide( X, X ), zero ), zero ) ] )
% 0.69/1.13 .
% 0.69/1.13 clause( 128, [ 'less_equal'( divide( X, X ), zero ) ] )
% 0.69/1.13 .
% 0.69/1.13 clause( 140, [ =( divide( X, X ), zero ) ] )
% 0.69/1.13 .
% 0.69/1.13 clause( 151, [ 'less_equal'( divide( divide( X, divide( X, zero ) ), zero )
% 0.69/1.13 , zero ) ] )
% 0.69/1.13 .
% 0.69/1.13 clause( 445, [ ~( =( X, a ) ), ~( 'less_equal'( X, divide( a, zero ) ) ),
% 0.69/1.13 ~( =( divide( divide( a, zero ), X ), zero ) ) ] )
% 0.69/1.13 .
% 0.69/1.13 clause( 453, [ ~( 'less_equal'( a, divide( a, zero ) ) ) ] )
% 0.69/1.13 .
% 0.69/1.13 clause( 456, [ ~( 'less_equal'( divide( a, divide( a, zero ) ), zero ) ) ]
% 0.69/1.13 )
% 0.69/1.13 .
% 0.69/1.13 clause( 501, [] )
% 0.69/1.13 .
% 0.69/1.13
% 0.69/1.13
% 0.69/1.13 % SZS output end Refutation
% 0.69/1.13 found a proof!
% 0.69/1.13
% 0.69/1.13 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.69/1.13
% 0.69/1.13 initialclauses(
% 0.69/1.13 [ clause( 503, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 0.69/1.13 , clause( 504, [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ] )
% 0.69/1.13 , clause( 505, [ 'less_equal'( divide( X, Y ), X ) ] )
% 0.69/1.13 , clause( 506, [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ),
% 0.69/1.13 divide( divide( X, Z ), Y ) ) ] )
% 0.69/1.13 , clause( 507, [ 'less_equal'( zero, X ) ] )
% 0.69/1.13 , clause( 508, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X
% 0.69/1.13 , Y ) ] )
% 0.69/1.13 , clause( 509, [ 'less_equal'( X, identity ) ] )
% 0.69/1.13 , clause( 510, [ ~( =( divide( a, zero ), a ) ) ] )
% 0.69/1.13 ] ).
% 0.69/1.13
% 0.69/1.13
% 0.69/1.13
% 0.69/1.13 subsumption(
% 0.69/1.13 clause( 0, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 0.69/1.13 , clause( 503, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 0.69/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.69/1.13 ), ==>( 1, 1 )] ) ).
% 0.69/1.13
% 0.69/1.13
% 0.69/1.13 subsumption(
% 0.69/1.13 clause( 1, [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ] )
% 0.69/1.13 , clause( 504, [ ~( =( divide( X, Y ), zero ) ), 'less_equal'( X, Y ) ] )
% 0.69/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.69/1.13 ), ==>( 1, 1 )] ) ).
% 0.69/1.13
% 0.69/1.13
% 0.69/1.13 subsumption(
% 0.69/1.13 clause( 2, [ 'less_equal'( divide( X, Y ), X ) ] )
% 0.69/1.13 , clause( 505, [ 'less_equal'( divide( X, Y ), X ) ] )
% 0.69/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.69/1.13 )] ) ).
% 0.69/1.13
% 0.69/1.13
% 0.69/1.13 subsumption(
% 0.69/1.13 clause( 3, [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ), divide(
% 0.69/1.13 divide( X, Z ), Y ) ) ] )
% 0.69/1.13 , clause( 506, [ 'less_equal'( divide( divide( X, Y ), divide( Z, Y ) ),
% 0.69/1.13 divide( divide( X, Z ), Y ) ) ] )
% 0.69/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.69/1.13 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.13
% 0.69/1.13
% 0.69/1.13 subsumption(
% 0.69/1.13 clause( 4, [ 'less_equal'( zero, X ) ] )
% 0.69/1.13 , clause( 507, [ 'less_equal'( zero, X ) ] )
% 0.69/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.13
% 0.69/1.13
% 0.69/1.13 subsumption(
% 0.69/1.13 clause( 5, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X, Y
% 0.69/1.13 ) ] )
% 0.69/1.13 , clause( 508, [ ~( 'less_equal'( X, Y ) ), ~( 'less_equal'( Y, X ) ), =( X
% 0.69/1.13 , Y ) ] )
% 0.69/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.69/1.13 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.69/1.13
% 0.69/1.13
% 0.69/1.13 subsumption(
% 0.69/1.13 clause( 7, [ ~( =( divide( a, zero ), a ) ) ] )
% 0.69/1.13 , clause( 510, [ ~( =( divide( a, zero ), a ) ) ] )
% 0.69/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.13
% 0.69/1.13
% 0.69/1.13 eqswap(
% 0.69/1.13 clause( 527, [ =( zero, divide( X, Y ) ), ~( 'less_equal'( X, Y ) ) ] )
% 0.69/1.13 , clause( 0, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 0.69/1.13 , 1, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.69/1.13
% 0.69/1.13
% 0.69/1.13 resolution(
% 0.69/1.13 clause( 528, [ =( zero, divide( divide( X, Y ), X ) ) ] )
% 0.69/1.13 , clause( 527, [ =( zero, divide( X, Y ) ), ~( 'less_equal'( X, Y ) ) ] )
% 0.69/1.13 , 1, clause( 2, [ 'less_equal'( divide( X, Y ), X ) ] )
% 0.69/1.13 , 0, substitution( 0, [ :=( X, divide( X, Y ) ), :=( Y, X )] ),
% 0.69/1.13 substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.69/1.13
% 0.69/1.13
% 0.69/1.13 eqswap(
% 0.69/1.13 clause( 529, [ =( divide( divide( X, Y ), X ), zero ) ] )
% 0.69/1.13 , clause( 528, [ =( zero, divide( divide( X, Y ), X ) ) ] )
% 0.69/1.13 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.69/1.13
% 0.69/1.13
% 0.69/1.13 subsumption(
% 0.69/1.13 clause( 8, [ =( divide( divide( X, Y ), X ), zero ) ] )
% 0.69/1.13 , clause( 529, [ =( divide( divide( X, Y ), X ), zero ) ] )
% 0.69/1.13 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.69/1.13 )] ) ).
% 0.69/1.13
% 0.69/1.13
% 0.69/1.13 eqswap(
% 0.69/1.13 clause( 530, [ =( zero, divide( X, Y ) ), ~( 'less_equal'( X, Y ) ) ] )
% 0.69/1.13 , clause( 0, [ ~( 'less_equal'( X, Y ) ), =( divide( X, Y ), zero ) ] )
% 0.69/1.13 , 1, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.69/1.13
% 0.69/1.13
% 0.69/1.13 resolution(
% 0.69/1.13 clause( 531, [ =( zero, divide( zero, X ) ) ] )
% 0.69/1.13 , clause( 530, [ =( zero, divide( X, Y ) ), ~( 'less_equal'( X, Y ) ) ] )
% 0.69/1.13 , 1, clause( 4, [ 'less_equal'( zero, X ) ] )
% 0.69/1.13 , 0, substitution( 0, [ :=( X, zero ), :=( Y, X )] ), substitution( 1, [
% 0.69/1.13 :=( X, X )] )).
% 0.69/1.13
% 0.69/1.13
% 0.69/1.13 eqswap(
% 0.69/1.13 clause( 532, [ =( divide( zero, X ), zero ) ] )
% 0.69/1.13 , clause( 531, [ =( zero, divide( zero, X ) ) ] )
% 0.69/1.13 , 0, substitution( 0, [ :=( X, X )] )).
% 0.69/1.13
% 0.69/1.13
% 0.69/1.13 subsumption(
% 0.69/1.13 clause( 9, [ =( divide( zero, X ), zero ) ] )
% 0.69/1.13 , clause( 532, [ =( divide( zero, X ), zero ) ] )
% 0.69/1.13 , suCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------