TSTP Solution File: LCL357-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL357-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n009.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 : Sun Jul 17 07:52:59 EDT 2022
% Result : Unsatisfiable 0.73s 1.09s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL357-1 : TPTP v8.1.0. Released v2.3.0.
% 0.13/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n009.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 : Sun Jul 3 04:41:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.73/1.09 *** allocated 10000 integers for termspace/termends
% 0.73/1.09 *** allocated 10000 integers for clauses
% 0.73/1.09 *** allocated 10000 integers for justifications
% 0.73/1.09 Bliksem 1.12
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 Automatic Strategy Selection
% 0.73/1.09
% 0.73/1.09 Clauses:
% 0.73/1.09 [
% 0.73/1.09 [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'( X ) ),
% 0.73/1.09 'is_a_theorem'( Y ) ],
% 0.73/1.09 [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies( Y, Z ),
% 0.73/1.09 implies( X, Z ) ) ) ) ],
% 0.73/1.09 [ 'is_a_theorem'( implies( implies( not( X ), X ), X ) ) ],
% 0.73/1.09 [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ],
% 0.73/1.09 [ ~( 'is_a_theorem'( implies( implies( x, y ), implies( implies( implies(
% 0.73/1.09 x, z ), u ), implies( implies( y, z ), u ) ) ) ) ) ]
% 0.73/1.09 ] .
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 percentage equality = 0.000000, percentage horn = 1.000000
% 0.73/1.09 This is a near-Horn, non-equality problem
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 Options Used:
% 0.73/1.09
% 0.73/1.09 useres = 1
% 0.73/1.09 useparamod = 0
% 0.73/1.09 useeqrefl = 0
% 0.73/1.09 useeqfact = 0
% 0.73/1.09 usefactor = 1
% 0.73/1.09 usesimpsplitting = 0
% 0.73/1.09 usesimpdemod = 0
% 0.73/1.09 usesimpres = 4
% 0.73/1.09
% 0.73/1.09 resimpinuse = 1000
% 0.73/1.09 resimpclauses = 20000
% 0.73/1.09 substype = standard
% 0.73/1.09 backwardsubs = 1
% 0.73/1.09 selectoldest = 5
% 0.73/1.09
% 0.73/1.09 litorderings [0] = split
% 0.73/1.09 litorderings [1] = liftord
% 0.73/1.09
% 0.73/1.09 termordering = none
% 0.73/1.09
% 0.73/1.09 litapriori = 1
% 0.73/1.09 termapriori = 0
% 0.73/1.09 litaposteriori = 0
% 0.73/1.09 termaposteriori = 0
% 0.73/1.09 demodaposteriori = 0
% 0.73/1.09 ordereqreflfact = 0
% 0.73/1.09
% 0.73/1.09 litselect = negative
% 0.73/1.09
% 0.73/1.09 maxweight = 30000
% 0.73/1.09 maxdepth = 30000
% 0.73/1.09 maxlength = 115
% 0.73/1.09 maxnrvars = 195
% 0.73/1.09 excuselevel = 0
% 0.73/1.09 increasemaxweight = 0
% 0.73/1.09
% 0.73/1.09 maxselected = 10000000
% 0.73/1.09 maxnrclauses = 10000000
% 0.73/1.09
% 0.73/1.09 showgenerated = 0
% 0.73/1.09 showkept = 0
% 0.73/1.09 showselected = 0
% 0.73/1.09 showdeleted = 0
% 0.73/1.09 showresimp = 1
% 0.73/1.09 showstatus = 2000
% 0.73/1.09
% 0.73/1.09 prologoutput = 1
% 0.73/1.09 nrgoals = 5000000
% 0.73/1.09 totalproof = 1
% 0.73/1.09
% 0.73/1.09 Symbols occurring in the translation:
% 0.73/1.09
% 0.73/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.73/1.09 . [1, 2] (w:1, o:23, a:1, s:1, b:0),
% 0.73/1.09 ! [4, 1] (w:1, o:16, a:1, s:1, b:0),
% 0.73/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.73/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.73/1.09 implies [41, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.73/1.09 'is_a_theorem' [42, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.73/1.09 not [44, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.73/1.09 x [45, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.73/1.09 y [46, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.73/1.09 z [47, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.73/1.09 u [48, 0] (w:1, o:15, a:1, s:1, b:0).
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 Starting Search:
% 0.73/1.09
% 0.73/1.09 Resimplifying inuse:
% 0.73/1.09
% 0.73/1.09 Bliksems!, er is een bewijs:
% 0.73/1.09 % SZS status Unsatisfiable
% 0.73/1.09 % SZS output start Refutation
% 0.73/1.09
% 0.73/1.09 clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y ),
% 0.73/1.09 ~( 'is_a_theorem'( X ) ) ] )
% 0.73/1.09 .
% 0.73/1.09 clause( 1, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies( Y
% 0.73/1.09 , Z ), implies( X, Z ) ) ) ) ] )
% 0.73/1.09 .
% 0.73/1.09 clause( 4, [ ~( 'is_a_theorem'( implies( implies( x, y ), implies( implies(
% 0.73/1.09 implies( x, z ), u ), implies( implies( y, z ), u ) ) ) ) ) ] )
% 0.73/1.09 .
% 0.73/1.09 clause( 7, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.73/1.09 implies( X, Y ), implies( implies( Y, Z ), implies( X, Z ) ) ), T ) ) ) ]
% 0.73/1.09 )
% 0.73/1.09 .
% 0.73/1.09 clause( 21, [ 'is_a_theorem'( implies( implies( implies( implies( X, Y ),
% 0.73/1.09 implies( Z, Y ) ), T ), implies( implies( Z, X ), T ) ) ) ] )
% 0.73/1.09 .
% 0.73/1.09 clause( 95, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies(
% 0.73/1.09 implies( X, Z ), T ), implies( implies( Y, Z ), T ) ) ) ) ] )
% 0.73/1.09 .
% 0.73/1.09 clause( 1006, [] )
% 0.73/1.09 .
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 % SZS output end Refutation
% 0.73/1.09 found a proof!
% 0.73/1.09
% 0.73/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.73/1.09
% 0.73/1.09 initialclauses(
% 0.73/1.09 [ clause( 1008, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'(
% 0.73/1.09 X ) ), 'is_a_theorem'( Y ) ] )
% 0.73/1.09 , clause( 1009, [ 'is_a_theorem'( implies( implies( X, Y ), implies(
% 0.73/1.09 implies( Y, Z ), implies( X, Z ) ) ) ) ] )
% 0.73/1.09 , clause( 1010, [ 'is_a_theorem'( implies( implies( not( X ), X ), X ) ) ]
% 0.73/1.09 )
% 0.73/1.09 , clause( 1011, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ]
% 0.73/1.09 )
% 0.73/1.09 , clause( 1012, [ ~( 'is_a_theorem'( implies( implies( x, y ), implies(
% 0.73/1.09 implies( implies( x, z ), u ), implies( implies( y, z ), u ) ) ) ) ) ] )
% 0.73/1.09 ] ).
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 subsumption(
% 0.73/1.09 clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y ),
% 0.73/1.09 ~( 'is_a_theorem'( X ) ) ] )
% 0.73/1.09 , clause( 1008, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'(
% 0.73/1.09 X ) ), 'is_a_theorem'( Y ) ] )
% 0.73/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.09 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 subsumption(
% 0.73/1.09 clause( 1, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies( Y
% 0.73/1.09 , Z ), implies( X, Z ) ) ) ) ] )
% 0.73/1.09 , clause( 1009, [ 'is_a_theorem'( implies( implies( X, Y ), implies(
% 0.73/1.09 implies( Y, Z ), implies( X, Z ) ) ) ) ] )
% 0.73/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.73/1.09 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 subsumption(
% 0.73/1.09 clause( 4, [ ~( 'is_a_theorem'( implies( implies( x, y ), implies( implies(
% 0.73/1.09 implies( x, z ), u ), implies( implies( y, z ), u ) ) ) ) ) ] )
% 0.73/1.09 , clause( 1012, [ ~( 'is_a_theorem'( implies( implies( x, y ), implies(
% 0.73/1.09 implies( implies( x, z ), u ), implies( implies( y, z ), u ) ) ) ) ) ] )
% 0.73/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 resolution(
% 0.73/1.09 clause( 1014, [ ~( 'is_a_theorem'( implies( implies( implies( X, Y ),
% 0.73/1.09 implies( implies( Y, Z ), implies( X, Z ) ) ), T ) ) ), 'is_a_theorem'( T
% 0.73/1.09 ) ] )
% 0.73/1.09 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.73/1.09 , ~( 'is_a_theorem'( X ) ) ] )
% 0.73/1.09 , 2, clause( 1, [ 'is_a_theorem'( implies( implies( X, Y ), implies(
% 0.73/1.09 implies( Y, Z ), implies( X, Z ) ) ) ) ] )
% 0.73/1.09 , 0, substitution( 0, [ :=( X, implies( implies( X, Y ), implies( implies(
% 0.73/1.09 Y, Z ), implies( X, Z ) ) ) ), :=( Y, T )] ), substitution( 1, [ :=( X, X
% 0.73/1.09 ), :=( Y, Y ), :=( Z, Z )] )).
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 subsumption(
% 0.73/1.09 clause( 7, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.73/1.09 implies( X, Y ), implies( implies( Y, Z ), implies( X, Z ) ) ), T ) ) ) ]
% 0.73/1.09 )
% 0.73/1.09 , clause( 1014, [ ~( 'is_a_theorem'( implies( implies( implies( X, Y ),
% 0.73/1.09 implies( implies( Y, Z ), implies( X, Z ) ) ), T ) ) ), 'is_a_theorem'( T
% 0.73/1.09 ) ] )
% 0.73/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.73/1.09 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 resolution(
% 0.73/1.09 clause( 1015, [ 'is_a_theorem'( implies( implies( implies( implies( X, Y )
% 0.73/1.09 , implies( Z, Y ) ), T ), implies( implies( Z, X ), T ) ) ) ] )
% 0.73/1.09 , clause( 7, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.73/1.09 implies( X, Y ), implies( implies( Y, Z ), implies( X, Z ) ) ), T ) ) ) ]
% 0.73/1.09 )
% 0.73/1.09 , 1, clause( 1, [ 'is_a_theorem'( implies( implies( X, Y ), implies(
% 0.73/1.09 implies( Y, Z ), implies( X, Z ) ) ) ) ] )
% 0.73/1.09 , 0, substitution( 0, [ :=( X, Z ), :=( Y, X ), :=( Z, Y ), :=( T, implies(
% 0.73/1.09 implies( implies( implies( X, Y ), implies( Z, Y ) ), T ), implies(
% 0.73/1.09 implies( Z, X ), T ) ) )] ), substitution( 1, [ :=( X, implies( Z, X ) )
% 0.73/1.09 , :=( Y, implies( implies( X, Y ), implies( Z, Y ) ) ), :=( Z, T )] )
% 0.73/1.09 ).
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 subsumption(
% 0.73/1.09 clause( 21, [ 'is_a_theorem'( implies( implies( implies( implies( X, Y ),
% 0.73/1.09 implies( Z, Y ) ), T ), implies( implies( Z, X ), T ) ) ) ] )
% 0.73/1.09 , clause( 1015, [ 'is_a_theorem'( implies( implies( implies( implies( X, Y
% 0.73/1.09 ), implies( Z, Y ) ), T ), implies( implies( Z, X ), T ) ) ) ] )
% 0.73/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.73/1.09 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 resolution(
% 0.73/1.09 clause( 1016, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies(
% 0.73/1.09 implies( X, Z ), T ), implies( implies( Y, Z ), T ) ) ) ) ] )
% 0.73/1.09 , clause( 7, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.73/1.09 implies( X, Y ), implies( implies( Y, Z ), implies( X, Z ) ) ), T ) ) ) ]
% 0.73/1.09 )
% 0.73/1.09 , 1, clause( 21, [ 'is_a_theorem'( implies( implies( implies( implies( X, Y
% 0.73/1.09 ), implies( Z, Y ) ), T ), implies( implies( Z, X ), T ) ) ) ] )
% 0.73/1.09 , 0, substitution( 0, [ :=( X, implies( Y, Z ) ), :=( Y, implies( X, Z ) )
% 0.73/1.09 , :=( Z, T ), :=( T, implies( implies( X, Y ), implies( implies( implies(
% 0.73/1.09 X, Z ), T ), implies( implies( Y, Z ), T ) ) ) )] ), substitution( 1, [
% 0.73/1.09 :=( X, Y ), :=( Y, Z ), :=( Z, X ), :=( T, implies( implies( implies( X,
% 0.73/1.09 Z ), T ), implies( implies( Y, Z ), T ) ) )] )).
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 subsumption(
% 0.73/1.09 clause( 95, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies(
% 0.73/1.09 implies( X, Z ), T ), implies( implies( Y, Z ), T ) ) ) ) ] )
% 0.73/1.09 , clause( 1016, [ 'is_a_theorem'( implies( implies( X, Y ), implies(
% 0.73/1.09 implies( implies( X, Z ), T ), implies( implies( Y, Z ), T ) ) ) ) ] )
% 0.73/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.73/1.09 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 resolution(
% 0.73/1.09 clause( 1017, [] )
% 0.73/1.09 , clause( 4, [ ~( 'is_a_theorem'( implies( implies( x, y ), implies(
% 0.73/1.09 implies( implies( x, z ), u ), implies( implies( y, z ), u ) ) ) ) ) ] )
% 0.73/1.09 , 0, clause( 95, [ 'is_a_theorem'( implies( implies( X, Y ), implies(
% 0.73/1.09 implies( implies( X, Z ), T ), implies( implies( Y, Z ), T ) ) ) ) ] )
% 0.73/1.09 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, x ), :=( Y, y ), :=(
% 0.73/1.09 Z, z ), :=( T, u )] )).
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 subsumption(
% 0.73/1.09 clause( 1006, [] )
% 0.73/1.09 , clause( 1017, [] )
% 0.73/1.09 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 end.
% 0.73/1.09
% 0.73/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.73/1.09
% 0.73/1.09 Memory use:
% 0.73/1.09
% 0.73/1.09 space for terms: 18286
% 0.73/1.09 space for clauses: 104268
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 clauses generated: 4325
% 0.73/1.09 clauses kept: 1007
% 0.73/1.09 clauses selected: 229
% 0.73/1.09 clauses deleted: 23
% 0.73/1.09 clauses inuse deleted: 17
% 0.73/1.09
% 0.73/1.09 subsentry: 3605
% 0.73/1.09 literals s-matched: 3340
% 0.73/1.09 literals matched: 3340
% 0.73/1.09 full subsumption: 0
% 0.73/1.09
% 0.73/1.09 checksum: -550270155
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 Bliksem ended
%------------------------------------------------------------------------------