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