TSTP Solution File: LCL356-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL356-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n007.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:58 EDT 2022
% Result : Unsatisfiable 0.69s 1.12s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.12 % Problem : LCL356-1 : TPTP v8.1.0. Released v2.3.0.
% 0.13/0.12 % Command : bliksem %s
% 0.13/0.33 % Computer : n007.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % DateTime : Mon Jul 4 00:48:11 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.69/1.12 *** allocated 10000 integers for termspace/termends
% 0.69/1.12 *** allocated 10000 integers for clauses
% 0.69/1.12 *** allocated 10000 integers for justifications
% 0.69/1.12 Bliksem 1.12
% 0.69/1.12
% 0.69/1.12
% 0.69/1.12 Automatic Strategy Selection
% 0.69/1.12
% 0.69/1.12 Clauses:
% 0.69/1.12 [
% 0.69/1.12 [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'( X ) ),
% 0.69/1.12 'is_a_theorem'( Y ) ],
% 0.69/1.12 [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies( Y, Z ),
% 0.69/1.12 implies( X, Z ) ) ) ) ],
% 0.69/1.12 [ 'is_a_theorem'( implies( implies( not( X ), X ), X ) ) ],
% 0.69/1.12 [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ],
% 0.69/1.12 [ ~( 'is_a_theorem'( implies( implies( x, implies( y, z ) ), implies(
% 0.69/1.12 implies( u, y ), implies( x, implies( u, z ) ) ) ) ) ) ]
% 0.69/1.12 ] .
% 0.69/1.12
% 0.69/1.12
% 0.69/1.12 percentage equality = 0.000000, percentage horn = 1.000000
% 0.69/1.12 This is a near-Horn, non-equality problem
% 0.69/1.12
% 0.69/1.12
% 0.69/1.12 Options Used:
% 0.69/1.12
% 0.69/1.12 useres = 1
% 0.69/1.12 useparamod = 0
% 0.69/1.12 useeqrefl = 0
% 0.69/1.12 useeqfact = 0
% 0.69/1.12 usefactor = 1
% 0.69/1.12 usesimpsplitting = 0
% 0.69/1.12 usesimpdemod = 0
% 0.69/1.12 usesimpres = 4
% 0.69/1.12
% 0.69/1.12 resimpinuse = 1000
% 0.69/1.12 resimpclauses = 20000
% 0.69/1.12 substype = standard
% 0.69/1.12 backwardsubs = 1
% 0.69/1.12 selectoldest = 5
% 0.69/1.12
% 0.69/1.12 litorderings [0] = split
% 0.69/1.12 litorderings [1] = liftord
% 0.69/1.12
% 0.69/1.12 termordering = none
% 0.69/1.12
% 0.69/1.12 litapriori = 1
% 0.69/1.12 termapriori = 0
% 0.69/1.12 litaposteriori = 0
% 0.69/1.12 termaposteriori = 0
% 0.69/1.12 demodaposteriori = 0
% 0.69/1.12 ordereqreflfact = 0
% 0.69/1.12
% 0.69/1.12 litselect = negative
% 0.69/1.12
% 0.69/1.12 maxweight = 30000
% 0.69/1.12 maxdepth = 30000
% 0.69/1.12 maxlength = 115
% 0.69/1.12 maxnrvars = 195
% 0.69/1.12 excuselevel = 0
% 0.69/1.12 increasemaxweight = 0
% 0.69/1.12
% 0.69/1.12 maxselected = 10000000
% 0.69/1.12 maxnrclauses = 10000000
% 0.69/1.12
% 0.69/1.12 showgenerated = 0
% 0.69/1.12 showkept = 0
% 0.69/1.12 showselected = 0
% 0.69/1.12 showdeleted = 0
% 0.69/1.12 showresimp = 1
% 0.69/1.12 showstatus = 2000
% 0.69/1.12
% 0.69/1.12 prologoutput = 1
% 0.69/1.12 nrgoals = 5000000
% 0.69/1.12 totalproof = 1
% 0.69/1.12
% 0.69/1.12 Symbols occurring in the translation:
% 0.69/1.12
% 0.69/1.12 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.69/1.12 . [1, 2] (w:1, o:23, a:1, s:1, b:0),
% 0.69/1.12 ! [4, 1] (w:1, o:16, a:1, s:1, b:0),
% 0.69/1.12 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.12 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.12 implies [41, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.69/1.12 'is_a_theorem' [42, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.69/1.12 not [44, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.69/1.12 x [45, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.69/1.12 y [46, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.69/1.12 z [47, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.69/1.12 u [48, 0] (w:1, o:15, a:1, s:1, b:0).
% 0.69/1.12
% 0.69/1.12
% 0.69/1.12 Starting Search:
% 0.69/1.12
% 0.69/1.12 Resimplifying inuse:
% 0.69/1.12 Done
% 0.69/1.12
% 0.69/1.12
% 0.69/1.12 Bliksems!, er is een bewijs:
% 0.69/1.12 % SZS status Unsatisfiable
% 0.69/1.12 % SZS output start Refutation
% 0.69/1.12
% 0.69/1.12 clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y ),
% 0.69/1.12 ~( 'is_a_theorem'( X ) ) ] )
% 0.69/1.12 .
% 0.69/1.12 clause( 1, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies( Y
% 0.69/1.12 , Z ), implies( X, Z ) ) ) ) ] )
% 0.69/1.12 .
% 0.69/1.12 clause( 4, [ ~( 'is_a_theorem'( implies( implies( x, implies( y, z ) ),
% 0.69/1.12 implies( implies( u, y ), implies( x, implies( u, z ) ) ) ) ) ) ] )
% 0.69/1.12 .
% 0.69/1.12 clause( 7, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.69/1.12 implies( X, Y ), implies( implies( Y, Z ), implies( X, Z ) ) ), T ) ) ) ]
% 0.69/1.12 )
% 0.69/1.12 .
% 0.69/1.12 clause( 21, [ 'is_a_theorem'( implies( implies( implies( implies( X, Y ),
% 0.69/1.12 implies( Z, Y ) ), T ), implies( implies( Z, X ), T ) ) ) ] )
% 0.69/1.12 .
% 0.69/1.12 clause( 97, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( implies( implies(
% 0.69/1.12 implies( implies( implies( X, Y ), implies( Z, Y ) ), T ), implies(
% 0.69/1.12 implies( Z, X ), T ) ), U ) ) ) ] )
% 0.69/1.12 .
% 0.69/1.12 clause( 1335, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 0.69/1.12 implies( implies( T, Y ), implies( X, implies( T, Z ) ) ) ) ) ] )
% 0.69/1.12 .
% 0.69/1.12 clause( 1619, [] )
% 0.69/1.12 .
% 0.69/1.12
% 0.69/1.12
% 0.69/1.12 % SZS output end Refutation
% 0.69/1.12 found a proof!
% 0.69/1.12
% 0.69/1.12 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.69/1.12
% 0.69/1.12 initialclauses(
% 0.69/1.12 [ clause( 1621, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'(
% 0.69/1.12 X ) ), 'is_a_theorem'( Y ) ] )
% 0.69/1.12 , clause( 1622, [ 'is_a_theorem'( implies( implies( X, Y ), implies(
% 0.69/1.12 implies( Y, Z ), implies( X, Z ) ) ) ) ] )
% 0.69/1.12 , clause( 1623, [ 'is_a_theorem'( implies( implies( not( X ), X ), X ) ) ]
% 0.69/1.12 )
% 0.69/1.12 , clause( 1624, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ]
% 0.69/1.12 )
% 0.69/1.12 , clause( 1625, [ ~( 'is_a_theorem'( implies( implies( x, implies( y, z ) )
% 0.69/1.12 , implies( implies( u, y ), implies( x, implies( u, z ) ) ) ) ) ) ] )
% 0.69/1.12 ] ).
% 0.69/1.12
% 0.69/1.12
% 0.69/1.12
% 0.69/1.12 subsumption(
% 0.69/1.12 clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y ),
% 0.69/1.12 ~( 'is_a_theorem'( X ) ) ] )
% 0.69/1.12 , clause( 1621, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'(
% 0.69/1.12 X ) ), 'is_a_theorem'( Y ) ] )
% 0.69/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.69/1.12 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.69/1.12
% 0.69/1.12
% 0.69/1.12 subsumption(
% 0.69/1.12 clause( 1, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies( Y
% 0.69/1.12 , Z ), implies( X, Z ) ) ) ) ] )
% 0.69/1.12 , clause( 1622, [ 'is_a_theorem'( implies( implies( X, Y ), implies(
% 0.69/1.12 implies( Y, Z ), implies( X, Z ) ) ) ) ] )
% 0.69/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.69/1.12 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.12
% 0.69/1.12
% 0.69/1.12 subsumption(
% 0.69/1.12 clause( 4, [ ~( 'is_a_theorem'( implies( implies( x, implies( y, z ) ),
% 0.69/1.12 implies( implies( u, y ), implies( x, implies( u, z ) ) ) ) ) ) ] )
% 0.69/1.12 , clause( 1625, [ ~( 'is_a_theorem'( implies( implies( x, implies( y, z ) )
% 0.69/1.12 , implies( implies( u, y ), implies( x, implies( u, z ) ) ) ) ) ) ] )
% 0.69/1.12 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.12
% 0.69/1.12
% 0.69/1.12 resolution(
% 0.69/1.12 clause( 1627, [ ~( 'is_a_theorem'( implies( implies( implies( X, Y ),
% 0.69/1.12 implies( implies( Y, Z ), implies( X, Z ) ) ), T ) ) ), 'is_a_theorem'( T
% 0.69/1.12 ) ] )
% 0.69/1.12 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.69/1.12 , ~( 'is_a_theorem'( X ) ) ] )
% 0.69/1.12 , 2, clause( 1, [ 'is_a_theorem'( implies( implies( X, Y ), implies(
% 0.69/1.12 implies( Y, Z ), implies( X, Z ) ) ) ) ] )
% 0.69/1.12 , 0, substitution( 0, [ :=( X, implies( implies( X, Y ), implies( implies(
% 0.69/1.12 Y, Z ), implies( X, Z ) ) ) ), :=( Y, T )] ), substitution( 1, [ :=( X, X
% 0.69/1.12 ), :=( Y, Y ), :=( Z, Z )] )).
% 0.69/1.12
% 0.69/1.12
% 0.69/1.12 subsumption(
% 0.69/1.12 clause( 7, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.69/1.12 implies( X, Y ), implies( implies( Y, Z ), implies( X, Z ) ) ), T ) ) ) ]
% 0.69/1.12 )
% 0.69/1.12 , clause( 1627, [ ~( 'is_a_theorem'( implies( implies( implies( X, Y ),
% 0.69/1.12 implies( implies( Y, Z ), implies( X, Z ) ) ), T ) ) ), 'is_a_theorem'( T
% 0.69/1.12 ) ] )
% 0.69/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.69/1.12 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.69/1.12
% 0.69/1.12
% 0.69/1.12 resolution(
% 0.69/1.12 clause( 1628, [ 'is_a_theorem'( implies( implies( implies( implies( X, Y )
% 0.69/1.12 , implies( Z, Y ) ), T ), implies( implies( Z, X ), T ) ) ) ] )
% 0.69/1.12 , clause( 7, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( implies( implies(
% 0.69/1.12 implies( X, Y ), implies( implies( Y, Z ), implies( X, Z ) ) ), T ) ) ) ]
% 0.69/1.12 )
% 0.69/1.12 , 1, clause( 1, [ 'is_a_theorem'( implies( implies( X, Y ), implies(
% 0.69/1.12 implies( Y, Z ), implies( X, Z ) ) ) ) ] )
% 0.69/1.12 , 0, substitution( 0, [ :=( X, Z ), :=( Y, X ), :=( Z, Y ), :=( T, implies(
% 0.69/1.12 implies( implies( implies( X, Y ), implies( Z, Y ) ), T ), implies(
% 0.69/1.12 implies( Z, X ), T ) ) )] ), substitution( 1, [ :=( X, implies( Z, X ) )
% 0.69/1.12 , :=( Y, implies( implies( X, Y ), implies( Z, Y ) ) ), :=( Z, T )] )
% 0.69/1.12 ).
% 0.69/1.12
% 0.69/1.12
% 0.69/1.12 subsumption(
% 0.69/1.12 clause( 21, [ 'is_a_theorem'( implies( implies( implies( implies( X, Y ),
% 0.69/1.12 implies( Z, Y ) ), T ), implies( implies( Z, X ), T ) ) ) ] )
% 0.69/1.12 , clause( 1628, [ 'is_a_theorem'( implies( implies( implies( implies( X, Y
% 0.69/1.12 ), implies( Z, Y ) ), T ), implies( implies( Z, X ), T ) ) ) ] )
% 0.69/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.69/1.12 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.12
% 0.69/1.12
% 0.69/1.12 resolution(
% 0.69/1.12 clause( 1630, [ ~( 'is_a_theorem'( implies( implies( implies( implies(
% 0.69/1.12 implies( X, Y ), implies( Z, Y ) ), T ), implies( implies( Z, X ), T ) )
% 0.69/1.12 , U ) ) ), 'is_a_theorem'( U ) ] )
% 0.69/1.12 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.69/1.12 , ~( 'is_a_theorem'( X ) ) ] )
% 0.69/1.12 , 2, clause( 21, [ 'is_a_theorem'( implies( implies( implies( implies( X, Y
% 0.69/1.12 ), implies( Z, Y ) ), T ), implies( implies( Z, X ), T ) ) ) ] )
% 0.69/1.12 , 0, substitution( 0, [ :=( X, implies( implies( implies( implies( X, Y ),
% 0.69/1.12 implies( Z, Y ) ), T ), implies( implies( Z, X ), T ) ) ), :=( Y, U )] )
% 0.69/1.12 , substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] )
% 0.69/1.12 ).
% 0.69/1.12
% 0.69/1.12
% 0.69/1.12 subsumption(
% 0.69/1.12 clause( 97, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( implies( implies(
% 0.69/1.12 implies( implies( implies( X, Y ), implies( Z, Y ) ), T ), implies(
% 0.69/1.12 implies( Z, X ), T ) ), U ) ) ) ] )
% 0.69/1.12 , clause( 1630, [ ~( 'is_a_theorem'( implies( implies( implies( implies(
% 0.69/1.12 implies( X, Y ), implies( Z, Y ) ), T ), implies( implies( Z, X ), T ) )
% 0.69/1.12 , U ) ) ), 'is_a_theorem'( U ) ] )
% 0.69/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.69/1.12 , U )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.69/1.12
% 0.69/1.12
% 0.69/1.12 resolution(
% 0.69/1.12 clause( 1631, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 0.69/1.12 implies( implies( T, Y ), implies( X, implies( T, Z ) ) ) ) ) ] )
% 0.69/1.12 , clause( 97, [ 'is_a_theorem'( U ), ~( 'is_a_theorem'( implies( implies(
% 0.69/1.12 implies( implies( implies( X, Y ), implies( Z, Y ) ), T ), implies(
% 0.69/1.12 implies( Z, X ), T ) ), U ) ) ) ] )
% 0.69/1.12 , 1, clause( 21, [ 'is_a_theorem'( implies( implies( implies( implies( X, Y
% 0.69/1.12 ), implies( Z, Y ) ), T ), implies( implies( Z, X ), T ) ) ) ] )
% 0.69/1.12 , 0, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, T ), :=( T, implies(
% 0.69/1.12 X, implies( T, Z ) ) ), :=( U, implies( implies( X, implies( Y, Z ) ),
% 0.69/1.12 implies( implies( T, Y ), implies( X, implies( T, Z ) ) ) ) )] ),
% 0.69/1.12 substitution( 1, [ :=( X, implies( Y, Z ) ), :=( Y, implies( T, Z ) ),
% 0.69/1.12 :=( Z, X ), :=( T, implies( implies( T, Y ), implies( X, implies( T, Z )
% 0.69/1.12 ) ) )] )).
% 0.69/1.12
% 0.69/1.12
% 0.69/1.12 subsumption(
% 0.69/1.12 clause( 1335, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 0.69/1.12 implies( implies( T, Y ), implies( X, implies( T, Z ) ) ) ) ) ] )
% 0.69/1.12 , clause( 1631, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 0.69/1.12 implies( implies( T, Y ), implies( X, implies( T, Z ) ) ) ) ) ] )
% 0.69/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.69/1.12 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.12
% 0.69/1.12
% 0.69/1.12 resolution(
% 0.69/1.12 clause( 1632, [] )
% 0.69/1.12 , clause( 4, [ ~( 'is_a_theorem'( implies( implies( x, implies( y, z ) ),
% 0.69/1.12 implies( implies( u, y ), implies( x, implies( u, z ) ) ) ) ) ) ] )
% 0.69/1.12 , 0, clause( 1335, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) )
% 0.69/1.12 , implies( implies( T, Y ), implies( X, implies( T, Z ) ) ) ) ) ] )
% 0.69/1.12 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, x ), :=( Y, y ), :=(
% 0.69/1.12 Z, z ), :=( T, u )] )).
% 0.69/1.12
% 0.69/1.12
% 0.69/1.12 subsumption(
% 0.69/1.12 clause( 1619, [] )
% 0.69/1.12 , clause( 1632, [] )
% 0.69/1.12 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.69/1.12
% 0.69/1.12
% 0.69/1.12 end.
% 0.69/1.12
% 0.69/1.12 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.69/1.12
% 0.69/1.12 Memory use:
% 0.69/1.12
% 0.69/1.12 space for terms: 31573
% 0.69/1.12 space for clauses: 180478
% 0.69/1.12
% 0.69/1.12
% 0.69/1.12 clauses generated: 7047
% 0.69/1.12 clauses kept: 1620
% 0.69/1.12 clauses selected: 337
% 0.69/1.12 clauses deleted: 36
% 0.69/1.12 clauses inuse deleted: 16
% 0.69/1.12
% 0.69/1.12 subsentry: 5840
% 0.69/1.12 literals s-matched: 5463
% 0.69/1.12 literals matched: 5463
% 0.69/1.12 full subsumption: 0
% 0.69/1.12
% 0.69/1.12 checksum: -842613672
% 0.69/1.12
% 0.69/1.12
% 0.69/1.12 Bliksem ended
%------------------------------------------------------------------------------