TSTP Solution File: COM003-2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : COM003-2 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n016.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 : Fri Jul 15 00:50:59 EDT 2022
% Result : Unsatisfiable 0.46s 1.10s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : COM003-2 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % DateTime : Thu Jun 16 18:23:04 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.46/1.10 *** allocated 10000 integers for termspace/termends
% 0.46/1.10 *** allocated 10000 integers for clauses
% 0.46/1.10 *** allocated 10000 integers for justifications
% 0.46/1.10 Bliksem 1.12
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 Automatic Strategy Selection
% 0.46/1.10
% 0.46/1.10 Clauses:
% 0.46/1.10 [
% 0.46/1.10 [ ~( 'program_decides'( X ) ), ~( program( Y ) ), decides( X, Y, Z ) ]
% 0.46/1.10 ,
% 0.46/1.10 [ 'program_decides'( X ), program( f2( X ) ) ],
% 0.46/1.10 [ 'program_decides'( X ), ~( decides( X, f2( X ), f1( X ) ) ) ],
% 0.46/1.10 [ ~( 'program_program_decides'( X ) ), program( X ) ],
% 0.46/1.10 [ ~( 'program_program_decides'( X ) ), 'program_decides'( X ) ],
% 0.46/1.10 [ 'program_program_decides'( X ), ~( program( X ) ), ~(
% 0.46/1.10 'program_decides'( X ) ) ],
% 0.46/1.10 [ ~( 'algorithm_program_decides'( X ) ), algorithm( X ) ],
% 0.46/1.10 [ ~( 'algorithm_program_decides'( X ) ), 'program_decides'( X ) ],
% 0.46/1.10 [ 'algorithm_program_decides'( X ), ~( algorithm( X ) ), ~(
% 0.46/1.10 'program_decides'( X ) ) ],
% 0.46/1.10 [ ~( 'program_halts2'( X, Y ) ), program( X ) ],
% 0.46/1.10 [ ~( 'program_halts2'( X, Y ) ), halts2( X, Y ) ],
% 0.46/1.10 [ 'program_halts2'( X, Y ), ~( program( X ) ), ~( halts2( X, Y ) ) ]
% 0.46/1.10 ,
% 0.46/1.10 [ ~( 'halts3_outputs'( X, Y, Z, T ) ), halts3( X, Y, Z ) ],
% 0.46/1.10 [ ~( 'halts3_outputs'( X, Y, Z, T ) ), outputs( X, T ) ],
% 0.46/1.10 [ 'halts3_outputs'( X, Y, Z, T ), ~( halts3( X, Y, Z ) ), ~( outputs( X
% 0.46/1.10 , T ) ) ],
% 0.46/1.10 [ ~( 'program_not_halts2'( X, Y ) ), program( X ) ],
% 0.46/1.10 [ ~( 'program_not_halts2'( X, Y ) ), ~( halts2( X, Y ) ) ],
% 0.46/1.10 [ 'program_not_halts2'( X, Y ), ~( program( X ) ), halts2( X, Y ) ],
% 0.46/1.10 [ ~( 'halts2_outputs'( X, Y, Z ) ), halts2( X, Y ) ],
% 0.46/1.10 [ ~( 'halts2_outputs'( X, Y, Z ) ), outputs( X, Z ) ],
% 0.46/1.10 [ 'halts2_outputs'( X, Y, Z ), ~( halts2( X, Y ) ), ~( outputs( X, Z ) )
% 0.46/1.10 ],
% 0.46/1.10 [ ~( 'program_halts2_halts3_outputs'( X, Y, Z, T ) ), 'program_halts2'(
% 0.46/1.10 Y, Z ) ],
% 0.46/1.10 [ ~( 'program_halts2_halts3_outputs'( X, Y, Z, T ) ), 'halts3_outputs'(
% 0.46/1.10 X, Y, Z, T ) ],
% 0.46/1.10 [ 'program_halts2_halts3_outputs'( X, Y, Z, T ), ~( 'program_halts2'( Y
% 0.46/1.10 , Z ) ), ~( 'halts3_outputs'( X, Y, Z, T ) ) ],
% 0.46/1.10 [ ~( 'program_not_halts2_halts3_outputs'( X, Y, Z, T ) ),
% 0.46/1.10 'program_not_halts2'( Y, Z ) ],
% 0.46/1.10 [ ~( 'program_not_halts2_halts3_outputs'( X, Y, Z, T ) ),
% 0.46/1.10 'halts3_outputs'( X, Y, Z, T ) ],
% 0.46/1.10 [ 'program_not_halts2_halts3_outputs'( X, Y, Z, T ), ~(
% 0.46/1.10 'program_not_halts2'( Y, Z ) ), ~( 'halts3_outputs'( X, Y, Z, T ) ) ]
% 0.46/1.10 ,
% 0.46/1.10 [ ~( 'program_halts2_halts2_outputs'( X, Y, Z ) ), 'program_halts2'( Y,
% 0.46/1.10 Y ) ],
% 0.46/1.10 [ ~( 'program_halts2_halts2_outputs'( X, Y, Z ) ), 'halts2_outputs'( X,
% 0.46/1.10 Y, Z ) ],
% 0.46/1.10 [ 'program_halts2_halts2_outputs'( X, Y, Z ), ~( 'program_halts2'( Y, Y
% 0.46/1.10 ) ), ~( 'halts2_outputs'( X, Y, Z ) ) ],
% 0.46/1.10 [ ~( 'program_not_halts2_halts2_outputs'( X, Y, Z ) ),
% 0.46/1.10 'program_not_halts2'( Y, Y ) ],
% 0.46/1.10 [ ~( 'program_not_halts2_halts2_outputs'( X, Y, Z ) ), 'halts2_outputs'(
% 0.46/1.10 X, Y, Z ) ],
% 0.46/1.10 [ 'program_not_halts2_halts2_outputs'( X, Y, Z ), ~(
% 0.46/1.10 'program_not_halts2'( Y, Y ) ), ~( 'halts2_outputs'( X, Y, Z ) ) ],
% 0.46/1.10 [ ~( 'algorithm_program_decides'( X ) ), 'program_program_decides'( c1 )
% 0.46/1.10 ],
% 0.46/1.10 [ ~( 'program_program_decides'( X ) ), 'program_halts2_halts3_outputs'(
% 0.46/1.10 X, Y, Z, good ) ],
% 0.46/1.10 [ ~( 'program_program_decides'( X ) ),
% 0.46/1.10 'program_not_halts2_halts3_outputs'( X, Y, Z, bad ) ],
% 0.46/1.10 [ ~( program( X ) ), ~( 'program_halts2_halts3_outputs'( X, f3( X ), f3(
% 0.46/1.10 X ), good ) ), ~( 'program_not_halts2_halts3_outputs'( X, f3( X ), f3( X
% 0.46/1.10 ), bad ) ), program( c2 ) ],
% 0.46/1.10 [ ~( program( X ) ), ~( 'program_halts2_halts3_outputs'( X, f3( X ), f3(
% 0.46/1.10 X ), good ) ), ~( 'program_not_halts2_halts3_outputs'( X, f3( X ), f3( X
% 0.46/1.10 ), bad ) ), 'program_halts2_halts2_outputs'( c2, Y, good ) ],
% 0.46/1.10 [ ~( program( X ) ), ~( 'program_halts2_halts3_outputs'( X, f3( X ), f3(
% 0.46/1.10 X ), good ) ), ~( 'program_not_halts2_halts3_outputs'( X, f3( X ), f3( X
% 0.46/1.10 ), bad ) ), 'program_not_halts2_halts2_outputs'( c2, Y, bad ) ],
% 0.46/1.10 [ ~( program( X ) ), ~( 'program_halts2_halts2_outputs'( X, f4( X ),
% 0.46/1.10 good ) ), ~( 'program_not_halts2_halts2_outputs'( X, f4( X ), bad ) ),
% 0.46/1.10 program( c3 ) ],
% 0.46/1.10 [ ~( program( X ) ), ~( 'program_halts2_halts2_outputs'( X, f4( X ),
% 0.46/1.10 good ) ), ~( 'program_not_halts2_halts2_outputs'( X, f4( X ), bad ) ),
% 0.46/1.10 ~( 'program_halts2'( Y, Y ) ), halts2( c3, Y ) ],
% 0.46/1.10 [ ~( program( X ) ), ~( 'program_halts2_halts2_outputs'( X, f4( X ),
% 0.46/1.10 good ) ), ~( 'program_not_halts2_halts2_outputs'( X, f4( X ), bad ) ),
% 0.46/1.10 'program_not_halts2_halts2_outputs'( c3, Y, bad ) ],
% 0.46/1.10 [ 'algorithm_program_decides'( c4 ) ]
% 0.46/1.10 ] .
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 percentage equality = 0.000000, percentage horn = 0.953488
% 0.46/1.10 This is a near-Horn, non-equality problem
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 Options Used:
% 0.46/1.10
% 0.46/1.10 useres = 1
% 0.46/1.10 useparamod = 0
% 0.46/1.10 useeqrefl = 0
% 0.46/1.10 useeqfact = 0
% 0.46/1.10 usefactor = 1
% 0.46/1.10 usesimpsplitting = 0
% 0.46/1.10 usesimpdemod = 0
% 0.46/1.10 usesimpres = 4
% 0.46/1.10
% 0.46/1.10 resimpinuse = 1000
% 0.46/1.10 resimpclauses = 20000
% 0.46/1.10 substype = standard
% 0.46/1.10 backwardsubs = 1
% 0.46/1.10 selectoldest = 5
% 0.46/1.10
% 0.46/1.10 litorderings [0] = split
% 0.46/1.10 litorderings [1] = liftord
% 0.46/1.10
% 0.46/1.10 termordering = none
% 0.46/1.10
% 0.46/1.10 litapriori = 1
% 0.46/1.10 termapriori = 0
% 0.46/1.10 litaposteriori = 0
% 0.46/1.10 termaposteriori = 0
% 0.46/1.10 demodaposteriori = 0
% 0.46/1.10 ordereqreflfact = 0
% 0.46/1.10
% 0.46/1.10 litselect = negative
% 0.46/1.10
% 0.46/1.10 maxweight = 30000
% 0.46/1.10 maxdepth = 30000
% 0.46/1.10 maxlength = 115
% 0.46/1.10 maxnrvars = 195
% 0.46/1.10 excuselevel = 0
% 0.46/1.10 increasemaxweight = 0
% 0.46/1.10
% 0.46/1.10 maxselected = 10000000
% 0.46/1.10 maxnrclauses = 10000000
% 0.46/1.10
% 0.46/1.10 showgenerated = 0
% 0.46/1.10 showkept = 0
% 0.46/1.10 showselected = 0
% 0.46/1.10 showdeleted = 0
% 0.46/1.10 showresimp = 1
% 0.46/1.10 showstatus = 2000
% 0.46/1.10
% 0.46/1.10 prologoutput = 1
% 0.46/1.10 nrgoals = 5000000
% 0.46/1.10 totalproof = 1
% 0.46/1.10
% 0.46/1.10 Symbols occurring in the translation:
% 0.46/1.10
% 0.46/1.10 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.46/1.10 . [1, 2] (w:1, o:34, a:1, s:1, b:0),
% 0.46/1.10 ! [4, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.46/1.10 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.46/1.10 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.46/1.10 'program_decides' [40, 1] (w:1, o:25, a:1, s:1, b:0),
% 0.46/1.10 program [42, 1] (w:1, o:26, a:1, s:1, b:0),
% 0.46/1.10 decides [44, 3] (w:1, o:63, a:1, s:1, b:0),
% 0.46/1.10 f2 [45, 1] (w:1, o:28, a:1, s:1, b:0),
% 0.46/1.10 f1 [46, 1] (w:1, o:27, a:1, s:1, b:0),
% 0.46/1.10 'program_program_decides' [47, 1] (w:1, o:29, a:1, s:1, b:0),
% 0.46/1.10 'algorithm_program_decides' [48, 1] (w:1, o:30, a:1, s:1, b:0),
% 0.46/1.10 algorithm [49, 1] (w:1, o:31, a:1, s:1, b:0),
% 0.46/1.10 'program_halts2' [50, 2] (w:1, o:60, a:1, s:1, b:0),
% 0.46/1.10 halts2 [51, 2] (w:1, o:61, a:1, s:1, b:0),
% 0.46/1.10 'halts3_outputs' [53, 4] (w:1, o:68, a:1, s:1, b:0),
% 0.46/1.10 halts3 [54, 3] (w:1, o:65, a:1, s:1, b:0),
% 0.46/1.10 outputs [55, 2] (w:1, o:59, a:1, s:1, b:0),
% 0.46/1.10 'program_not_halts2' [56, 2] (w:1, o:62, a:1, s:1, b:0),
% 0.46/1.10 'halts2_outputs' [57, 3] (w:1, o:64, a:1, s:1, b:0),
% 0.46/1.10 'program_halts2_halts3_outputs' [58, 4] (w:1, o:69, a:1, s:1, b:0),
% 0.46/1.10 'program_not_halts2_halts3_outputs' [59, 4] (w:1, o:70, a:1, s:1, b:0
% 0.46/1.10 ),
% 0.46/1.10 'program_halts2_halts2_outputs' [60, 3] (w:1, o:66, a:1, s:1, b:0),
% 0.46/1.10 'program_not_halts2_halts2_outputs' [61, 3] (w:1, o:67, a:1, s:1, b:0
% 0.46/1.10 ),
% 0.46/1.10 c1 [62, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.46/1.10 good [63, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.46/1.10 bad [64, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.46/1.10 f3 [65, 1] (w:1, o:32, a:1, s:1, b:0),
% 0.46/1.10 c2 [66, 0] (w:1, o:17, a:1, s:1, b:0),
% 0.46/1.10 f4 [68, 1] (w:1, o:33, a:1, s:1, b:0),
% 0.46/1.10 c3 [69, 0] (w:1, o:18, a:1, s:1, b:0),
% 0.46/1.10 c4 [70, 0] (w:1, o:19, a:1, s:1, b:0).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 Starting Search:
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 Bliksems!, er is een bewijs:
% 0.46/1.10 % SZS status Unsatisfiable
% 0.46/1.10 % SZS output start Refutation
% 0.46/1.10
% 0.46/1.10 clause( 5, [ ~( program( X ) ), 'program_program_decides'( X ), ~(
% 0.46/1.10 'program_decides'( X ) ) ] )
% 0.46/1.10 .
% 0.46/1.10 clause( 7, [ 'program_decides'( X ), ~( 'algorithm_program_decides'( X ) )
% 0.46/1.10 ] )
% 0.46/1.10 .
% 0.46/1.10 clause( 10, [ halts2( X, Y ), ~( 'program_halts2'( X, Y ) ) ] )
% 0.46/1.10 .
% 0.46/1.10 clause( 15, [ program( X ), ~( 'program_not_halts2'( X, Y ) ) ] )
% 0.46/1.10 .
% 0.46/1.10 clause( 16, [ ~( 'program_not_halts2'( X, Y ) ), ~( halts2( X, Y ) ) ] )
% 0.46/1.10 .
% 0.46/1.10 clause( 21, [ 'program_halts2'( Y, Z ), ~( 'program_halts2_halts3_outputs'(
% 0.46/1.10 X, Y, Z, T ) ) ] )
% 0.46/1.10 .
% 0.46/1.10 clause( 24, [ 'program_not_halts2'( Y, Z ), ~(
% 0.46/1.10 'program_not_halts2_halts3_outputs'( X, Y, Z, T ) ) ] )
% 0.46/1.10 .
% 0.46/1.10 clause( 33, [ 'program_program_decides'( c1 ), ~(
% 0.46/1.10 'algorithm_program_decides'( X ) ) ] )
% 0.46/1.10 .
% 0.46/1.10 clause( 34, [ 'program_halts2_halts3_outputs'( X, Y, Z, good ), ~(
% 0.46/1.10 'program_program_decides'( X ) ) ] )
% 0.46/1.10 .
% 0.46/1.10 clause( 35, [ 'program_not_halts2_halts3_outputs'( X, Y, Z, bad ), ~(
% 0.46/1.10 'program_program_decides'( X ) ) ] )
% 0.46/1.10 .
% 0.46/1.10 clause( 42, [ 'algorithm_program_decides'( c4 ) ] )
% 0.46/1.10 .
% 0.46/1.10 clause( 43, [ 'program_program_decides'( c1 ) ] )
% 0.46/1.10 .
% 0.46/1.10 clause( 44, [ 'program_decides'( c4 ) ] )
% 0.46/1.10 .
% 0.46/1.10 clause( 54, [ 'program_program_decides'( c4 ), ~( program( c4 ) ) ] )
% 0.46/1.10 .
% 0.46/1.10 clause( 56, [ 'program_not_halts2_halts3_outputs'( c1, X, Y, bad ) ] )
% 0.46/1.10 .
% 0.46/1.10 clause( 60, [ 'program_not_halts2'( X, Y ) ] )
% 0.46/1.10 .
% 0.46/1.10 clause( 61, [ program( X ) ] )
% 0.46/1.10 .
% 0.46/1.10 clause( 63, [ 'program_program_decides'( c4 ) ] )
% 0.46/1.10 .
% 0.46/1.10 clause( 66, [ 'program_halts2_halts3_outputs'( c4, X, Y, good ) ] )
% 0.46/1.10 .
% 0.46/1.10 clause( 68, [ 'program_halts2'( X, Y ) ] )
% 0.46/1.10 .
% 0.46/1.10 clause( 69, [ halts2( X, Y ) ] )
% 0.46/1.10 .
% 0.46/1.10 clause( 70, [] )
% 0.46/1.10 .
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 % SZS output end Refutation
% 0.46/1.10 found a proof!
% 0.46/1.10
% 0.46/1.10 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.46/1.10
% 0.46/1.10 initialclauses(
% 0.46/1.10 [ clause( 72, [ ~( 'program_decides'( X ) ), ~( program( Y ) ), decides( X
% 0.46/1.10 , Y, Z ) ] )
% 0.46/1.10 , clause( 73, [ 'program_decides'( X ), program( f2( X ) ) ] )
% 0.46/1.10 , clause( 74, [ 'program_decides'( X ), ~( decides( X, f2( X ), f1( X ) ) )
% 0.46/1.10 ] )
% 0.46/1.10 , clause( 75, [ ~( 'program_program_decides'( X ) ), program( X ) ] )
% 0.46/1.10 , clause( 76, [ ~( 'program_program_decides'( X ) ), 'program_decides'( X )
% 0.46/1.10 ] )
% 0.46/1.10 , clause( 77, [ 'program_program_decides'( X ), ~( program( X ) ), ~(
% 0.46/1.10 'program_decides'( X ) ) ] )
% 0.46/1.10 , clause( 78, [ ~( 'algorithm_program_decides'( X ) ), algorithm( X ) ] )
% 0.46/1.10 , clause( 79, [ ~( 'algorithm_program_decides'( X ) ), 'program_decides'( X
% 0.46/1.10 ) ] )
% 0.46/1.10 , clause( 80, [ 'algorithm_program_decides'( X ), ~( algorithm( X ) ), ~(
% 0.46/1.10 'program_decides'( X ) ) ] )
% 0.46/1.10 , clause( 81, [ ~( 'program_halts2'( X, Y ) ), program( X ) ] )
% 0.46/1.10 , clause( 82, [ ~( 'program_halts2'( X, Y ) ), halts2( X, Y ) ] )
% 0.46/1.10 , clause( 83, [ 'program_halts2'( X, Y ), ~( program( X ) ), ~( halts2( X,
% 0.46/1.10 Y ) ) ] )
% 0.46/1.10 , clause( 84, [ ~( 'halts3_outputs'( X, Y, Z, T ) ), halts3( X, Y, Z ) ] )
% 0.46/1.10 , clause( 85, [ ~( 'halts3_outputs'( X, Y, Z, T ) ), outputs( X, T ) ] )
% 0.46/1.10 , clause( 86, [ 'halts3_outputs'( X, Y, Z, T ), ~( halts3( X, Y, Z ) ), ~(
% 0.46/1.10 outputs( X, T ) ) ] )
% 0.46/1.10 , clause( 87, [ ~( 'program_not_halts2'( X, Y ) ), program( X ) ] )
% 0.46/1.10 , clause( 88, [ ~( 'program_not_halts2'( X, Y ) ), ~( halts2( X, Y ) ) ] )
% 0.46/1.10 , clause( 89, [ 'program_not_halts2'( X, Y ), ~( program( X ) ), halts2( X
% 0.46/1.10 , Y ) ] )
% 0.46/1.10 , clause( 90, [ ~( 'halts2_outputs'( X, Y, Z ) ), halts2( X, Y ) ] )
% 0.46/1.10 , clause( 91, [ ~( 'halts2_outputs'( X, Y, Z ) ), outputs( X, Z ) ] )
% 0.46/1.10 , clause( 92, [ 'halts2_outputs'( X, Y, Z ), ~( halts2( X, Y ) ), ~(
% 0.46/1.10 outputs( X, Z ) ) ] )
% 0.46/1.10 , clause( 93, [ ~( 'program_halts2_halts3_outputs'( X, Y, Z, T ) ),
% 0.46/1.10 'program_halts2'( Y, Z ) ] )
% 0.46/1.10 , clause( 94, [ ~( 'program_halts2_halts3_outputs'( X, Y, Z, T ) ),
% 0.46/1.10 'halts3_outputs'( X, Y, Z, T ) ] )
% 0.46/1.10 , clause( 95, [ 'program_halts2_halts3_outputs'( X, Y, Z, T ), ~(
% 0.46/1.10 'program_halts2'( Y, Z ) ), ~( 'halts3_outputs'( X, Y, Z, T ) ) ] )
% 0.46/1.10 , clause( 96, [ ~( 'program_not_halts2_halts3_outputs'( X, Y, Z, T ) ),
% 0.46/1.10 'program_not_halts2'( Y, Z ) ] )
% 0.46/1.10 , clause( 97, [ ~( 'program_not_halts2_halts3_outputs'( X, Y, Z, T ) ),
% 0.46/1.10 'halts3_outputs'( X, Y, Z, T ) ] )
% 0.46/1.10 , clause( 98, [ 'program_not_halts2_halts3_outputs'( X, Y, Z, T ), ~(
% 0.46/1.10 'program_not_halts2'( Y, Z ) ), ~( 'halts3_outputs'( X, Y, Z, T ) ) ] )
% 0.46/1.10 , clause( 99, [ ~( 'program_halts2_halts2_outputs'( X, Y, Z ) ),
% 0.46/1.10 'program_halts2'( Y, Y ) ] )
% 0.46/1.10 , clause( 100, [ ~( 'program_halts2_halts2_outputs'( X, Y, Z ) ),
% 0.46/1.10 'halts2_outputs'( X, Y, Z ) ] )
% 0.46/1.10 , clause( 101, [ 'program_halts2_halts2_outputs'( X, Y, Z ), ~(
% 0.46/1.10 'program_halts2'( Y, Y ) ), ~( 'halts2_outputs'( X, Y, Z ) ) ] )
% 0.46/1.10 , clause( 102, [ ~( 'program_not_halts2_halts2_outputs'( X, Y, Z ) ),
% 0.46/1.10 'program_not_halts2'( Y, Y ) ] )
% 0.46/1.10 , clause( 103, [ ~( 'program_not_halts2_halts2_outputs'( X, Y, Z ) ),
% 0.46/1.10 'halts2_outputs'( X, Y, Z ) ] )
% 0.46/1.10 , clause( 104, [ 'program_not_halts2_halts2_outputs'( X, Y, Z ), ~(
% 0.46/1.10 'program_not_halts2'( Y, Y ) ), ~( 'halts2_outputs'( X, Y, Z ) ) ] )
% 0.46/1.10 , clause( 105, [ ~( 'algorithm_program_decides'( X ) ),
% 0.46/1.10 'program_program_decides'( c1 ) ] )
% 0.46/1.10 , clause( 106, [ ~( 'program_program_decides'( X ) ),
% 0.46/1.10 'program_halts2_halts3_outputs'( X, Y, Z, good ) ] )
% 0.46/1.10 , clause( 107, [ ~( 'program_program_decides'( X ) ),
% 0.46/1.10 'program_not_halts2_halts3_outputs'( X, Y, Z, bad ) ] )
% 0.46/1.10 , clause( 108, [ ~( program( X ) ), ~( 'program_halts2_halts3_outputs'( X,
% 0.46/1.10 f3( X ), f3( X ), good ) ), ~( 'program_not_halts2_halts3_outputs'( X, f3(
% 0.46/1.10 X ), f3( X ), bad ) ), program( c2 ) ] )
% 0.46/1.10 , clause( 109, [ ~( program( X ) ), ~( 'program_halts2_halts3_outputs'( X,
% 0.46/1.10 f3( X ), f3( X ), good ) ), ~( 'program_not_halts2_halts3_outputs'( X, f3(
% 0.46/1.10 X ), f3( X ), bad ) ), 'program_halts2_halts2_outputs'( c2, Y, good ) ]
% 0.46/1.10 )
% 0.46/1.10 , clause( 110, [ ~( program( X ) ), ~( 'program_halts2_halts3_outputs'( X,
% 0.46/1.10 f3( X ), f3( X ), good ) ), ~( 'program_not_halts2_halts3_outputs'( X, f3(
% 0.46/1.10 X ), f3( X ), bad ) ), 'program_not_halts2_halts2_outputs'( c2, Y, bad )
% 0.46/1.10 ] )
% 0.46/1.10 , clause( 111, [ ~( program( X ) ), ~( 'program_halts2_halts2_outputs'( X,
% 0.46/1.10 f4( X ), good ) ), ~( 'program_not_halts2_halts2_outputs'( X, f4( X ),
% 0.46/1.10 bad ) ), program( c3 ) ] )
% 0.46/1.10 , clause( 112, [ ~( program( X ) ), ~( 'program_halts2_halts2_outputs'( X,
% 0.46/1.10 f4( X ), good ) ), ~( 'program_not_halts2_halts2_outputs'( X, f4( X ),
% 0.46/1.10 bad ) ), ~( 'program_halts2'( Y, Y ) ), halts2( c3, Y ) ] )
% 0.46/1.10 , clause( 113, [ ~( program( X ) ), ~( 'program_halts2_halts2_outputs'( X,
% 0.46/1.10 f4( X ), good ) ), ~( 'program_not_halts2_halts2_outputs'( X, f4( X ),
% 0.46/1.10 bad ) ), 'program_not_halts2_halts2_outputs'( c3, Y, bad ) ] )
% 0.46/1.10 , clause( 114, [ 'algorithm_program_decides'( c4 ) ] )
% 0.46/1.10 ] ).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 subsumption(
% 0.46/1.10 clause( 5, [ ~( program( X ) ), 'program_program_decides'( X ), ~(
% 0.46/1.10 'program_decides'( X ) ) ] )
% 0.46/1.10 , clause( 77, [ 'program_program_decides'( X ), ~( program( X ) ), ~(
% 0.46/1.10 'program_decides'( X ) ) ] )
% 0.46/1.10 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.46/1.10 0 ), ==>( 2, 2 )] ) ).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 subsumption(
% 0.46/1.10 clause( 7, [ 'program_decides'( X ), ~( 'algorithm_program_decides'( X ) )
% 0.46/1.10 ] )
% 0.46/1.10 , clause( 79, [ ~( 'algorithm_program_decides'( X ) ), 'program_decides'( X
% 0.46/1.10 ) ] )
% 0.46/1.10 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.46/1.10 0 )] ) ).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 subsumption(
% 0.46/1.10 clause( 10, [ halts2( X, Y ), ~( 'program_halts2'( X, Y ) ) ] )
% 0.46/1.10 , clause( 82, [ ~( 'program_halts2'( X, Y ) ), halts2( X, Y ) ] )
% 0.46/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.46/1.10 ), ==>( 1, 0 )] ) ).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 subsumption(
% 0.46/1.10 clause( 15, [ program( X ), ~( 'program_not_halts2'( X, Y ) ) ] )
% 0.46/1.10 , clause( 87, [ ~( 'program_not_halts2'( X, Y ) ), program( X ) ] )
% 0.46/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.46/1.10 ), ==>( 1, 0 )] ) ).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 subsumption(
% 0.46/1.10 clause( 16, [ ~( 'program_not_halts2'( X, Y ) ), ~( halts2( X, Y ) ) ] )
% 0.46/1.10 , clause( 88, [ ~( 'program_not_halts2'( X, Y ) ), ~( halts2( X, Y ) ) ] )
% 0.46/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.46/1.10 ), ==>( 1, 1 )] ) ).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 subsumption(
% 0.46/1.10 clause( 21, [ 'program_halts2'( Y, Z ), ~( 'program_halts2_halts3_outputs'(
% 0.46/1.10 X, Y, Z, T ) ) ] )
% 0.46/1.10 , clause( 93, [ ~( 'program_halts2_halts3_outputs'( X, Y, Z, T ) ),
% 0.46/1.10 'program_halts2'( Y, Z ) ] )
% 0.46/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.46/1.10 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 subsumption(
% 0.46/1.10 clause( 24, [ 'program_not_halts2'( Y, Z ), ~(
% 0.46/1.10 'program_not_halts2_halts3_outputs'( X, Y, Z, T ) ) ] )
% 0.46/1.10 , clause( 96, [ ~( 'program_not_halts2_halts3_outputs'( X, Y, Z, T ) ),
% 0.46/1.10 'program_not_halts2'( Y, Z ) ] )
% 0.46/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.46/1.10 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 subsumption(
% 0.46/1.10 clause( 33, [ 'program_program_decides'( c1 ), ~(
% 0.46/1.10 'algorithm_program_decides'( X ) ) ] )
% 0.46/1.10 , clause( 105, [ ~( 'algorithm_program_decides'( X ) ),
% 0.46/1.10 'program_program_decides'( c1 ) ] )
% 0.46/1.10 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.46/1.10 0 )] ) ).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 subsumption(
% 0.46/1.10 clause( 34, [ 'program_halts2_halts3_outputs'( X, Y, Z, good ), ~(
% 0.46/1.10 'program_program_decides'( X ) ) ] )
% 0.46/1.10 , clause( 106, [ ~( 'program_program_decides'( X ) ),
% 0.46/1.10 'program_halts2_halts3_outputs'( X, Y, Z, good ) ] )
% 0.46/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.46/1.10 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 subsumption(
% 0.46/1.10 clause( 35, [ 'program_not_halts2_halts3_outputs'( X, Y, Z, bad ), ~(
% 0.46/1.10 'program_program_decides'( X ) ) ] )
% 0.46/1.10 , clause( 107, [ ~( 'program_program_decides'( X ) ),
% 0.46/1.10 'program_not_halts2_halts3_outputs'( X, Y, Z, bad ) ] )
% 0.46/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.46/1.10 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 subsumption(
% 0.46/1.10 clause( 42, [ 'algorithm_program_decides'( c4 ) ] )
% 0.46/1.10 , clause( 114, [ 'algorithm_program_decides'( c4 ) ] )
% 0.46/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 resolution(
% 0.46/1.10 clause( 115, [ 'program_program_decides'( c1 ) ] )
% 0.46/1.10 , clause( 33, [ 'program_program_decides'( c1 ), ~(
% 0.46/1.10 'algorithm_program_decides'( X ) ) ] )
% 0.46/1.10 , 1, clause( 42, [ 'algorithm_program_decides'( c4 ) ] )
% 0.46/1.10 , 0, substitution( 0, [ :=( X, c4 )] ), substitution( 1, [] )).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 subsumption(
% 0.46/1.10 clause( 43, [ 'program_program_decides'( c1 ) ] )
% 0.46/1.10 , clause( 115, [ 'program_program_decides'( c1 ) ] )
% 0.46/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 resolution(
% 0.46/1.10 clause( 116, [ 'program_decides'( c4 ) ] )
% 0.46/1.10 , clause( 7, [ 'program_decides'( X ), ~( 'algorithm_program_decides'( X )
% 0.46/1.10 ) ] )
% 0.46/1.10 , 1, clause( 42, [ 'algorithm_program_decides'( c4 ) ] )
% 0.46/1.10 , 0, substitution( 0, [ :=( X, c4 )] ), substitution( 1, [] )).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 subsumption(
% 0.46/1.10 clause( 44, [ 'program_decides'( c4 ) ] )
% 0.46/1.10 , clause( 116, [ 'program_decides'( c4 ) ] )
% 0.46/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 resolution(
% 0.46/1.10 clause( 117, [ ~( program( c4 ) ), 'program_program_decides'( c4 ) ] )
% 0.46/1.10 , clause( 5, [ ~( program( X ) ), 'program_program_decides'( X ), ~(
% 0.46/1.10 'program_decides'( X ) ) ] )
% 0.46/1.10 , 2, clause( 44, [ 'program_decides'( c4 ) ] )
% 0.46/1.10 , 0, substitution( 0, [ :=( X, c4 )] ), substitution( 1, [] )).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 subsumption(
% 0.46/1.10 clause( 54, [ 'program_program_decides'( c4 ), ~( program( c4 ) ) ] )
% 0.46/1.10 , clause( 117, [ ~( program( c4 ) ), 'program_program_decides'( c4 ) ] )
% 0.46/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] )
% 0.46/1.10 ).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 resolution(
% 0.46/1.10 clause( 118, [ 'program_not_halts2_halts3_outputs'( c1, X, Y, bad ) ] )
% 0.46/1.10 , clause( 35, [ 'program_not_halts2_halts3_outputs'( X, Y, Z, bad ), ~(
% 0.46/1.10 'program_program_decides'( X ) ) ] )
% 0.46/1.10 , 1, clause( 43, [ 'program_program_decides'( c1 ) ] )
% 0.46/1.10 , 0, substitution( 0, [ :=( X, c1 ), :=( Y, X ), :=( Z, Y )] ),
% 0.46/1.10 substitution( 1, [] )).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 subsumption(
% 0.46/1.10 clause( 56, [ 'program_not_halts2_halts3_outputs'( c1, X, Y, bad ) ] )
% 0.46/1.10 , clause( 118, [ 'program_not_halts2_halts3_outputs'( c1, X, Y, bad ) ] )
% 0.46/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.46/1.10 )] ) ).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 resolution(
% 0.46/1.10 clause( 119, [ 'program_not_halts2'( X, Y ) ] )
% 0.46/1.10 , clause( 24, [ 'program_not_halts2'( Y, Z ), ~(
% 0.46/1.10 'program_not_halts2_halts3_outputs'( X, Y, Z, T ) ) ] )
% 0.46/1.10 , 1, clause( 56, [ 'program_not_halts2_halts3_outputs'( c1, X, Y, bad ) ]
% 0.46/1.10 )
% 0.46/1.10 , 0, substitution( 0, [ :=( X, c1 ), :=( Y, X ), :=( Z, Y ), :=( T, bad )] )
% 0.46/1.10 , substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 subsumption(
% 0.46/1.10 clause( 60, [ 'program_not_halts2'( X, Y ) ] )
% 0.46/1.10 , clause( 119, [ 'program_not_halts2'( X, Y ) ] )
% 0.46/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.46/1.10 )] ) ).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 resolution(
% 0.46/1.10 clause( 120, [ program( X ) ] )
% 0.46/1.10 , clause( 15, [ program( X ), ~( 'program_not_halts2'( X, Y ) ) ] )
% 0.46/1.10 , 1, clause( 60, [ 'program_not_halts2'( X, Y ) ] )
% 0.46/1.10 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ :=( X
% 0.46/1.10 , X ), :=( Y, Y )] )).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 subsumption(
% 0.46/1.10 clause( 61, [ program( X ) ] )
% 0.46/1.10 , clause( 120, [ program( X ) ] )
% 0.46/1.10 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 resolution(
% 0.46/1.10 clause( 121, [ 'program_program_decides'( c4 ) ] )
% 0.46/1.10 , clause( 54, [ 'program_program_decides'( c4 ), ~( program( c4 ) ) ] )
% 0.46/1.10 , 1, clause( 61, [ program( X ) ] )
% 0.46/1.10 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, c4 )] )).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 subsumption(
% 0.46/1.10 clause( 63, [ 'program_program_decides'( c4 ) ] )
% 0.46/1.10 , clause( 121, [ 'program_program_decides'( c4 ) ] )
% 0.46/1.10 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 resolution(
% 0.46/1.10 clause( 122, [ 'program_halts2_halts3_outputs'( c4, X, Y, good ) ] )
% 0.46/1.10 , clause( 34, [ 'program_halts2_halts3_outputs'( X, Y, Z, good ), ~(
% 0.46/1.10 'program_program_decides'( X ) ) ] )
% 0.46/1.10 , 1, clause( 63, [ 'program_program_decides'( c4 ) ] )
% 0.46/1.10 , 0, substitution( 0, [ :=( X, c4 ), :=( Y, X ), :=( Z, Y )] ),
% 0.46/1.10 substitution( 1, [] )).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 subsumption(
% 0.46/1.10 clause( 66, [ 'program_halts2_halts3_outputs'( c4, X, Y, good ) ] )
% 0.46/1.10 , clause( 122, [ 'program_halts2_halts3_outputs'( c4, X, Y, good ) ] )
% 0.46/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.46/1.10 )] ) ).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 resolution(
% 0.46/1.10 clause( 123, [ 'program_halts2'( X, Y ) ] )
% 0.46/1.10 , clause( 21, [ 'program_halts2'( Y, Z ), ~(
% 0.46/1.10 'program_halts2_halts3_outputs'( X, Y, Z, T ) ) ] )
% 0.46/1.10 , 1, clause( 66, [ 'program_halts2_halts3_outputs'( c4, X, Y, good ) ] )
% 0.46/1.10 , 0, substitution( 0, [ :=( X, c4 ), :=( Y, X ), :=( Z, Y ), :=( T, good )] )
% 0.46/1.10 , substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 subsumption(
% 0.46/1.10 clause( 68, [ 'program_halts2'( X, Y ) ] )
% 0.46/1.10 , clause( 123, [ 'program_halts2'( X, Y ) ] )
% 0.46/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.46/1.10 )] ) ).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 resolution(
% 0.46/1.10 clause( 124, [ halts2( X, Y ) ] )
% 0.46/1.10 , clause( 10, [ halts2( X, Y ), ~( 'program_halts2'( X, Y ) ) ] )
% 0.46/1.10 , 1, clause( 68, [ 'program_halts2'( X, Y ) ] )
% 0.46/1.10 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ :=( X
% 0.46/1.10 , X ), :=( Y, Y )] )).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 subsumption(
% 0.46/1.10 clause( 69, [ halts2( X, Y ) ] )
% 0.46/1.10 , clause( 124, [ halts2( X, Y ) ] )
% 0.46/1.10 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.46/1.10 )] ) ).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 resolution(
% 0.46/1.10 clause( 125, [ ~( 'program_not_halts2'( X, Y ) ) ] )
% 0.46/1.10 , clause( 16, [ ~( 'program_not_halts2'( X, Y ) ), ~( halts2( X, Y ) ) ] )
% 0.46/1.10 , 1, clause( 69, [ halts2( X, Y ) ] )
% 0.46/1.10 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ :=( X
% 0.46/1.10 , X ), :=( Y, Y )] )).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 resolution(
% 0.46/1.10 clause( 126, [] )
% 0.46/1.10 , clause( 125, [ ~( 'program_not_halts2'( X, Y ) ) ] )
% 0.46/1.10 , 0, clause( 60, [ 'program_not_halts2'( X, Y ) ] )
% 0.46/1.10 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ :=( X
% 0.46/1.10 , X ), :=( Y, Y )] )).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 subsumption(
% 0.46/1.10 clause( 70, [] )
% 0.46/1.10 , clause( 126, [] )
% 0.46/1.10 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 end.
% 0.46/1.10
% 0.46/1.10 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.46/1.10
% 0.46/1.10 Memory use:
% 0.46/1.10
% 0.46/1.10 space for terms: 1768
% 0.46/1.10 space for clauses: 4041
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 clauses generated: 83
% 0.46/1.10 clauses kept: 71
% 0.46/1.10 clauses selected: 53
% 0.46/1.10 clauses deleted: 1
% 0.46/1.10 clauses inuse deleted: 0
% 0.46/1.10
% 0.46/1.10 subsentry: 14
% 0.46/1.10 literals s-matched: 14
% 0.46/1.10 literals matched: 14
% 0.46/1.10 full subsumption: 0
% 0.46/1.10
% 0.46/1.10 checksum: -561888026
% 0.46/1.10
% 0.46/1.10
% 0.46/1.10 Bliksem ended
%------------------------------------------------------------------------------