TSTP Solution File: ROB030-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : ROB030-1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n027.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:32 EDT 2022
% Result : Unsatisfiable 0.43s 0.80s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : ROB030-1 : TPTP v8.1.0. Released v3.1.0.
% 0.00/0.11 % Command : bliksem %s
% 0.08/0.30 % Computer : n027.cluster.edu
% 0.08/0.30 % Model : x86_64 x86_64
% 0.08/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.30 % Memory : 8042.1875MB
% 0.08/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.30 % CPULimit : 300
% 0.08/0.30 % DateTime : Thu Jun 9 13:30:12 EDT 2022
% 0.08/0.30 % CPUTime :
% 0.43/0.80 *** allocated 10000 integers for termspace/termends
% 0.43/0.80 *** allocated 10000 integers for clauses
% 0.43/0.80 *** allocated 10000 integers for justifications
% 0.43/0.80 Bliksem 1.12
% 0.43/0.80
% 0.43/0.80
% 0.43/0.80 Automatic Strategy Selection
% 0.43/0.80
% 0.43/0.80 Clauses:
% 0.43/0.80 [
% 0.43/0.80 [ =( add( X, Y ), add( Y, X ) ) ],
% 0.43/0.80 [ =( add( add( X, Y ), Z ), add( X, add( Y, Z ) ) ) ],
% 0.43/0.80 [ =( negate( add( negate( add( X, Y ) ), negate( add( X, negate( Y ) ) )
% 0.43/0.80 ) ), X ) ],
% 0.43/0.80 [ =( add( c, d ), d ) ],
% 0.43/0.80 [ ~( =( negate( add( X, Y ) ), negate( Y ) ) ) ]
% 0.43/0.80 ] .
% 0.43/0.80
% 0.43/0.80
% 0.43/0.80 percentage equality = 1.000000, percentage horn = 1.000000
% 0.43/0.80 This is a pure equality problem
% 0.43/0.80
% 0.43/0.80
% 0.43/0.80
% 0.43/0.80 Options Used:
% 0.43/0.80
% 0.43/0.80 useres = 1
% 0.43/0.80 useparamod = 1
% 0.43/0.80 useeqrefl = 1
% 0.43/0.80 useeqfact = 1
% 0.43/0.80 usefactor = 1
% 0.43/0.80 usesimpsplitting = 0
% 0.43/0.80 usesimpdemod = 5
% 0.43/0.80 usesimpres = 3
% 0.43/0.80
% 0.43/0.80 resimpinuse = 1000
% 0.43/0.80 resimpclauses = 20000
% 0.43/0.80 substype = eqrewr
% 0.43/0.80 backwardsubs = 1
% 0.43/0.80 selectoldest = 5
% 0.43/0.80
% 0.43/0.80 litorderings [0] = split
% 0.43/0.80 litorderings [1] = extend the termordering, first sorting on arguments
% 0.43/0.80
% 0.43/0.80 termordering = kbo
% 0.43/0.80
% 0.43/0.80 litapriori = 0
% 0.43/0.80 termapriori = 1
% 0.43/0.80 litaposteriori = 0
% 0.43/0.80 termaposteriori = 0
% 0.43/0.80 demodaposteriori = 0
% 0.43/0.80 ordereqreflfact = 0
% 0.43/0.80
% 0.43/0.80 litselect = negord
% 0.43/0.80
% 0.43/0.80 maxweight = 15
% 0.43/0.80 maxdepth = 30000
% 0.43/0.80 maxlength = 115
% 0.43/0.80 maxnrvars = 195
% 0.43/0.80 excuselevel = 1
% 0.43/0.80 increasemaxweight = 1
% 0.43/0.80
% 0.43/0.80 maxselected = 10000000
% 0.43/0.80 maxnrclauses = 10000000
% 0.43/0.80
% 0.43/0.80 showgenerated = 0
% 0.43/0.80 showkept = 0
% 0.43/0.80 showselected = 0
% 0.43/0.80 showdeleted = 0
% 0.43/0.80 showresimp = 1
% 0.43/0.80 showstatus = 2000
% 0.43/0.80
% 0.43/0.80 prologoutput = 1
% 0.43/0.80 nrgoals = 5000000
% 0.43/0.80 totalproof = 1
% 0.43/0.80
% 0.43/0.80 Symbols occurring in the translation:
% 0.43/0.80
% 0.43/0.80 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.43/0.80 . [1, 2] (w:1, o:22, a:1, s:1, b:0),
% 0.43/0.80 ! [4, 1] (w:0, o:16, a:1, s:1, b:0),
% 0.43/0.80 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.43/0.80 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.43/0.80 add [41, 2] (w:1, o:47, a:1, s:1, b:0),
% 0.43/0.80 negate [43, 1] (w:1, o:21, a:1, s:1, b:0),
% 0.43/0.80 c [44, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.43/0.80 d [45, 0] (w:1, o:13, a:1, s:1, b:0).
% 0.43/0.80
% 0.43/0.80
% 0.43/0.80 Starting Search:
% 0.43/0.80
% 0.43/0.80
% 0.43/0.80 Bliksems!, er is een bewijs:
% 0.43/0.80 % SZS status Unsatisfiable
% 0.43/0.80 % SZS output start Refutation
% 0.43/0.80
% 0.43/0.80 clause( 3, [ =( add( c, d ), d ) ] )
% 0.43/0.80 .
% 0.43/0.80 clause( 4, [ ~( =( negate( add( X, Y ) ), negate( Y ) ) ) ] )
% 0.43/0.80 .
% 0.43/0.80 clause( 8, [] )
% 0.43/0.80 .
% 0.43/0.80
% 0.43/0.80
% 0.43/0.80 % SZS output end Refutation
% 0.43/0.80 found a proof!
% 0.43/0.80
% 0.43/0.80 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.43/0.80
% 0.43/0.80 initialclauses(
% 0.43/0.80 [ clause( 10, [ =( add( X, Y ), add( Y, X ) ) ] )
% 0.43/0.80 , clause( 11, [ =( add( add( X, Y ), Z ), add( X, add( Y, Z ) ) ) ] )
% 0.43/0.80 , clause( 12, [ =( negate( add( negate( add( X, Y ) ), negate( add( X,
% 0.43/0.80 negate( Y ) ) ) ) ), X ) ] )
% 0.43/0.80 , clause( 13, [ =( add( c, d ), d ) ] )
% 0.43/0.80 , clause( 14, [ ~( =( negate( add( X, Y ) ), negate( Y ) ) ) ] )
% 0.43/0.80 ] ).
% 0.43/0.80
% 0.43/0.80
% 0.43/0.80
% 0.43/0.80 subsumption(
% 0.43/0.80 clause( 3, [ =( add( c, d ), d ) ] )
% 0.43/0.80 , clause( 13, [ =( add( c, d ), d ) ] )
% 0.43/0.80 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.43/0.80
% 0.43/0.80
% 0.43/0.80 subsumption(
% 0.43/0.80 clause( 4, [ ~( =( negate( add( X, Y ) ), negate( Y ) ) ) ] )
% 0.43/0.80 , clause( 14, [ ~( =( negate( add( X, Y ) ), negate( Y ) ) ) ] )
% 0.43/0.80 , substitution( 0, [ :=( X, X ), :=( Y, Y )] ), permutation( 0, [ ==>( 0, 0
% 0.43/0.80 )] ) ).
% 0.43/0.80
% 0.43/0.80
% 0.43/0.80 eqswap(
% 0.43/0.80 clause( 23, [ ~( =( negate( Y ), negate( add( X, Y ) ) ) ) ] )
% 0.43/0.80 , clause( 4, [ ~( =( negate( add( X, Y ) ), negate( Y ) ) ) ] )
% 0.43/0.80 , 0, substitution( 0, [ :=( X, X ), :=( Y, Y )] )).
% 0.43/0.80
% 0.43/0.80
% 0.43/0.80 paramod(
% 0.43/0.80 clause( 24, [ ~( =( negate( d ), negate( d ) ) ) ] )
% 0.43/0.80 , clause( 3, [ =( add( c, d ), d ) ] )
% 0.43/0.80 , 0, clause( 23, [ ~( =( negate( Y ), negate( add( X, Y ) ) ) ) ] )
% 0.43/0.80 , 0, 5, substitution( 0, [] ), substitution( 1, [ :=( X, c ), :=( Y, d )] )
% 0.43/0.80 ).
% 0.43/0.80
% 0.43/0.80
% 0.43/0.80 eqrefl(
% 0.43/0.80 clause( 25, [] )
% 0.43/0.80 , clause( 24, [ ~( =( negate( d ), negate( d ) ) ) ] )
% 0.43/0.80 , 0, substitution( 0, [] )).
% 0.43/0.80
% 0.43/0.80
% 0.43/0.80 subsumption(
% 0.43/0.80 clause( 8, [] )
% 0.43/0.80 , clause( 25, [] )
% 0.43/0.80 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.43/0.80
% 0.43/0.80
% 0.43/0.80 end.
% 0.43/0.80
% 0.43/0.80 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.43/0.80
% 0.43/0.80 Memory use:
% 0.43/0.80
% 0.43/0.80 space for terms: 178
% 0.43/0.80 space for clauses: 784
% 0.43/0.80
% 0.43/0.80
% 0.43/0.80 clauses generated: 29
% 0.43/0.80 clauses kept: 9
% 0.43/0.80 clauses selected: 4
% 0.43/0.80 clauses deleted: 0
% 0.43/0.80 clauses inuse deleted: 0
% 0.43/0.80
% 0.43/0.80 subsentry: 53
% 0.43/0.80 literals s-matched: 28
% 0.43/0.80 literals matched: 28
% 0.43/0.80 full subsumption: 0
% 0.43/0.80
% 0.43/0.80 checksum: 441661566
% 0.43/0.80
% 0.43/0.80
% 0.43/0.80 Bliksem ended
%------------------------------------------------------------------------------