TSTP Solution File: LCL321-3 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL321-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n018.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:52:44 EDT 2022
% Result : Unsatisfiable 1.92s 2.35s
% Output : Refutation 1.92s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL321-3 : TPTP v8.1.0. Released v2.3.0.
% 0.03/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n018.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 18:58:05 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.92/2.35 *** allocated 10000 integers for termspace/termends
% 1.92/2.35 *** allocated 10000 integers for clauses
% 1.92/2.35 *** allocated 10000 integers for justifications
% 1.92/2.35 Bliksem 1.12
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 Automatic Strategy Selection
% 1.92/2.35
% 1.92/2.35 Clauses:
% 1.92/2.35 [
% 1.92/2.35 [ axiom( implies( or( X, X ), X ) ) ],
% 1.92/2.35 [ axiom( implies( X, or( Y, X ) ) ) ],
% 1.92/2.35 [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ],
% 1.92/2.35 [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ],
% 1.92/2.35 [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or( Z, Y ) ) ) )
% 1.92/2.35 ],
% 1.92/2.35 [ =( implies( X, Y ), or( not( X ), Y ) ) ],
% 1.92/2.35 [ theorem( X ), ~( axiom( X ) ) ],
% 1.92/2.35 [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y ) ) ]
% 1.92/2.35 ,
% 1.92/2.35 [ ~( theorem( or( implies( p, q ), implies( p, not( q ) ) ) ) ) ]
% 1.92/2.35 ] .
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 percentage equality = 0.083333, percentage horn = 1.000000
% 1.92/2.35 This is a problem with some equality
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 Options Used:
% 1.92/2.35
% 1.92/2.35 useres = 1
% 1.92/2.35 useparamod = 1
% 1.92/2.35 useeqrefl = 1
% 1.92/2.35 useeqfact = 1
% 1.92/2.35 usefactor = 1
% 1.92/2.35 usesimpsplitting = 0
% 1.92/2.35 usesimpdemod = 5
% 1.92/2.35 usesimpres = 3
% 1.92/2.35
% 1.92/2.35 resimpinuse = 1000
% 1.92/2.35 resimpclauses = 20000
% 1.92/2.35 substype = eqrewr
% 1.92/2.35 backwardsubs = 1
% 1.92/2.35 selectoldest = 5
% 1.92/2.35
% 1.92/2.35 litorderings [0] = split
% 1.92/2.35 litorderings [1] = extend the termordering, first sorting on arguments
% 1.92/2.35
% 1.92/2.35 termordering = kbo
% 1.92/2.35
% 1.92/2.35 litapriori = 0
% 1.92/2.35 termapriori = 1
% 1.92/2.35 litaposteriori = 0
% 1.92/2.35 termaposteriori = 0
% 1.92/2.35 demodaposteriori = 0
% 1.92/2.35 ordereqreflfact = 0
% 1.92/2.35
% 1.92/2.35 litselect = negord
% 1.92/2.35
% 1.92/2.35 maxweight = 15
% 1.92/2.35 maxdepth = 30000
% 1.92/2.35 maxlength = 115
% 1.92/2.35 maxnrvars = 195
% 1.92/2.35 excuselevel = 1
% 1.92/2.35 increasemaxweight = 1
% 1.92/2.35
% 1.92/2.35 maxselected = 10000000
% 1.92/2.35 maxnrclauses = 10000000
% 1.92/2.35
% 1.92/2.35 showgenerated = 0
% 1.92/2.35 showkept = 0
% 1.92/2.35 showselected = 0
% 1.92/2.35 showdeleted = 0
% 1.92/2.35 showresimp = 1
% 1.92/2.35 showstatus = 2000
% 1.92/2.35
% 1.92/2.35 prologoutput = 1
% 1.92/2.35 nrgoals = 5000000
% 1.92/2.35 totalproof = 1
% 1.92/2.35
% 1.92/2.35 Symbols occurring in the translation:
% 1.92/2.35
% 1.92/2.35 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 1.92/2.35 . [1, 2] (w:1, o:24, a:1, s:1, b:0),
% 1.92/2.35 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 1.92/2.35 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.92/2.35 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 1.92/2.35 or [40, 2] (w:1, o:49, a:1, s:1, b:0),
% 1.92/2.35 implies [41, 2] (w:1, o:50, a:1, s:1, b:0),
% 1.92/2.35 axiom [42, 1] (w:1, o:21, a:1, s:1, b:0),
% 1.92/2.35 not [47, 1] (w:1, o:22, a:1, s:1, b:0),
% 1.92/2.35 theorem [48, 1] (w:1, o:23, a:1, s:1, b:0),
% 1.92/2.35 p [49, 0] (w:1, o:14, a:1, s:1, b:0),
% 1.92/2.35 q [50, 0] (w:1, o:15, a:1, s:1, b:0).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 Starting Search:
% 1.92/2.35
% 1.92/2.35 Resimplifying inuse:
% 1.92/2.35 Done
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 Intermediate Status:
% 1.92/2.35 Generated: 3827
% 1.92/2.35 Kept: 2070
% 1.92/2.35 Inuse: 121
% 1.92/2.35 Deleted: 0
% 1.92/2.35 Deletedinuse: 0
% 1.92/2.35
% 1.92/2.35 Resimplifying inuse:
% 1.92/2.35 Done
% 1.92/2.35
% 1.92/2.35 Resimplifying inuse:
% 1.92/2.35 Done
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 Intermediate Status:
% 1.92/2.35 Generated: 8181
% 1.92/2.35 Kept: 4083
% 1.92/2.35 Inuse: 181
% 1.92/2.35 Deleted: 0
% 1.92/2.35 Deletedinuse: 0
% 1.92/2.35
% 1.92/2.35 Resimplifying inuse:
% 1.92/2.35 Done
% 1.92/2.35
% 1.92/2.35 Resimplifying inuse:
% 1.92/2.35 Done
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 Intermediate Status:
% 1.92/2.35 Generated: 13021
% 1.92/2.35 Kept: 6162
% 1.92/2.35 Inuse: 231
% 1.92/2.35 Deleted: 0
% 1.92/2.35 Deletedinuse: 0
% 1.92/2.35
% 1.92/2.35 Resimplifying inuse:
% 1.92/2.35 Done
% 1.92/2.35
% 1.92/2.35 Resimplifying inuse:
% 1.92/2.35 Done
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 Intermediate Status:
% 1.92/2.35 Generated: 17210
% 1.92/2.35 Kept: 8227
% 1.92/2.35 Inuse: 269
% 1.92/2.35 Deleted: 0
% 1.92/2.35 Deletedinuse: 0
% 1.92/2.35
% 1.92/2.35 Resimplifying inuse:
% 1.92/2.35 Done
% 1.92/2.35
% 1.92/2.35 Resimplifying inuse:
% 1.92/2.35 Done
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 Intermediate Status:
% 1.92/2.35 Generated: 22769
% 1.92/2.35 Kept: 10272
% 1.92/2.35 Inuse: 323
% 1.92/2.35 Deleted: 0
% 1.92/2.35 Deletedinuse: 0
% 1.92/2.35
% 1.92/2.35 Resimplifying inuse:
% 1.92/2.35 Done
% 1.92/2.35
% 1.92/2.35 Resimplifying inuse:
% 1.92/2.35 Done
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 Intermediate Status:
% 1.92/2.35 Generated: 28073
% 1.92/2.35 Kept: 12418
% 1.92/2.35 Inuse: 361
% 1.92/2.35 Deleted: 0
% 1.92/2.35 Deletedinuse: 0
% 1.92/2.35
% 1.92/2.35 Resimplifying inuse:
% 1.92/2.35 Done
% 1.92/2.35
% 1.92/2.35 Resimplifying inuse:
% 1.92/2.35 Done
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 Intermediate Status:
% 1.92/2.35 Generated: 32572
% 1.92/2.35 Kept: 14444
% 1.92/2.35 Inuse: 386
% 1.92/2.35 Deleted: 0
% 1.92/2.35 Deletedinuse: 0
% 1.92/2.35
% 1.92/2.35 Resimplifying inuse:
% 1.92/2.35 Done
% 1.92/2.35
% 1.92/2.35 Resimplifying inuse:
% 1.92/2.35 Done
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 Intermediate Status:
% 1.92/2.35 Generated: 40168
% 1.92/2.35 Kept: 16487
% 1.92/2.35 Inuse: 444
% 1.92/2.35 Deleted: 0
% 1.92/2.35 Deletedinuse: 0
% 1.92/2.35
% 1.92/2.35 Resimplifying inuse:
% 1.92/2.35 Done
% 1.92/2.35
% 1.92/2.35 Resimplifying inuse:
% 1.92/2.35 Done
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 Intermediate Status:
% 1.92/2.35 Generated: 43613
% 1.92/2.35 Kept: 18567
% 1.92/2.35 Inuse: 478
% 1.92/2.35 Deleted: 0
% 1.92/2.35 Deletedinuse: 0
% 1.92/2.35
% 1.92/2.35 Resimplifying inuse:
% 1.92/2.35 Done
% 1.92/2.35
% 1.92/2.35 Resimplifying inuse:
% 1.92/2.35 Done
% 1.92/2.35
% 1.92/2.35 Resimplifying clauses:
% 1.92/2.35 Done
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 Intermediate Status:
% 1.92/2.35 Generated: 47363
% 1.92/2.35 Kept: 20682
% 1.92/2.35 Inuse: 501
% 1.92/2.35 Deleted: 59
% 1.92/2.35 Deletedinuse: 0
% 1.92/2.35
% 1.92/2.35 Resimplifying inuse:
% 1.92/2.35 Done
% 1.92/2.35
% 1.92/2.35 Resimplifying inuse:
% 1.92/2.35 Done
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 Intermediate Status:
% 1.92/2.35 Generated: 51471
% 1.92/2.35 Kept: 22841
% 1.92/2.35 Inuse: 531
% 1.92/2.35 Deleted: 59
% 1.92/2.35 Deletedinuse: 0
% 1.92/2.35
% 1.92/2.35 Resimplifying inuse:
% 1.92/2.35 Done
% 1.92/2.35
% 1.92/2.35 Resimplifying inuse:
% 1.92/2.35 Done
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 Bliksems!, er is een bewijs:
% 1.92/2.35 % SZS status Unsatisfiable
% 1.92/2.35 % SZS output start Refutation
% 1.92/2.35
% 1.92/2.35 clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.92/2.35 .
% 1.92/2.35 clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 1.92/2.35 .
% 1.92/2.35 clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ]
% 1.92/2.35 )
% 1.92/2.35 .
% 1.92/2.35 clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.92/2.35 .
% 1.92/2.35 clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.92/2.35 .
% 1.92/2.35 clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y )
% 1.92/2.35 ) ] )
% 1.92/2.35 .
% 1.92/2.35 clause( 8, [ ~( theorem( or( implies( p, q ), implies( p, not( q ) ) ) ) )
% 1.92/2.35 ] )
% 1.92/2.35 .
% 1.92/2.35 clause( 9, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.92/2.35 .
% 1.92/2.35 clause( 16, [ theorem( or( X, Y ) ), ~( theorem( Y ) ) ] )
% 1.92/2.35 .
% 1.92/2.35 clause( 18, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X ) )
% 1.92/2.35 ) ] )
% 1.92/2.35 .
% 1.92/2.35 clause( 64, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 1.92/2.35 .
% 1.92/2.35 clause( 84, [ theorem( or( X, Y ) ), ~( axiom( or( Y, X ) ) ) ] )
% 1.92/2.35 .
% 1.92/2.35 clause( 124, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies( X
% 1.92/2.35 , Z ) ) ) ) ] )
% 1.92/2.35 .
% 1.92/2.35 clause( 128, [ theorem( implies( X, Y ) ), ~( theorem( Y ) ) ] )
% 1.92/2.35 .
% 1.92/2.35 clause( 134, [ axiom( implies( Y, implies( X, Y ) ) ) ] )
% 1.92/2.35 .
% 1.92/2.35 clause( 169, [ ~( theorem( X ) ), ~( axiom( implies( X, or( implies( p, q )
% 1.92/2.35 , implies( p, not( q ) ) ) ) ) ) ] )
% 1.92/2.35 .
% 1.92/2.35 clause( 1609, [ theorem( or( Y, not( X ) ) ), ~( axiom( implies( X, Y ) ) )
% 1.92/2.35 ] )
% 1.92/2.35 .
% 1.92/2.35 clause( 7175, [ theorem( or( implies( X, Y ), not( Y ) ) ) ] )
% 1.92/2.35 .
% 1.92/2.35 clause( 7342, [ theorem( implies( X, or( implies( Y, Z ), not( Z ) ) ) ) ]
% 1.92/2.35 )
% 1.92/2.35 .
% 1.92/2.35 clause( 24468, [] )
% 1.92/2.35 .
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 % SZS output end Refutation
% 1.92/2.35 found a proof!
% 1.92/2.35
% 1.92/2.35 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 1.92/2.35
% 1.92/2.35 initialclauses(
% 1.92/2.35 [ clause( 24470, [ axiom( implies( or( X, X ), X ) ) ] )
% 1.92/2.35 , clause( 24471, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.92/2.35 , clause( 24472, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 1.92/2.35 , clause( 24473, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 1.92/2.35 ) ) ] )
% 1.92/2.35 , clause( 24474, [ axiom( implies( implies( X, Y ), implies( or( Z, X ), or(
% 1.92/2.35 Z, Y ) ) ) ) ] )
% 1.92/2.35 , clause( 24475, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 1.92/2.35 , clause( 24476, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.92/2.35 , clause( 24477, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~(
% 1.92/2.35 theorem( Y ) ) ] )
% 1.92/2.35 , clause( 24478, [ ~( theorem( or( implies( p, q ), implies( p, not( q ) )
% 1.92/2.35 ) ) ) ] )
% 1.92/2.35 ] ).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 subsumption(
% 1.92/2.35 clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.92/2.35 , clause( 24471, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.92/2.35 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.92/2.35 )] ) ).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 subsumption(
% 1.92/2.35 clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 1.92/2.35 , clause( 24472, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 1.92/2.35 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.92/2.35 )] ) ).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 subsumption(
% 1.92/2.35 clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) ) ) ) ]
% 1.92/2.35 )
% 1.92/2.35 , clause( 24473, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 1.92/2.35 ) ) ] )
% 1.92/2.35 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.92/2.35 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 eqswap(
% 1.92/2.35 clause( 24479, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.92/2.35 , clause( 24475, [ =( implies( X, Y ), or( not( X ), Y ) ) ] )
% 1.92/2.35 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 subsumption(
% 1.92/2.35 clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.92/2.35 , clause( 24479, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.92/2.35 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.92/2.35 )] ) ).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 subsumption(
% 1.92/2.35 clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.92/2.35 , clause( 24476, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.92/2.35 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 1.92/2.35 1 )] ) ).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 subsumption(
% 1.92/2.35 clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y )
% 1.92/2.35 ) ] )
% 1.92/2.35 , clause( 24477, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~(
% 1.92/2.35 theorem( Y ) ) ] )
% 1.92/2.35 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.92/2.35 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 subsumption(
% 1.92/2.35 clause( 8, [ ~( theorem( or( implies( p, q ), implies( p, not( q ) ) ) ) )
% 1.92/2.35 ] )
% 1.92/2.35 , clause( 24478, [ ~( theorem( or( implies( p, q ), implies( p, not( q ) )
% 1.92/2.35 ) ) ) ] )
% 1.92/2.35 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 resolution(
% 1.92/2.35 clause( 24483, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.92/2.35 , clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.92/2.35 , 1, clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.92/2.35 , 0, substitution( 0, [ :=( X, implies( X, or( Y, X ) ) )] ),
% 1.92/2.35 substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 subsumption(
% 1.92/2.35 clause( 9, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.92/2.35 , clause( 24483, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.92/2.35 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.92/2.35 )] ) ).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 resolution(
% 1.92/2.35 clause( 24484, [ theorem( or( X, Y ) ), ~( theorem( Y ) ) ] )
% 1.92/2.35 , clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y
% 1.92/2.35 ) ) ] )
% 1.92/2.35 , 1, clause( 9, [ theorem( implies( X, or( Y, X ) ) ) ] )
% 1.92/2.35 , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, Y )] ), substitution( 1
% 1.92/2.35 , [ :=( X, Y ), :=( Y, X )] )).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 subsumption(
% 1.92/2.35 clause( 16, [ theorem( or( X, Y ) ), ~( theorem( Y ) ) ] )
% 1.92/2.35 , clause( 24484, [ theorem( or( X, Y ) ), ~( theorem( Y ) ) ] )
% 1.92/2.35 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.92/2.35 ), ==>( 1, 1 )] ) ).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 resolution(
% 1.92/2.35 clause( 24486, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 1.92/2.35 ) ) ] )
% 1.92/2.35 , clause( 7, [ theorem( X ), ~( theorem( implies( Y, X ) ) ), ~( theorem( Y
% 1.92/2.35 ) ) ] )
% 1.92/2.35 , 1, clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.92/2.35 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ :=( X
% 1.92/2.35 , implies( Y, X ) )] )).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 subsumption(
% 1.92/2.35 clause( 18, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X ) )
% 1.92/2.35 ) ] )
% 1.92/2.35 , clause( 24486, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X
% 1.92/2.35 ) ) ) ] )
% 1.92/2.35 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.92/2.35 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 resolution(
% 1.92/2.35 clause( 24488, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 1.92/2.35 , clause( 18, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X )
% 1.92/2.35 ) ) ] )
% 1.92/2.35 , 2, clause( 2, [ axiom( implies( or( X, Y ), or( Y, X ) ) ) ] )
% 1.92/2.35 , 0, substitution( 0, [ :=( X, or( X, Y ) ), :=( Y, or( Y, X ) )] ),
% 1.92/2.35 substitution( 1, [ :=( X, Y ), :=( Y, X )] )).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 subsumption(
% 1.92/2.35 clause( 64, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 1.92/2.35 , clause( 24488, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 1.92/2.35 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.92/2.35 ), ==>( 1, 1 )] ) ).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 resolution(
% 1.92/2.35 clause( 24489, [ theorem( or( X, Y ) ), ~( axiom( or( Y, X ) ) ) ] )
% 1.92/2.35 , clause( 64, [ theorem( or( X, Y ) ), ~( theorem( or( Y, X ) ) ) ] )
% 1.92/2.35 , 1, clause( 6, [ theorem( X ), ~( axiom( X ) ) ] )
% 1.92/2.35 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [ :=( X
% 1.92/2.35 , or( Y, X ) )] )).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 subsumption(
% 1.92/2.35 clause( 84, [ theorem( or( X, Y ) ), ~( axiom( or( Y, X ) ) ) ] )
% 1.92/2.35 , clause( 24489, [ theorem( or( X, Y ) ), ~( axiom( or( Y, X ) ) ) ] )
% 1.92/2.35 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.92/2.35 ), ==>( 1, 1 )] ) ).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 paramod(
% 1.92/2.35 clause( 24495, [ axiom( implies( or( not( X ), or( Y, Z ) ), or( Y, implies(
% 1.92/2.35 X, Z ) ) ) ) ] )
% 1.92/2.35 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.92/2.35 , 0, clause( 3, [ axiom( implies( or( X, or( Y, Z ) ), or( Y, or( X, Z ) )
% 1.92/2.35 ) ) ] )
% 1.92/2.35 , 0, 10, substitution( 0, [ :=( X, X ), :=( Y, Z )] ), substitution( 1, [
% 1.92/2.35 :=( X, not( X ) ), :=( Y, Y ), :=( Z, Z )] )).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 paramod(
% 1.92/2.35 clause( 24498, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies(
% 1.92/2.35 X, Z ) ) ) ) ] )
% 1.92/2.35 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.92/2.35 , 0, clause( 24495, [ axiom( implies( or( not( X ), or( Y, Z ) ), or( Y,
% 1.92/2.35 implies( X, Z ) ) ) ) ] )
% 1.92/2.35 , 0, 2, substitution( 0, [ :=( X, X ), :=( Y, or( Y, Z ) )] ),
% 1.92/2.35 substitution( 1, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 subsumption(
% 1.92/2.35 clause( 124, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies( X
% 1.92/2.35 , Z ) ) ) ) ] )
% 1.92/2.35 , clause( 24498, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y, implies(
% 1.92/2.35 X, Z ) ) ) ) ] )
% 1.92/2.35 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.92/2.35 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 paramod(
% 1.92/2.35 clause( 24500, [ theorem( implies( X, Y ) ), ~( theorem( Y ) ) ] )
% 1.92/2.35 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.92/2.35 , 0, clause( 16, [ theorem( or( X, Y ) ), ~( theorem( Y ) ) ] )
% 1.92/2.35 , 0, 1, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 1.92/2.35 :=( X, not( X ) ), :=( Y, Y )] )).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 subsumption(
% 1.92/2.35 clause( 128, [ theorem( implies( X, Y ) ), ~( theorem( Y ) ) ] )
% 1.92/2.35 , clause( 24500, [ theorem( implies( X, Y ) ), ~( theorem( Y ) ) ] )
% 1.92/2.35 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.92/2.35 ), ==>( 1, 1 )] ) ).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 paramod(
% 1.92/2.35 clause( 24502, [ axiom( implies( X, implies( Y, X ) ) ) ] )
% 1.92/2.35 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.92/2.35 , 0, clause( 1, [ axiom( implies( X, or( Y, X ) ) ) ] )
% 1.92/2.35 , 0, 3, substitution( 0, [ :=( X, Y ), :=( Y, X )] ), substitution( 1, [
% 1.92/2.35 :=( X, X ), :=( Y, not( Y ) )] )).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 subsumption(
% 1.92/2.35 clause( 134, [ axiom( implies( Y, implies( X, Y ) ) ) ] )
% 1.92/2.35 , clause( 24502, [ axiom( implies( X, implies( Y, X ) ) ) ] )
% 1.92/2.35 , substitution( 0, [ :=( X, Y ), :=( Y, X )] ), permutation( 0, [ ==>( 0, 0
% 1.92/2.35 )] ) ).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 resolution(
% 1.92/2.35 clause( 24503, [ ~( theorem( X ) ), ~( axiom( implies( X, or( implies( p, q
% 1.92/2.35 ), implies( p, not( q ) ) ) ) ) ) ] )
% 1.92/2.35 , clause( 8, [ ~( theorem( or( implies( p, q ), implies( p, not( q ) ) ) )
% 1.92/2.35 ) ] )
% 1.92/2.35 , 0, clause( 18, [ theorem( X ), ~( theorem( Y ) ), ~( axiom( implies( Y, X
% 1.92/2.35 ) ) ) ] )
% 1.92/2.35 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, or( implies( p, q ),
% 1.92/2.35 implies( p, not( q ) ) ) ), :=( Y, X )] )).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 subsumption(
% 1.92/2.35 clause( 169, [ ~( theorem( X ) ), ~( axiom( implies( X, or( implies( p, q )
% 1.92/2.35 , implies( p, not( q ) ) ) ) ) ) ] )
% 1.92/2.35 , clause( 24503, [ ~( theorem( X ) ), ~( axiom( implies( X, or( implies( p
% 1.92/2.35 , q ), implies( p, not( q ) ) ) ) ) ) ] )
% 1.92/2.35 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 1.92/2.35 1 )] ) ).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 paramod(
% 1.92/2.35 clause( 24506, [ ~( axiom( implies( X, Y ) ) ), theorem( or( Y, not( X ) )
% 1.92/2.35 ) ] )
% 1.92/2.35 , clause( 5, [ =( or( not( X ), Y ), implies( X, Y ) ) ] )
% 1.92/2.35 , 0, clause( 84, [ theorem( or( X, Y ) ), ~( axiom( or( Y, X ) ) ) ] )
% 1.92/2.35 , 1, 2, substitution( 0, [ :=( X, X ), :=( Y, Y )] ), substitution( 1, [
% 1.92/2.35 :=( X, Y ), :=( Y, not( X ) )] )).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 subsumption(
% 1.92/2.35 clause( 1609, [ theorem( or( Y, not( X ) ) ), ~( axiom( implies( X, Y ) ) )
% 1.92/2.35 ] )
% 1.92/2.35 , clause( 24506, [ ~( axiom( implies( X, Y ) ) ), theorem( or( Y, not( X )
% 1.92/2.35 ) ) ] )
% 1.92/2.35 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 1
% 1.92/2.35 ), ==>( 1, 0 )] ) ).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 resolution(
% 1.92/2.35 clause( 24507, [ theorem( or( implies( X, Y ), not( Y ) ) ) ] )
% 1.92/2.35 , clause( 1609, [ theorem( or( Y, not( X ) ) ), ~( axiom( implies( X, Y ) )
% 1.92/2.35 ) ] )
% 1.92/2.35 , 1, clause( 134, [ axiom( implies( Y, implies( X, Y ) ) ) ] )
% 1.92/2.35 , 0, substitution( 0, [ :=( X, Y ), :=( Y, implies( X, Y ) )] ),
% 1.92/2.35 substitution( 1, [ :=( X, X ), :=( Y, Y )] )).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 subsumption(
% 1.92/2.35 clause( 7175, [ theorem( or( implies( X, Y ), not( Y ) ) ) ] )
% 1.92/2.35 , clause( 24507, [ theorem( or( implies( X, Y ), not( Y ) ) ) ] )
% 1.92/2.35 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 1.92/2.35 )] ) ).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 resolution(
% 1.92/2.35 clause( 24508, [ theorem( implies( X, or( implies( Y, Z ), not( Z ) ) ) ) ]
% 1.92/2.35 )
% 1.92/2.35 , clause( 128, [ theorem( implies( X, Y ) ), ~( theorem( Y ) ) ] )
% 1.92/2.35 , 1, clause( 7175, [ theorem( or( implies( X, Y ), not( Y ) ) ) ] )
% 1.92/2.35 , 0, substitution( 0, [ :=( X, X ), :=( Y, or( implies( Y, Z ), not( Z ) )
% 1.92/2.35 )] ), substitution( 1, [ :=( X, Y ), :=( Y, Z )] )).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 subsumption(
% 1.92/2.35 clause( 7342, [ theorem( implies( X, or( implies( Y, Z ), not( Z ) ) ) ) ]
% 1.92/2.35 )
% 1.92/2.35 , clause( 24508, [ theorem( implies( X, or( implies( Y, Z ), not( Z ) ) ) )
% 1.92/2.35 ] )
% 1.92/2.35 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 1.92/2.35 permutation( 0, [ ==>( 0, 0 )] ) ).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 resolution(
% 1.92/2.35 clause( 24509, [ ~( theorem( implies( p, or( implies( p, q ), not( q ) ) )
% 1.92/2.35 ) ) ] )
% 1.92/2.35 , clause( 169, [ ~( theorem( X ) ), ~( axiom( implies( X, or( implies( p, q
% 1.92/2.35 ), implies( p, not( q ) ) ) ) ) ) ] )
% 1.92/2.35 , 1, clause( 124, [ axiom( implies( implies( X, or( Y, Z ) ), or( Y,
% 1.92/2.35 implies( X, Z ) ) ) ) ] )
% 1.92/2.35 , 0, substitution( 0, [ :=( X, implies( p, or( implies( p, q ), not( q ) )
% 1.92/2.35 ) )] ), substitution( 1, [ :=( X, p ), :=( Y, implies( p, q ) ), :=( Z,
% 1.92/2.35 not( q ) )] )).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 resolution(
% 1.92/2.35 clause( 24510, [] )
% 1.92/2.35 , clause( 24509, [ ~( theorem( implies( p, or( implies( p, q ), not( q ) )
% 1.92/2.35 ) ) ) ] )
% 1.92/2.35 , 0, clause( 7342, [ theorem( implies( X, or( implies( Y, Z ), not( Z ) ) )
% 1.92/2.35 ) ] )
% 1.92/2.35 , 0, substitution( 0, [] ), substitution( 1, [ :=( X, p ), :=( Y, p ), :=(
% 1.92/2.35 Z, q )] )).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 subsumption(
% 1.92/2.35 clause( 24468, [] )
% 1.92/2.35 , clause( 24510, [] )
% 1.92/2.35 , substitution( 0, [] ), permutation( 0, [] ) ).
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 end.
% 1.92/2.35
% 1.92/2.35 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 1.92/2.35
% 1.92/2.35 Memory use:
% 1.92/2.35
% 1.92/2.35 space for terms: 371479
% 1.92/2.35 space for clauses: 1102401
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 clauses generated: 54266
% 1.92/2.35 clauses kept: 24469
% 1.92/2.35 clauses selected: 546
% 1.92/2.35 clauses deleted: 59
% 1.92/2.35 clauses inuse deleted: 0
% 1.92/2.35
% 1.92/2.35 subsentry: 1067375
% 1.92/2.35 literals s-matched: 450718
% 1.92/2.35 literals matched: 419689
% 1.92/2.35 full subsumption: 186433
% 1.92/2.35
% 1.92/2.35 checksum: 1202728530
% 1.92/2.35
% 1.92/2.35
% 1.92/2.35 Bliksem ended
%------------------------------------------------------------------------------