TSTP Solution File: LCL186-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL186-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n005.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:24 EDT 2022
% Result : Unsatisfiable 0.42s 1.05s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : LCL186-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n005.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % DateTime : Sun Jul 3 13:52:22 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/1.05 *** allocated 10000 integers for termspace/termends
% 0.42/1.05 *** allocated 10000 integers for clauses
% 0.42/1.05 *** allocated 10000 integers for justifications
% 0.42/1.05 Bliksem 1.12
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 Automatic Strategy Selection
% 0.42/1.05
% 0.42/1.05 Clauses:
% 0.42/1.05 [
% 0.42/1.05 [ axiom( or( not( or( X, X ) ), X ) ) ],
% 0.42/1.05 [ axiom( or( not( X ), or( Y, X ) ) ) ],
% 0.42/1.05 [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ],
% 0.42/1.05 [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) ) ],
% 0.42/1.05 [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or( Z, Y )
% 0.42/1.05 ) ) ) ],
% 0.42/1.05 [ theorem( X ), ~( axiom( X ) ) ],
% 0.42/1.05 [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem( Y ) ) ]
% 0.42/1.05 ,
% 0.42/1.05 [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z ) ) ), ~(
% 0.42/1.05 theorem( or( not( Z ), Y ) ) ) ],
% 0.42/1.05 [ ~( theorem( or( not( not( p ) ), or( not( p ), q ) ) ) ) ]
% 0.42/1.05 ] .
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 percentage equality = 0.000000, percentage horn = 1.000000
% 0.42/1.05 This is a near-Horn, non-equality problem
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 Options Used:
% 0.42/1.05
% 0.42/1.05 useres = 1
% 0.42/1.05 useparamod = 0
% 0.42/1.05 useeqrefl = 0
% 0.42/1.05 useeqfact = 0
% 0.42/1.05 usefactor = 1
% 0.42/1.05 usesimpsplitting = 0
% 0.42/1.05 usesimpdemod = 0
% 0.42/1.05 usesimpres = 4
% 0.42/1.05
% 0.42/1.05 resimpinuse = 1000
% 0.42/1.05 resimpclauses = 20000
% 0.42/1.05 substype = standard
% 0.42/1.05 backwardsubs = 1
% 0.42/1.05 selectoldest = 5
% 0.42/1.05
% 0.42/1.05 litorderings [0] = split
% 0.42/1.05 litorderings [1] = liftord
% 0.42/1.05
% 0.42/1.05 termordering = none
% 0.42/1.05
% 0.42/1.05 litapriori = 1
% 0.42/1.05 termapriori = 0
% 0.42/1.05 litaposteriori = 0
% 0.42/1.05 termaposteriori = 0
% 0.42/1.05 demodaposteriori = 0
% 0.42/1.05 ordereqreflfact = 0
% 0.42/1.05
% 0.42/1.05 litselect = negative
% 0.42/1.05
% 0.42/1.05 maxweight = 30000
% 0.42/1.05 maxdepth = 30000
% 0.42/1.05 maxlength = 115
% 0.42/1.05 maxnrvars = 195
% 0.42/1.05 excuselevel = 0
% 0.42/1.05 increasemaxweight = 0
% 0.42/1.05
% 0.42/1.05 maxselected = 10000000
% 0.42/1.05 maxnrclauses = 10000000
% 0.42/1.05
% 0.42/1.05 showgenerated = 0
% 0.42/1.05 showkept = 0
% 0.42/1.05 showselected = 0
% 0.42/1.05 showdeleted = 0
% 0.42/1.05 showresimp = 1
% 0.42/1.05 showstatus = 2000
% 0.42/1.05
% 0.42/1.05 prologoutput = 1
% 0.42/1.05 nrgoals = 5000000
% 0.42/1.05 totalproof = 1
% 0.42/1.05
% 0.42/1.05 Symbols occurring in the translation:
% 0.42/1.05
% 0.42/1.05 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.42/1.05 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 0.42/1.05 ! [4, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.42/1.05 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.42/1.05 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.42/1.05 or [40, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.42/1.05 not [41, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.42/1.05 axiom [42, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.42/1.05 theorem [46, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.42/1.05 p [49, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.42/1.05 q [50, 0] (w:1, o:16, a:1, s:1, b:0).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 Starting Search:
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 Bliksems!, er is een bewijs:
% 0.42/1.05 % SZS status Unsatisfiable
% 0.42/1.05 % SZS output start Refutation
% 0.42/1.05
% 0.42/1.05 clause( 1, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.42/1.05 .
% 0.42/1.05 clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.42/1.05 .
% 0.42/1.05 clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.42/1.05 .
% 0.42/1.05 clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y ) )
% 0.42/1.05 ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.42/1.05 .
% 0.42/1.05 clause( 8, [ ~( theorem( or( not( not( p ) ), or( not( p ), q ) ) ) ) ] )
% 0.42/1.05 .
% 0.42/1.05 clause( 11, [ theorem( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.42/1.05 .
% 0.42/1.05 clause( 37, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z, X )
% 0.42/1.05 ), Y ) ) ) ] )
% 0.42/1.05 .
% 0.42/1.05 clause( 237, [ theorem( or( not( X ), or( X, Y ) ) ) ] )
% 0.42/1.05 .
% 0.42/1.05 clause( 247, [] )
% 0.42/1.05 .
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 % SZS output end Refutation
% 0.42/1.05 found a proof!
% 0.42/1.05
% 0.42/1.05 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.42/1.05
% 0.42/1.05 initialclauses(
% 0.42/1.05 [ clause( 249, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.42/1.05 , clause( 250, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.42/1.05 , clause( 251, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.42/1.05 , clause( 252, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) )
% 0.42/1.05 ) ) ] )
% 0.42/1.05 , clause( 253, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) )
% 0.42/1.05 , or( Z, Y ) ) ) ) ] )
% 0.42/1.05 , clause( 254, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.42/1.05 , clause( 255, [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem(
% 0.42/1.05 Y ) ) ] )
% 0.42/1.05 , clause( 256, [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z )
% 0.42/1.05 ) ), ~( theorem( or( not( Z ), Y ) ) ) ] )
% 0.42/1.05 , clause( 257, [ ~( theorem( or( not( not( p ) ), or( not( p ), q ) ) ) ) ]
% 0.42/1.05 )
% 0.42/1.05 ] ).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 subsumption(
% 0.42/1.05 clause( 1, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.42/1.05 , clause( 250, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.42/1.05 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.42/1.05 )] ) ).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 subsumption(
% 0.42/1.05 clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.42/1.05 , clause( 251, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.42/1.05 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.42/1.05 )] ) ).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 subsumption(
% 0.42/1.05 clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.42/1.05 , clause( 254, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.42/1.05 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.42/1.05 1 )] ) ).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 subsumption(
% 0.42/1.05 clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y ) )
% 0.42/1.05 ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.42/1.05 , clause( 256, [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z )
% 0.42/1.05 ) ), ~( theorem( or( not( Z ), Y ) ) ) ] )
% 0.42/1.05 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.42/1.05 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 subsumption(
% 0.42/1.05 clause( 8, [ ~( theorem( or( not( not( p ) ), or( not( p ), q ) ) ) ) ] )
% 0.42/1.05 , clause( 257, [ ~( theorem( or( not( not( p ) ), or( not( p ), q ) ) ) ) ]
% 0.42/1.05 )
% 0.42/1.05 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 resolution(
% 0.42/1.05 clause( 258, [ theorem( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.42/1.05 , clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.42/1.05 , 1, clause( 2, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.42/1.05 , 0, substitution( 0, [ :=( X, or( not( or( X, Y ) ), or( Y, X ) ) )] ),
% 0.42/1.05 substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 subsumption(
% 0.42/1.05 clause( 11, [ theorem( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.42/1.05 , clause( 258, [ theorem( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.42/1.05 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.42/1.05 )] ) ).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 resolution(
% 0.42/1.05 clause( 259, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z, X
% 0.42/1.05 ) ), Y ) ) ) ] )
% 0.42/1.05 , clause( 7, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( Z ), Y )
% 0.42/1.05 ) ), ~( axiom( or( not( X ), Z ) ) ) ] )
% 0.42/1.05 , 2, clause( 1, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.42/1.05 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, or( Z, X ) )] ),
% 0.42/1.05 substitution( 1, [ :=( X, X ), :=( Y, Z )] )).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 subsumption(
% 0.42/1.05 clause( 37, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z, X )
% 0.42/1.05 ), Y ) ) ) ] )
% 0.42/1.05 , clause( 259, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z,
% 0.42/1.05 X ) ), Y ) ) ) ] )
% 0.42/1.05 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.42/1.05 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 resolution(
% 0.42/1.05 clause( 260, [ theorem( or( not( X ), or( X, Y ) ) ) ] )
% 0.42/1.05 , clause( 37, [ theorem( or( not( X ), Y ) ), ~( theorem( or( not( or( Z, X
% 0.42/1.05 ) ), Y ) ) ) ] )
% 0.42/1.05 , 1, clause( 11, [ theorem( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.42/1.05 , 0, substitution( 0, [ :=( X, X ), :=( Y, or( X, Y ) ), :=( Z, Y )] ),
% 0.42/1.05 substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 subsumption(
% 0.42/1.05 clause( 237, [ theorem( or( not( X ), or( X, Y ) ) ) ] )
% 0.42/1.05 , clause( 260, [ theorem( or( not( X ), or( X, Y ) ) ) ] )
% 0.42/1.05 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.42/1.05 )] ) ).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 resolution(
% 0.42/1.05 clause( 261, [] )
% 0.42/1.05 , clause( 8, [ ~( theorem( or( not( not( p ) ), or( not( p ), q ) ) ) ) ]
% 0.42/1.05 )
% 0.42/1.05 , 0, clause( 237, [ theorem( or( not( X ), or( X, Y ) ) ) ] )
% 0.42/1.05 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, not( p ) ), :=( Y, q
% 0.42/1.05 )] )).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 subsumption(
% 0.42/1.05 clause( 247, [] )
% 0.42/1.05 , clause( 261, [] )
% 0.42/1.05 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 end.
% 0.42/1.05
% 0.42/1.05 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.42/1.05
% 0.42/1.05 Memory use:
% 0.42/1.05
% 0.42/1.05 space for terms: 3297
% 0.42/1.05 space for clauses: 18972
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 clauses generated: 455
% 0.42/1.05 clauses kept: 248
% 0.42/1.05 clauses selected: 82
% 0.42/1.05 clauses deleted: 0
% 0.42/1.05 clauses inuse deleted: 0
% 0.42/1.05
% 0.42/1.05 subsentry: 249
% 0.42/1.05 literals s-matched: 249
% 0.42/1.05 literals matched: 249
% 0.42/1.05 full subsumption: 0
% 0.42/1.05
% 0.42/1.05 checksum: 1762923228
% 0.42/1.05
% 0.42/1.05
% 0.42/1.05 Bliksem ended
%------------------------------------------------------------------------------