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