TSTP Solution File: LCL043-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL043-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n027.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:34 EDT 2022
% Result : Unsatisfiable 0.71s 1.08s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL043-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n027.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Tue Jul 5 00:11:56 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.71/1.08 *** allocated 10000 integers for termspace/termends
% 0.71/1.08 *** allocated 10000 integers for clauses
% 0.71/1.08 *** allocated 10000 integers for justifications
% 0.71/1.08 Bliksem 1.12
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 Automatic Strategy Selection
% 0.71/1.08
% 0.71/1.08 Clauses:
% 0.71/1.08 [
% 0.71/1.08 [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'( X ) ),
% 0.71/1.08 'is_a_theorem'( Y ) ],
% 0.71/1.08 [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ],
% 0.71/1.08 [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ],
% 0.71/1.08 [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ), implies( Y,
% 0.71/1.08 implies( X, Z ) ) ) ) ],
% 0.71/1.08 [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies( Z, X ),
% 0.71/1.08 implies( Z, Y ) ) ) ) ],
% 0.71/1.08 [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies( not( X ),
% 0.71/1.08 Y ), Y ) ) ) ],
% 0.71/1.08 [ ~( 'is_a_theorem'( implies( not( not( a ) ), a ) ) ) ]
% 0.71/1.08 ] .
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 percentage equality = 0.000000, percentage horn = 1.000000
% 0.71/1.08 This is a near-Horn, non-equality problem
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 Options Used:
% 0.71/1.08
% 0.71/1.08 useres = 1
% 0.71/1.08 useparamod = 0
% 0.71/1.08 useeqrefl = 0
% 0.71/1.08 useeqfact = 0
% 0.71/1.08 usefactor = 1
% 0.71/1.08 usesimpsplitting = 0
% 0.71/1.08 usesimpdemod = 0
% 0.71/1.08 usesimpres = 4
% 0.71/1.08
% 0.71/1.08 resimpinuse = 1000
% 0.71/1.08 resimpclauses = 20000
% 0.71/1.08 substype = standard
% 0.71/1.08 backwardsubs = 1
% 0.71/1.08 selectoldest = 5
% 0.71/1.08
% 0.71/1.08 litorderings [0] = split
% 0.71/1.08 litorderings [1] = liftord
% 0.71/1.08
% 0.71/1.08 termordering = none
% 0.71/1.08
% 0.71/1.08 litapriori = 1
% 0.71/1.08 termapriori = 0
% 0.71/1.08 litaposteriori = 0
% 0.71/1.08 termaposteriori = 0
% 0.71/1.08 demodaposteriori = 0
% 0.71/1.08 ordereqreflfact = 0
% 0.71/1.08
% 0.71/1.08 litselect = negative
% 0.71/1.08
% 0.71/1.08 maxweight = 30000
% 0.71/1.08 maxdepth = 30000
% 0.71/1.08 maxlength = 115
% 0.71/1.08 maxnrvars = 195
% 0.71/1.08 excuselevel = 0
% 0.71/1.08 increasemaxweight = 0
% 0.71/1.08
% 0.71/1.08 maxselected = 10000000
% 0.71/1.08 maxnrclauses = 10000000
% 0.71/1.08
% 0.71/1.08 showgenerated = 0
% 0.71/1.08 showkept = 0
% 0.71/1.08 showselected = 0
% 0.71/1.08 showdeleted = 0
% 0.71/1.08 showresimp = 1
% 0.71/1.08 showstatus = 2000
% 0.71/1.08
% 0.71/1.08 prologoutput = 1
% 0.71/1.08 nrgoals = 5000000
% 0.71/1.08 totalproof = 1
% 0.71/1.08
% 0.71/1.08 Symbols occurring in the translation:
% 0.71/1.08
% 0.71/1.08 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.71/1.08 . [1, 2] (w:1, o:20, a:1, s:1, b:0),
% 0.71/1.08 ! [4, 1] (w:1, o:13, a:1, s:1, b:0),
% 0.71/1.08 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.08 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.08 implies [41, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.71/1.08 'is_a_theorem' [42, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.71/1.08 not [43, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.71/1.08 a [45, 0] (w:1, o:12, a:1, s:1, b:0).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 Starting Search:
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 Bliksems!, er is een bewijs:
% 0.71/1.08 % SZS status Unsatisfiable
% 0.71/1.08 % SZS output start Refutation
% 0.71/1.08
% 0.71/1.08 clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y ),
% 0.71/1.08 ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.08 .
% 0.71/1.08 clause( 1, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ] )
% 0.71/1.08 .
% 0.71/1.08 clause( 2, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.08 .
% 0.71/1.08 clause( 5, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies(
% 0.71/1.08 not( X ), Y ), Y ) ) ) ] )
% 0.71/1.08 .
% 0.71/1.08 clause( 6, [ ~( 'is_a_theorem'( implies( not( not( a ) ), a ) ) ) ] )
% 0.71/1.08 .
% 0.71/1.08 clause( 7, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.08 implies( not( X ), Y ) ), Z ) ) ) ] )
% 0.71/1.08 .
% 0.71/1.08 clause( 8, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.08 implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.08 .
% 0.71/1.08 clause( 28, [ 'is_a_theorem'( implies( implies( not( X ), implies( Y, X ) )
% 0.71/1.08 , implies( Y, X ) ) ) ] )
% 0.71/1.08 .
% 0.71/1.08 clause( 64, [ 'is_a_theorem'( implies( not( not( X ) ), X ) ) ] )
% 0.71/1.08 .
% 0.71/1.08 clause( 71, [] )
% 0.71/1.08 .
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 % SZS output end Refutation
% 0.71/1.08 found a proof!
% 0.71/1.08
% 0.71/1.08 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.08
% 0.71/1.08 initialclauses(
% 0.71/1.08 [ clause( 73, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'(
% 0.71/1.08 X ) ), 'is_a_theorem'( Y ) ] )
% 0.71/1.08 , clause( 74, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ] )
% 0.71/1.08 , clause( 75, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.08 , clause( 76, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 0.71/1.08 implies( Y, implies( X, Z ) ) ) ) ] )
% 0.71/1.08 , clause( 77, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies(
% 0.71/1.08 Z, X ), implies( Z, Y ) ) ) ) ] )
% 0.71/1.08 , clause( 78, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies(
% 0.71/1.08 not( X ), Y ), Y ) ) ) ] )
% 0.71/1.08 , clause( 79, [ ~( 'is_a_theorem'( implies( not( not( a ) ), a ) ) ) ] )
% 0.71/1.08 ] ).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 subsumption(
% 0.71/1.08 clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y ),
% 0.71/1.08 ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.08 , clause( 73, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'(
% 0.71/1.08 X ) ), 'is_a_theorem'( Y ) ] )
% 0.71/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.08 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 subsumption(
% 0.71/1.08 clause( 1, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ] )
% 0.71/1.08 , clause( 74, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ] )
% 0.71/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.08 )] ) ).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 subsumption(
% 0.71/1.08 clause( 2, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.08 , clause( 75, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.08 )] ) ).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 subsumption(
% 0.71/1.08 clause( 5, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies(
% 0.71/1.08 not( X ), Y ), Y ) ) ) ] )
% 0.71/1.08 , clause( 78, [ 'is_a_theorem'( implies( implies( X, Y ), implies( implies(
% 0.71/1.08 not( X ), Y ), Y ) ) ) ] )
% 0.71/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.08 )] ) ).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 subsumption(
% 0.71/1.08 clause( 6, [ ~( 'is_a_theorem'( implies( not( not( a ) ), a ) ) ) ] )
% 0.71/1.08 , clause( 79, [ ~( 'is_a_theorem'( implies( not( not( a ) ), a ) ) ) ] )
% 0.71/1.08 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 resolution(
% 0.71/1.08 clause( 81, [ ~( 'is_a_theorem'( implies( implies( X, implies( not( X ), Y
% 0.71/1.08 ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.08 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.08 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.08 , 2, clause( 1, [ 'is_a_theorem'( implies( X, implies( not( X ), Y ) ) ) ]
% 0.71/1.08 )
% 0.71/1.08 , 0, substitution( 0, [ :=( X, implies( X, implies( not( X ), Y ) ) ), :=(
% 0.71/1.08 Y, Z )] ), substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 subsumption(
% 0.71/1.08 clause( 7, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.08 implies( not( X ), Y ) ), Z ) ) ) ] )
% 0.71/1.08 , clause( 81, [ ~( 'is_a_theorem'( implies( implies( X, implies( not( X ),
% 0.71/1.08 Y ) ), Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.08 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 resolution(
% 0.71/1.08 clause( 83, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y, X ) ), Z
% 0.71/1.08 ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.08 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.71/1.08 , ~( 'is_a_theorem'( X ) ) ] )
% 0.71/1.08 , 2, clause( 2, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.71/1.08 , 0, substitution( 0, [ :=( X, implies( X, implies( Y, X ) ) ), :=( Y, Z )] )
% 0.71/1.08 , substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 subsumption(
% 0.71/1.08 clause( 8, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X,
% 0.71/1.08 implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.08 , clause( 83, [ ~( 'is_a_theorem'( implies( implies( X, implies( Y, X ) ),
% 0.71/1.08 Z ) ) ), 'is_a_theorem'( Z ) ] )
% 0.71/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.71/1.08 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 resolution(
% 0.71/1.08 clause( 84, [ 'is_a_theorem'( implies( implies( not( X ), implies( Y, X ) )
% 0.71/1.08 , implies( Y, X ) ) ) ] )
% 0.71/1.08 , clause( 8, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X
% 0.71/1.08 , implies( Y, X ) ), Z ) ) ) ] )
% 0.71/1.08 , 1, clause( 5, [ 'is_a_theorem'( implies( implies( X, Y ), implies(
% 0.71/1.08 implies( not( X ), Y ), Y ) ) ) ] )
% 0.71/1.08 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, implies( implies(
% 0.71/1.08 not( X ), implies( Y, X ) ), implies( Y, X ) ) )] ), substitution( 1, [
% 0.71/1.08 :=( X, X ), :=( Y, implies( Y, X ) )] )).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 subsumption(
% 0.71/1.08 clause( 28, [ 'is_a_theorem'( implies( implies( not( X ), implies( Y, X ) )
% 0.71/1.08 , implies( Y, X ) ) ) ] )
% 0.71/1.08 , clause( 84, [ 'is_a_theorem'( implies( implies( not( X ), implies( Y, X )
% 0.71/1.08 ), implies( Y, X ) ) ) ] )
% 0.71/1.08 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.08 )] ) ).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 resolution(
% 0.71/1.08 clause( 85, [ 'is_a_theorem'( implies( not( not( X ) ), X ) ) ] )
% 0.71/1.08 , clause( 7, [ 'is_a_theorem'( Z ), ~( 'is_a_theorem'( implies( implies( X
% 0.71/1.08 , implies( not( X ), Y ) ), Z ) ) ) ] )
% 0.71/1.08 , 1, clause( 28, [ 'is_a_theorem'( implies( implies( not( X ), implies( Y,
% 0.71/1.08 X ) ), implies( Y, X ) ) ) ] )
% 0.71/1.08 , 0, substitution( 0, [ :=( X, not( X ) ), :=( Y, X ), :=( Z, implies( not(
% 0.71/1.08 not( X ) ), X ) )] ), substitution( 1, [ :=( X, X ), :=( Y, not( not( X )
% 0.71/1.08 ) )] )).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 subsumption(
% 0.71/1.08 clause( 64, [ 'is_a_theorem'( implies( not( not( X ) ), X ) ) ] )
% 0.71/1.08 , clause( 85, [ 'is_a_theorem'( implies( not( not( X ) ), X ) ) ] )
% 0.71/1.08 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 resolution(
% 0.71/1.08 clause( 86, [] )
% 0.71/1.08 , clause( 6, [ ~( 'is_a_theorem'( implies( not( not( a ) ), a ) ) ) ] )
% 0.71/1.08 , 0, clause( 64, [ 'is_a_theorem'( implies( not( not( X ) ), X ) ) ] )
% 0.71/1.08 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a )] )).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 subsumption(
% 0.71/1.08 clause( 71, [] )
% 0.71/1.08 , clause( 86, [] )
% 0.71/1.08 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 end.
% 0.71/1.08
% 0.71/1.08 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.08
% 0.71/1.08 Memory use:
% 0.71/1.08
% 0.71/1.08 space for terms: 983
% 0.71/1.08 space for clauses: 5628
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 clauses generated: 126
% 0.71/1.08 clauses kept: 72
% 0.71/1.08 clauses selected: 32
% 0.71/1.08 clauses deleted: 0
% 0.71/1.08 clauses inuse deleted: 0
% 0.71/1.08
% 0.71/1.08 subsentry: 86
% 0.71/1.08 literals s-matched: 54
% 0.71/1.08 literals matched: 54
% 0.71/1.08 full subsumption: 0
% 0.71/1.08
% 0.71/1.08 checksum: -1227344769
% 0.71/1.08
% 0.71/1.08
% 0.71/1.08 Bliksem ended
%------------------------------------------------------------------------------