TSTP Solution File: LCL169-3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL169-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n023.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:10 EDT 2022
% Result : Unsatisfiable 0.71s 1.09s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL169-3 : TPTP v8.1.0. Released v2.3.0.
% 0.04/0.13 % Command : bliksem %s
% 0.14/0.34 % Computer : n023.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % DateTime : Mon Jul 4 07:17:27 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.71/1.09 *** allocated 10000 integers for termspace/termends
% 0.71/1.09 *** allocated 10000 integers for clauses
% 0.71/1.09 *** allocated 10000 integers for justifications
% 0.71/1.09 Bliksem 1.12
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Automatic Strategy Selection
% 0.71/1.09
% 0.71/1.09 Clauses:
% 0.71/1.09 [
% 0.71/1.09 [ axiom( implies( or( X, X ), X ) ) ],
% 0.71/1.09 [ axiom( implies( X, or( Y, X ) ) ) ],
% 0.71/1.09 [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ],
% 0.71/1.09 [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ],
% 0.71/1.09 [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or( Z, Y ) ) ) )
% 0.71/1.09 ],
% 0.71/1.09 [ =( implies( X, Y ), or( not( X ), Y ) ) ],
% 0.71/1.09 [ theorem( X ), ~( axiom( X ) ) ],
% 0.71/1.09 [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y ) ) ]
% 0.71/1.09 ,
% 0.71/1.09 [ ~( theorem( implies( implies( p, not( p ) ), not( p ) ) ) ) ]
% 0.71/1.09 ] .
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 percentage equality = 0.083333, percentage horn = 1.000000
% 0.71/1.09 This is a problem with some equality
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Options Used:
% 0.71/1.09
% 0.71/1.09 useres = 1
% 0.71/1.09 useparamod = 1
% 0.71/1.09 useeqrefl = 1
% 0.71/1.09 useeqfact = 1
% 0.71/1.09 usefactor = 1
% 0.71/1.09 usesimpsplitting = 0
% 0.71/1.09 usesimpdemod = 5
% 0.71/1.09 usesimpres = 3
% 0.71/1.09
% 0.71/1.09 resimpinuse = 1000
% 0.71/1.09 resimpclauses = 20000
% 0.71/1.09 substype = eqrewr
% 0.71/1.09 backwardsubs = 1
% 0.71/1.09 selectoldest = 5
% 0.71/1.09
% 0.71/1.09 litorderings [0] = split
% 0.71/1.09 litorderings [1] = extend the termordering, first sorting on arguments
% 0.71/1.09
% 0.71/1.09 termordering = kbo
% 0.71/1.09
% 0.71/1.09 litapriori = 0
% 0.71/1.09 termapriori = 1
% 0.71/1.09 litaposteriori = 0
% 0.71/1.09 termaposteriori = 0
% 0.71/1.09 demodaposteriori = 0
% 0.71/1.09 ordereqreflfact = 0
% 0.71/1.09
% 0.71/1.09 litselect = negord
% 0.71/1.09
% 0.71/1.09 maxweight = 15
% 0.71/1.09 maxdepth = 30000
% 0.71/1.09 maxlength = 115
% 0.71/1.09 maxnrvars = 195
% 0.71/1.09 excuselevel = 1
% 0.71/1.09 increasemaxweight = 1
% 0.71/1.09
% 0.71/1.09 maxselected = 10000000
% 0.71/1.09 maxnrclauses = 10000000
% 0.71/1.09
% 0.71/1.09 showgenerated = 0
% 0.71/1.09 showkept = 0
% 0.71/1.09 showselected = 0
% 0.71/1.09 showdeleted = 0
% 0.71/1.09 showresimp = 1
% 0.71/1.09 showstatus = 2000
% 0.71/1.09
% 0.71/1.09 prologoutput = 1
% 0.71/1.09 nrgoals = 5000000
% 0.71/1.09 totalproof = 1
% 0.71/1.09
% 0.71/1.09 Symbols occurring in the translation:
% 0.71/1.09
% 0.71/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.71/1.09 . [1, 2] (w:1, o:23, a:1, s:1, b:0),
% 0.71/1.09 ! [4, 1] (w:0, o:15, a:1, s:1, b:0),
% 0.71/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.71/1.09 or [40, 2] (w:1, o:48, a:1, s:1, b:0),
% 0.71/1.09 implies [41, 2] (w:1, o:49, a:1, s:1, b:0),
% 0.71/1.09 axiom [42, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.71/1.09 not [47, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.71/1.09 theorem [48, 1] (w:1, o:22, a:1, s:1, b:0),
% 0.71/1.09 p [49, 0] (w:1, o:14, a:1, s:1, b:0).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Starting Search:
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 Bliksems!, er is een bewijs:
% 0.71/1.09 % SZS status Unsatisfiable
% 0.71/1.09 % SZS output start Refutation
% 0.71/1.09
% 0.71/1.09 clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 8, [ ~( theorem( implies( implies( p, not( p ) ), not( p ) ) ) ) ]
% 0.71/1.09 )
% 0.71/1.09 .
% 0.71/1.09 clause( 10, [ theorem( implies( or( X, X ), X ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 131, [ theorem( implies( implies( X, not( X ) ), not( X ) ) ) ] )
% 0.71/1.09 .
% 0.71/1.09 clause( 165, [] )
% 0.71/1.09 .
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 % SZS output end Refutation
% 0.71/1.09 found a proof!
% 0.71/1.09
% 0.71/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.09
% 0.71/1.09 initialclauses(
% 0.71/1.09 [ clause( 167, [ axiom( implies( or( X, X ), X ) ) ] )
% 0.71/1.09 , clause( 168, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 0.71/1.09 , clause( 169, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 0.71/1.09 , clause( 170, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) )
% 0.71/1.09 ) ] )
% 0.71/1.09 , clause( 171, [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or(
% 0.71/1.09 Z, Y ) ) ) ) ] )
% 0.71/1.09 , clause( 172, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 0.71/1.09 , clause( 173, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.71/1.09 , clause( 174, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem(
% 0.71/1.09 Y ) ) ] )
% 0.71/1.09 , clause( 175, [ ~( theorem( implies( implies( p, not( p ) ), not( p ) ) )
% 0.71/1.09 ) ] )
% 0.71/1.09 ] ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 0.71/1.09 , clause( 167, [ axiom( implies( or( X, X ), X ) ) ] )
% 0.71/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 eqswap(
% 0.71/1.09 clause( 176, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.71/1.09 , clause( 172, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 0.71/1.09 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.71/1.09 , clause( 176, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.71/1.09 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.71/1.09 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.71/1.09 , clause( 173, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.71/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.71/1.09 1 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 8, [ ~( theorem( implies( implies( p, not( p ) ), not( p ) ) ) ) ]
% 0.71/1.09 )
% 0.71/1.09 , clause( 175, [ ~( theorem( implies( implies( p, not( p ) ), not( p ) ) )
% 0.71/1.09 ) ] )
% 0.71/1.09 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 resolution(
% 0.71/1.09 clause( 179, [ theorem( implies( or( X, X ), X ) ) ] )
% 0.71/1.09 , clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 0.71/1.09 , 1, clause( 0, [ axiom( implies( or( X, X ), X ) ) ] )
% 0.71/1.09 , 0, substitution( 0, [ :=( X, implies( or( X, X ), X ) )] ),
% 0.71/1.09 substitution( 1, [ :=( X, X )] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 10, [ theorem( implies( or( X, X ), X ) ) ] )
% 0.71/1.09 , clause( 179, [ theorem( implies( or( X, X ), X ) ) ] )
% 0.71/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 paramod(
% 0.71/1.09 clause( 181, [ theorem( implies( implies( X, not( X ) ), not( X ) ) ) ] )
% 0.71/1.09 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 0.71/1.09 , 0, clause( 10, [ theorem( implies( or( X, X ), X ) ) ] )
% 0.71/1.09 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, not( X ) )] ), substitution(
% 0.71/1.09 1, [ :=( X, not( X ) )] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 131, [ theorem( implies( implies( X, not( X ) ), not( X ) ) ) ] )
% 0.71/1.09 , clause( 181, [ theorem( implies( implies( X, not( X ) ), not( X ) ) ) ]
% 0.71/1.09 )
% 0.71/1.09 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 resolution(
% 0.71/1.09 clause( 182, [] )
% 0.71/1.09 , clause( 8, [ ~( theorem( implies( implies( p, not( p ) ), not( p ) ) ) )
% 0.71/1.09 ] )
% 0.71/1.09 , 0, clause( 131, [ theorem( implies( implies( X, not( X ) ), not( X ) ) )
% 0.71/1.09 ] )
% 0.71/1.09 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, p )] )).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 subsumption(
% 0.71/1.09 clause( 165, [] )
% 0.71/1.09 , clause( 182, [] )
% 0.71/1.09 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 end.
% 0.71/1.09
% 0.71/1.09 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.71/1.09
% 0.71/1.09 Memory use:
% 0.71/1.09
% 0.71/1.09 space for terms: 1973
% 0.71/1.09 space for clauses: 9406
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 clauses generated: 236
% 0.71/1.10 clauses kept: 166
% 0.71/1.10 clauses selected: 25
% 0.71/1.10 clauses deleted: 1
% 0.71/1.10 clauses inuse deleted: 0
% 0.71/1.10
% 0.71/1.10 subsentry: 637
% 0.71/1.10 literals s-matched: 555
% 0.71/1.10 literals matched: 550
% 0.71/1.10 full subsumption: 81
% 0.71/1.10
% 0.71/1.10 checksum: -1100669911
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 Bliksem ended
%------------------------------------------------------------------------------