TSTP Solution File: LCL188-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL188-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n011.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:26 EDT 2022
% Result : Unsatisfiable 0.45s 1.12s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL188-1 : TPTP v8.1.0. Released v1.1.0.
% 0.10/0.13 % Command : bliksem %s
% 0.12/0.34 % Computer : n011.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 17:59:06 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.45/1.12 *** allocated 10000 integers for termspace/termends
% 0.45/1.12 *** allocated 10000 integers for clauses
% 0.45/1.12 *** allocated 10000 integers for justifications
% 0.45/1.12 Bliksem 1.12
% 0.45/1.12
% 0.45/1.12
% 0.45/1.12 Automatic Strategy Selection
% 0.45/1.12
% 0.45/1.12 Clauses:
% 0.45/1.12 [
% 0.45/1.12 [ axiom( or( not( or( X, X ) ), X ) ) ],
% 0.45/1.12 [ axiom( or( not( X ), or( Y, X ) ) ) ],
% 0.45/1.12 [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ],
% 0.45/1.12 [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) ) ],
% 0.45/1.12 [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or( Z, Y )
% 0.45/1.12 ) ) ) ],
% 0.45/1.12 [ theorem( X ), ~( axiom( X ) ) ],
% 0.45/1.12 [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem( Y ) ) ]
% 0.45/1.12 ,
% 0.45/1.12 [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z ) ) ), ~(
% 0.45/1.12 theorem( or( not( Z ), Y ) ) ) ],
% 0.45/1.12 [ ~( theorem( or( p, or( not( or( p, q ) ), q ) ) ) ) ]
% 0.45/1.12 ] .
% 0.45/1.12
% 0.45/1.12
% 0.45/1.12 percentage equality = 0.000000, percentage horn = 1.000000
% 0.45/1.12 This is a near-Horn, non-equality problem
% 0.45/1.12
% 0.45/1.12
% 0.45/1.12 Options Used:
% 0.45/1.12
% 0.45/1.12 useres = 1
% 0.45/1.12 useparamod = 0
% 0.45/1.12 useeqrefl = 0
% 0.45/1.12 useeqfact = 0
% 0.45/1.12 usefactor = 1
% 0.45/1.12 usesimpsplitting = 0
% 0.45/1.12 usesimpdemod = 0
% 0.45/1.12 usesimpres = 4
% 0.45/1.12
% 0.45/1.12 resimpinuse = 1000
% 0.45/1.12 resimpclauses = 20000
% 0.45/1.12 substype = standard
% 0.45/1.12 backwardsubs = 1
% 0.45/1.12 selectoldest = 5
% 0.45/1.12
% 0.45/1.12 litorderings [0] = split
% 0.45/1.12 litorderings [1] = liftord
% 0.45/1.12
% 0.45/1.12 termordering = none
% 0.45/1.12
% 0.45/1.12 litapriori = 1
% 0.45/1.12 termapriori = 0
% 0.45/1.12 litaposteriori = 0
% 0.45/1.12 termaposteriori = 0
% 0.45/1.12 demodaposteriori = 0
% 0.45/1.12 ordereqreflfact = 0
% 0.45/1.12
% 0.45/1.12 litselect = negative
% 0.45/1.12
% 0.45/1.12 maxweight = 30000
% 0.45/1.12 maxdepth = 30000
% 0.45/1.12 maxlength = 115
% 0.45/1.12 maxnrvars = 195
% 0.45/1.12 excuselevel = 0
% 0.45/1.12 increasemaxweight = 0
% 0.45/1.12
% 0.45/1.12 maxselected = 10000000
% 0.45/1.12 maxnrclauses = 10000000
% 0.45/1.12
% 0.45/1.12 showgenerated = 0
% 0.45/1.12 showkept = 0
% 0.45/1.12 showselected = 0
% 0.45/1.12 showdeleted = 0
% 0.45/1.12 showresimp = 1
% 0.45/1.12 showstatus = 2000
% 0.45/1.12
% 0.45/1.12 prologoutput = 1
% 0.45/1.12 nrgoals = 5000000
% 0.45/1.12 totalproof = 1
% 0.45/1.12
% 0.45/1.12 Symbols occurring in the translation:
% 0.45/1.12
% 0.45/1.12 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.45/1.12 . [1, 2] (w:1, o:25, a:1, s:1, b:0),
% 0.45/1.12 ! [4, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.45/1.12 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.45/1.12 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.45/1.12 or [40, 2] (w:1, o:50, a:1, s:1, b:0),
% 0.45/1.12 not [41, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.45/1.12 axiom [42, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.45/1.12 theorem [46, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.45/1.12 p [49, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.45/1.12 q [50, 0] (w:1, o:16, a:1, s:1, b:0).
% 0.45/1.12
% 0.45/1.12
% 0.45/1.12 Starting Search:
% 0.45/1.12
% 0.45/1.12
% 0.45/1.12 Bliksems!, er is een bewijs:
% 0.45/1.12 % SZS status Unsatisfiable
% 0.45/1.12 % SZS output start Refutation
% 0.45/1.12
% 0.45/1.12 clause( 0, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.45/1.12 .
% 0.45/1.12 clause( 1, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.45/1.12 .
% 0.45/1.12 clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) )
% 0.45/1.12 ] )
% 0.45/1.12 .
% 0.45/1.12 clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.45/1.12 .
% 0.45/1.12 clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X ) )
% 0.45/1.12 ) ] )
% 0.45/1.12 .
% 0.45/1.12 clause( 8, [ ~( theorem( or( p, or( not( or( p, q ) ), q ) ) ) ) ] )
% 0.45/1.12 .
% 0.45/1.12 clause( 9, [ theorem( or( not( X ), or( Y, X ) ) ) ] )
% 0.45/1.12 .
% 0.45/1.12 clause( 13, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.45/1.12 .
% 0.45/1.12 clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z )
% 0.45/1.12 ) ) ) ] )
% 0.45/1.12 .
% 0.45/1.12 clause( 59, [ theorem( or( X, or( not( Y ), Y ) ) ) ] )
% 0.45/1.12 .
% 0.45/1.12 clause( 61, [ theorem( or( not( X ), X ) ) ] )
% 0.45/1.12 .
% 0.45/1.12 clause( 63, [ theorem( or( X, or( not( or( X, Y ) ), Y ) ) ) ] )
% 0.45/1.12 .
% 0.45/1.12 clause( 160, [] )
% 0.45/1.12 .
% 0.45/1.12
% 0.45/1.12
% 0.45/1.12 % SZS output end Refutation
% 0.45/1.12 found a proof!
% 0.45/1.12
% 0.45/1.12 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.45/1.12
% 0.45/1.12 initialclauses(
% 0.45/1.12 [ clause( 162, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.45/1.12 , clause( 163, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.45/1.12 , clause( 164, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.45/1.12 , clause( 165, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) )
% 0.45/1.12 ) ) ] )
% 0.45/1.12 , clause( 166, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) )
% 0.45/1.12 , or( Z, Y ) ) ) ) ] )
% 0.45/1.12 , clause( 167, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.45/1.12 , clause( 168, [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem(
% 0.45/1.12 Y ) ) ] )
% 0.45/1.12 , clause( 169, [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z )
% 0.45/1.12 ) ), ~( theorem( or( not( Z ), Y ) ) ) ] )
% 0.45/1.12 , clause( 170, [ ~( theorem( or( p, or( not( or( p, q ) ), q ) ) ) ) ] )
% 0.45/1.12 ] ).
% 0.45/1.12
% 0.45/1.12
% 0.45/1.12
% 0.45/1.12 subsumption(
% 0.45/1.12 clause( 0, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.45/1.12 , clause( 162, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.45/1.12 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.45/1.12
% 0.45/1.12
% 0.45/1.12 subsumption(
% 0.45/1.12 clause( 1, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.45/1.12 , clause( 163, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.45/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.45/1.12 )] ) ).
% 0.45/1.12
% 0.45/1.12
% 0.45/1.12 subsumption(
% 0.45/1.12 clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) )
% 0.45/1.12 ] )
% 0.45/1.12 , clause( 165, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) )
% 0.45/1.12 ) ) ] )
% 0.45/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.45/1.12 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.45/1.12
% 0.45/1.12
% 0.45/1.12 subsumption(
% 0.45/1.12 clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.45/1.12 , clause( 167, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.45/1.12 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.45/1.12 1 )] ) ).
% 0.45/1.12
% 0.45/1.12
% 0.45/1.12 subsumption(
% 0.45/1.12 clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X ) )
% 0.45/1.12 ) ] )
% 0.45/1.12 , clause( 168, [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem(
% 0.45/1.12 Y ) ) ] )
% 0.45/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.45/1.12 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.45/1.12
% 0.45/1.12
% 0.45/1.12 subsumption(
% 0.45/1.12 clause( 8, [ ~( theorem( or( p, or( not( or( p, q ) ), q ) ) ) ) ] )
% 0.45/1.12 , clause( 170, [ ~( theorem( or( p, or( not( or( p, q ) ), q ) ) ) ) ] )
% 0.45/1.12 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.45/1.12
% 0.45/1.12
% 0.45/1.12 resolution(
% 0.45/1.12 clause( 171, [ theorem( or( not( X ), or( Y, X ) ) ) ] )
% 0.45/1.12 , clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.45/1.12 , 1, clause( 1, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.45/1.12 , 0, substitution( 0, [ :=( X, or( not( X ), or( Y, X ) ) )] ),
% 0.45/1.12 substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 0.45/1.12
% 0.45/1.12
% 0.45/1.12 subsumption(
% 0.45/1.12 clause( 9, [ theorem( or( not( X ), or( Y, X ) ) ) ] )
% 0.45/1.12 , clause( 171, [ theorem( or( not( X ), or( Y, X ) ) ) ] )
% 0.45/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.45/1.12 )] ) ).
% 0.45/1.12
% 0.45/1.12
% 0.45/1.12 resolution(
% 0.45/1.12 clause( 172, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.45/1.12 , clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X )
% 0.45/1.12 ) ) ] )
% 0.45/1.12 , 2, clause( 0, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.45/1.12 , 0, substitution( 0, [ :=( X, X ), :=( Y, or( X, X ) )] ), substitution( 1
% 0.45/1.12 , [ :=( X, X )] )).
% 0.45/1.12
% 0.45/1.12
% 0.45/1.12 subsumption(
% 0.45/1.12 clause( 13, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.45/1.12 , clause( 172, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.45/1.12 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.45/1.12 1 )] ) ).
% 0.45/1.12
% 0.45/1.12
% 0.45/1.12 resolution(
% 0.45/1.12 clause( 173, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 0.45/1.12 ) ) ) ) ] )
% 0.45/1.12 , clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X )
% 0.45/1.12 ) ) ] )
% 0.45/1.12 , 2, clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 0.45/1.12 ) ) ) ] )
% 0.45/1.12 , 0, substitution( 0, [ :=( X, or( X, or( Y, Z ) ) ), :=( Y, or( Y, or( X,
% 0.45/1.12 Z ) ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] )).
% 0.45/1.12
% 0.45/1.12
% 0.45/1.12 subsumption(
% 0.45/1.12 clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z )
% 0.45/1.12 ) ) ) ] )
% 0.45/1.12 , clause( 173, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X,
% 0.45/1.12 Z ) ) ) ) ] )
% 0.45/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.45/1.12 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.45/1.12
% 0.45/1.12
% 0.45/1.12 resolution(
% 0.45/1.12 clause( 174, [ theorem( or( X, or( not( Y ), Y ) ) ) ] )
% 0.45/1.12 , clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 0.45/1.12 ) ) ) ) ] )
% 0.45/1.12 , 1, clause( 9, [ theorem( or( not( X ), or( Y, X ) ) ) ] )
% 0.45/1.12 , 0, substitution( 0, [ :=( X, X ), :=( Y, not( Y ) ), :=( Z, Y )] ),
% 0.45/1.12 substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 0.45/1.12
% 0.45/1.12
% 0.45/1.12 subsumption(
% 0.45/1.12 clause( 59, [ theorem( or( X, or( not( Y ), Y ) ) ) ] )
% 0.45/1.12 , clause( 174, [ theorem( or( X, or( not( Y ), Y ) ) ) ] )
% 0.45/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.45/1.12 )] ) ).
% 0.45/1.12
% 0.45/1.12
% 0.45/1.12 resolution(
% 0.45/1.12 clause( 175, [ theorem( or( not( X ), X ) ) ] )
% 0.45/1.12 , clause( 13, [ theorem( X ), ~( theorem( or( X, X ) ) ) ] )
% 0.45/1.12 , 1, clause( 59, [ theorem( or( X, or( not( Y ), Y ) ) ) ] )
% 0.45/1.12 , 0, substitution( 0, [ :=( X, or( not( X ), X ) )] ), substitution( 1, [
% 0.45/1.12 :=( X, or( not( X ), X ) ), :=( Y, X )] )).
% 0.45/1.12
% 0.45/1.12
% 0.45/1.12 subsumption(
% 0.45/1.12 clause( 61, [ theorem( or( not( X ), X ) ) ] )
% 0.45/1.12 , clause( 175, [ theorem( or( not( X ), X ) ) ] )
% 0.45/1.12 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.45/1.12
% 0.45/1.12
% 0.45/1.12 resolution(
% 0.45/1.12 clause( 176, [ theorem( or( X, or( not( or( X, Y ) ), Y ) ) ) ] )
% 0.45/1.12 , clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 0.45/1.12 ) ) ) ) ] )
% 0.45/1.12 , 1, clause( 61, [ theorem( or( not( X ), X ) ) ] )
% 0.45/1.12 , 0, substitution( 0, [ :=( X, X ), :=( Y, not( or( X, Y ) ) ), :=( Z, Y )] )
% 0.45/1.12 , substitution( 1, [ :=( X, or( X, Y ) )] )).
% 0.45/1.12
% 0.45/1.12
% 0.45/1.12 subsumption(
% 0.45/1.12 clause( 63, [ theorem( or( X, or( not( or( X, Y ) ), Y ) ) ) ] )
% 0.45/1.12 , clause( 176, [ theorem( or( X, or( not( or( X, Y ) ), Y ) ) ) ] )
% 0.45/1.12 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.45/1.12 )] ) ).
% 0.45/1.12
% 0.45/1.12
% 0.45/1.12 resolution(
% 0.45/1.12 clause( 177, [] )
% 0.45/1.12 , clause( 8, [ ~( theorem( or( p, or( not( or( p, q ) ), q ) ) ) ) ] )
% 0.45/1.12 , 0, clause( 63, [ theorem( or( X, or( not( or( X, Y ) ), Y ) ) ) ] )
% 0.45/1.12 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, p ), :=( Y, q )] )
% 0.45/1.12 ).
% 0.45/1.12
% 0.45/1.12
% 0.45/1.12 subsumption(
% 0.45/1.12 clause( 160, [] )
% 0.45/1.12 , clause( 177, [] )
% 0.45/1.12 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.45/1.12
% 0.45/1.12
% 0.45/1.12 end.
% 0.45/1.12
% 0.45/1.12 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.45/1.12
% 0.45/1.12 Memory use:
% 0.45/1.12
% 0.45/1.12 space for terms: 2146
% 0.45/1.12 space for clauses: 12209
% 0.45/1.12
% 0.45/1.12
% 0.45/1.12 clauses generated: 290
% 0.45/1.12 clauses kept: 161
% 0.45/1.12 clauses selected: 67
% 0.45/1.12 clauses deleted: 0
% 0.45/1.12 clauses inuse deleted: 0
% 0.45/1.12
% 0.45/1.12 subsentry: 164
% 0.45/1.12 literals s-matched: 164
% 0.45/1.12 literals matched: 164
% 0.45/1.12 full subsumption: 0
% 0.45/1.12
% 0.45/1.12 checksum: -1295256679
% 0.45/1.12
% 0.45/1.12
% 0.45/1.12 Bliksem ended
%------------------------------------------------------------------------------