TSTP Solution File: LCL013-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL013-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n026.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:09 EDT 2022
% Result : Unsatisfiable 0.69s 1.09s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL013-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n026.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.35 % CPULimit : 300
% 0.13/0.35 % DateTime : Sun Jul 3 21:21:51 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.69/1.09 *** allocated 10000 integers for termspace/termends
% 0.69/1.09 *** allocated 10000 integers for clauses
% 0.69/1.09 *** allocated 10000 integers for justifications
% 0.69/1.09 Bliksem 1.12
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Automatic Strategy Selection
% 0.69/1.09
% 0.69/1.09 Clauses:
% 0.69/1.09 [
% 0.69/1.09 [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~( 'is_a_theorem'( X ) ),
% 0.69/1.09 'is_a_theorem'( Y ) ],
% 0.69/1.09 [ 'is_a_theorem'( equivalent( X, equivalent( equivalent( Y, equivalent(
% 0.69/1.09 X, Z ) ), equivalent( Z, Y ) ) ) ) ],
% 0.69/1.09 [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a, b ), c ),
% 0.69/1.09 equivalent( b, equivalent( c, a ) ) ) ) ) ]
% 0.69/1.09 ] .
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 percentage equality = 0.000000, percentage horn = 1.000000
% 0.69/1.09 This is a near-Horn, non-equality problem
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Options Used:
% 0.69/1.09
% 0.69/1.09 useres = 1
% 0.69/1.09 useparamod = 0
% 0.69/1.09 useeqrefl = 0
% 0.69/1.09 useeqfact = 0
% 0.69/1.09 usefactor = 1
% 0.69/1.09 usesimpsplitting = 0
% 0.69/1.09 usesimpdemod = 0
% 0.69/1.09 usesimpres = 4
% 0.69/1.09
% 0.69/1.09 resimpinuse = 1000
% 0.69/1.09 resimpclauses = 20000
% 0.69/1.09 substype = standard
% 0.69/1.09 backwardsubs = 1
% 0.69/1.09 selectoldest = 5
% 0.69/1.09
% 0.69/1.09 litorderings [0] = split
% 0.69/1.09 litorderings [1] = liftord
% 0.69/1.09
% 0.69/1.09 termordering = none
% 0.69/1.09
% 0.69/1.09 litapriori = 1
% 0.69/1.09 termapriori = 0
% 0.69/1.09 litaposteriori = 0
% 0.69/1.09 termaposteriori = 0
% 0.69/1.09 demodaposteriori = 0
% 0.69/1.09 ordereqreflfact = 0
% 0.69/1.09
% 0.69/1.09 litselect = negative
% 0.69/1.09
% 0.69/1.09 maxweight = 30000
% 0.69/1.09 maxdepth = 30000
% 0.69/1.09 maxlength = 115
% 0.69/1.09 maxnrvars = 195
% 0.69/1.09 excuselevel = 0
% 0.69/1.09 increasemaxweight = 0
% 0.69/1.09
% 0.69/1.09 maxselected = 10000000
% 0.69/1.09 maxnrclauses = 10000000
% 0.69/1.09
% 0.69/1.09 showgenerated = 0
% 0.69/1.09 showkept = 0
% 0.69/1.09 showselected = 0
% 0.69/1.09 showdeleted = 0
% 0.69/1.09 showresimp = 1
% 0.69/1.09 showstatus = 2000
% 0.69/1.09
% 0.69/1.09 prologoutput = 1
% 0.69/1.09 nrgoals = 5000000
% 0.69/1.09 totalproof = 1
% 0.69/1.09
% 0.69/1.09 Symbols occurring in the translation:
% 0.69/1.09
% 0.69/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.69/1.09 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.69/1.09 ! [4, 1] (w:1, o:15, a:1, s:1, b:0),
% 0.69/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.09 equivalent [41, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.69/1.09 'is_a_theorem' [42, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.69/1.09 a [44, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.69/1.09 b [45, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.69/1.09 c [46, 0] (w:1, o:14, a:1, s:1, b:0).
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Starting Search:
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Bliksems!, er is een bewijs:
% 0.69/1.09 % SZS status Unsatisfiable
% 0.69/1.09 % SZS output start Refutation
% 0.69/1.09
% 0.69/1.09 clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.69/1.09 , ~( 'is_a_theorem'( X ) ) ] )
% 0.69/1.09 .
% 0.69/1.09 clause( 1, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent( Y,
% 0.69/1.09 equivalent( X, Z ) ), equivalent( Z, Y ) ) ) ) ] )
% 0.69/1.09 .
% 0.69/1.09 clause( 2, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a, b )
% 0.69/1.09 , c ), equivalent( b, equivalent( c, a ) ) ) ) ) ] )
% 0.69/1.09 .
% 0.69/1.09 clause( 3, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.69/1.09 X, equivalent( equivalent( Y, equivalent( X, Z ) ), equivalent( Z, Y ) )
% 0.69/1.09 ), T ) ) ) ] )
% 0.69/1.09 .
% 0.69/1.09 clause( 4, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.69/1.09 equivalent( Y, equivalent( equivalent( Z, equivalent( Y, T ) ),
% 0.69/1.09 equivalent( T, Z ) ) ), U ) ), equivalent( U, X ) ) ) ] )
% 0.69/1.09 .
% 0.69/1.09 clause( 5, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ), Z
% 0.69/1.09 ), equivalent( Y, equivalent( Z, X ) ) ) ) ] )
% 0.69/1.09 .
% 0.69/1.09 clause( 8, [] )
% 0.69/1.09 .
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 % SZS output end Refutation
% 0.69/1.09 found a proof!
% 0.69/1.09
% 0.69/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.69/1.09
% 0.69/1.09 initialclauses(
% 0.69/1.09 [ clause( 10, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~(
% 0.69/1.09 'is_a_theorem'( X ) ), 'is_a_theorem'( Y ) ] )
% 0.69/1.09 , clause( 11, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent( Y,
% 0.69/1.09 equivalent( X, Z ) ), equivalent( Z, Y ) ) ) ) ] )
% 0.69/1.09 , clause( 12, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a, b
% 0.69/1.09 ), c ), equivalent( b, equivalent( c, a ) ) ) ) ) ] )
% 0.69/1.09 ] ).
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 subsumption(
% 0.69/1.09 clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y )
% 0.69/1.09 , ~( 'is_a_theorem'( X ) ) ] )
% 0.69/1.09 , clause( 10, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), ~(
% 0.69/1.09 'is_a_theorem'( X ) ), 'is_a_theorem'( Y ) ] )
% 0.69/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.69/1.09 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 subsumption(
% 0.69/1.09 clause( 1, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent( Y,
% 0.69/1.09 equivalent( X, Z ) ), equivalent( Z, Y ) ) ) ) ] )
% 0.69/1.09 , clause( 11, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent( Y,
% 0.69/1.09 equivalent( X, Z ) ), equivalent( Z, Y ) ) ) ) ] )
% 0.69/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.69/1.09 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 subsumption(
% 0.69/1.09 clause( 2, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a, b )
% 0.69/1.09 , c ), equivalent( b, equivalent( c, a ) ) ) ) ) ] )
% 0.69/1.09 , clause( 12, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a, b
% 0.69/1.09 ), c ), equivalent( b, equivalent( c, a ) ) ) ) ) ] )
% 0.69/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 resolution(
% 0.69/1.09 clause( 14, [ ~( 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.69/1.09 equivalent( Y, equivalent( X, Z ) ), equivalent( Z, Y ) ) ), T ) ) ),
% 0.69/1.09 'is_a_theorem'( T ) ] )
% 0.69/1.09 , clause( 0, [ ~( 'is_a_theorem'( equivalent( X, Y ) ) ), 'is_a_theorem'( Y
% 0.69/1.09 ), ~( 'is_a_theorem'( X ) ) ] )
% 0.69/1.09 , 2, clause( 1, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent( Y
% 0.69/1.09 , equivalent( X, Z ) ), equivalent( Z, Y ) ) ) ) ] )
% 0.69/1.09 , 0, substitution( 0, [ :=( X, equivalent( X, equivalent( equivalent( Y,
% 0.69/1.09 equivalent( X, Z ) ), equivalent( Z, Y ) ) ) ), :=( Y, T )] ),
% 0.69/1.09 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 subsumption(
% 0.69/1.09 clause( 3, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent( equivalent(
% 0.69/1.09 X, equivalent( equivalent( Y, equivalent( X, Z ) ), equivalent( Z, Y ) )
% 0.69/1.09 ), T ) ) ) ] )
% 0.69/1.09 , clause( 14, [ ~( 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.69/1.09 equivalent( Y, equivalent( X, Z ) ), equivalent( Z, Y ) ) ), T ) ) ),
% 0.69/1.09 'is_a_theorem'( T ) ] )
% 0.69/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T )] ),
% 0.69/1.09 permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] ) ).
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 resolution(
% 0.69/1.09 clause( 15, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.69/1.09 equivalent( Y, equivalent( equivalent( Z, equivalent( Y, T ) ),
% 0.69/1.09 equivalent( T, Z ) ) ), U ) ), equivalent( U, X ) ) ) ] )
% 0.69/1.09 , clause( 3, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.69/1.09 equivalent( X, equivalent( equivalent( Y, equivalent( X, Z ) ),
% 0.69/1.09 equivalent( Z, Y ) ) ), T ) ) ) ] )
% 0.69/1.09 , 1, clause( 1, [ 'is_a_theorem'( equivalent( X, equivalent( equivalent( Y
% 0.69/1.09 , equivalent( X, Z ) ), equivalent( Z, Y ) ) ) ) ] )
% 0.69/1.09 , 0, substitution( 0, [ :=( X, Y ), :=( Y, Z ), :=( Z, T ), :=( T,
% 0.69/1.09 equivalent( equivalent( X, equivalent( equivalent( Y, equivalent(
% 0.69/1.09 equivalent( Z, equivalent( Y, T ) ), equivalent( T, Z ) ) ), U ) ),
% 0.69/1.09 equivalent( U, X ) ) )] ), substitution( 1, [ :=( X, equivalent( Y,
% 0.69/1.09 equivalent( equivalent( Z, equivalent( Y, T ) ), equivalent( T, Z ) ) ) )
% 0.69/1.09 , :=( Y, X ), :=( Z, U )] )).
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 subsumption(
% 0.69/1.09 clause( 4, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.69/1.09 equivalent( Y, equivalent( equivalent( Z, equivalent( Y, T ) ),
% 0.69/1.09 equivalent( T, Z ) ) ), U ) ), equivalent( U, X ) ) ) ] )
% 0.69/1.09 , clause( 15, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.69/1.09 equivalent( Y, equivalent( equivalent( Z, equivalent( Y, T ) ),
% 0.69/1.09 equivalent( T, Z ) ) ), U ) ), equivalent( U, X ) ) ) ] )
% 0.69/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z ), :=( T, T ), :=( U
% 0.69/1.09 , U )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 resolution(
% 0.69/1.09 clause( 16, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ), Z
% 0.69/1.09 ), equivalent( Y, equivalent( Z, X ) ) ) ) ] )
% 0.69/1.09 , clause( 3, [ 'is_a_theorem'( T ), ~( 'is_a_theorem'( equivalent(
% 0.69/1.09 equivalent( X, equivalent( equivalent( Y, equivalent( X, Z ) ),
% 0.69/1.09 equivalent( Z, Y ) ) ), T ) ) ) ] )
% 0.69/1.09 , 1, clause( 4, [ 'is_a_theorem'( equivalent( equivalent( X, equivalent(
% 0.69/1.09 equivalent( Y, equivalent( equivalent( Z, equivalent( Y, T ) ),
% 0.69/1.09 equivalent( T, Z ) ) ), U ) ), equivalent( U, X ) ) ) ] )
% 0.69/1.09 , 0, substitution( 0, [ :=( X, equivalent( Y, equivalent( Z, X ) ) ), :=( Y
% 0.69/1.09 , Z ), :=( Z, equivalent( X, Y ) ), :=( T, equivalent( equivalent(
% 0.69/1.09 equivalent( X, Y ), Z ), equivalent( Y, equivalent( Z, X ) ) ) )] ),
% 0.69/1.09 substitution( 1, [ :=( X, equivalent( Y, equivalent( Z, X ) ) ), :=( Y, Z
% 0.69/1.09 ), :=( Z, Y ), :=( T, X ), :=( U, equivalent( equivalent( X, Y ), Z ) )] )
% 0.69/1.09 ).
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 subsumption(
% 0.69/1.09 clause( 5, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y ), Z
% 0.69/1.09 ), equivalent( Y, equivalent( Z, X ) ) ) ) ] )
% 0.69/1.09 , clause( 16, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y )
% 0.69/1.09 , Z ), equivalent( Y, equivalent( Z, X ) ) ) ) ] )
% 0.69/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.69/1.09 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 resolution(
% 0.69/1.09 clause( 17, [] )
% 0.69/1.09 , clause( 2, [ ~( 'is_a_theorem'( equivalent( equivalent( equivalent( a, b
% 0.69/1.09 ), c ), equivalent( b, equivalent( c, a ) ) ) ) ) ] )
% 0.69/1.09 , 0, clause( 5, [ 'is_a_theorem'( equivalent( equivalent( equivalent( X, Y
% 0.69/1.09 ), Z ), equivalent( Y, equivalent( Z, X ) ) ) ) ] )
% 0.69/1.09 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, a ), :=( Y, b ), :=(
% 0.69/1.09 Z, c )] )).
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 subsumption(
% 0.69/1.09 clause( 8, [] )
% 0.69/1.09 , clause( 17, [] )
% 0.69/1.09 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 end.
% 0.69/1.09
% 0.69/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.69/1.09
% 0.69/1.09 Memory use:
% 0.69/1.09
% 0.69/1.09 space for terms: 218
% 0.69/1.09 space for clauses: 1086
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 clauses generated: 9
% 0.69/1.09 clauses kept: 9
% 0.69/1.09 clauses selected: 6
% 0.69/1.09 clauses deleted: 0
% 0.69/1.09 clauses inuse deleted: 0
% 0.69/1.09
% 0.69/1.09 subsentry: 4
% 0.69/1.09 literals s-matched: 0
% 0.69/1.09 literals matched: 0
% 0.69/1.09 full subsumption: 0
% 0.69/1.09
% 0.69/1.09 checksum: -1368151735
% 0.69/1.09
% 0.69/1.09
% 0.69/1.09 Bliksem ended
%------------------------------------------------------------------------------