TSTP Solution File: ROB010-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : ROB010-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n028.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 : Mon Jul 18 20:49:27 EDT 2022
% Result : Unsatisfiable 0.43s 1.07s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ROB010-1 : TPTP v8.1.0. Released v1.0.0.
% 0.00/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n028.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 : Thu Jun 9 15:21:47 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.43/1.06 *** allocated 10000 integers for termspace/termends
% 0.43/1.06 *** allocated 10000 integers for clauses
% 0.43/1.06 *** allocated 10000 integers for justifications
% 0.43/1.06 Bliksem 1.12
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 Automatic Strategy Selection
% 0.43/1.06
% 0.43/1.06 Clauses:
% 0.43/1.06 [
% 0.43/1.06 [ =( add( X, Y ), add( Y, X ) ) ],
% 0.43/1.06 [ =( add( add( X, Y ), Z ), add( X, add( Y, Z ) ) ) ],
% 0.43/1.06 [ =( negate( add( negate( add( X, Y ) ), negate( add( X, negate( Y ) ) )
% 0.43/1.06 ) ), X ) ],
% 0.43/1.06 [ =( negate( add( a, negate( b ) ) ), c ) ],
% 0.43/1.06 [ ~( =( negate( add( c, negate( add( b, a ) ) ) ), a ) ) ]
% 0.43/1.06 ] .
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 percentage equality = 1.000000, percentage horn = 1.000000
% 0.43/1.06 This is a pure equality problem
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06
% 0.43/1.06 Options Used:
% 0.43/1.06
% 0.43/1.06 useres = 1
% 0.43/1.06 useparamod = 1
% 0.43/1.06 useeqrefl = 1
% 0.43/1.06 useeqfact = 1
% 0.43/1.06 usefactor = 1
% 0.43/1.06 usesimpsplitting = 0
% 0.43/1.06 usesimpdemod = 5
% 0.43/1.06 usesimpres = 3
% 0.43/1.06
% 0.43/1.06 resimpinuse = 1000
% 0.43/1.06 resimpclauses = 20000
% 0.43/1.06 substype = eqrewr
% 0.43/1.06 backwardsubs = 1
% 0.43/1.06 selectoldest = 5
% 0.43/1.06
% 0.43/1.06 litorderings [0] = split
% 0.43/1.06 litorderings [1] = extend the termordering, first sorting on arguments
% 0.43/1.06
% 0.43/1.06 termordering = kbo
% 0.43/1.06
% 0.43/1.06 litapriori = 0
% 0.43/1.06 termapriori = 1
% 0.43/1.06 litaposteriori = 0
% 0.43/1.06 termaposteriori = 0
% 0.43/1.06 demodaposteriori = 0
% 0.43/1.06 ordereqreflfact = 0
% 0.43/1.06
% 0.43/1.06 litselect = negord
% 0.43/1.06
% 0.43/1.06 maxweight = 15
% 0.43/1.06 maxdepth = 30000
% 0.43/1.06 maxlength = 115
% 0.43/1.06 maxnrvars = 195
% 0.43/1.06 excuselevel = 1
% 0.43/1.06 increasemaxweight = 1
% 0.43/1.06
% 0.43/1.06 maxselected = 10000000
% 0.43/1.06 maxnrclauses = 10000000
% 0.43/1.06
% 0.43/1.06 showgenerated = 0
% 0.43/1.06 showkept = 0
% 0.43/1.06 showselected = 0
% 0.43/1.06 showdeleted = 0
% 0.43/1.06 showresimp = 1
% 0.43/1.06 showstatus = 2000
% 0.43/1.06
% 0.43/1.06 prologoutput = 1
% 0.43/1.06 nrgoals = 5000000
% 0.43/1.06 totalproof = 1
% 0.43/1.06
% 0.43/1.06 Symbols occurring in the translation:
% 0.43/1.06
% 0.43/1.06 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.43/1.06 . [1, 2] (w:1, o:21, a:1, s:1, b:0),
% 0.43/1.06 ! [4, 1] (w:0, o:15, a:1, s:1, b:0),
% 0.43/1.06 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.43/1.06 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.43/1.06 add [41, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.43/1.06 negate [43, 1] (w:1, o:20, a:1, s:1, b:0),
% 0.43/1.06 a [44, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.43/1.06 b [45, 0] (w:1, o:13, a:1, s:1, b:0),
% 0.43/1.06 c [46, 0] (w:1, o:14, a:1, s:1, b:0).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 Starting Search:
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 Bliksems!, er is een bewijs:
% 0.43/1.07 % SZS status Unsatisfiable
% 0.43/1.07 % SZS output start Refutation
% 0.43/1.07
% 0.43/1.07 clause( 0, [ =( add( X, Y ), add( Y, X ) ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 2, [ =( negate( add( negate( add( X, Y ) ), negate( add( X, negate(
% 0.43/1.07 Y ) ) ) ) ), X ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 3, [ =( negate( add( a, negate( b ) ) ), c ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 4, [ ~( =( negate( add( c, negate( add( b, a ) ) ) ), a ) ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 6, [ ~( =( negate( add( negate( add( b, a ) ), c ) ), a ) ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 8, [ ~( =( negate( add( negate( add( a, b ) ), c ) ), a ) ) ] )
% 0.43/1.07 .
% 0.43/1.07 clause( 28, [] )
% 0.43/1.07 .
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 % SZS output end Refutation
% 0.43/1.07 found a proof!
% 0.43/1.07
% 0.43/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.43/1.07
% 0.43/1.07 initialclauses(
% 0.43/1.07 [ clause( 30, [ =( add( X, Y ), add( Y, X ) ) ] )
% 0.43/1.07 , clause( 31, [ =( add( add( X, Y ), Z ), add( X, add( Y, Z ) ) ) ] )
% 0.43/1.07 , clause( 32, [ =( negate( add( negate( add( X, Y ) ), negate( add( X,
% 0.43/1.07 negate( Y ) ) ) ) ), X ) ] )
% 0.43/1.07 , clause( 33, [ =( negate( add( a, negate( b ) ) ), c ) ] )
% 0.43/1.07 , clause( 34, [ ~( =( negate( add( c, negate( add( b, a ) ) ) ), a ) ) ] )
% 0.43/1.07 ] ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 0, [ =( add( X, Y ), add( Y, X ) ) ] )
% 0.43/1.07 , clause( 30, [ =( add( X, Y ), add( Y, X ) ) ] )
% 0.43/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.43/1.07 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 2, [ =( negate( add( negate( add( X, Y ) ), negate( add( X, negate(
% 0.43/1.07 Y ) ) ) ) ), X ) ] )
% 0.43/1.07 , clause( 32, [ =( negate( add( negate( add( X, Y ) ), negate( add( X,
% 0.43/1.07 negate( Y ) ) ) ) ), X ) ] )
% 0.43/1.07 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.43/1.07 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 3, [ =( negate( add( a, negate( b ) ) ), c ) ] )
% 0.43/1.07 , clause( 33, [ =( negate( add( a, negate( b ) ) ), c ) ] )
% 0.43/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 4, [ ~( =( negate( add( c, negate( add( b, a ) ) ) ), a ) ) ] )
% 0.43/1.07 , clause( 34, [ ~( =( negate( add( c, negate( add( b, a ) ) ) ), a ) ) ] )
% 0.43/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 eqswap(
% 0.43/1.07 clause( 44, [ ~( =( a, negate( add( c, negate( add( b, a ) ) ) ) ) ) ] )
% 0.43/1.07 , clause( 4, [ ~( =( negate( add( c, negate( add( b, a ) ) ) ), a ) ) ] )
% 0.43/1.07 , 0, substitution( 0, [] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 paramod(
% 0.43/1.07 clause( 45, [ ~( =( a, negate( add( negate( add( b, a ) ), c ) ) ) ) ] )
% 0.43/1.07 , clause( 0, [ =( add( X, Y ), add( Y, X ) ) ] )
% 0.43/1.07 , 0, clause( 44, [ ~( =( a, negate( add( c, negate( add( b, a ) ) ) ) ) ) ]
% 0.43/1.07 )
% 0.43/1.07 , 0, 4, substitution( 0, [ :=( X, c ), :=( Y, negate( add( b, a ) ) )] ),
% 0.43/1.07 substitution( 1, [] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 eqswap(
% 0.43/1.07 clause( 49, [ ~( =( negate( add( negate( add( b, a ) ), c ) ), a ) ) ] )
% 0.43/1.07 , clause( 45, [ ~( =( a, negate( add( negate( add( b, a ) ), c ) ) ) ) ] )
% 0.43/1.07 , 0, substitution( 0, [] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 6, [ ~( =( negate( add( negate( add( b, a ) ), c ) ), a ) ) ] )
% 0.43/1.07 , clause( 49, [ ~( =( negate( add( negate( add( b, a ) ), c ) ), a ) ) ] )
% 0.43/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 eqswap(
% 0.43/1.07 clause( 53, [ ~( =( a, negate( add( negate( add( b, a ) ), c ) ) ) ) ] )
% 0.43/1.07 , clause( 6, [ ~( =( negate( add( negate( add( b, a ) ), c ) ), a ) ) ] )
% 0.43/1.07 , 0, substitution( 0, [] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 paramod(
% 0.43/1.07 clause( 55, [ ~( =( a, negate( add( negate( add( a, b ) ), c ) ) ) ) ] )
% 0.43/1.07 , clause( 0, [ =( add( X, Y ), add( Y, X ) ) ] )
% 0.43/1.07 , 0, clause( 53, [ ~( =( a, negate( add( negate( add( b, a ) ), c ) ) ) ) ]
% 0.43/1.07 )
% 0.43/1.07 , 0, 6, substitution( 0, [ :=( X, b ), :=( Y, a )] ), substitution( 1, [] )
% 0.43/1.07 ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 eqswap(
% 0.43/1.07 clause( 61, [ ~( =( negate( add( negate( add( a, b ) ), c ) ), a ) ) ] )
% 0.43/1.07 , clause( 55, [ ~( =( a, negate( add( negate( add( a, b ) ), c ) ) ) ) ] )
% 0.43/1.07 , 0, substitution( 0, [] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 8, [ ~( =( negate( add( negate( add( a, b ) ), c ) ), a ) ) ] )
% 0.43/1.07 , clause( 61, [ ~( =( negate( add( negate( add( a, b ) ), c ) ), a ) ) ] )
% 0.43/1.07 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 eqswap(
% 0.43/1.07 clause( 63, [ =( X, negate( add( negate( add( X, Y ) ), negate( add( X,
% 0.43/1.07 negate( Y ) ) ) ) ) ) ] )
% 0.43/1.07 , clause( 2, [ =( negate( add( negate( add( X, Y ) ), negate( add( X,
% 0.43/1.07 negate( Y ) ) ) ) ), X ) ] )
% 0.43/1.07 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 eqswap(
% 0.43/1.07 clause( 64, [ ~( =( a, negate( add( negate( add( a, b ) ), c ) ) ) ) ] )
% 0.43/1.07 , clause( 8, [ ~( =( negate( add( negate( add( a, b ) ), c ) ), a ) ) ] )
% 0.43/1.07 , 0, substitution( 0, [] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 paramod(
% 0.43/1.07 clause( 66, [ =( a, negate( add( negate( add( a, b ) ), c ) ) ) ] )
% 0.43/1.07 , clause( 3, [ =( negate( add( a, negate( b ) ) ), c ) ] )
% 0.43/1.07 , 0, clause( 63, [ =( X, negate( add( negate( add( X, Y ) ), negate( add( X
% 0.43/1.07 , negate( Y ) ) ) ) ) ) ] )
% 0.43/1.07 , 0, 8, substitution( 0, [] ), substitution( 1, [ :=( X, a ), :=( Y, b )] )
% 0.43/1.07 ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 resolution(
% 0.43/1.07 clause( 68, [] )
% 0.43/1.07 , clause( 64, [ ~( =( a, negate( add( negate( add( a, b ) ), c ) ) ) ) ] )
% 0.43/1.07 , 0, clause( 66, [ =( a, negate( add( negate( add( a, b ) ), c ) ) ) ] )
% 0.43/1.07 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 subsumption(
% 0.43/1.07 clause( 28, [] )
% 0.43/1.07 , clause( 68, [] )
% 0.43/1.07 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 end.
% 0.43/1.07
% 0.43/1.07 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.43/1.07
% 0.43/1.07 Memory use:
% 0.43/1.07
% 0.43/1.07 space for terms: 486
% 0.43/1.07 space for clauses: 2979
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 clauses generated: 156
% 0.43/1.07 clauses kept: 29
% 0.43/1.07 clauses selected: 11
% 0.43/1.07 clauses deleted: 0
% 0.43/1.07 clauses inuse deleted: 0
% 0.43/1.07
% 0.43/1.07 subsentry: 281
% 0.43/1.07 literals s-matched: 141
% 0.43/1.07 literals matched: 141
% 0.43/1.07 full subsumption: 0
% 0.43/1.07
% 0.43/1.07 checksum: -973269711
% 0.43/1.07
% 0.43/1.07
% 0.43/1.07 Bliksem ended
%------------------------------------------------------------------------------