TSTP Solution File: BOO027-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : BOO027-1 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n020.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 14 23:30:42 EDT 2022
% Result : Satisfiable 0.68s 1.09s
% Output : Saturation 0.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : BOO027-1 : TPTP v8.1.0. Released v2.2.0.
% 0.10/0.12 % Command : bliksem %s
% 0.12/0.33 % Computer : n020.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 1 17:46:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.68/1.09 *** allocated 10000 integers for termspace/termends
% 0.68/1.09 *** allocated 10000 integers for clauses
% 0.68/1.09 *** allocated 10000 integers for justifications
% 0.68/1.09 Bliksem 1.12
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 Automatic Strategy Selection
% 0.68/1.09
% 0.68/1.09 Clauses:
% 0.68/1.09 [
% 0.68/1.09 [ =( multiply( X, add( Y, Z ) ), add( multiply( Y, X ), multiply( Z, X )
% 0.68/1.09 ) ) ],
% 0.68/1.09 [ =( add( X, inverse( X ) ), one ) ],
% 0.68/1.09 [ =( add( multiply( X, inverse( X ) ), add( multiply( X, Y ), multiply(
% 0.68/1.09 inverse( X ), Y ) ) ), Y ) ],
% 0.68/1.09 [ =( add( multiply( X, inverse( Y ) ), add( multiply( X, Y ), multiply(
% 0.68/1.09 inverse( Y ), Y ) ) ), X ) ],
% 0.68/1.09 [ =( add( multiply( X, inverse( Y ) ), add( multiply( X, X ), multiply(
% 0.68/1.09 inverse( Y ), X ) ) ), X ) ],
% 0.68/1.09 [ ~( =( add( a, a ), a ) ) ]
% 0.68/1.09 ] .
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 percentage equality = 1.000000, percentage horn = 1.000000
% 0.68/1.09 This is a pure equality problem
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 Options Used:
% 0.68/1.09
% 0.68/1.09 useres = 1
% 0.68/1.09 useparamod = 1
% 0.68/1.09 useeqrefl = 1
% 0.68/1.09 useeqfact = 1
% 0.68/1.09 usefactor = 1
% 0.68/1.09 usesimpsplitting = 0
% 0.68/1.09 usesimpdemod = 5
% 0.68/1.09 usesimpres = 3
% 0.68/1.09
% 0.68/1.09 resimpinuse = 1000
% 0.68/1.09 resimpclauses = 20000
% 0.68/1.09 substype = eqrewr
% 0.68/1.09 backwardsubs = 1
% 0.68/1.09 selectoldest = 5
% 0.68/1.09
% 0.68/1.09 litorderings [0] = split
% 0.68/1.09 litorderings [1] = extend the termordering, first sorting on arguments
% 0.68/1.09
% 0.68/1.09 termordering = kbo
% 0.68/1.09
% 0.68/1.09 litapriori = 0
% 0.68/1.09 termapriori = 1
% 0.68/1.09 litaposteriori = 0
% 0.68/1.09 termaposteriori = 0
% 0.68/1.09 demodaposteriori = 0
% 0.68/1.09 ordereqreflfact = 0
% 0.68/1.09
% 0.68/1.09 litselect = negord
% 0.68/1.09
% 0.68/1.09 maxweight = 15
% 0.68/1.09 maxdepth = 30000
% 0.68/1.09 maxlength = 115
% 0.68/1.09 maxnrvars = 195
% 0.68/1.09 excuselevel = 1
% 0.68/1.09 increasemaxweight = 1
% 0.68/1.09
% 0.68/1.09 maxselected = 10000000
% 0.68/1.09 maxnrclauses = 10000000
% 0.68/1.09
% 0.68/1.09 showgenerated = 0
% 0.68/1.09 showkept = 0
% 0.68/1.09 showselected = 0
% 0.68/1.09 showdeleted = 0
% 0.68/1.09 showresimp = 1
% 0.68/1.09 showstatus = 2000
% 0.68/1.09
% 0.68/1.09 prologoutput = 1
% 0.68/1.09 nrgoals = 5000000
% 0.68/1.09 totalproof = 1
% 0.68/1.09
% 0.68/1.09 Symbols occurring in the translation:
% 0.68/1.09
% 0.68/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.68/1.09 . [1, 2] (w:1, o:20, a:1, s:1, b:0),
% 0.68/1.09 ! [4, 1] (w:0, o:14, a:1, s:1, b:0),
% 0.68/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.68/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.68/1.09 add [42, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.68/1.09 multiply [43, 2] (w:1, o:46, a:1, s:1, b:0),
% 0.68/1.09 inverse [44, 1] (w:1, o:19, a:1, s:1, b:0),
% 0.68/1.09 one [45, 0] (w:1, o:7, a:1, s:1, b:0),
% 0.68/1.09 a [46, 0] (w:1, o:13, a:1, s:1, b:0).
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 Starting Search:
% 0.68/1.09
% 0.68/1.09 Resimplifying inuse:
% 0.68/1.09 Done
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 found a saturation!
% 0.68/1.09 % SZS status Satisfiable
% 0.68/1.09 % SZS output start Saturation
% 0.68/1.09
% 0.68/1.09 clause( 3, [ =( add( multiply( X, inverse( Y ) ), multiply( Y, add( X,
% 0.68/1.09 inverse( Y ) ) ) ), X ) ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 4, [ =( add( multiply( X, inverse( Y ) ), multiply( X, add( X,
% 0.68/1.09 inverse( Y ) ) ) ), X ) ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 0, [ =( add( multiply( Y, X ), multiply( Z, X ) ), multiply( X, add(
% 0.68/1.09 Y, Z ) ) ) ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 2, [ =( add( multiply( X, inverse( X ) ), multiply( Y, one ) ), Y )
% 0.68/1.09 ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 1, [ =( add( X, inverse( X ) ), one ) ] )
% 0.68/1.09 .
% 0.68/1.09 clause( 5, [ ~( =( add( a, a ), a ) ) ] )
% 0.68/1.09 .
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 % SZS output end Saturation
% 0.68/1.09 end of saturation!
% 0.68/1.09
% 0.68/1.09 Memory use:
% 0.68/1.09
% 0.68/1.09 space for terms: 232
% 0.68/1.09 space for clauses: 697
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 clauses generated: 20
% 0.68/1.09 clauses kept: 6
% 0.68/1.09 clauses selected: 6
% 0.68/1.09 clauses deleted: 0
% 0.68/1.09 clauses inuse deleted: 0
% 0.68/1.09
% 0.68/1.09 subsentry: 0
% 0.68/1.09 literals s-matched: 0
% 0.68/1.09 literals matched: 0
% 0.68/1.09 full subsumption: 0
% 0.68/1.09
% 0.68/1.09 checksum: 579838605
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 Bliksem ended
%------------------------------------------------------------------------------