TSTP Solution File: LCL046-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL046-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n028.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:49:35 EDT 2022
% Result : Unsatisfiable 0.44s 1.08s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL046-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.33 % Computer : n028.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 14:22:19 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/1.07 *** allocated 10000 integers for termspace/termends
% 0.44/1.07 *** allocated 10000 integers for clauses
% 0.44/1.07 *** allocated 10000 integers for justifications
% 0.44/1.07 Bliksem 1.12
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 Automatic Strategy Selection
% 0.44/1.07
% 0.44/1.07 Clauses:
% 0.44/1.07 [
% 0.44/1.07 [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'( X ) ),
% 0.44/1.07 'is_a_theorem'( Y ) ],
% 0.44/1.07 [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies( Y, Z ),
% 0.44/1.07 implies( X, Z ) ) ) ) ],
% 0.44/1.07 [ 'is_a_theorem'( implies( implies( not( X ), X ), X ) ) ],
% 0.44/1.07 [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ],
% 0.44/1.07 [ ~( 'is_a_theorem'( implies( a, a ) ) ) ]
% 0.44/1.07 ] .
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 percentage equality = 0.000000, percentage horn = 1.000000
% 0.44/1.07 This is a near-Horn, non-equality problem
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 Options Used:
% 0.44/1.07
% 0.44/1.07 useres = 1
% 0.44/1.07 useparamod = 0
% 0.44/1.07 useeqrefl = 0
% 0.44/1.07 useeqfact = 0
% 0.44/1.07 usefactor = 1
% 0.44/1.07 usesimpsplitting = 0
% 0.44/1.07 usesimpdemod = 0
% 0.44/1.07 usesimpres = 4
% 0.44/1.07
% 0.44/1.07 resimpinuse = 1000
% 0.44/1.07 resimpclauses = 20000
% 0.44/1.07 substype = standard
% 0.44/1.07 backwardsubs = 1
% 0.44/1.07 selectoldest = 5
% 0.44/1.07
% 0.44/1.07 litorderings [0] = split
% 0.44/1.07 litorderings [1] = liftord
% 0.44/1.07
% 0.44/1.07 termordering = none
% 0.44/1.07
% 0.44/1.07 litapriori = 1
% 0.44/1.07 termapriori = 0
% 0.44/1.07 litaposteriori = 0
% 0.44/1.07 termaposteriori = 0
% 0.44/1.07 demodaposteriori = 0
% 0.44/1.07 ordereqreflfact = 0
% 0.44/1.07
% 0.44/1.07 litselect = negative
% 0.44/1.07
% 0.44/1.07 maxweight = 30000
% 0.44/1.07 maxdepth = 30000
% 0.44/1.07 maxlength = 115
% 0.44/1.07 maxnrvars = 195
% 0.44/1.07 excuselevel = 0
% 0.44/1.07 increasemaxweight = 0
% 0.44/1.07
% 0.44/1.07 maxselected = 10000000
% 0.44/1.07 maxnrclauses = 10000000
% 0.44/1.07
% 0.44/1.07 showgenerated = 0
% 0.44/1.07 showkept = 0
% 0.44/1.07 showselected = 0
% 0.44/1.07 showdeleted = 0
% 0.44/1.07 showresimp = 1
% 0.44/1.07 showstatus = 2000
% 0.44/1.07
% 0.44/1.07 prologoutput = 1
% 0.44/1.07 nrgoals = 5000000
% 0.44/1.07 totalproof = 1
% 0.44/1.07
% 0.44/1.07 Symbols occurring in the translation:
% 0.44/1.07
% 0.44/1.07 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.44/1.07 . [1, 2] (w:1, o:20, a:1, s:1, b:0),
% 0.44/1.07 ! [4, 1] (w:1, o:13, a:1, s:1, b:0),
% 0.44/1.07 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.44/1.07 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.44/1.07 implies [41, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.44/1.07 'is_a_theorem' [42, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.44/1.07 not [44, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.44/1.08 a [45, 0] (w:1, o:12, a:1, s:1, b:0).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 Starting Search:
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 Bliksems!, er is een bewijs:
% 0.44/1.08 % SZS status Unsatisfiable
% 0.44/1.08 % SZS output start Refutation
% 0.44/1.08
% 0.44/1.08 clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y ),
% 0.44/1.08 ~( 'is_a_theorem'( X ) ) ] )
% 0.44/1.08 .
% 0.44/1.08 clause( 1, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies( Y
% 0.44/1.08 , Z ), implies( X, Z ) ) ) ) ] )
% 0.44/1.08 .
% 0.44/1.08 clause( 2, [ 'is_a_theorem'( implies( implies( not( X ), X ), X ) ) ] )
% 0.44/1.08 .
% 0.44/1.08 clause( 3, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ] )
% 0.44/1.08 .
% 0.44/1.08 clause( 4, [ ~( 'is_a_theorem'( implies( a, a ) ) ) ] )
% 0.44/1.08 .
% 0.44/1.08 clause( 5, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies(
% 0.44/1.08 implies( not( X ), X ), X ), Y ) ) ) ] )
% 0.44/1.08 .
% 0.44/1.08 clause( 6, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X,
% 0.44/1.08 implies( not( X ), Y ) ), Z ) ) ) ] )
% 0.44/1.08 .
% 0.44/1.08 clause( 14, [ 'is_a_theorem'( implies( implies( implies( not( X ), Y ), Z )
% 0.44/1.08 , implies( X, Z ) ) ) ] )
% 0.44/1.08 .
% 0.44/1.08 clause( 23, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.44/1.08 .
% 0.44/1.08 clause( 26, [] )
% 0.44/1.08 .
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 % SZS output end Refutation
% 0.44/1.08 found a proof!
% 0.44/1.08
% 0.44/1.08 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.44/1.08
% 0.44/1.08 initialclauses(
% 0.44/1.08 [ clause( 28, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'(
% 0.44/1.08 X ) ), 'is_a_theorem'( Y ) ] )
% 0.44/1.08 , clause( 29, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies(
% 0.44/1.08 Y, Z ), implies( X, Z ) ) ) ) ] )
% 0.44/1.08 , clause( 30, [ 'is_a_theorem'( implies( implies( not( X ), X ), X ) ) ] )
% 0.44/1.08 , clause( 31, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ] )
% 0.44/1.08 , clause( 32, [ ~( 'is_a_theorem'( implies( a, a ) ) ) ] )
% 0.44/1.08 ] ).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 subsumption(
% 0.44/1.08 clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y ),
% 0.44/1.08 ~( 'is_a_theorem'( X ) ) ] )
% 0.44/1.08 , clause( 28, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'(
% 0.44/1.08 X ) ), 'is_a_theorem'( Y ) ] )
% 0.44/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.44/1.08 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 subsumption(
% 0.44/1.08 clause( 1, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies( Y
% 0.44/1.08 , Z ), implies( X, Z ) ) ) ) ] )
% 0.44/1.08 , clause( 29, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies(
% 0.44/1.08 Y, Z ), implies( X, Z ) ) ) ) ] )
% 0.44/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.44/1.08 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 subsumption(
% 0.44/1.08 clause( 2, [ 'is_a_theorem'( implies( implies( not( X ), X ), X ) ) ] )
% 0.44/1.08 , clause( 30, [ 'is_a_theorem'( implies( implies( not( X ), X ), X ) ) ] )
% 0.44/1.08 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 subsumption(
% 0.44/1.08 clause( 3, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ] )
% 0.44/1.08 , clause( 31, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ] )
% 0.44/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.44/1.08 )] ) ).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 subsumption(
% 0.44/1.08 clause( 4, [ ~( 'is_a_theorem'( implies( a, a ) ) ) ] )
% 0.44/1.08 , clause( 32, [ ~( 'is_a_theorem'( implies( a, a ) ) ) ] )
% 0.44/1.08 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 resolution(
% 0.44/1.08 clause( 34, [ ~( 'is_a_theorem'( implies( implies( implies( not( X ), X ),
% 0.44/1.08 X ), Y ) ) ), 'is_a_theorem'( Y ) ] )
% 0.44/1.08 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.44/1.08 , ~( 'is_a_theorem'( X ) ) ] )
% 0.44/1.08 , 2, clause( 2, [ 'is_a_theorem'( implies( implies( not( X ), X ), X ) ) ]
% 0.44/1.08 )
% 0.44/1.08 , 0, substitution( 0, [ :=( X, implies( implies( not( X ), X ), X ) ), :=(
% 0.44/1.08 Y, Y )] ), substitution( 1, [ :=( X, X )] )).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 subsumption(
% 0.44/1.08 clause( 5, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies(
% 0.44/1.08 implies( not( X ), X ), X ), Y ) ) ) ] )
% 0.44/1.08 , clause( 34, [ ~( 'is_a_theorem'( implies( implies( implies( not( X ), X )
% 0.44/1.08 , X ), Y ) ) ), 'is_a_theorem'( Y ) ] )
% 0.44/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.44/1.08 ), ==>( 1, 0 )] ) ).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 resolution(
% 0.44/1.08 clause( 36, [ ~( 'is_a_theorem'( implies( implies( X, implies( not( X ), Y
% 0.44/1.08 ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.44/1.08 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.44/1.08 , ~( 'is_a_theorem'( X ) ) ] )
% 0.44/1.08 , 2, clause( 3, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ]
% 0.44/1.08 )
% 0.44/1.08 , 0, substitution( 0, [ :=( X, implies( X, implies( not( X ), Y ) ) ), :=(
% 0.44/1.08 Y, Z )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 subsumption(
% 0.44/1.08 clause( 6, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X,
% 0.44/1.08 implies( not( X ), Y ) ), Z ) ) ) ] )
% 0.44/1.08 , clause( 36, [ ~( 'is_a_theorem'( implies( implies( X, implies( not( X ),
% 0.44/1.08 Y ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.44/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.44/1.08 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 resolution(
% 0.44/1.08 clause( 37, [ 'is_a_theorem'( implies( implies( implies( not( X ), Y ), Z )
% 0.44/1.08 , implies( X, Z ) ) ) ] )
% 0.44/1.08 , clause( 6, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X
% 0.44/1.08 , implies( not( X ), Y ) ), Z ) ) ) ] )
% 0.44/1.08 , 1, clause( 1, [ 'is_a_theorem'( implies( implies( X, Y ), implies(
% 0.44/1.08 implies( Y, Z ), implies( X, Z ) ) ) ) ] )
% 0.44/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, implies( implies(
% 0.44/1.08 implies( not( X ), Y ), Z ), implies( X, Z ) ) )] ), substitution( 1, [
% 0.44/1.08 :=( X, X ), :=( Y, implies( not( X ), Y ) ), :=( Z, Z )] )).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 subsumption(
% 0.44/1.08 clause( 14, [ 'is_a_theorem'( implies( implies( implies( not( X ), Y ), Z )
% 0.44/1.08 , implies( X, Z ) ) ) ] )
% 0.44/1.08 , clause( 37, [ 'is_a_theorem'( implies( implies( implies( not( X ), Y ), Z
% 0.44/1.08 ), implies( X, Z ) ) ) ] )
% 0.44/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.44/1.08 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 resolution(
% 0.44/1.08 clause( 38, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.44/1.08 , clause( 5, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies(
% 0.44/1.08 implies( not( X ), X ), X ), Y ) ) ) ] )
% 0.44/1.08 , 1, clause( 14, [ 'is_a_theorem'( implies( implies( implies( not( X ), Y )
% 0.44/1.08 , Z ), implies( X, Z ) ) ) ] )
% 0.44/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, implies( X, X ) )] ),
% 0.44/1.08 substitution( 1, [ :=( X, X ), :=( Y, X ), :=( Z, X )] )).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 subsumption(
% 0.44/1.08 clause( 23, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.44/1.08 , clause( 38, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.44/1.08 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 resolution(
% 0.44/1.08 clause( 39, [] )
% 0.44/1.08 , clause( 4, [ ~( 'is_a_theorem'( implies( a, a ) ) ) ] )
% 0.44/1.08 , 0, clause( 23, [ 'is_a_theorem'( implies( X, X ) ) ] )
% 0.44/1.08 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a )] )).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 subsumption(
% 0.44/1.08 clause( 26, [] )
% 0.44/1.08 , clause( 39, [] )
% 0.44/1.08 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 end.
% 0.44/1.08
% 0.44/1.08 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.44/1.08
% 0.44/1.08 Memory use:
% 0.44/1.08
% 0.44/1.08 space for terms: 419
% 0.44/1.08 space for clauses: 2403
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 clauses generated: 30
% 0.44/1.08 clauses kept: 27
% 0.44/1.08 clauses selected: 14
% 0.44/1.08 clauses deleted: 0
% 0.44/1.08 clauses inuse deleted: 0
% 0.44/1.08
% 0.44/1.08 subsentry: 17
% 0.44/1.08 literals s-matched: 3
% 0.44/1.08 literals matched: 3
% 0.44/1.08 full subsumption: 0
% 0.44/1.08
% 0.44/1.08 checksum: -724248350
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 Bliksem ended
%------------------------------------------------------------------------------