TSTP Solution File: LCL076-2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL076-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n029.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:58 EDT 2022
% Result : Unsatisfiable 0.73s 1.11s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : LCL076-2 : TPTP v8.1.0. Released v1.0.0.
% 0.13/0.14 % Command : bliksem %s
% 0.14/0.36 % Computer : n029.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % DateTime : Mon Jul 4 06:41:26 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.73/1.11 *** allocated 10000 integers for termspace/termends
% 0.73/1.11 *** allocated 10000 integers for clauses
% 0.73/1.11 *** allocated 10000 integers for justifications
% 0.73/1.11 Bliksem 1.12
% 0.73/1.11
% 0.73/1.11
% 0.73/1.11 Automatic Strategy Selection
% 0.73/1.11
% 0.73/1.11 Clauses:
% 0.73/1.11 [
% 0.73/1.11 [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'( X ) ),
% 0.73/1.11 'is_a_theorem'( Y ) ],
% 0.73/1.11 [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ],
% 0.73/1.11 [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ), implies(
% 0.73/1.11 implies( X, Y ), implies( X, Z ) ) ) ) ],
% 0.73/1.11 [ 'is_a_theorem'( implies( implies( not( X ), not( Y ) ), implies( Y, X
% 0.73/1.11 ) ) ) ],
% 0.73/1.11 [ 'is_a_theorem'( implies( not( not( X ) ), X ) ) ],
% 0.73/1.11 [ ~( 'is_a_theorem'( implies( a, not( not( a ) ) ) ) ) ]
% 0.73/1.11 ] .
% 0.73/1.11
% 0.73/1.11
% 0.73/1.11 percentage equality = 0.000000, percentage horn = 1.000000
% 0.73/1.11 This is a near-Horn, non-equality problem
% 0.73/1.11
% 0.73/1.11
% 0.73/1.11 Options Used:
% 0.73/1.11
% 0.73/1.11 useres = 1
% 0.73/1.11 useparamod = 0
% 0.73/1.11 useeqrefl = 0
% 0.73/1.11 useeqfact = 0
% 0.73/1.11 usefactor = 1
% 0.73/1.11 usesimpsplitting = 0
% 0.73/1.11 usesimpdemod = 0
% 0.73/1.11 usesimpres = 4
% 0.73/1.11
% 0.73/1.11 resimpinuse = 1000
% 0.73/1.11 resimpclauses = 20000
% 0.73/1.11 substype = standard
% 0.73/1.11 backwardsubs = 1
% 0.73/1.11 selectoldest = 5
% 0.73/1.11
% 0.73/1.11 litorderings [0] = split
% 0.73/1.11 litorderings [1] = liftord
% 0.73/1.11
% 0.73/1.11 termordering = none
% 0.73/1.11
% 0.73/1.11 litapriori = 1
% 0.73/1.11 termapriori = 0
% 0.73/1.11 litaposteriori = 0
% 0.73/1.11 termaposteriori = 0
% 0.73/1.11 demodaposteriori = 0
% 0.73/1.11 ordereqreflfact = 0
% 0.73/1.11
% 0.73/1.11 litselect = negative
% 0.73/1.11
% 0.73/1.11 maxweight = 30000
% 0.73/1.11 maxdepth = 30000
% 0.73/1.11 maxlength = 115
% 0.73/1.11 maxnrvars = 195
% 0.73/1.11 excuselevel = 0
% 0.73/1.11 increasemaxweight = 0
% 0.73/1.11
% 0.73/1.11 maxselected = 10000000
% 0.73/1.11 maxnrclauses = 10000000
% 0.73/1.11
% 0.73/1.11 showgenerated = 0
% 0.73/1.11 showkept = 0
% 0.73/1.11 showselected = 0
% 0.73/1.11 showdeleted = 0
% 0.73/1.11 showresimp = 1
% 0.73/1.11 showstatus = 2000
% 0.73/1.11
% 0.73/1.11 prologoutput = 1
% 0.73/1.11 nrgoals = 5000000
% 0.73/1.11 totalproof = 1
% 0.73/1.11
% 0.73/1.11 Symbols occurring in the translation:
% 0.73/1.11
% 0.73/1.11 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.73/1.11 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.73/1.11 ! [4, 1] (w:1, o:14, a:1, s:1, b:0),
% 0.73/1.11 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.73/1.11 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.73/1.11 implies [41, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.73/1.11 'is_a_theorem' [42, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.73/1.11 not [44, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.73/1.11 a [46, 0] (w:1, o:13, a:1, s:1, b:0).
% 0.73/1.11
% 0.73/1.11
% 0.73/1.11 Starting Search:
% 0.73/1.11
% 0.73/1.11
% 0.73/1.11 Bliksems!, er is een bewijs:
% 0.73/1.11 % SZS status Unsatisfiable
% 0.73/1.11 % SZS output start Refutation
% 0.73/1.11
% 0.73/1.11 clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y ),
% 0.73/1.11 ~( 'is_a_theorem'( X ) ) ] )
% 0.73/1.11 .
% 0.73/1.11 clause( 3, [ 'is_a_theorem'( implies( implies( not( X ), not( Y ) ),
% 0.73/1.11 implies( Y, X ) ) ) ] )
% 0.73/1.11 .
% 0.73/1.11 clause( 4, [ 'is_a_theorem'( implies( not( not( X ) ), X ) ) ] )
% 0.73/1.11 .
% 0.73/1.11 clause( 5, [ ~( 'is_a_theorem'( implies( a, not( not( a ) ) ) ) ) ] )
% 0.73/1.11 .
% 0.73/1.11 clause( 6, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies( not(
% 0.73/1.11 not( X ) ), X ), Y ) ) ) ] )
% 0.73/1.11 .
% 0.73/1.11 clause( 17, [ 'is_a_theorem'( implies( X, not( not( X ) ) ) ) ] )
% 0.73/1.11 .
% 0.73/1.11 clause( 22, [] )
% 0.73/1.11 .
% 0.73/1.11
% 0.73/1.11
% 0.73/1.11 % SZS output end Refutation
% 0.73/1.11 found a proof!
% 0.73/1.11
% 0.73/1.11 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.73/1.11
% 0.73/1.11 initialclauses(
% 0.73/1.11 [ clause( 24, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'(
% 0.73/1.11 X ) ), 'is_a_theorem'( Y ) ] )
% 0.73/1.11 , clause( 25, [ 'is_a_theorem'( implies( X, implies( Y, X ) ) ) ] )
% 0.73/1.11 , clause( 26, [ 'is_a_theorem'( implies( implies( X, implies( Y, Z ) ),
% 0.73/1.11 implies( implies( X, Y ), implies( X, Z ) ) ) ) ] )
% 0.73/1.11 , clause( 27, [ 'is_a_theorem'( implies( implies( not( X ), not( Y ) ),
% 0.73/1.11 implies( Y, X ) ) ) ] )
% 0.73/1.11 , clause( 28, [ 'is_a_theorem'( implies( not( not( X ) ), X ) ) ] )
% 0.73/1.11 , clause( 29, [ ~( 'is_a_theorem'( implies( a, not( not( a ) ) ) ) ) ] )
% 0.73/1.11 ] ).
% 0.73/1.11
% 0.73/1.11
% 0.73/1.11
% 0.73/1.11 subsumption(
% 0.73/1.11 clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y ),
% 0.73/1.11 ~( 'is_a_theorem'( X ) ) ] )
% 0.73/1.11 , clause( 24, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), ~( 'is_a_theorem'(
% 0.73/1.11 X ) ), 'is_a_theorem'( Y ) ] )
% 0.73/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.11 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.73/1.11
% 0.73/1.11
% 0.73/1.11 subsumption(
% 0.73/1.11 clause( 3, [ 'is_a_theorem'( implies( implies( not( X ), not( Y ) ),
% 0.73/1.11 implies( Y, X ) ) ) ] )
% 0.73/1.11 , clause( 27, [ 'is_a_theorem'( implies( implies( not( X ), not( Y ) ),
% 0.73/1.11 implies( Y, X ) ) ) ] )
% 0.73/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.73/1.11 )] ) ).
% 0.73/1.11
% 0.73/1.11
% 0.73/1.11 subsumption(
% 0.73/1.11 clause( 4, [ 'is_a_theorem'( implies( not( not( X ) ), X ) ) ] )
% 0.73/1.11 , clause( 28, [ 'is_a_theorem'( implies( not( not( X ) ), X ) ) ] )
% 0.73/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.11
% 0.73/1.11
% 0.73/1.11 subsumption(
% 0.73/1.11 clause( 5, [ ~( 'is_a_theorem'( implies( a, not( not( a ) ) ) ) ) ] )
% 0.73/1.11 , clause( 29, [ ~( 'is_a_theorem'( implies( a, not( not( a ) ) ) ) ) ] )
% 0.73/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.11
% 0.73/1.11
% 0.73/1.11 resolution(
% 0.73/1.11 clause( 31, [ ~( 'is_a_theorem'( implies( implies( not( not( X ) ), X ), Y
% 0.73/1.11 ) ) ), 'is_a_theorem'( Y ) ] )
% 0.73/1.11 , clause( 0, [ ~( 'is_a_theorem'( implies( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.73/1.11 , ~( 'is_a_theorem'( X ) ) ] )
% 0.73/1.11 , 2, clause( 4, [ 'is_a_theorem'( implies( not( not( X ) ), X ) ) ] )
% 0.73/1.11 , 0, substitution( 0, [ :=( X, implies( not( not( X ) ), X ) ), :=( Y, Y )] )
% 0.73/1.11 , substitution( 1, [ :=( X, X )] )).
% 0.73/1.11
% 0.73/1.11
% 0.73/1.11 subsumption(
% 0.73/1.11 clause( 6, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies( not(
% 0.73/1.11 not( X ) ), X ), Y ) ) ) ] )
% 0.73/1.11 , clause( 31, [ ~( 'is_a_theorem'( implies( implies( not( not( X ) ), X ),
% 0.73/1.11 Y ) ) ), 'is_a_theorem'( Y ) ] )
% 0.73/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 0.73/1.11 ), ==>( 1, 0 )] ) ).
% 0.73/1.11
% 0.73/1.11
% 0.73/1.11 resolution(
% 0.73/1.11 clause( 32, [ 'is_a_theorem'( implies( X, not( not( X ) ) ) ) ] )
% 0.73/1.11 , clause( 6, [ 'is_a_theorem'( Y ), ~( 'is_a_theorem'( implies( implies(
% 0.73/1.11 not( not( X ) ), X ), Y ) ) ) ] )
% 0.73/1.11 , 1, clause( 3, [ 'is_a_theorem'( implies( implies( not( X ), not( Y ) ),
% 0.73/1.11 implies( Y, X ) ) ) ] )
% 0.73/1.11 , 0, substitution( 0, [ :=( X, not( X ) ), :=( Y, implies( X, not( not( X )
% 0.73/1.11 ) ) )] ), substitution( 1, [ :=( X, not( not( X ) ) ), :=( Y, X )] )
% 0.73/1.11 ).
% 0.73/1.11
% 0.73/1.11
% 0.73/1.11 subsumption(
% 0.73/1.11 clause( 17, [ 'is_a_theorem'( implies( X, not( not( X ) ) ) ) ] )
% 0.73/1.11 , clause( 32, [ 'is_a_theorem'( implies( X, not( not( X ) ) ) ) ] )
% 0.73/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.73/1.11
% 0.73/1.11
% 0.73/1.11 resolution(
% 0.73/1.11 clause( 33, [] )
% 0.73/1.11 , clause( 5, [ ~( 'is_a_theorem'( implies( a, not( not( a ) ) ) ) ) ] )
% 0.73/1.11 , 0, clause( 17, [ 'is_a_theorem'( implies( X, not( not( X ) ) ) ) ] )
% 0.73/1.11 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a )] )).
% 0.73/1.11
% 0.73/1.11
% 0.73/1.11 subsumption(
% 0.73/1.11 clause( 22, [] )
% 0.73/1.11 , clause( 33, [] )
% 0.73/1.11 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.73/1.11
% 0.73/1.11
% 0.73/1.11 end.
% 0.73/1.11
% 0.73/1.11 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.73/1.11
% 0.73/1.11 Memory use:
% 0.73/1.11
% 0.73/1.11 space for terms: 362
% 0.73/1.11 space for clauses: 1820
% 0.73/1.11
% 0.73/1.11
% 0.73/1.11 clauses generated: 28
% 0.73/1.11 clauses kept: 23
% 0.73/1.11 clauses selected: 12
% 0.73/1.11 clauses deleted: 0
% 0.73/1.11 clauses inuse deleted: 0
% 0.73/1.11
% 0.73/1.11 subsentry: 16
% 0.73/1.11 literals s-matched: 5
% 0.73/1.11 literals matched: 5
% 0.73/1.11 full subsumption: 0
% 0.73/1.11
% 0.73/1.11 checksum: -1271036545
% 0.73/1.11
% 0.73/1.11
% 0.73/1.11 Bliksem ended
%------------------------------------------------------------------------------