TSTP Solution File: LCL171-3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL171-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n021.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:51:12 EDT 2022
% Result : Unsatisfiable 0.74s 1.52s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL171-3 : TPTP v8.1.0. Released v2.3.0.
% 0.03/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % DateTime : Mon Jul 4 23:18:47 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.74/1.52 *** allocated 10000 integers for termspace/termends
% 0.74/1.52 *** allocated 10000 integers for clauses
% 0.74/1.52 *** allocated 10000 integers for justifications
% 0.74/1.52 Bliksem 1.12
% 0.74/1.52
% 0.74/1.52
% 0.74/1.52 Automatic Strategy Selection
% 0.74/1.52
% 0.74/1.52 Clauses:
% 0.74/1.52 [
% 0.74/1.52 [ axiom( implies( or( X, X ), X ) ) ],
% 0.74/1.52 [ axiom( implies( X, or( Y, X ) ) ) ],
% 0.74/1.52 [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ],
% 0.74/1.52 [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ],
% 0.74/1.52 [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or( Z, Y ) ) ) )
% 0.74/1.52 ],
% 0.74/1.52 [ =( implies( X, Y ), or( not( X ), Y ) ) ],
% 0.74/1.52 [ theorem( X ), ~( axiom( X ) ) ],
% 0.74/1.52 [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y ) ) ]
% 0.74/1.52 ,
% 0.74/1.52 [ ~( theorem( implies( implies( p, not( q ) ), implies( q, not( p ) ) )
% 0.74/1.52 ) ) ]
% 0.74/1.52 ] .
% 0.74/1.52
% 0.74/1.52
% 0.74/1.52 percentage equality = 0.083333, percentage horn = 1.000000
% 0.74/1.52 This is a problem with some equality
% 0.74/1.52
% 0.74/1.52
% 0.74/1.52
% 0.74/1.52 Options Used:
% 0.74/1.52
% 0.74/1.52 useres = 1
% 0.74/1.52 useparamod = 1
% 0.74/1.52 useeqrefl = 1
% 0.74/1.52 useeqfact = 1
% 0.74/1.52 usefactor = 1
% 0.74/1.52 usesimpsplitting = 0
% 0.74/1.52 usesimpdemod = 5
% 0.74/1.52 usesimpres = 3
% 0.74/1.52
% 0.74/1.52 resimpinuse = 1000
% 0.74/1.52 resimpclauses = 20000
% 0.74/1.52 substype = eqrewr
% 0.74/1.52 backwardsubs = 1
% 0.74/1.52 selectoldest = 5
% 0.74/1.52
% 0.74/1.52 litorderings [0] = split
% 0.74/1.52 litorderings [1] = extend the termordering, first sorting on arguments
% 0.74/1.52
% 0.74/1.52 termordering = kbo
% 0.74/1.52
% 0.74/1.52 litapriori = 0
% 0.74/1.52 termapriori = 1
% 0.74/1.52 litaposteriori = 0
% 0.74/1.52 termaposteriori = 0
% 0.74/1.52 demodaposteriori = 0
% 0.74/1.52 ordereqreflfact = 0
% 0.74/1.52
% 0.74/1.52 litselect = negord
% 0.74/1.52
% 0.74/1.52 maxweight = 15
% 0.74/1.52 maxdepth = 30000
% 0.74/1.52 maxlength = 115
% 0.74/1.52 maxnrvars = 195
% 0.74/1.52 excuselevel = 1
% 0.74/1.52 increasemaxweight = 1
% 0.74/1.52
% 0.74/1.52 maxselected = 10000000
% 0.74/1.52 maxnrclauses = 10000000
% 0.74/1.52
% 0.74/1.52 showgenerated = 0
% 0.74/1.52 showkept = 0
% 0.74/1.52 showselected = 0
% 0.74/1.52 showdeleted = 0
% 0.74/1.52 showresimp = 1
% 0.74/1.52 showstatus = 2000
% 0.74/1.52
% 0.74/1.52 prologoutput = 1
% 0.74/1.52 nrgoals = 5000000
% 0.74/1.52 totalproof = 1
% 0.74/1.52
% 0.74/1.52 Symbols occurring in the translation:
% 0.74/1.52
% 0.74/1.52 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.74/1.52 . [1, 2] (w:1, o:24, a:1, s:1, b:0),
% 0.74/1.52 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 0.74/1.52 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.74/1.52 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.74/1.52 or [40, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.74/1.52 implies [41, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.74/1.52 axiom [42, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.74/1.52 not [47, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.74/1.52 theorem [48, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.74/1.52 p [49, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.74/1.52 q [50, 0] (w:1, o:15, a:1, s:1, b:0).
% 0.74/1.52
% 0.74/1.52
% 0.74/1.52 Starting Search:
% 0.74/1.52
% 0.74/1.52 Resimplifying inuse:
% 0.74/1.52 Done
% 0.74/1.52
% 0.74/1.52
% 0.74/1.52 Intermediate Status:
% 0.74/1.52 Generated: 3612
% 0.74/1.52 Kept: 2005
% 0.74/1.52 Inuse: 110
% 0.74/1.52 Deleted: 5
% 0.74/1.52 Deletedinuse: 2
% 0.74/1.52
% 0.74/1.52 Resimplifying inuse:
% 0.74/1.52 Done
% 0.74/1.52
% 0.74/1.52 Resimplifying inuse:
% 0.74/1.52 Done
% 0.74/1.52
% 0.74/1.52
% 0.74/1.52 Intermediate Status:
% 0.74/1.52 Generated: 8319
% 0.74/1.52 Kept: 4068
% 0.74/1.52 Inuse: 176
% 0.74/1.52 Deleted: 10
% 0.74/1.52 Deletedinuse: 2
% 0.74/1.52
% 0.74/1.52 Resimplifying inuse:
% 0.74/1.52 Done
% 0.74/1.52
% 0.74/1.52 Resimplifying inuse:
% 0.74/1.52 Done
% 0.74/1.52
% 0.74/1.52
% 0.74/1.52 Intermediate Status:
% 0.74/1.52 Generated: 12621
% 0.74/1.52 Kept: 6099
% 0.74/1.52 Inuse: 222
% 0.74/1.52 Deleted: 10
% 0.74/1.52 Deletedinuse: 2
% 0.74/1.52
% 0.74/1.52 Resimplifying inuse:
% 0.74/1.52 Done
% 0.74/1.52
% 0.74/1.52 Resimplifying inuse:
% 0.74/1.52 Done
% 0.74/1.52
% 0.74/1.52
% 0.74/1.52 Intermediate Status:
% 0.74/1.52 Generated: 17717
% 0.74/1.52 Kept: 8128
% 0.74/1.52 Inuse: 257
% 0.74/1.52 Deleted: 10
% 0.74/1.52 Deletedinuse: 2
% 0.74/1.52
% 0.74/1.52 Resimplifying inuse:
% 0.74/1.52 Done
% 0.74/1.52
% 0.74/1.52 Resimplifying inuse:
% 0.74/1.52 Done
% 0.74/1.52
% 0.74/1.52
% 0.74/1.52 Intermediate Status:
% 0.74/1.52 Generated: 23685
% 0.74/1.52 Kept: 10184
% 0.74/1.52 Inuse: 301
% 0.74/1.52 Deleted: 22
% 0.74/1.52 Deletedinuse: 2
% 0.74/1.52
% 0.74/1.52 Resimplifying inuse:
% 0.74/1.52 Done
% 0.74/1.52
% 0.74/1.52 Resimplifying inuse:
% 0.74/1.52 Done
% 0.74/1.52
% 0.74/1.52
% 0.74/1.52 Intermediate Status:
% 0.74/1.52 Generated: 27663
% 0.74/1.52 Kept: 12223
% 0.74/1.52 Inuse: 317
% 0.74/1.52 Deleted: 24
% 0.74/1.52 Deletedinuse: 2
% 0.74/1.52
% 0.74/1.52 Resimplifying inuse:
% 0.74/1.52 Done
% 0.74/1.52
% 0.74/1.52 Resimplifying inuse:
% 0.74/1.52 Done
% 0.74/1.52
% 0.74/1.52
% 0.74/1.52 Intermediate Status:
% 0.74/1.52 Generated: 32056
% 0.74/1.52 Kept: 14238
% 0.74/1.52 Inuse: 354
% 0.74/1.52 Deleted: 24
% 0.74/1.52 Deletedinuse: 2
% 0.74/1.52
% 0.74/1.52 Resimplifying inuse:
% 0.74/1.52
% 0.74/1.52 Bliksems!, er is een bewijs:
% 0.74/1.52 % SZS status Unsatisfiable
% 0.74/1.52 % SZS output start Refutation
% 0.74/1.52
% 0.74/1.52 clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.74/1.52 .
% 0.74/1.52 clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.74/1.52 .
% 0.74/1.52 clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.74/1.52 .
% 0.74/1.52 clause( 8, [ ~( theorem( implies( implies( p, not( q ) ), implies( q, not(
% 0.74/1.52 p ) ) ) ) ) ] )
% 0.74/1.52 .
% 0.74/1.52 clause( 11, [ theorem( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.74/1.52 .
% 0.74/1.52 clause( 182, [ theorem( implies( implies( X, Y ), or( Y, not( X ) ) ) ) ]
% 0.74/1.52 )
% 0.74/1.52 .
% 0.74/1.52 clause( 14069, [ theorem( implies( implies( Y, not( X ) ), implies( X, not(
% 0.74/1.52 Y ) ) ) ) ] )
% 0.74/1.52 .
% 0.74/1.52 clause( 14400, [] )
% 0.74/1.52 .
% 0.74/1.52
% 0.74/1.52
% 0.74/1.52 % SZS output end Refutation
% 0.74/1.52 found a proof!
% 0.74/1.52
% 0.74/1.52 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.74/1.52
% 0.74/1.52 initialclauses(
% 0.74/1.52 [ clause( 14402, [ axiom( implies( or( X, X ), X ) ) ] )
% 0.74/1.52 , clause( 14403, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 0.74/1.52 , clause( 14404, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.74/1.52 , clause( 14405, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 0.74/1.52 ) ) ] )
% 0.74/1.52 , clause( 14406, [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or(
% 0.74/1.52 Z, Y ) ) ) ) ] )
% 0.74/1.52 , clause( 14407, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 0.74/1.52 , clause( 14408, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.74/1.52 , clause( 14409, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~(
% 0.74/1.52 theorem( Y ) ) ] )
% 0.74/1.52 , clause( 14410, [ ~( theorem( implies( implies( p, not( q ) ), implies( q
% 0.74/1.52 , not( p ) ) ) ) ) ] )
% 0.74/1.52 ] ).
% 0.74/1.52
% 0.74/1.52
% 0.74/1.52
% 0.74/1.52 subsumption(
% 0.74/1.52 clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.74/1.52 , clause( 14404, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.74/1.52 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.52 )] ) ).
% 0.74/1.52
% 0.74/1.52
% 0.74/1.52 eqswap(
% 0.74/1.52 clause( 14411, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.74/1.52 , clause( 14407, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 0.74/1.52 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.74/1.52
% 0.74/1.52
% 0.74/1.52 subsumption(
% 0.74/1.52 clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.74/1.52 , clause( 14411, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.74/1.52 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.52 )] ) ).
% 0.74/1.52
% 0.74/1.52
% 0.74/1.52 subsumption(
% 0.74/1.52 clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.74/1.52 , clause( 14408, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.74/1.52 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.74/1.52 1 )] ) ).
% 0.74/1.52
% 0.74/1.52
% 0.74/1.52 subsumption(
% 0.74/1.52 clause( 8, [ ~( theorem( implies( implies( p, not( q ) ), implies( q, not(
% 0.74/1.52 p ) ) ) ) ) ] )
% 0.74/1.52 , clause( 14410, [ ~( theorem( implies( implies( p, not( q ) ), implies( q
% 0.74/1.52 , not( p ) ) ) ) ) ] )
% 0.74/1.52 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.52
% 0.74/1.52
% 0.74/1.52 resolution(
% 0.74/1.52 clause( 14414, [ theorem( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.74/1.52 , clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.74/1.52 , 1, clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.74/1.52 , 0, substitution( 0, [ :=( X, implies( or( X, Y ), or( Y, X ) ) )] ),
% 0.74/1.52 substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.74/1.52
% 0.74/1.52
% 0.74/1.52 subsumption(
% 0.74/1.52 clause( 11, [ theorem( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.74/1.52 , clause( 14414, [ theorem( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.74/1.52 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.52 )] ) ).
% 0.74/1.52
% 0.74/1.52
% 0.74/1.52 paramod(
% 0.74/1.52 clause( 14416, [ theorem( implies( implies( X, Y ), or( Y, not( X ) ) ) ) ]
% 0.74/1.52 )
% 0.74/1.52 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.74/1.52 , 0, clause( 11, [ theorem( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.74/1.52 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 0.74/1.52 :=( X, not( X ) ), :=( Y, Y )] )).
% 0.74/1.52
% 0.74/1.52
% 0.74/1.52 subsumption(
% 0.74/1.52 clause( 182, [ theorem( implies( implies( X, Y ), or( Y, not( X ) ) ) ) ]
% 0.74/1.52 )
% 0.74/1.52 , clause( 14416, [ theorem( implies( implies( X, Y ), or( Y, not( X ) ) ) )
% 0.74/1.52 ] )
% 0.74/1.52 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.52 )] ) ).
% 0.74/1.52
% 0.74/1.52
% 0.74/1.52 paramod(
% 0.74/1.52 clause( 14419, [ theorem( implies( implies( X, not( Y ) ), implies( Y, not(
% 0.74/1.52 X ) ) ) ) ] )
% 0.74/1.52 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.74/1.52 , 0, clause( 182, [ theorem( implies( implies( X, Y ), or( Y, not( X ) ) )
% 0.74/1.52 ) ] )
% 0.74/1.52 , 0, 6, substitution( 0, [ :=( X, Y ), :=( Y, not( X ) )] ), substitution(
% 0.74/1.52 1, [ :=( X, X ), :=( Y, not( Y ) )] )).
% 0.74/1.52
% 0.74/1.52
% 0.74/1.52 subsumption(
% 0.74/1.52 clause( 14069, [ theorem( implies( implies( Y, not( X ) ), implies( X, not(
% 0.74/1.52 Y ) ) ) ) ] )
% 0.74/1.52 , clause( 14419, [ theorem( implies( implies( X, not( Y ) ), implies( Y,
% 0.74/1.52 not( X ) ) ) ) ] )
% 0.74/1.52 , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.52 )] ) ).
% 0.74/1.52
% 0.74/1.52
% 0.74/1.52 resolution(
% 0.74/1.52 clause( 14420, [] )
% 0.74/1.52 , clause( 8, [ ~( theorem( implies( implies( p, not( q ) ), implies( q, not(
% 0.74/1.52 p ) ) ) ) ) ] )
% 0.74/1.52 , 0, clause( 14069, [ theorem( implies( implies( Y, not( X ) ), implies( X
% 0.74/1.52 , not( Y ) ) ) ) ] )
% 0.74/1.52 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, q ), :=( Y, p )] )
% 0.74/1.52 ).
% 0.74/1.52
% 0.74/1.52
% 0.74/1.52 subsumption(
% 0.74/1.52 clause( 14400, [] )
% 0.74/1.52 , clause( 14420, [] )
% 0.74/1.52 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.74/1.52
% 0.74/1.52
% 0.74/1.52 end.
% 0.74/1.52
% 0.74/1.52 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.74/1.52
% 0.74/1.52 Memory use:
% 0.74/1.52
% 0.74/1.52 space for terms: 222809
% 0.74/1.52 space for clauses: 657538
% 0.74/1.52
% 0.74/1.52
% 0.74/1.52 clauses generated: 32345
% 0.74/1.52 clauses kept: 14401
% 0.74/1.52 clauses selected: 358
% 0.74/1.52 clauses deleted: 25
% 0.74/1.52 clauses inuse deleted: 3
% 0.74/1.52
% 0.74/1.52 subsentry: 395443
% 0.74/1.52 literals s-matched: 170530
% 0.74/1.52 literals matched: 160211
% 0.74/1.52 full subsumption: 73063
% 0.74/1.52
% 0.74/1.52 checksum: 158484942
% 0.74/1.52
% 0.74/1.52
% 0.74/1.52 Bliksem ended
%------------------------------------------------------------------------------