TSTP Solution File: SWV254-2 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SWV254-2 : TPTP v8.1.0. Released v3.2.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 : Wed Jul 20 16:23:15 EDT 2022
% Result : Unsatisfiable 0.68s 1.06s
% Output : Refutation 0.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV254-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n008.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 : Wed Jun 15 19:53:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.68/1.06 *** allocated 10000 integers for termspace/termends
% 0.68/1.06 *** allocated 10000 integers for clauses
% 0.68/1.06 *** allocated 10000 integers for justifications
% 0.68/1.06 Bliksem 1.12
% 0.68/1.06
% 0.68/1.06
% 0.68/1.06 Automatic Strategy Selection
% 0.68/1.06
% 0.68/1.06 Clauses:
% 0.68/1.06 [
% 0.68/1.06 [ ~( 'class_Orderings_Oorder'( X ) ), ~( 'c_lessequals'( Y, Z, X ) ),
% 0.68/1.06 =( 'c_SetInterval_OatLeastLessThan'( Z, Y, X ), 'c_emptyset' ) ],
% 0.68/1.06 [ =( 'c_SetInterval_OatLeastLessThan'( X, 'c_Suc'( X ), 'tc_nat' ),
% 0.68/1.06 'c_insert'( X, 'c_emptyset', 'tc_nat' ) ) ],
% 0.68/1.06 [ ~( =( 'c_emptyset', 'c_insert'( X, Y, Z ) ) ) ],
% 0.68/1.06 [ 'c_lessequals'( X, 'v_x'( X ), 'tc_nat' ) ],
% 0.68/1.06 [ =( 'v_x'( X ), 'v_nat' ) ],
% 0.68/1.06 [ 'class_Orderings_Oorder'( 'tc_nat' ) ]
% 0.68/1.06 ] .
% 0.68/1.06
% 0.68/1.06
% 0.68/1.06 percentage equality = 0.500000, percentage horn = 1.000000
% 0.68/1.06 This is a problem with some equality
% 0.68/1.06
% 0.68/1.06
% 0.68/1.06
% 0.68/1.06 Options Used:
% 0.68/1.06
% 0.68/1.06 useres = 1
% 0.68/1.06 useparamod = 1
% 0.68/1.06 useeqrefl = 1
% 0.68/1.06 useeqfact = 1
% 0.68/1.06 usefactor = 1
% 0.68/1.06 usesimpsplitting = 0
% 0.68/1.06 usesimpdemod = 5
% 0.68/1.06 usesimpres = 3
% 0.68/1.06
% 0.68/1.06 resimpinuse = 1000
% 0.68/1.06 resimpclauses = 20000
% 0.68/1.06 substype = eqrewr
% 0.68/1.06 backwardsubs = 1
% 0.68/1.06 selectoldest = 5
% 0.68/1.06
% 0.68/1.06 litorderings [0] = split
% 0.68/1.06 litorderings [1] = extend the termordering, first sorting on arguments
% 0.68/1.06
% 0.68/1.06 termordering = kbo
% 0.68/1.06
% 0.68/1.06 litapriori = 0
% 0.68/1.06 termapriori = 1
% 0.68/1.06 litaposteriori = 0
% 0.68/1.06 termaposteriori = 0
% 0.68/1.06 demodaposteriori = 0
% 0.68/1.06 ordereqreflfact = 0
% 0.68/1.06
% 0.68/1.06 litselect = negord
% 0.68/1.06
% 0.68/1.06 maxweight = 15
% 0.68/1.06 maxdepth = 30000
% 0.68/1.06 maxlength = 115
% 0.68/1.06 maxnrvars = 195
% 0.68/1.06 excuselevel = 1
% 0.68/1.06 increasemaxweight = 1
% 0.68/1.06
% 0.68/1.06 maxselected = 10000000
% 0.68/1.06 maxnrclauses = 10000000
% 0.68/1.06
% 0.68/1.06 showgenerated = 0
% 0.68/1.06 showkept = 0
% 0.68/1.06 showselected = 0
% 0.68/1.06 showdeleted = 0
% 0.68/1.06 showresimp = 1
% 0.68/1.06 showstatus = 2000
% 0.68/1.06
% 0.68/1.06 prologoutput = 1
% 0.68/1.06 nrgoals = 5000000
% 0.68/1.06 totalproof = 1
% 0.68/1.06
% 0.68/1.06 Symbols occurring in the translation:
% 0.68/1.06
% 0.68/1.06 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.68/1.06 . [1, 2] (w:1, o:26, a:1, s:1, b:0),
% 0.68/1.06 ! [4, 1] (w:0, o:18, a:1, s:1, b:0),
% 0.68/1.06 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.68/1.06 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.68/1.06 'class_Orderings_Oorder' [40, 1] (w:1, o:23, a:1, s:1, b:0),
% 0.68/1.06 'c_lessequals' [43, 3] (w:1, o:51, a:1, s:1, b:0),
% 0.68/1.06 'c_SetInterval_OatLeastLessThan' [44, 3] (w:1, o:52, a:1, s:1, b:0),
% 0.68/1.06
% 0.68/1.06 'c_emptyset' [45, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.68/1.06 'c_Suc' [46, 1] (w:1, o:24, a:1, s:1, b:0),
% 0.68/1.06 'tc_nat' [47, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.68/1.06 'c_insert' [48, 3] (w:1, o:53, a:1, s:1, b:0),
% 0.68/1.06 'v_x' [52, 1] (w:1, o:25, a:1, s:1, b:0),
% 0.68/1.06 'v_nat' [53, 0] (w:1, o:17, a:1, s:1, b:0).
% 0.68/1.06
% 0.68/1.06
% 0.68/1.06 Starting Search:
% 0.68/1.06
% 0.68/1.06
% 0.68/1.06 Bliksems!, er is een bewijs:
% 0.68/1.06 % SZS status Unsatisfiable
% 0.68/1.06 % SZS output start Refutation
% 0.68/1.06
% 0.68/1.06 clause( 0, [ ~( 'class_Orderings_Oorder'( X ) ), ~( 'c_lessequals'( Y, Z, X
% 0.68/1.06 ) ), =( 'c_SetInterval_OatLeastLessThan'( Z, Y, X ), 'c_emptyset' ) ] )
% 0.68/1.06 .
% 0.68/1.06 clause( 1, [ =( 'c_SetInterval_OatLeastLessThan'( X, 'c_Suc'( X ), 'tc_nat'
% 0.68/1.06 ), 'c_insert'( X, 'c_emptyset', 'tc_nat' ) ) ] )
% 0.68/1.06 .
% 0.68/1.06 clause( 2, [ ~( =( 'c_insert'( X, Y, Z ), 'c_emptyset' ) ) ] )
% 0.68/1.06 .
% 0.68/1.06 clause( 3, [ 'c_lessequals'( X, 'v_x'( X ), 'tc_nat' ) ] )
% 0.68/1.06 .
% 0.68/1.06 clause( 4, [ =( 'v_x'( X ), 'v_nat' ) ] )
% 0.68/1.06 .
% 0.68/1.06 clause( 5, [ 'class_Orderings_Oorder'( 'tc_nat' ) ] )
% 0.68/1.06 .
% 0.68/1.06 clause( 6, [ 'c_lessequals'( X, 'v_nat', 'tc_nat' ) ] )
% 0.68/1.06 .
% 0.68/1.06 clause( 7, [ =( 'c_SetInterval_OatLeastLessThan'( 'v_nat', X, 'tc_nat' ),
% 0.68/1.06 'c_emptyset' ) ] )
% 0.68/1.06 .
% 0.68/1.06 clause( 10, [] )
% 0.68/1.06 .
% 0.68/1.06
% 0.68/1.06
% 0.68/1.06 % SZS output end Refutation
% 0.68/1.06 found a proof!
% 0.68/1.06
% 0.68/1.06 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.68/1.06
% 0.68/1.06 initialclauses(
% 0.68/1.06 [ clause( 12, [ ~( 'class_Orderings_Oorder'( X ) ), ~( 'c_lessequals'( Y, Z
% 0.68/1.06 , X ) ), =( 'c_SetInterval_OatLeastLessThan'( Z, Y, X ), 'c_emptyset' ) ]
% 0.68/1.06 )
% 0.68/1.06 , clause( 13, [ =( 'c_SetInterval_OatLeastLessThan'( X, 'c_Suc'( X ),
% 0.68/1.06 'tc_nat' ), 'c_insert'( X, 'c_emptyset', 'tc_nat' ) ) ] )
% 0.68/1.06 , clause( 14, [ ~( =( 'c_emptyset', 'c_insert'( X, Y, Z ) ) ) ] )
% 0.68/1.06 , clause( 15, [ 'c_lessequals'( X, 'v_x'( X ), 'tc_nat' ) ] )
% 0.68/1.06 , clause( 16, [ =( 'v_x'( X ), 'v_nat' ) ] )
% 0.68/1.06 , clause( 17, [ 'class_Orderings_Oorder'( 'tc_nat' ) ] )
% 0.68/1.06 ] ).
% 0.68/1.06
% 0.68/1.06
% 0.68/1.06
% 0.68/1.06 subsumption(
% 0.68/1.06 clause( 0, [ ~( 'class_Orderings_Oorder'( X ) ), ~( 'c_lessequals'( Y, Z, X
% 0.68/1.06 ) ), =( 'c_SetInterval_OatLeastLessThan'( Z, Y, X ), 'c_emptyset' ) ] )
% 0.68/1.06 , clause( 12, [ ~( 'class_Orderings_Oorder'( X ) ), ~( 'c_lessequals'( Y, Z
% 0.68/1.06 , X ) ), =( 'c_SetInterval_OatLeastLessThan'( Z, Y, X ), 'c_emptyset' ) ]
% 0.68/1.06 )
% 0.68/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.68/1.06 permutation( 0, [ ==>( 0, 0 ), ==>( 1, 1 ), ==>( 2, 2 )] ) ).
% 0.68/1.06
% 0.68/1.06
% 0.68/1.06 subsumption(
% 0.68/1.06 clause( 1, [ =( 'c_SetInterval_OatLeastLessThan'( X, 'c_Suc'( X ), 'tc_nat'
% 0.68/1.06 ), 'c_insert'( X, 'c_emptyset', 'tc_nat' ) ) ] )
% 0.68/1.06 , clause( 13, [ =( 'c_SetInterval_OatLeastLessThan'( X, 'c_Suc'( X ),
% 0.68/1.06 'tc_nat' ), 'c_insert'( X, 'c_emptyset', 'tc_nat' ) ) ] )
% 0.68/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.06
% 0.68/1.06
% 0.68/1.06 eqswap(
% 0.68/1.06 clause( 23, [ ~( =( 'c_insert'( X, Y, Z ), 'c_emptyset' ) ) ] )
% 0.68/1.06 , clause( 14, [ ~( =( 'c_emptyset', 'c_insert'( X, Y, Z ) ) ) ] )
% 0.68/1.06 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] )).
% 0.68/1.06
% 0.68/1.06
% 0.68/1.06 subsumption(
% 0.68/1.06 clause( 2, [ ~( =( 'c_insert'( X, Y, Z ), 'c_emptyset' ) ) ] )
% 0.68/1.06 , clause( 23, [ ~( =( 'c_insert'( X, Y, Z ), 'c_emptyset' ) ) ] )
% 0.68/1.06 , substitution( 0, [ :=( X, X ), :=( Y, Y ), :=( Z, Z )] ),
% 0.68/1.06 permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.06
% 0.68/1.06
% 0.68/1.06 subsumption(
% 0.68/1.06 clause( 3, [ 'c_lessequals'( X, 'v_x'( X ), 'tc_nat' ) ] )
% 0.68/1.06 , clause( 15, [ 'c_lessequals'( X, 'v_x'( X ), 'tc_nat' ) ] )
% 0.68/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.06
% 0.68/1.06
% 0.68/1.06 subsumption(
% 0.68/1.06 clause( 4, [ =( 'v_x'( X ), 'v_nat' ) ] )
% 0.68/1.06 , clause( 16, [ =( 'v_x'( X ), 'v_nat' ) ] )
% 0.68/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.06
% 0.68/1.06
% 0.68/1.06 subsumption(
% 0.68/1.06 clause( 5, [ 'class_Orderings_Oorder'( 'tc_nat' ) ] )
% 0.68/1.06 , clause( 17, [ 'class_Orderings_Oorder'( 'tc_nat' ) ] )
% 0.68/1.06 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.06
% 0.68/1.06
% 0.68/1.06 paramod(
% 0.68/1.06 clause( 36, [ 'c_lessequals'( X, 'v_nat', 'tc_nat' ) ] )
% 0.68/1.06 , clause( 4, [ =( 'v_x'( X ), 'v_nat' ) ] )
% 0.68/1.06 , 0, clause( 3, [ 'c_lessequals'( X, 'v_x'( X ), 'tc_nat' ) ] )
% 0.68/1.06 , 0, 2, substitution( 0, [ :=( X, X )] ), substitution( 1, [ :=( X, X )] )
% 0.68/1.06 ).
% 0.68/1.06
% 0.68/1.06
% 0.68/1.06 subsumption(
% 0.68/1.06 clause( 6, [ 'c_lessequals'( X, 'v_nat', 'tc_nat' ) ] )
% 0.68/1.06 , clause( 36, [ 'c_lessequals'( X, 'v_nat', 'tc_nat' ) ] )
% 0.68/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.06
% 0.68/1.06
% 0.68/1.06 eqswap(
% 0.68/1.06 clause( 37, [ =( 'c_emptyset', 'c_SetInterval_OatLeastLessThan'( X, Y, Z )
% 0.68/1.06 ), ~( 'class_Orderings_Oorder'( Z ) ), ~( 'c_lessequals'( Y, X, Z ) ) ]
% 0.68/1.06 )
% 0.68/1.06 , clause( 0, [ ~( 'class_Orderings_Oorder'( X ) ), ~( 'c_lessequals'( Y, Z
% 0.68/1.06 , X ) ), =( 'c_SetInterval_OatLeastLessThan'( Z, Y, X ), 'c_emptyset' ) ]
% 0.68/1.06 )
% 0.68/1.06 , 2, substitution( 0, [ :=( X, Z ), :=( Y, Y ), :=( Z, X )] )).
% 0.68/1.06
% 0.68/1.06
% 0.68/1.06 resolution(
% 0.68/1.06 clause( 38, [ =( 'c_emptyset', 'c_SetInterval_OatLeastLessThan'( 'v_nat', X
% 0.68/1.06 , 'tc_nat' ) ), ~( 'class_Orderings_Oorder'( 'tc_nat' ) ) ] )
% 0.68/1.06 , clause( 37, [ =( 'c_emptyset', 'c_SetInterval_OatLeastLessThan'( X, Y, Z
% 0.68/1.06 ) ), ~( 'class_Orderings_Oorder'( Z ) ), ~( 'c_lessequals'( Y, X, Z ) )
% 0.68/1.06 ] )
% 0.68/1.06 , 2, clause( 6, [ 'c_lessequals'( X, 'v_nat', 'tc_nat' ) ] )
% 0.68/1.06 , 0, substitution( 0, [ :=( X, 'v_nat' ), :=( Y, X ), :=( Z, 'tc_nat' )] )
% 0.68/1.06 , substitution( 1, [ :=( X, X )] )).
% 0.68/1.06
% 0.68/1.06
% 0.68/1.06 resolution(
% 0.68/1.06 clause( 39, [ =( 'c_emptyset', 'c_SetInterval_OatLeastLessThan'( 'v_nat', X
% 0.68/1.06 , 'tc_nat' ) ) ] )
% 0.68/1.06 , clause( 38, [ =( 'c_emptyset', 'c_SetInterval_OatLeastLessThan'( 'v_nat'
% 0.68/1.06 , X, 'tc_nat' ) ), ~( 'class_Orderings_Oorder'( 'tc_nat' ) ) ] )
% 0.68/1.06 , 1, clause( 5, [ 'class_Orderings_Oorder'( 'tc_nat' ) ] )
% 0.68/1.06 , 0, substitution( 0, [ :=( X, X )] ), substitution( 1, [] )).
% 0.68/1.06
% 0.68/1.06
% 0.68/1.06 eqswap(
% 0.68/1.06 clause( 40, [ =( 'c_SetInterval_OatLeastLessThan'( 'v_nat', X, 'tc_nat' ),
% 0.68/1.06 'c_emptyset' ) ] )
% 0.68/1.06 , clause( 39, [ =( 'c_emptyset', 'c_SetInterval_OatLeastLessThan'( 'v_nat'
% 0.68/1.06 , X, 'tc_nat' ) ) ] )
% 0.68/1.06 , 0, substitution( 0, [ :=( X, X )] )).
% 0.68/1.06
% 0.68/1.06
% 0.68/1.06 subsumption(
% 0.68/1.06 clause( 7, [ =( 'c_SetInterval_OatLeastLessThan'( 'v_nat', X, 'tc_nat' ),
% 0.68/1.06 'c_emptyset' ) ] )
% 0.68/1.06 , clause( 40, [ =( 'c_SetInterval_OatLeastLessThan'( 'v_nat', X, 'tc_nat' )
% 0.68/1.06 , 'c_emptyset' ) ] )
% 0.68/1.06 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.68/1.06
% 0.68/1.06
% 0.68/1.06 eqswap(
% 0.68/1.06 clause( 41, [ =( 'c_insert'( X, 'c_emptyset', 'tc_nat' ),
% 0.68/1.06 'c_SetInterval_OatLeastLessThan'( X, 'c_Suc'( X ), 'tc_nat' ) ) ] )
% 0.68/1.06 , clause( 1, [ =( 'c_SetInterval_OatLeastLessThan'( X, 'c_Suc'( X ),
% 0.68/1.06 'tc_nat' ), 'c_insert'( X, 'c_emptyset', 'tc_nat' ) ) ] )
% 0.68/1.06 , 0, substitution( 0, [ :=( X, X )] )).
% 0.68/1.06
% 0.68/1.06
% 0.68/1.06 paramod(
% 0.68/1.06 clause( 44, [ =( 'c_insert'( 'v_nat', 'c_emptyset', 'tc_nat' ),
% 0.68/1.06 'c_emptyset' ) ] )
% 0.68/1.06 , clause( 7, [ =( 'c_SetInterval_OatLeastLessThan'( 'v_nat', X, 'tc_nat' )
% 0.68/1.06 , 'c_emptyset' ) ] )
% 0.68/1.06 , 0, clause( 41, [ =( 'c_insert'( X, 'c_emptyset', 'tc_nat' ),
% 0.68/1.06 'c_SetInterval_OatLeastLessThan'( X, 'c_Suc'( X ), 'tc_nat' ) ) ] )
% 0.68/1.06 , 0, 5, substitution( 0, [ :=( X, 'c_Suc'( 'v_nat' ) )] ), substitution( 1
% 0.68/1.06 , [ :=( X, 'v_nat' )] )).
% 0.68/1.06
% 0.68/1.06
% 0.68/1.06 resolution(
% 0.68/1.06 clause( 45, [] )
% 0.68/1.06 , clause( 2, [ ~( =( 'c_insert'( X, Y, Z ), 'c_emptyset' ) ) ] )
% 0.68/1.06 , 0, clause( 44, [ =( 'c_insert'( 'v_nat', 'c_emptyset', 'tc_nat' ),
% 0.68/1.06 'c_emptyset' ) ] )
% 0.68/1.06 , 0, substitution( 0, [ :=( X, 'v_nat' ), :=( Y, 'c_emptyset' ), :=( Z,
% 0.68/1.06 'tc_nat' )] ), substitution( 1, [] )).
% 0.68/1.06
% 0.68/1.06
% 0.68/1.06 subsumption(
% 0.68/1.06 clause( 10, [] )
% 0.68/1.06 , clause( 45, [] )
% 0.68/1.06 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.68/1.06
% 0.68/1.06
% 0.68/1.06 end.
% 0.68/1.06
% 0.68/1.06 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.68/1.06
% 0.68/1.06 Memory use:
% 0.68/1.06
% 0.68/1.06 space for terms: 188
% 0.68/1.06 space for clauses: 850
% 0.68/1.06
% 0.68/1.06
% 0.68/1.06 clauses generated: 29
% 0.68/1.06 clauses kept: 11
% 0.68/1.06 clauses selected: 8
% 0.68/1.06 clauses deleted: 1
% 0.68/1.06 clauses inuse deleted: 0
% 0.68/1.06
% 0.68/1.06 subsentry: 121
% 0.68/1.06 literals s-matched: 58
% 0.68/1.06 literals matched: 58
% 0.68/1.06 full subsumption: 0
% 0.68/1.06
% 0.68/1.06 checksum: 1122415240
% 0.68/1.06
% 0.68/1.06
% 0.68/1.06 Bliksem ended
%------------------------------------------------------------------------------