TSTP Solution File: LCL190-3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL190-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n015.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:28 EDT 2022
% Result : Unsatisfiable 0.74s 1.31s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL190-3 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n015.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.34 % CPULimit : 300
% 0.13/0.34 % DateTime : Sun Jul 3 18:46:15 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.74/1.31 *** allocated 10000 integers for termspace/termends
% 0.74/1.31 *** allocated 10000 integers for clauses
% 0.74/1.31 *** allocated 10000 integers for justifications
% 0.74/1.31 Bliksem 1.12
% 0.74/1.31
% 0.74/1.31
% 0.74/1.31 Automatic Strategy Selection
% 0.74/1.31
% 0.74/1.31 Clauses:
% 0.74/1.31 [
% 0.74/1.31 [ axiom( implies( or( X, X ), X ) ) ],
% 0.74/1.31 [ axiom( implies( X, or( Y, X ) ) ) ],
% 0.74/1.31 [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ],
% 0.74/1.31 [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ],
% 0.74/1.31 [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or( Z, Y ) ) ) )
% 0.74/1.31 ],
% 0.74/1.31 [ =( implies( X, Y ), or( not( X ), Y ) ) ],
% 0.74/1.31 [ theorem( X ), ~( axiom( X ) ) ],
% 0.74/1.31 [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y ) ) ]
% 0.74/1.31 ,
% 0.74/1.31 [ ~( theorem( implies( or( p, or( q, r ) ), or( p, or( r, q ) ) ) ) ) ]
% 0.74/1.31
% 0.74/1.31 ] .
% 0.74/1.31
% 0.74/1.31
% 0.74/1.31 percentage equality = 0.083333, percentage horn = 1.000000
% 0.74/1.31 This is a problem with some equality
% 0.74/1.31
% 0.74/1.31
% 0.74/1.31
% 0.74/1.31 Options Used:
% 0.74/1.31
% 0.74/1.31 useres = 1
% 0.74/1.31 useparamod = 1
% 0.74/1.31 useeqrefl = 1
% 0.74/1.31 useeqfact = 1
% 0.74/1.31 usefactor = 1
% 0.74/1.31 usesimpsplitting = 0
% 0.74/1.31 usesimpdemod = 5
% 0.74/1.31 usesimpres = 3
% 0.74/1.31
% 0.74/1.31 resimpinuse = 1000
% 0.74/1.31 resimpclauses = 20000
% 0.74/1.31 substype = eqrewr
% 0.74/1.31 backwardsubs = 1
% 0.74/1.31 selectoldest = 5
% 0.74/1.31
% 0.74/1.31 litorderings [0] = split
% 0.74/1.31 litorderings [1] = extend the termordering, first sorting on arguments
% 0.74/1.31
% 0.74/1.31 termordering = kbo
% 0.74/1.31
% 0.74/1.31 litapriori = 0
% 0.74/1.31 termapriori = 1
% 0.74/1.31 litaposteriori = 0
% 0.74/1.31 termaposteriori = 0
% 0.74/1.31 demodaposteriori = 0
% 0.74/1.31 ordereqreflfact = 0
% 0.74/1.31
% 0.74/1.31 litselect = negord
% 0.74/1.31
% 0.74/1.31 maxweight = 15
% 0.74/1.31 maxdepth = 30000
% 0.74/1.31 maxlength = 115
% 0.74/1.31 maxnrvars = 195
% 0.74/1.31 excuselevel = 1
% 0.74/1.31 increasemaxweight = 1
% 0.74/1.31
% 0.74/1.31 maxselected = 10000000
% 0.74/1.31 maxnrclauses = 10000000
% 0.74/1.31
% 0.74/1.31 showgenerated = 0
% 0.74/1.31 showkept = 0
% 0.74/1.31 showselected = 0
% 0.74/1.31 showdeleted = 0
% 0.74/1.31 showresimp = 1
% 0.74/1.31 showstatus = 2000
% 0.74/1.31
% 0.74/1.31 prologoutput = 1
% 0.74/1.31 nrgoals = 5000000
% 0.74/1.31 totalproof = 1
% 0.74/1.31
% 0.74/1.31 Symbols occurring in the translation:
% 0.74/1.31
% 0.74/1.31 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.74/1.31 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 0.74/1.31 ! [4, 1] (w:0, o:17, a:1, s:1, b:0),
% 0.74/1.31 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.74/1.31 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.74/1.31 or [40, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.74/1.31 implies [41, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.74/1.31 axiom [42, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.74/1.31 not [47, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.74/1.31 theorem [48, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.74/1.31 p [49, 0] (w:1, o:14, a:1, s:1, b:0),
% 0.74/1.31 q [50, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.74/1.31 r [51, 0] (w:1, o:16, a:1, s:1, b:0).
% 0.74/1.31
% 0.74/1.31
% 0.74/1.31 Starting Search:
% 0.74/1.31
% 0.74/1.31 Resimplifying inuse:
% 0.74/1.31 Done
% 0.74/1.31
% 0.74/1.31
% 0.74/1.31 Intermediate Status:
% 0.74/1.31 Generated: 3861
% 0.74/1.31 Kept: 2007
% 0.74/1.31 Inuse: 125
% 0.74/1.31 Deleted: 1
% 0.74/1.31 Deletedinuse: 0
% 0.74/1.31
% 0.74/1.31 Resimplifying inuse:
% 0.74/1.31 Done
% 0.74/1.31
% 0.74/1.31 Resimplifying inuse:
% 0.74/1.31 Done
% 0.74/1.31
% 0.74/1.31
% 0.74/1.31 Intermediate Status:
% 0.74/1.31 Generated: 8469
% 0.74/1.31 Kept: 4051
% 0.74/1.31 Inuse: 189
% 0.74/1.31 Deleted: 1
% 0.74/1.31 Deletedinuse: 0
% 0.74/1.31
% 0.74/1.31 Resimplifying inuse:
% 0.74/1.31 Done
% 0.74/1.31
% 0.74/1.31 Resimplifying inuse:
% 0.74/1.31 Done
% 0.74/1.31
% 0.74/1.31
% 0.74/1.31 Intermediate Status:
% 0.74/1.31 Generated: 13062
% 0.74/1.31 Kept: 6187
% 0.74/1.31 Inuse: 240
% 0.74/1.31 Deleted: 1
% 0.74/1.31 Deletedinuse: 0
% 0.74/1.31
% 0.74/1.31 Resimplifying inuse:
% 0.74/1.31 Done
% 0.74/1.31
% 0.74/1.31 Resimplifying inuse:
% 0.74/1.31 Done
% 0.74/1.31
% 0.74/1.31
% 0.74/1.31 Bliksems!, er is een bewijs:
% 0.74/1.31 % SZS status Unsatisfiable
% 0.74/1.31 % SZS output start Refutation
% 0.74/1.31
% 0.74/1.31 clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.74/1.31 .
% 0.74/1.31 clause( 4, [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or( Z, Y
% 0.74/1.31 ) ) ) ) ] )
% 0.74/1.31 .
% 0.74/1.31 clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.74/1.31 .
% 0.74/1.31 clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y )
% 0.74/1.31 ) ] )
% 0.74/1.31 .
% 0.74/1.31 clause( 8, [ ~( theorem( implies( or( p, or( q, r ) ), or( p, or( r, q ) )
% 0.74/1.31 ) ) ) ] )
% 0.74/1.31 .
% 0.74/1.31 clause( 11, [ theorem( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.74/1.31 .
% 0.74/1.31 clause( 18, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X ) )
% 0.74/1.31 ) ] )
% 0.74/1.31 .
% 0.74/1.31 clause( 70, [ theorem( implies( or( X, Y ), or( X, Z ) ) ), ~( theorem(
% 0.74/1.31 implies( Y, Z ) ) ) ] )
% 0.74/1.31 .
% 0.74/1.31 clause( 8144, [] )
% 0.74/1.31 .
% 0.74/1.31
% 0.74/1.31
% 0.74/1.31 % SZS output end Refutation
% 0.74/1.31 found a proof!
% 0.74/1.31
% 0.74/1.31 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.74/1.31
% 0.74/1.31 initialclauses(
% 0.74/1.31 [ clause( 8146, [ axiom( implies( or( X, X ), X ) ) ] )
% 0.74/1.31 , clause( 8147, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 0.74/1.31 , clause( 8148, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.74/1.31 , clause( 8149, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 0.74/1.31 ) ) ] )
% 0.74/1.31 , clause( 8150, [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or(
% 0.74/1.31 Z, Y ) ) ) ) ] )
% 0.74/1.31 , clause( 8151, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 0.74/1.31 , clause( 8152, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.74/1.31 , clause( 8153, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem(
% 0.74/1.31 Y ) ) ] )
% 0.74/1.31 , clause( 8154, [ ~( theorem( implies( or( p, or( q, r ) ), or( p, or( r, q
% 0.74/1.31 ) ) ) ) ) ] )
% 0.74/1.31 ] ).
% 0.74/1.31
% 0.74/1.31
% 0.74/1.31
% 0.74/1.31 subsumption(
% 0.74/1.31 clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.74/1.31 , clause( 8148, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.74/1.31 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.31 )] ) ).
% 0.74/1.31
% 0.74/1.31
% 0.74/1.31 subsumption(
% 0.74/1.31 clause( 4, [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or( Z, Y
% 0.74/1.31 ) ) ) ) ] )
% 0.74/1.31 , clause( 8150, [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or(
% 0.74/1.31 Z, Y ) ) ) ) ] )
% 0.74/1.31 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.74/1.31 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.31
% 0.74/1.31
% 0.74/1.31 subsumption(
% 0.74/1.31 clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.74/1.31 , clause( 8152, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.74/1.31 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.74/1.31 1 )] ) ).
% 0.74/1.31
% 0.74/1.31
% 0.74/1.31 subsumption(
% 0.74/1.31 clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y )
% 0.74/1.31 ) ] )
% 0.74/1.31 , clause( 8153, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem(
% 0.74/1.31 Y ) ) ] )
% 0.74/1.31 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.31 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.74/1.31
% 0.74/1.31
% 0.74/1.31 subsumption(
% 0.74/1.31 clause( 8, [ ~( theorem( implies( or( p, or( q, r ) ), or( p, or( r, q ) )
% 0.74/1.31 ) ) ) ] )
% 0.74/1.31 , clause( 8154, [ ~( theorem( implies( or( p, or( q, r ) ), or( p, or( r, q
% 0.74/1.31 ) ) ) ) ) ] )
% 0.74/1.31 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.74/1.31
% 0.74/1.31
% 0.74/1.31 resolution(
% 0.74/1.31 clause( 8158, [ theorem( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.74/1.31 , clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.74/1.31 , 1, clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.74/1.31 , 0, substitution( 0, [ :=( X, implies( or( X, Y ), or( Y, X ) ) )] ),
% 0.74/1.31 substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.74/1.31
% 0.74/1.31
% 0.74/1.31 subsumption(
% 0.74/1.31 clause( 11, [ theorem( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.74/1.31 , clause( 8158, [ theorem( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.74/1.31 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.31 )] ) ).
% 0.74/1.31
% 0.74/1.31
% 0.74/1.31 resolution(
% 0.74/1.31 clause( 8159, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 0.74/1.31 ) ) ] )
% 0.74/1.31 , clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y
% 0.74/1.31 ) ) ] )
% 0.74/1.31 , 1, clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.74/1.31 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ :=( X
% 0.74/1.31 , implies( Y, X ) )] )).
% 0.74/1.31
% 0.74/1.31
% 0.74/1.31 subsumption(
% 0.74/1.31 clause( 18, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X ) )
% 0.74/1.31 ) ] )
% 0.74/1.31 , clause( 8159, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X
% 0.74/1.31 ) ) ) ] )
% 0.74/1.31 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.74/1.31 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.74/1.31
% 0.74/1.31
% 0.74/1.31 resolution(
% 0.74/1.31 clause( 8161, [ theorem( implies( or( X, Y ), or( X, Z ) ) ), ~( theorem(
% 0.74/1.31 implies( Y, Z ) ) ) ] )
% 0.74/1.31 , clause( 18, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 0.74/1.31 ) ) ] )
% 0.74/1.31 , 2, clause( 4, [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or(
% 0.74/1.31 Z, Y ) ) ) ) ] )
% 0.74/1.31 , 0, substitution( 0, [ :=( X, implies( or( X, Y ), or( X, Z ) ) ), :=( Y,
% 0.74/1.31 implies( Y, Z ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, Z ), :=( Z, X
% 0.74/1.31 )] )).
% 0.74/1.31
% 0.74/1.31
% 0.74/1.31 subsumption(
% 0.74/1.31 clause( 70, [ theorem( implies( or( X, Y ), or( X, Z ) ) ), ~( theorem(
% 0.74/1.31 implies( Y, Z ) ) ) ] )
% 0.74/1.31 , clause( 8161, [ theorem( implies( or( X, Y ), or( X, Z ) ) ), ~( theorem(
% 0.74/1.31 implies( Y, Z ) ) ) ] )
% 0.74/1.31 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.74/1.31 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.74/1.31
% 0.74/1.31
% 0.74/1.31 resolution(
% 0.74/1.31 clause( 8162, [ ~( theorem( implies( or( q, r ), or( r, q ) ) ) ) ] )
% 0.74/1.31 , clause( 8, [ ~( theorem( implies( or( p, or( q, r ) ), or( p, or( r, q )
% 0.74/1.31 ) ) ) ) ] )
% 0.74/1.31 , 0, clause( 70, [ theorem( implies( or( X, Y ), or( X, Z ) ) ), ~( theorem(
% 0.74/1.31 implies( Y, Z ) ) ) ] )
% 0.74/1.31 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, p ), :=( Y, or( q, r
% 0.74/1.31 ) ), :=( Z, or( r, q ) )] )).
% 0.74/1.31
% 0.74/1.31
% 0.74/1.31 resolution(
% 0.74/1.31 clause( 8163, [] )
% 0.74/1.31 , clause( 8162, [ ~( theorem( implies( or( q, r ), or( r, q ) ) ) ) ] )
% 0.74/1.31 , 0, clause( 11, [ theorem( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.74/1.31 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, q ), :=( Y, r )] )
% 0.74/1.31 ).
% 0.74/1.31
% 0.74/1.31
% 0.74/1.31 subsumption(
% 0.74/1.31 clause( 8144, [] )
% 0.74/1.31 , clause( 8163, [] )
% 0.74/1.31 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.74/1.31
% 0.74/1.31
% 0.74/1.31 end.
% 0.74/1.31
% 0.74/1.31 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.74/1.31
% 0.74/1.31 Memory use:
% 0.74/1.31
% 0.74/1.31 space for terms: 120377
% 0.74/1.31 space for clauses: 358929
% 0.74/1.31
% 0.74/1.31
% 0.74/1.31 clauses generated: 18060
% 0.74/1.31 clauses kept: 8145
% 0.74/1.31 clauses selected: 280
% 0.74/1.31 clauses deleted: 1
% 0.74/1.31 clauses inuse deleted: 0
% 0.74/1.31
% 0.74/1.31 subsentry: 102453
% 0.74/1.31 literals s-matched: 63280
% 0.74/1.31 literals matched: 62428
% 0.74/1.31 full subsumption: 24055
% 0.74/1.31
% 0.74/1.31 checksum: 1702178521
% 0.74/1.31
% 0.74/1.31
% 0.74/1.31 Bliksem ended
%------------------------------------------------------------------------------