TSTP Solution File: LCL174-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL174-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:15 EDT 2022
% Result : Unsatisfiable 0.76s 1.15s
% Output : Refutation 0.76s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL174-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.14 % Command : bliksem %s
% 0.13/0.35 % Computer : n011.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 : Sun Jul 3 20:09:36 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.76/1.15 *** allocated 10000 integers for termspace/termends
% 0.76/1.15 *** allocated 10000 integers for clauses
% 0.76/1.15 *** allocated 10000 integers for justifications
% 0.76/1.15 Bliksem 1.12
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 Automatic Strategy Selection
% 0.76/1.15
% 0.76/1.15 Clauses:
% 0.76/1.15 [
% 0.76/1.15 [ axiom( or( not( or( X, X ) ), X ) ) ],
% 0.76/1.15 [ axiom( or( not( X ), or( Y, X ) ) ) ],
% 0.76/1.15 [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ],
% 0.76/1.15 [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) ) ],
% 0.76/1.15 [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or( Z, Y )
% 0.76/1.15 ) ) ) ],
% 0.76/1.15 [ theorem( X ), ~( axiom( X ) ) ],
% 0.76/1.15 [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem( Y ) ) ]
% 0.76/1.15 ,
% 0.76/1.15 [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z ) ) ), ~(
% 0.76/1.15 theorem( or( not( Z ), Y ) ) ) ],
% 0.76/1.15 [ ~( theorem( or( not( or( not( p ), q ) ), or( not( or( not( q ), r ) )
% 0.76/1.15 , or( not( p ), r ) ) ) ) ) ]
% 0.76/1.15 ] .
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 percentage equality = 0.000000, percentage horn = 1.000000
% 0.76/1.15 This is a near-Horn, non-equality problem
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 Options Used:
% 0.76/1.15
% 0.76/1.15 useres = 1
% 0.76/1.15 useparamod = 0
% 0.76/1.15 useeqrefl = 0
% 0.76/1.15 useeqfact = 0
% 0.76/1.15 usefactor = 1
% 0.76/1.15 usesimpsplitting = 0
% 0.76/1.15 usesimpdemod = 0
% 0.76/1.15 usesimpres = 4
% 0.76/1.15
% 0.76/1.15 resimpinuse = 1000
% 0.76/1.15 resimpclauses = 20000
% 0.76/1.15 substype = standard
% 0.76/1.15 backwardsubs = 1
% 0.76/1.15 selectoldest = 5
% 0.76/1.15
% 0.76/1.15 litorderings [0] = split
% 0.76/1.15 litorderings [1] = liftord
% 0.76/1.15
% 0.76/1.15 termordering = none
% 0.76/1.15
% 0.76/1.15 litapriori = 1
% 0.76/1.15 termapriori = 0
% 0.76/1.15 litaposteriori = 0
% 0.76/1.15 termaposteriori = 0
% 0.76/1.15 demodaposteriori = 0
% 0.76/1.15 ordereqreflfact = 0
% 0.76/1.15
% 0.76/1.15 litselect = negative
% 0.76/1.15
% 0.76/1.15 maxweight = 30000
% 0.76/1.15 maxdepth = 30000
% 0.76/1.15 maxlength = 115
% 0.76/1.15 maxnrvars = 195
% 0.76/1.15 excuselevel = 0
% 0.76/1.15 increasemaxweight = 0
% 0.76/1.15
% 0.76/1.15 maxselected = 10000000
% 0.76/1.15 maxnrclauses = 10000000
% 0.76/1.15
% 0.76/1.15 showgenerated = 0
% 0.76/1.15 showkept = 0
% 0.76/1.15 showselected = 0
% 0.76/1.15 showdeleted = 0
% 0.76/1.15 showresimp = 1
% 0.76/1.15 showstatus = 2000
% 0.76/1.15
% 0.76/1.15 prologoutput = 1
% 0.76/1.15 nrgoals = 5000000
% 0.76/1.15 totalproof = 1
% 0.76/1.15
% 0.76/1.15 Symbols occurring in the translation:
% 0.76/1.15
% 0.76/1.15 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.76/1.15 . [1, 2] (w:1, o:26, a:1, s:1, b:0),
% 0.76/1.15 ! [4, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.76/1.15 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.76/1.15 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.76/1.15 or [40, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.76/1.15 not [41, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.76/1.15 axiom [42, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.76/1.15 theorem [46, 1] (w:1, o:25, a:1, s:1, b:0),
% 0.76/1.15 p [49, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.76/1.15 q [50, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.76/1.15 r [51, 0] (w:1, o:17, a:1, s:1, b:0).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 Starting Search:
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 Bliksems!, er is een bewijs:
% 0.76/1.15 % SZS status Unsatisfiable
% 0.76/1.15 % SZS output start Refutation
% 0.76/1.15
% 0.76/1.15 clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) )
% 0.76/1.15 ] )
% 0.76/1.15 .
% 0.76/1.15 clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or(
% 0.76/1.15 Z, Y ) ) ) ) ] )
% 0.76/1.15 .
% 0.76/1.15 clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.76/1.15 .
% 0.76/1.15 clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X ) )
% 0.76/1.15 ) ] )
% 0.76/1.15 .
% 0.76/1.15 clause( 8, [ ~( theorem( or( not( or( not( p ), q ) ), or( not( or( not( q
% 0.76/1.15 ), r ) ), or( not( p ), r ) ) ) ) ) ] )
% 0.76/1.15 .
% 0.76/1.15 clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z )
% 0.76/1.15 ) ) ) ] )
% 0.76/1.15 .
% 0.76/1.15 clause( 28, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) )
% 0.76/1.15 , or( Z, Y ) ) ) ) ] )
% 0.76/1.15 .
% 0.76/1.15 clause( 100, [ theorem( or( not( or( X, Y ) ), or( not( or( not( Y ), Z ) )
% 0.76/1.15 , or( X, Z ) ) ) ) ] )
% 0.76/1.15 .
% 0.76/1.15 clause( 760, [] )
% 0.76/1.15 .
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 % SZS output end Refutation
% 0.76/1.15 found a proof!
% 0.76/1.15
% 0.76/1.15 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.76/1.15
% 0.76/1.15 initialclauses(
% 0.76/1.15 [ clause( 762, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.76/1.15 , clause( 763, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.76/1.15 , clause( 764, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.76/1.15 , clause( 765, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) )
% 0.76/1.15 ) ) ] )
% 0.76/1.15 , clause( 766, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) )
% 0.76/1.15 , or( Z, Y ) ) ) ) ] )
% 0.76/1.15 , clause( 767, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.76/1.15 , clause( 768, [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem(
% 0.76/1.15 Y ) ) ] )
% 0.76/1.15 , clause( 769, [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z )
% 0.76/1.15 ) ), ~( theorem( or( not( Z ), Y ) ) ) ] )
% 0.76/1.15 , clause( 770, [ ~( theorem( or( not( or( not( p ), q ) ), or( not( or( not(
% 0.76/1.15 q ), r ) ), or( not( p ), r ) ) ) ) ) ] )
% 0.76/1.15 ] ).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 subsumption(
% 0.76/1.15 clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) )
% 0.76/1.15 ] )
% 0.76/1.15 , clause( 765, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) )
% 0.76/1.15 ) ) ] )
% 0.76/1.15 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.76/1.15 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 subsumption(
% 0.76/1.15 clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or(
% 0.76/1.15 Z, Y ) ) ) ) ] )
% 0.76/1.15 , clause( 766, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) )
% 0.76/1.15 , or( Z, Y ) ) ) ) ] )
% 0.76/1.15 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.76/1.15 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 subsumption(
% 0.76/1.15 clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.76/1.15 , clause( 767, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.76/1.15 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.76/1.15 1 )] ) ).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 subsumption(
% 0.76/1.15 clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X ) )
% 0.76/1.15 ) ] )
% 0.76/1.15 , clause( 768, [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem(
% 0.76/1.15 Y ) ) ] )
% 0.76/1.15 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.76/1.15 ), ==>( 1, 2 ), ==>( 2, 1 )] ) ).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 subsumption(
% 0.76/1.15 clause( 8, [ ~( theorem( or( not( or( not( p ), q ) ), or( not( or( not( q
% 0.76/1.15 ), r ) ), or( not( p ), r ) ) ) ) ) ] )
% 0.76/1.15 , clause( 770, [ ~( theorem( or( not( or( not( p ), q ) ), or( not( or( not(
% 0.76/1.15 q ), r ) ), or( not( p ), r ) ) ) ) ) ] )
% 0.76/1.15 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 resolution(
% 0.76/1.15 clause( 771, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 0.76/1.15 ) ) ) ) ] )
% 0.76/1.15 , clause( 6, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( or( not( Y ), X )
% 0.76/1.15 ) ) ] )
% 0.76/1.15 , 2, clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 0.76/1.15 ) ) ) ] )
% 0.76/1.15 , 0, substitution( 0, [ :=( X, or( X, or( Y, Z ) ) ), :=( Y, or( Y, or( X,
% 0.76/1.15 Z ) ) )] ), substitution( 1, [ :=( X, Y ), :=( Y, X ), :=( Z, Z )] )).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 subsumption(
% 0.76/1.15 clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z )
% 0.76/1.15 ) ) ) ] )
% 0.76/1.15 , clause( 771, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X,
% 0.76/1.15 Z ) ) ) ) ] )
% 0.76/1.15 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.76/1.15 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 )] ) ).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 resolution(
% 0.76/1.15 clause( 772, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) )
% 0.76/1.15 , or( Z, Y ) ) ) ) ] )
% 0.76/1.15 , clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.76/1.15 , 1, clause( 4, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 0.76/1.15 ), or( Z, Y ) ) ) ) ] )
% 0.76/1.15 , 0, substitution( 0, [ :=( X, or( not( or( not( X ), Y ) ), or( not( or( Z
% 0.76/1.15 , X ) ), or( Z, Y ) ) ) )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ),
% 0.76/1.15 :=( Z, Z )] )).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 subsumption(
% 0.76/1.15 clause( 28, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) )
% 0.76/1.15 , or( Z, Y ) ) ) ) ] )
% 0.76/1.15 , clause( 772, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Z, X )
% 0.76/1.15 ), or( Z, Y ) ) ) ) ] )
% 0.76/1.15 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.76/1.15 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 resolution(
% 0.76/1.15 clause( 773, [ theorem( or( not( or( X, Y ) ), or( not( or( not( Y ), Z ) )
% 0.76/1.15 , or( X, Z ) ) ) ) ] )
% 0.76/1.15 , clause( 18, [ theorem( or( X, or( Y, Z ) ) ), ~( theorem( or( Y, or( X, Z
% 0.76/1.15 ) ) ) ) ] )
% 0.76/1.15 , 1, clause( 28, [ theorem( or( not( or( not( X ), Y ) ), or( not( or( Z, X
% 0.76/1.15 ) ), or( Z, Y ) ) ) ) ] )
% 0.76/1.15 , 0, substitution( 0, [ :=( X, not( or( X, Y ) ) ), :=( Y, not( or( not( Y
% 0.76/1.15 ), Z ) ) ), :=( Z, or( X, Z ) )] ), substitution( 1, [ :=( X, Y ), :=( Y
% 0.76/1.15 , Z ), :=( Z, X )] )).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 subsumption(
% 0.76/1.15 clause( 100, [ theorem( or( not( or( X, Y ) ), or( not( or( not( Y ), Z ) )
% 0.76/1.15 , or( X, Z ) ) ) ) ] )
% 0.76/1.15 , clause( 773, [ theorem( or( not( or( X, Y ) ), or( not( or( not( Y ), Z )
% 0.76/1.15 ), or( X, Z ) ) ) ) ] )
% 0.76/1.15 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.76/1.15 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 resolution(
% 0.76/1.15 clause( 774, [] )
% 0.76/1.15 , clause( 8, [ ~( theorem( or( not( or( not( p ), q ) ), or( not( or( not(
% 0.76/1.15 q ), r ) ), or( not( p ), r ) ) ) ) ) ] )
% 0.76/1.15 , 0, clause( 100, [ theorem( or( not( or( X, Y ) ), or( not( or( not( Y ),
% 0.76/1.15 Z ) ), or( X, Z ) ) ) ) ] )
% 0.76/1.15 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, not( p ) ), :=( Y, q
% 0.76/1.15 ), :=( Z, r )] )).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 subsumption(
% 0.76/1.15 clause( 760, [] )
% 0.76/1.15 , clause( 774, [] )
% 0.76/1.15 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 end.
% 0.76/1.15
% 0.76/1.15 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.76/1.15
% 0.76/1.15 Memory use:
% 0.76/1.15
% 0.76/1.15 space for terms: 10468
% 0.76/1.15 space for clauses: 57807
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 clauses generated: 1426
% 0.76/1.15 clauses kept: 761
% 0.76/1.15 clauses selected: 241
% 0.76/1.15 clauses deleted: 0
% 0.76/1.15 clauses inuse deleted: 0
% 0.76/1.15
% 0.76/1.15 subsentry: 707
% 0.76/1.15 literals s-matched: 707
% 0.76/1.15 literals matched: 707
% 0.76/1.15 full subsumption: 0
% 0.76/1.15
% 0.76/1.15 checksum: 1783312677
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 Bliksem ended
%------------------------------------------------------------------------------