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