TSTP Solution File: LCL172-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL172-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:13 EDT 2022
% Result : Unsatisfiable 0.68s 1.09s
% Output : Refutation 0.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : LCL172-1 : TPTP v8.1.0. Released v1.1.0.
% 0.08/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n005.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 19:58:07 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.68/1.09 *** allocated 10000 integers for termspace/termends
% 0.68/1.09 *** allocated 10000 integers for clauses
% 0.68/1.09 *** allocated 10000 integers for justifications
% 0.68/1.09 Bliksem 1.12
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 Automatic Strategy Selection
% 0.68/1.09
% 0.68/1.09 Clauses:
% 0.68/1.09 [
% 0.68/1.09 [ axiom( or( not( or( X, X ) ), X ) ) ],
% 0.68/1.09 [ axiom( or( not( X ), or( Y, X ) ) ) ],
% 0.68/1.09 [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ],
% 0.68/1.09 [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) ) ],
% 0.68/1.09 [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) ), or( Z, Y )
% 0.68/1.09 ) ) ) ],
% 0.68/1.09 [ theorem( X ), ~( axiom( X ) ) ],
% 0.68/1.09 [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem( Y ) ) ]
% 0.68/1.09 ,
% 0.68/1.09 [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z ) ) ), ~(
% 0.68/1.09 theorem( or( not( Z ), Y ) ) ) ],
% 0.68/1.09 [ ~( theorem( or( not( or( not( p ), or( not( q ), r ) ) ), or( not( q )
% 0.68/1.09 , or( not( p ), r ) ) ) ) ) ]
% 0.68/1.09 ] .
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 percentage equality = 0.000000, percentage horn = 1.000000
% 0.68/1.09 This is a near-Horn, non-equality problem
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 Options Used:
% 0.68/1.09
% 0.68/1.09 useres = 1
% 0.68/1.09 useparamod = 0
% 0.68/1.09 useeqrefl = 0
% 0.68/1.09 useeqfact = 0
% 0.68/1.09 usefactor = 1
% 0.68/1.09 usesimpsplitting = 0
% 0.68/1.09 usesimpdemod = 0
% 0.68/1.09 usesimpres = 4
% 0.68/1.09
% 0.68/1.09 resimpinuse = 1000
% 0.68/1.09 resimpclauses = 20000
% 0.68/1.09 substype = standard
% 0.68/1.09 backwardsubs = 1
% 0.68/1.09 selectoldest = 5
% 0.68/1.09
% 0.68/1.09 litorderings [0] = split
% 0.68/1.09 litorderings [1] = liftord
% 0.68/1.09
% 0.68/1.09 termordering = none
% 0.68/1.09
% 0.68/1.09 litapriori = 1
% 0.68/1.09 termapriori = 0
% 0.68/1.09 litaposteriori = 0
% 0.68/1.09 termaposteriori = 0
% 0.68/1.09 demodaposteriori = 0
% 0.68/1.09 ordereqreflfact = 0
% 0.68/1.09
% 0.68/1.09 litselect = negative
% 0.68/1.09
% 0.68/1.09 maxweight = 30000
% 0.68/1.09 maxdepth = 30000
% 0.68/1.09 maxlength = 115
% 0.68/1.09 maxnrvars = 195
% 0.68/1.09 excuselevel = 0
% 0.68/1.09 increasemaxweight = 0
% 0.68/1.09
% 0.68/1.09 maxselected = 10000000
% 0.68/1.09 maxnrclauses = 10000000
% 0.68/1.09
% 0.68/1.09 showgenerated = 0
% 0.68/1.09 showkept = 0
% 0.68/1.09 showselected = 0
% 0.68/1.09 showdeleted = 0
% 0.68/1.09 showresimp = 1
% 0.68/1.09 showstatus = 2000
% 0.68/1.09
% 0.68/1.09 prologoutput = 1
% 0.68/1.09 nrgoals = 5000000
% 0.68/1.09 totalproof = 1
% 0.68/1.09
% 0.68/1.09 Symbols occurring in the translation:
% 0.68/1.09
% 0.68/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.68/1.09 . [1, 2] (w:1, o:26, a:1, s:1, b:0),
% 0.68/1.09 ! [4, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.68/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.68/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.68/1.09 or [40, 2] (w:1, o:51, a:1, s:1, b:0),
% 0.68/1.09 not [41, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.68/1.09 axiom [42, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.68/1.09 theorem [46, 1] (w:1, o:25, a:1, s:1, b:0),
% 0.68/1.09 p [49, 0] (w:1, o:15, a:1, s:1, b:0),
% 0.68/1.09 q [50, 0] (w:1, o:16, a:1, s:1, b:0),
% 0.68/1.09 r [51, 0] (w:1, o:17, a:1, s:1, b:0).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 Starting Search:
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 Bliksems!, er is een bewijs:
% 0.68/1.09 % SZS status Unsatisfiable
% 0.68/1.09 % SZS output start Refutation
% 0.68/1.09
% 0.68/1.09 clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) )
% 0.68/1.09 ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 8, [ ~( theorem( or( not( or( not( p ), or( not( q ), r ) ) ), or(
% 0.68/1.09 not( q ), or( not( p ), r ) ) ) ) ) ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 19, [ theorem( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) )
% 0.68/1.09 ) ) ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 45, [] )
% 0.68/1.09 .
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 % SZS output end Refutation
% 0.68/1.09 found a proof!
% 0.68/1.09
% 0.68/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.68/1.09
% 0.68/1.09 initialclauses(
% 0.68/1.09 [ clause( 47, [ axiom( or( not( or( X, X ) ), X ) ) ] )
% 0.68/1.09 , clause( 48, [ axiom( or( not( X ), or( Y, X ) ) ) ] )
% 0.68/1.09 , clause( 49, [ axiom( or( not( or( X, Y ) ), or( Y, X ) ) ) ] )
% 0.68/1.09 , clause( 50, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) )
% 0.68/1.09 ) ) ] )
% 0.68/1.09 , clause( 51, [ axiom( or( not( or( not( X ), Y ) ), or( not( or( Z, X ) )
% 0.68/1.09 , or( Z, Y ) ) ) ) ] )
% 0.68/1.09 , clause( 52, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.68/1.09 , clause( 53, [ theorem( X ), ~( axiom( or( not( Y ), X ) ) ), ~( theorem(
% 0.68/1.09 Y ) ) ] )
% 0.68/1.09 , clause( 54, [ theorem( or( not( X ), Y ) ), ~( axiom( or( not( X ), Z ) )
% 0.68/1.09 ), ~( theorem( or( not( Z ), Y ) ) ) ] )
% 0.68/1.09 , clause( 55, [ ~( theorem( or( not( or( not( p ), or( not( q ), r ) ) ),
% 0.68/1.09 or( not( q ), or( not( p ), r ) ) ) ) ) ] )
% 0.68/1.09 ] ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) ) ) )
% 0.68/1.09 ] )
% 0.68/1.09 , clause( 50, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) )
% 0.68/1.09 ) ) ] )
% 0.68/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.68/1.09 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.68/1.09 , clause( 52, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.68/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.68/1.09 1 )] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 8, [ ~( theorem( or( not( or( not( p ), or( not( q ), r ) ) ), or(
% 0.68/1.09 not( q ), or( not( p ), r ) ) ) ) ) ] )
% 0.68/1.09 , clause( 55, [ ~( theorem( or( not( or( not( p ), or( not( q ), r ) ) ),
% 0.68/1.09 or( not( q ), or( not( p ), r ) ) ) ) ) ] )
% 0.68/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 resolution(
% 0.68/1.09 clause( 56, [ theorem( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) )
% 0.68/1.09 ) ) ] )
% 0.68/1.09 , clause( 5, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.68/1.09 , 1, clause( 3, [ axiom( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 0.68/1.09 ) ) ) ] )
% 0.68/1.09 , 0, substitution( 0, [ :=( X, or( not( or( X, or( Y, Z ) ) ), or( Y, or( X
% 0.68/1.09 , Z ) ) ) )] ), substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )
% 0.68/1.09 ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 19, [ theorem( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z ) )
% 0.68/1.09 ) ) ] )
% 0.68/1.09 , clause( 56, [ theorem( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z )
% 0.68/1.09 ) ) ) ] )
% 0.68/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.68/1.09 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 resolution(
% 0.68/1.09 clause( 57, [] )
% 0.68/1.09 , clause( 8, [ ~( theorem( or( not( or( not( p ), or( not( q ), r ) ) ), or(
% 0.68/1.09 not( q ), or( not( p ), r ) ) ) ) ) ] )
% 0.68/1.09 , 0, clause( 19, [ theorem( or( not( or( X, or( Y, Z ) ) ), or( Y, or( X, Z
% 0.68/1.09 ) ) ) ) ] )
% 0.68/1.09 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, not( p ) ), :=( Y,
% 0.68/1.09 not( q ) ), :=( Z, r )] )).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 subsumption(
% 0.68/1.09 clause( 45, [] )
% 0.68/1.09 , clause( 57, [] )
% 0.68/1.09 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 end.
% 0.68/1.09
% 0.68/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.68/1.09
% 0.68/1.09 Memory use:
% 0.68/1.09
% 0.68/1.09 space for terms: 747
% 0.68/1.09 space for clauses: 3563
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 clauses generated: 61
% 0.68/1.09 clauses kept: 46
% 0.68/1.09 clauses selected: 25
% 0.68/1.09 clauses deleted: 1
% 0.68/1.09 clauses inuse deleted: 0
% 0.68/1.09
% 0.68/1.09 subsentry: 38
% 0.68/1.09 literals s-matched: 38
% 0.68/1.09 literals matched: 38
% 0.68/1.09 full subsumption: 0
% 0.68/1.09
% 0.68/1.09 checksum: 1080607000
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 Bliksem ended
%------------------------------------------------------------------------------