TSTP Solution File: SYO038-1.003.003 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYO038-1.003.003 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n026.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 : Thu Jul 21 14:25:08 EDT 2022
% Result : Unsatisfiable 0.69s 1.11s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO038-1.003.003 : TPTP v8.1.0. Released v5.3.0.
% 0.03/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n026.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 : Sat Jul 9 14:29:25 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.69/1.11 *** allocated 10000 integers for termspace/termends
% 0.69/1.11 *** allocated 10000 integers for clauses
% 0.69/1.11 *** allocated 10000 integers for justifications
% 0.69/1.11 Bliksem 1.12
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 Automatic Strategy Selection
% 0.69/1.11
% 0.69/1.11 Clauses:
% 0.69/1.11 [
% 0.69/1.11 [ =( f( X, one ), s( one ) ) ],
% 0.69/1.11 [ =( f( one, s( X ) ), s( s( f( one, X ) ) ) ) ],
% 0.69/1.11 [ =( f( s( X ), s( Y ) ), f( X, f( s( X ), Y ) ) ) ],
% 0.69/1.11 [ d( one ) ],
% 0.69/1.11 [ ~( d( X ) ), d( s( X ) ) ],
% 0.69/1.11 [ ~( d( f( s( s( one ) ), s( s( one ) ) ) ) ) ]
% 0.69/1.11 ] .
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 percentage equality = 0.428571, percentage horn = 1.000000
% 0.69/1.11 This is a problem with some equality
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 Options Used:
% 0.69/1.11
% 0.69/1.11 useres = 1
% 0.69/1.11 useparamod = 1
% 0.69/1.11 useeqrefl = 1
% 0.69/1.11 useeqfact = 1
% 0.69/1.11 usefactor = 1
% 0.69/1.11 usesimpsplitting = 0
% 0.69/1.11 usesimpdemod = 5
% 0.69/1.11 usesimpres = 3
% 0.69/1.11
% 0.69/1.11 resimpinuse = 1000
% 0.69/1.11 resimpclauses = 20000
% 0.69/1.11 substype = eqrewr
% 0.69/1.11 backwardsubs = 1
% 0.69/1.11 selectoldest = 5
% 0.69/1.11
% 0.69/1.11 litorderings [0] = split
% 0.69/1.11 litorderings [1] = extend the termordering, first sorting on arguments
% 0.69/1.11
% 0.69/1.11 termordering = kbo
% 0.69/1.11
% 0.69/1.11 litapriori = 0
% 0.69/1.11 termapriori = 1
% 0.69/1.11 litaposteriori = 0
% 0.69/1.11 termaposteriori = 0
% 0.69/1.11 demodaposteriori = 0
% 0.69/1.11 ordereqreflfact = 0
% 0.69/1.11
% 0.69/1.11 litselect = negord
% 0.69/1.11
% 0.69/1.11 maxweight = 15
% 0.69/1.11 maxdepth = 30000
% 0.69/1.11 maxlength = 115
% 0.69/1.11 maxnrvars = 195
% 0.69/1.11 excuselevel = 1
% 0.69/1.11 increasemaxweight = 1
% 0.69/1.11
% 0.69/1.11 maxselected = 10000000
% 0.69/1.11 maxnrclauses = 10000000
% 0.69/1.11
% 0.69/1.11 showgenerated = 0
% 0.69/1.11 showkept = 0
% 0.69/1.11 showselected = 0
% 0.69/1.11 showdeleted = 0
% 0.69/1.11 showresimp = 1
% 0.69/1.11 showstatus = 2000
% 0.69/1.11
% 0.69/1.11 prologoutput = 1
% 0.69/1.11 nrgoals = 5000000
% 0.69/1.11 totalproof = 1
% 0.69/1.11
% 0.69/1.11 Symbols occurring in the translation:
% 0.69/1.11
% 0.69/1.11 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.69/1.11 . [1, 2] (w:1, o:19, a:1, s:1, b:0),
% 0.69/1.11 ! [4, 1] (w:0, o:12, a:1, s:1, b:0),
% 0.69/1.11 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.11 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.69/1.11 one [40, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.69/1.11 f [41, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.69/1.11 s [42, 1] (w:1, o:17, a:1, s:1, b:0),
% 0.69/1.11 d [44, 1] (w:1, o:18, a:1, s:1, b:0).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 Starting Search:
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 Bliksems!, er is een bewijs:
% 0.69/1.11 % SZS status Unsatisfiable
% 0.69/1.11 % SZS output start Refutation
% 0.69/1.11
% 0.69/1.11 clause( 0, [ =( f( X, one ), s( one ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 1, [ =( s( s( f( one, X ) ) ), f( one, s( X ) ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 2, [ =( f( X, f( s( X ), Y ) ), f( s( X ), s( Y ) ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 3, [ d( one ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 4, [ ~( d( X ) ), d( s( X ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 5, [ ~( d( f( s( s( one ) ), s( s( one ) ) ) ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 6, [ d( s( s( X ) ) ), ~( d( X ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 7, [ d( s( one ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 8, [ d( s( s( one ) ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 9, [ d( s( s( s( one ) ) ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 11, [ ~( d( X ) ), d( s( s( s( s( X ) ) ) ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 21, [ d( f( one, s( X ) ) ), ~( d( f( one, X ) ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 23, [ =( f( one, s( one ) ), s( s( s( one ) ) ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 28, [ ~( d( f( one, X ) ) ), d( f( one, s( s( X ) ) ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 38, [ =( f( s( X ), s( one ) ), f( X, s( one ) ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 39, [ d( f( one, s( s( one ) ) ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 40, [ =( s( s( s( s( s( one ) ) ) ) ), f( one, s( s( one ) ) ) ) ]
% 0.69/1.11 )
% 0.69/1.11 .
% 0.69/1.11 clause( 41, [ d( f( one, s( s( s( one ) ) ) ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 45, [ d( f( one, f( one, s( s( one ) ) ) ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 64, [ =( f( X, f( X, s( one ) ) ), f( s( X ), s( s( one ) ) ) ) ]
% 0.69/1.11 )
% 0.69/1.11 .
% 0.69/1.11 clause( 71, [ ~( d( f( one, f( one, X ) ) ) ), d( f( one, f( one, s( X ) )
% 0.69/1.11 ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 126, [ =( f( one, s( s( s( one ) ) ) ), f( s( one ), s( s( one ) )
% 0.69/1.11 ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 127, [ ~( d( f( s( one ), s( s( s( one ) ) ) ) ) ) ] )
% 0.69/1.11 .
% 0.69/1.11 clause( 141, [] )
% 0.69/1.11 .
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 % SZS output end Refutation
% 0.69/1.11 found a proof!
% 0.69/1.11
% 0.69/1.11 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.69/1.11
% 0.69/1.11 initialclauses(
% 0.69/1.11 [ clause( 143, [ =( f( X, one ), s( one ) ) ] )
% 0.69/1.11 , clause( 144, [ =( f( one, s( X ) ), s( s( f( one, X ) ) ) ) ] )
% 0.69/1.11 , clause( 145, [ =( f( s( X ), s( Y ) ), f( X, f( s( X ), Y ) ) ) ] )
% 0.69/1.11 , clause( 146, [ d( one ) ] )
% 0.69/1.11 , clause( 147, [ ~( d( X ) ), d( s( X ) ) ] )
% 0.69/1.11 , clause( 148, [ ~( d( f( s( s( one ) ), s( s( one ) ) ) ) ) ] )
% 0.69/1.11 ] ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 0, [ =( f( X, one ), s( one ) ) ] )
% 0.69/1.11 , clause( 143, [ =( f( X, one ), s( one ) ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 eqswap(
% 0.69/1.11 clause( 151, [ =( s( s( f( one, X ) ) ), f( one, s( X ) ) ) ] )
% 0.69/1.11 , clause( 144, [ =( f( one, s( X ) ), s( s( f( one, X ) ) ) ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, X )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 1, [ =( s( s( f( one, X ) ) ), f( one, s( X ) ) ) ] )
% 0.69/1.11 , clause( 151, [ =( s( s( f( one, X ) ) ), f( one, s( X ) ) ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 eqswap(
% 0.69/1.11 clause( 154, [ =( f( X, f( s( X ), Y ) ), f( s( X ), s( Y ) ) ) ] )
% 0.69/1.11 , clause( 145, [ =( f( s( X ), s( Y ) ), f( X, f( s( X ), Y ) ) ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 2, [ =( f( X, f( s( X ), Y ) ), f( s( X ), s( Y ) ) ) ] )
% 0.69/1.11 , clause( 154, [ =( f( X, f( s( X ), Y ) ), f( s( X ), s( Y ) ) ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.69/1.11 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 3, [ d( one ) ] )
% 0.69/1.11 , clause( 146, [ d( one ) ] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 4, [ ~( d( X ) ), d( s( X ) ) ] )
% 0.69/1.11 , clause( 147, [ ~( d( X ) ), d( s( X ) ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.69/1.11 1 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 5, [ ~( d( f( s( s( one ) ), s( s( one ) ) ) ) ) ] )
% 0.69/1.11 , clause( 148, [ ~( d( f( s( s( one ) ), s( s( one ) ) ) ) ) ] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 164, [ d( s( s( X ) ) ), ~( d( X ) ) ] )
% 0.69/1.11 , clause( 4, [ ~( d( X ) ), d( s( X ) ) ] )
% 0.69/1.11 , 0, clause( 4, [ ~( d( X ) ), d( s( X ) ) ] )
% 0.69/1.11 , 1, substitution( 0, [ :=( X, s( X ) )] ), substitution( 1, [ :=( X, X )] )
% 0.69/1.11 ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 6, [ d( s( s( X ) ) ), ~( d( X ) ) ] )
% 0.69/1.11 , clause( 164, [ d( s( s( X ) ) ), ~( d( X ) ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.69/1.11 1 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 165, [ d( s( one ) ) ] )
% 0.69/1.11 , clause( 4, [ ~( d( X ) ), d( s( X ) ) ] )
% 0.69/1.11 , 0, clause( 3, [ d( one ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, one )] ), substitution( 1, [] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 7, [ d( s( one ) ) ] )
% 0.69/1.11 , clause( 165, [ d( s( one ) ) ] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 166, [ d( s( s( one ) ) ) ] )
% 0.69/1.11 , clause( 4, [ ~( d( X ) ), d( s( X ) ) ] )
% 0.69/1.11 , 0, clause( 7, [ d( s( one ) ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, s( one ) )] ), substitution( 1, [] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 8, [ d( s( s( one ) ) ) ] )
% 0.69/1.11 , clause( 166, [ d( s( s( one ) ) ) ] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 167, [ d( s( s( s( one ) ) ) ) ] )
% 0.69/1.11 , clause( 4, [ ~( d( X ) ), d( s( X ) ) ] )
% 0.69/1.11 , 0, clause( 8, [ d( s( s( one ) ) ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, s( s( one ) ) )] ), substitution( 1, [] )
% 0.69/1.11 ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 9, [ d( s( s( s( one ) ) ) ) ] )
% 0.69/1.11 , clause( 167, [ d( s( s( s( one ) ) ) ) ] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 168, [ d( s( s( s( s( X ) ) ) ) ), ~( d( X ) ) ] )
% 0.69/1.11 , clause( 6, [ d( s( s( X ) ) ), ~( d( X ) ) ] )
% 0.69/1.11 , 1, clause( 6, [ d( s( s( X ) ) ), ~( d( X ) ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, s( s( X ) ) )] ), substitution( 1, [ :=( X,
% 0.69/1.11 X )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 11, [ ~( d( X ) ), d( s( s( s( s( X ) ) ) ) ) ] )
% 0.69/1.11 , clause( 168, [ d( s( s( s( s( X ) ) ) ) ), ~( d( X ) ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.69/1.11 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 paramod(
% 0.69/1.11 clause( 170, [ d( f( one, s( X ) ) ), ~( d( f( one, X ) ) ) ] )
% 0.69/1.11 , clause( 1, [ =( s( s( f( one, X ) ) ), f( one, s( X ) ) ) ] )
% 0.69/1.11 , 0, clause( 6, [ d( s( s( X ) ) ), ~( d( X ) ) ] )
% 0.69/1.11 , 0, 1, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, f( one
% 0.69/1.11 , X ) )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 21, [ d( f( one, s( X ) ) ), ~( d( f( one, X ) ) ) ] )
% 0.69/1.11 , clause( 170, [ d( f( one, s( X ) ) ), ~( d( f( one, X ) ) ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1,
% 0.69/1.11 1 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 eqswap(
% 0.69/1.11 clause( 173, [ =( f( one, s( X ) ), s( s( f( one, X ) ) ) ) ] )
% 0.69/1.11 , clause( 1, [ =( s( s( f( one, X ) ) ), f( one, s( X ) ) ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, X )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 paramod(
% 0.69/1.11 clause( 174, [ =( f( one, s( one ) ), s( s( s( one ) ) ) ) ] )
% 0.69/1.11 , clause( 0, [ =( f( X, one ), s( one ) ) ] )
% 0.69/1.11 , 0, clause( 173, [ =( f( one, s( X ) ), s( s( f( one, X ) ) ) ) ] )
% 0.69/1.11 , 0, 7, substitution( 0, [ :=( X, one )] ), substitution( 1, [ :=( X, one )] )
% 0.69/1.11 ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 23, [ =( f( one, s( one ) ), s( s( s( one ) ) ) ) ] )
% 0.69/1.11 , clause( 174, [ =( f( one, s( one ) ), s( s( s( one ) ) ) ) ] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 paramod(
% 0.69/1.11 clause( 178, [ d( s( s( f( one, s( X ) ) ) ) ), ~( d( f( one, X ) ) ) ] )
% 0.69/1.11 , clause( 1, [ =( s( s( f( one, X ) ) ), f( one, s( X ) ) ) ] )
% 0.69/1.11 , 0, clause( 11, [ ~( d( X ) ), d( s( s( s( s( X ) ) ) ) ) ] )
% 0.69/1.11 , 1, 3, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, f( one
% 0.69/1.11 , X ) )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 paramod(
% 0.69/1.11 clause( 183, [ d( f( one, s( s( X ) ) ) ), ~( d( f( one, X ) ) ) ] )
% 0.69/1.11 , clause( 1, [ =( s( s( f( one, X ) ) ), f( one, s( X ) ) ) ] )
% 0.69/1.11 , 0, clause( 178, [ d( s( s( f( one, s( X ) ) ) ) ), ~( d( f( one, X ) ) )
% 0.69/1.11 ] )
% 0.69/1.11 , 0, 1, substitution( 0, [ :=( X, s( X ) )] ), substitution( 1, [ :=( X, X
% 0.69/1.11 )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 28, [ ~( d( f( one, X ) ) ), d( f( one, s( s( X ) ) ) ) ] )
% 0.69/1.11 , clause( 183, [ d( f( one, s( s( X ) ) ) ), ~( d( f( one, X ) ) ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.69/1.11 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 eqswap(
% 0.69/1.11 clause( 185, [ =( f( s( X ), s( Y ) ), f( X, f( s( X ), Y ) ) ) ] )
% 0.69/1.11 , clause( 2, [ =( f( X, f( s( X ), Y ) ), f( s( X ), s( Y ) ) ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 paramod(
% 0.69/1.11 clause( 186, [ =( f( s( X ), s( one ) ), f( X, s( one ) ) ) ] )
% 0.69/1.11 , clause( 0, [ =( f( X, one ), s( one ) ) ] )
% 0.69/1.11 , 0, clause( 185, [ =( f( s( X ), s( Y ) ), f( X, f( s( X ), Y ) ) ) ] )
% 0.69/1.11 , 0, 8, substitution( 0, [ :=( X, s( X ) )] ), substitution( 1, [ :=( X, X
% 0.69/1.11 ), :=( Y, one )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 38, [ =( f( s( X ), s( one ) ), f( X, s( one ) ) ) ] )
% 0.69/1.11 , clause( 186, [ =( f( s( X ), s( one ) ), f( X, s( one ) ) ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 paramod(
% 0.69/1.11 clause( 190, [ ~( d( s( s( s( one ) ) ) ) ), d( f( one, s( s( one ) ) ) ) ]
% 0.69/1.11 )
% 0.69/1.11 , clause( 23, [ =( f( one, s( one ) ), s( s( s( one ) ) ) ) ] )
% 0.69/1.11 , 0, clause( 21, [ d( f( one, s( X ) ) ), ~( d( f( one, X ) ) ) ] )
% 0.69/1.11 , 1, 2, substitution( 0, [] ), substitution( 1, [ :=( X, s( one ) )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 191, [ d( f( one, s( s( one ) ) ) ) ] )
% 0.69/1.11 , clause( 190, [ ~( d( s( s( s( one ) ) ) ) ), d( f( one, s( s( one ) ) ) )
% 0.69/1.11 ] )
% 0.69/1.11 , 0, clause( 9, [ d( s( s( s( one ) ) ) ) ] )
% 0.69/1.11 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 39, [ d( f( one, s( s( one ) ) ) ) ] )
% 0.69/1.11 , clause( 191, [ d( f( one, s( s( one ) ) ) ) ] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 eqswap(
% 0.69/1.11 clause( 193, [ =( f( one, s( X ) ), s( s( f( one, X ) ) ) ) ] )
% 0.69/1.11 , clause( 1, [ =( s( s( f( one, X ) ) ), f( one, s( X ) ) ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, X )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 paramod(
% 0.69/1.11 clause( 195, [ =( f( one, s( s( one ) ) ), s( s( s( s( s( one ) ) ) ) ) ) ]
% 0.69/1.11 )
% 0.69/1.11 , clause( 23, [ =( f( one, s( one ) ), s( s( s( one ) ) ) ) ] )
% 0.69/1.11 , 0, clause( 193, [ =( f( one, s( X ) ), s( s( f( one, X ) ) ) ) ] )
% 0.69/1.11 , 0, 8, substitution( 0, [] ), substitution( 1, [ :=( X, s( one ) )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 eqswap(
% 0.69/1.11 clause( 197, [ =( s( s( s( s( s( one ) ) ) ) ), f( one, s( s( one ) ) ) ) ]
% 0.69/1.11 )
% 0.69/1.11 , clause( 195, [ =( f( one, s( s( one ) ) ), s( s( s( s( s( one ) ) ) ) ) )
% 0.69/1.11 ] )
% 0.69/1.11 , 0, substitution( 0, [] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 40, [ =( s( s( s( s( s( one ) ) ) ) ), f( one, s( s( one ) ) ) ) ]
% 0.69/1.11 )
% 0.69/1.11 , clause( 197, [ =( s( s( s( s( s( one ) ) ) ) ), f( one, s( s( one ) ) ) )
% 0.69/1.11 ] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 198, [ d( f( one, s( s( s( one ) ) ) ) ) ] )
% 0.69/1.11 , clause( 21, [ d( f( one, s( X ) ) ), ~( d( f( one, X ) ) ) ] )
% 0.69/1.11 , 1, clause( 39, [ d( f( one, s( s( one ) ) ) ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, s( s( one ) ) )] ), substitution( 1, [] )
% 0.69/1.11 ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 41, [ d( f( one, s( s( s( one ) ) ) ) ) ] )
% 0.69/1.11 , clause( 198, [ d( f( one, s( s( s( one ) ) ) ) ) ] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 202, [ d( s( s( s( s( f( one, s( s( s( one ) ) ) ) ) ) ) ) ) ] )
% 0.69/1.11 , clause( 11, [ ~( d( X ) ), d( s( s( s( s( X ) ) ) ) ) ] )
% 0.69/1.11 , 0, clause( 41, [ d( f( one, s( s( s( one ) ) ) ) ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, f( one, s( s( s( one ) ) ) ) )] ),
% 0.69/1.11 substitution( 1, [] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 paramod(
% 0.69/1.11 clause( 203, [ d( s( s( f( one, s( s( s( s( one ) ) ) ) ) ) ) ) ] )
% 0.69/1.11 , clause( 1, [ =( s( s( f( one, X ) ) ), f( one, s( X ) ) ) ] )
% 0.69/1.11 , 0, clause( 202, [ d( s( s( s( s( f( one, s( s( s( one ) ) ) ) ) ) ) ) ) ]
% 0.69/1.11 )
% 0.69/1.11 , 0, 3, substitution( 0, [ :=( X, s( s( s( one ) ) ) )] ), substitution( 1
% 0.69/1.11 , [] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 paramod(
% 0.69/1.11 clause( 205, [ d( f( one, s( s( s( s( s( one ) ) ) ) ) ) ) ] )
% 0.69/1.11 , clause( 1, [ =( s( s( f( one, X ) ) ), f( one, s( X ) ) ) ] )
% 0.69/1.11 , 0, clause( 203, [ d( s( s( f( one, s( s( s( s( one ) ) ) ) ) ) ) ) ] )
% 0.69/1.11 , 0, 1, substitution( 0, [ :=( X, s( s( s( s( one ) ) ) ) )] ),
% 0.69/1.11 substitution( 1, [] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 paramod(
% 0.69/1.11 clause( 206, [ d( f( one, f( one, s( s( one ) ) ) ) ) ] )
% 0.69/1.11 , clause( 40, [ =( s( s( s( s( s( one ) ) ) ) ), f( one, s( s( one ) ) ) )
% 0.69/1.11 ] )
% 0.69/1.11 , 0, clause( 205, [ d( f( one, s( s( s( s( s( one ) ) ) ) ) ) ) ] )
% 0.69/1.11 , 0, 3, substitution( 0, [] ), substitution( 1, [] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 45, [ d( f( one, f( one, s( s( one ) ) ) ) ) ] )
% 0.69/1.11 , clause( 206, [ d( f( one, f( one, s( s( one ) ) ) ) ) ] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 eqswap(
% 0.69/1.11 clause( 208, [ =( f( s( X ), s( Y ) ), f( X, f( s( X ), Y ) ) ) ] )
% 0.69/1.11 , clause( 2, [ =( f( X, f( s( X ), Y ) ), f( s( X ), s( Y ) ) ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 paramod(
% 0.69/1.11 clause( 210, [ =( f( s( X ), s( s( one ) ) ), f( X, f( X, s( one ) ) ) ) ]
% 0.69/1.11 )
% 0.69/1.11 , clause( 38, [ =( f( s( X ), s( one ) ), f( X, s( one ) ) ) ] )
% 0.69/1.11 , 0, clause( 208, [ =( f( s( X ), s( Y ) ), f( X, f( s( X ), Y ) ) ) ] )
% 0.69/1.11 , 0, 9, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X ),
% 0.69/1.11 :=( Y, s( one ) )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 eqswap(
% 0.69/1.11 clause( 212, [ =( f( X, f( X, s( one ) ) ), f( s( X ), s( s( one ) ) ) ) ]
% 0.69/1.11 )
% 0.69/1.11 , clause( 210, [ =( f( s( X ), s( s( one ) ) ), f( X, f( X, s( one ) ) ) )
% 0.69/1.11 ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, X )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 64, [ =( f( X, f( X, s( one ) ) ), f( s( X ), s( s( one ) ) ) ) ]
% 0.69/1.11 )
% 0.69/1.11 , clause( 212, [ =( f( X, f( X, s( one ) ) ), f( s( X ), s( s( one ) ) ) )
% 0.69/1.11 ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 paramod(
% 0.69/1.11 clause( 214, [ d( f( one, f( one, s( X ) ) ) ), ~( d( f( one, f( one, X ) )
% 0.69/1.11 ) ) ] )
% 0.69/1.11 , clause( 1, [ =( s( s( f( one, X ) ) ), f( one, s( X ) ) ) ] )
% 0.69/1.11 , 0, clause( 28, [ ~( d( f( one, X ) ) ), d( f( one, s( s( X ) ) ) ) ] )
% 0.69/1.11 , 1, 3, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, f( one
% 0.69/1.11 , X ) )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 71, [ ~( d( f( one, f( one, X ) ) ) ), d( f( one, f( one, s( X ) )
% 0.69/1.11 ) ) ] )
% 0.69/1.11 , clause( 214, [ d( f( one, f( one, s( X ) ) ) ), ~( d( f( one, f( one, X )
% 0.69/1.11 ) ) ) ] )
% 0.69/1.11 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1,
% 0.69/1.11 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 eqswap(
% 0.69/1.11 clause( 217, [ =( f( s( X ), s( s( one ) ) ), f( X, f( X, s( one ) ) ) ) ]
% 0.69/1.11 )
% 0.69/1.11 , clause( 64, [ =( f( X, f( X, s( one ) ) ), f( s( X ), s( s( one ) ) ) ) ]
% 0.69/1.11 )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, X )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 paramod(
% 0.69/1.11 clause( 218, [ =( f( s( one ), s( s( one ) ) ), f( one, s( s( s( one ) ) )
% 0.69/1.11 ) ) ] )
% 0.69/1.11 , clause( 23, [ =( f( one, s( one ) ), s( s( s( one ) ) ) ) ] )
% 0.69/1.11 , 0, clause( 217, [ =( f( s( X ), s( s( one ) ) ), f( X, f( X, s( one ) ) )
% 0.69/1.11 ) ] )
% 0.69/1.11 , 0, 9, substitution( 0, [] ), substitution( 1, [ :=( X, one )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 eqswap(
% 0.69/1.11 clause( 219, [ =( f( one, s( s( s( one ) ) ) ), f( s( one ), s( s( one ) )
% 0.69/1.11 ) ) ] )
% 0.69/1.11 , clause( 218, [ =( f( s( one ), s( s( one ) ) ), f( one, s( s( s( one ) )
% 0.69/1.11 ) ) ) ] )
% 0.69/1.11 , 0, substitution( 0, [] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 126, [ =( f( one, s( s( s( one ) ) ) ), f( s( one ), s( s( one ) )
% 0.69/1.11 ) ) ] )
% 0.69/1.11 , clause( 219, [ =( f( one, s( s( s( one ) ) ) ), f( s( one ), s( s( one )
% 0.69/1.11 ) ) ) ] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 eqswap(
% 0.69/1.11 clause( 220, [ =( f( s( X ), s( s( one ) ) ), f( X, f( X, s( one ) ) ) ) ]
% 0.69/1.11 )
% 0.69/1.11 , clause( 64, [ =( f( X, f( X, s( one ) ) ), f( s( X ), s( s( one ) ) ) ) ]
% 0.69/1.11 )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, X )] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 paramod(
% 0.69/1.11 clause( 223, [ ~( d( f( s( one ), f( s( one ), s( one ) ) ) ) ) ] )
% 0.69/1.11 , clause( 220, [ =( f( s( X ), s( s( one ) ) ), f( X, f( X, s( one ) ) ) )
% 0.69/1.11 ] )
% 0.69/1.11 , 0, clause( 5, [ ~( d( f( s( s( one ) ), s( s( one ) ) ) ) ) ] )
% 0.69/1.11 , 0, 2, substitution( 0, [ :=( X, s( one ) )] ), substitution( 1, [] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 paramod(
% 0.69/1.11 clause( 224, [ ~( d( f( s( one ), f( one, s( one ) ) ) ) ) ] )
% 0.69/1.11 , clause( 38, [ =( f( s( X ), s( one ) ), f( X, s( one ) ) ) ] )
% 0.69/1.11 , 0, clause( 223, [ ~( d( f( s( one ), f( s( one ), s( one ) ) ) ) ) ] )
% 0.69/1.11 , 0, 5, substitution( 0, [ :=( X, one )] ), substitution( 1, [] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 paramod(
% 0.69/1.11 clause( 225, [ ~( d( f( s( one ), s( s( s( one ) ) ) ) ) ) ] )
% 0.69/1.11 , clause( 23, [ =( f( one, s( one ) ), s( s( s( one ) ) ) ) ] )
% 0.69/1.11 , 0, clause( 224, [ ~( d( f( s( one ), f( one, s( one ) ) ) ) ) ] )
% 0.69/1.11 , 0, 5, substitution( 0, [] ), substitution( 1, [] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 127, [ ~( d( f( s( one ), s( s( s( one ) ) ) ) ) ) ] )
% 0.69/1.11 , clause( 225, [ ~( d( f( s( one ), s( s( s( one ) ) ) ) ) ) ] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 228, [ d( f( one, f( one, s( s( s( one ) ) ) ) ) ) ] )
% 0.69/1.11 , clause( 71, [ ~( d( f( one, f( one, X ) ) ) ), d( f( one, f( one, s( X )
% 0.69/1.11 ) ) ) ] )
% 0.69/1.11 , 0, clause( 45, [ d( f( one, f( one, s( s( one ) ) ) ) ) ] )
% 0.69/1.11 , 0, substitution( 0, [ :=( X, s( s( one ) ) )] ), substitution( 1, [] )
% 0.69/1.11 ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 paramod(
% 0.69/1.11 clause( 229, [ d( f( one, f( s( one ), s( s( one ) ) ) ) ) ] )
% 0.69/1.11 , clause( 126, [ =( f( one, s( s( s( one ) ) ) ), f( s( one ), s( s( one )
% 0.69/1.11 ) ) ) ] )
% 0.69/1.11 , 0, clause( 228, [ d( f( one, f( one, s( s( s( one ) ) ) ) ) ) ] )
% 0.69/1.11 , 0, 3, substitution( 0, [] ), substitution( 1, [] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 paramod(
% 0.69/1.11 clause( 230, [ d( f( s( one ), s( s( s( one ) ) ) ) ) ] )
% 0.69/1.11 , clause( 2, [ =( f( X, f( s( X ), Y ) ), f( s( X ), s( Y ) ) ) ] )
% 0.69/1.11 , 0, clause( 229, [ d( f( one, f( s( one ), s( s( one ) ) ) ) ) ] )
% 0.69/1.11 , 0, 1, substitution( 0, [ :=( X, one ), :=( Y, s( s( one ) ) )] ),
% 0.69/1.11 substitution( 1, [] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 resolution(
% 0.69/1.11 clause( 231, [] )
% 0.69/1.11 , clause( 127, [ ~( d( f( s( one ), s( s( s( one ) ) ) ) ) ) ] )
% 0.69/1.11 , 0, clause( 230, [ d( f( s( one ), s( s( s( one ) ) ) ) ) ] )
% 0.69/1.11 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 subsumption(
% 0.69/1.11 clause( 141, [] )
% 0.69/1.11 , clause( 231, [] )
% 0.69/1.11 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 end.
% 0.69/1.11
% 0.69/1.11 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.69/1.11
% 0.69/1.11 Memory use:
% 0.69/1.11
% 0.69/1.11 space for terms: 1814
% 0.69/1.11 space for clauses: 9478
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 clauses generated: 1087
% 0.69/1.11 clauses kept: 142
% 0.69/1.11 clauses selected: 77
% 0.69/1.11 clauses deleted: 5
% 0.69/1.11 clauses inuse deleted: 0
% 0.69/1.11
% 0.69/1.11 subsentry: 1953
% 0.69/1.11 literals s-matched: 1705
% 0.69/1.11 literals matched: 1705
% 0.69/1.11 full subsumption: 0
% 0.69/1.11
% 0.69/1.11 checksum: 482603523
% 0.69/1.11
% 0.69/1.11
% 0.69/1.11 Bliksem ended
%------------------------------------------------------------------------------