TSTP Solution File: LCL905-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : LCL905-1 : TPTP v8.1.0. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n010.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 : Sun Jul 17 07:59:07 EDT 2022
% Result : Satisfiable 0.41s 1.09s
% Output : Saturation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : LCL905-1 : TPTP v8.1.0. Released v6.4.0.
% 0.11/0.12 % Command : bliksem %s
% 0.13/0.33 % Computer : n010.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % DateTime : Sat Jul 2 20:13:18 EDT 2022
% 0.18/0.33 % CPUTime :
% 0.41/1.09 *** allocated 10000 integers for termspace/termends
% 0.41/1.09 *** allocated 10000 integers for clauses
% 0.41/1.09 *** allocated 10000 integers for justifications
% 0.41/1.09 Bliksem 1.12
% 0.41/1.09
% 0.41/1.09
% 0.41/1.09 Automatic Strategy Selection
% 0.41/1.09
% 0.41/1.09 Clauses:
% 0.41/1.09 [
% 0.41/1.09 [ =( not( X ), xor( X, truth ) ) ],
% 0.41/1.09 [ =( xor( X, falsehood ), X ) ],
% 0.41/1.09 [ =( xor( X, X ), falsehood ) ],
% 0.41/1.09 [ =( 'and_star'( X, truth ), X ) ],
% 0.41/1.09 [ =( 'and_star'( X, falsehood ), falsehood ) ],
% 0.41/1.09 [ =( 'and_star'( xor( truth, X ), X ), falsehood ) ],
% 0.41/1.09 [ =( xor( X, xor( truth, Y ) ), xor( xor( X, truth ), Y ) ) ],
% 0.41/1.09 [ =( 'and_star'( xor( 'and_star'( xor( truth, X ), Y ), truth ), Y ),
% 0.41/1.09 'and_star'( xor( 'and_star'( xor( truth, Y ), X ), truth ), X ) ) ],
% 0.41/1.09 [ =( not( X ), xor( X, truth ) ) ],
% 0.41/1.09 [ =( xor( X, falsehood ), X ) ],
% 0.41/1.09 [ =( xor( X, X ), falsehood ) ],
% 0.41/1.09 [ =( 'and_star'( X, truth ), X ) ],
% 0.41/1.09 [ =( 'and_star'( X, falsehood ), falsehood ) ],
% 0.41/1.09 [ =( 'and_star'( xor( truth, X ), X ), falsehood ) ],
% 0.41/1.09 [ =( xor( X, xor( truth, Y ) ), xor( xor( X, truth ), Y ) ) ],
% 0.41/1.09 [ =( 'and_star'( xor( 'and_star'( xor( truth, X ), Y ), truth ), Y ),
% 0.41/1.09 'and_star'( xor( 'and_star'( xor( truth, Y ), X ), truth ), X ) ) ]
% 0.41/1.09 ] .
% 0.41/1.09
% 0.41/1.09
% 0.41/1.09 percentage equality = 1.000000, percentage horn = 1.000000
% 0.41/1.09 This is a pure equality problem
% 0.41/1.09
% 0.41/1.09
% 0.41/1.09
% 0.41/1.09 Options Used:
% 0.41/1.09
% 0.41/1.09 useres = 1
% 0.41/1.09 useparamod = 1
% 0.41/1.09 useeqrefl = 1
% 0.41/1.09 useeqfact = 1
% 0.41/1.09 usefactor = 1
% 0.41/1.09 usesimpsplitting = 0
% 0.41/1.09 usesimpdemod = 5
% 0.41/1.09 usesimpres = 3
% 0.41/1.09
% 0.41/1.09 resimpinuse = 1000
% 0.41/1.09 resimpclauses = 20000
% 0.41/1.09 substype = eqrewr
% 0.41/1.09 backwardsubs = 1
% 0.41/1.09 selectoldest = 5
% 0.41/1.09
% 0.41/1.09 litorderings [0] = split
% 0.41/1.09 litorderings [1] = extend the termordering, first sorting on arguments
% 0.41/1.09
% 0.41/1.09 termordering = kbo
% 0.41/1.09
% 0.41/1.09 litapriori = 0
% 0.41/1.09 termapriori = 1
% 0.41/1.09 litaposteriori = 0
% 0.41/1.09 termaposteriori = 0
% 0.41/1.09 demodaposteriori = 0
% 0.41/1.09 ordereqreflfact = 0
% 0.41/1.09
% 0.41/1.09 litselect = negord
% 0.41/1.09
% 0.41/1.09 maxweight = 15
% 0.41/1.09 maxdepth = 30000
% 0.41/1.09 maxlength = 115
% 0.41/1.09 maxnrvars = 195
% 0.41/1.09 excuselevel = 1
% 0.41/1.09 increasemaxweight = 1
% 0.41/1.09
% 0.41/1.09 maxselected = 10000000
% 0.41/1.09 maxnrclauses = 10000000
% 0.41/1.09
% 0.41/1.09 showgenerated = 0
% 0.41/1.09 showkept = 0
% 0.41/1.09 showselected = 0
% 0.41/1.09 showdeleted = 0
% 0.41/1.09 showresimp = 1
% 0.41/1.09 showstatus = 2000
% 0.41/1.09
% 0.41/1.09 prologoutput = 1
% 0.41/1.09 nrgoals = 5000000
% 0.41/1.09 totalproof = 1
% 0.41/1.09
% 0.41/1.09 Symbols occurring in the translation:
% 0.41/1.09
% 0.41/1.09 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.41/1.09 . [1, 2] (w:1, o:19, a:1, s:1, b:0),
% 0.41/1.09 ! [4, 1] (w:0, o:13, a:1, s:1, b:0),
% 0.41/1.09 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.41/1.09 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.41/1.09 not [40, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.41/1.09 truth [41, 0] (w:1, o:10, a:1, s:1, b:0),
% 0.41/1.09 xor [42, 2] (w:1, o:44, a:1, s:1, b:0),
% 0.41/1.09 falsehood [43, 0] (w:1, o:11, a:1, s:1, b:0),
% 0.41/1.09 'and_star' [44, 2] (w:1, o:45, a:1, s:1, b:0).
% 0.41/1.09
% 0.41/1.09
% 0.41/1.09 Starting Search:
% 0.41/1.09
% 0.41/1.09 Resimplifying inuse:
% 0.41/1.09 Done
% 0.41/1.09
% 0.41/1.09 Failed to find proof!
% 0.41/1.09 maxweight = 15
% 0.41/1.09 maxnrclauses = 10000000
% 0.41/1.09 Generated: 194
% 0.41/1.09 Kept: 21
% 0.41/1.09
% 0.41/1.09
% 0.41/1.09 The strategy used was not complete!
% 0.41/1.09
% 0.41/1.09 Increased maxweight to 16
% 0.41/1.09
% 0.41/1.09 Starting Search:
% 0.41/1.09
% 0.41/1.09 Resimplifying inuse:
% 0.41/1.09 Done
% 0.41/1.09
% 0.41/1.09 Failed to find proof!
% 0.41/1.09 maxweight = 16
% 0.41/1.09 maxnrclauses = 10000000
% 0.41/1.09 Generated: 194
% 0.41/1.09 Kept: 21
% 0.41/1.09
% 0.41/1.09
% 0.41/1.09 The strategy used was not complete!
% 0.41/1.09
% 0.41/1.09 Increased maxweight to 17
% 0.41/1.09
% 0.41/1.09 Starting Search:
% 0.41/1.09
% 0.41/1.09 Resimplifying inuse:
% 0.41/1.09 Done
% 0.41/1.09
% 0.41/1.09 Failed to find proof!
% 0.41/1.09 maxweight = 17
% 0.41/1.09 maxnrclauses = 10000000
% 0.41/1.09 Generated: 194
% 0.41/1.09 Kept: 21
% 0.41/1.09
% 0.41/1.09
% 0.41/1.09 The strategy used was not complete!
% 0.41/1.09
% 0.41/1.09 Increased maxweight to 18
% 0.41/1.09
% 0.41/1.09 Starting Search:
% 0.41/1.09
% 0.41/1.09 Resimplifying inuse:
% 0.41/1.09 Done
% 0.41/1.09
% 0.41/1.09 Failed to find proof!
% 0.41/1.09 maxweight = 18
% 0.41/1.09 maxnrclauses = 10000000
% 0.41/1.09 Generated: 194
% 0.41/1.09 Kept: 21
% 0.41/1.09
% 0.41/1.09
% 0.41/1.09 The strategy used was not complete!
% 0.41/1.09
% 0.41/1.09 Increased maxweight to 19
% 0.41/1.09
% 0.41/1.09 Starting Search:
% 0.41/1.09
% 0.41/1.09 Resimplifying inuse:
% 0.41/1.09 Done
% 0.41/1.09
% 0.41/1.09 Failed to find proof!
% 0.41/1.09 maxweight = 19
% 0.41/1.09 maxnrclauses = 10000000
% 0.41/1.09 Generated: 194
% 0.41/1.09 Kept: 21
% 0.41/1.09
% 0.41/1.09
% 0.41/1.09 The strategy used was not complete!
% 0.41/1.09
% 0.41/1.09 Increased maxweight to 20
% 0.41/1.09
% 0.41/1.09 Starting Search:
% 0.41/1.09
% 0.41/1.09 Resimplifying inuse:
% 0.41/1.09 Done
% 0.41/1.09
% 0.41/1.09 Failed to find proof!
% 0.41/1.09 maxweight = 20
% 0.41/1.09 maxnrclauses = 10000000
% 0.41/1.09 Generated: 194
% 0.41/1.09 Kept: 21
% 0.41/1.09
% 0.41/1.09
% 0.41/1.09 The strategy used was not complete!
% 0.41/1.09
% 0.41/1.09 Increased maxweight to 21
% 0.41/1.09
% 0.41/1.09 Starting Search:
% 0.41/1.09
% 0.41/1.09 Resimplifying inuse:
% 0.41/1.09 Done
% 0.41/1.09
% 0.41/1.09 Failed to find proof!
% 0.41/1.09 maxweight = 21
% 0.41/1.09 maxnrclauses = 10000000
% 0.41/1.09 Generated: 325
% 0.41/1.09 Kept: 25
% 0.41/1.09
% 0.41/1.09
% 0.41/1.09 The strategy used was not complete!
% 0.41/1.09
% 0.41/1.09 Increased maxweight to 22
% 0.41/1.09
% 0.41/1.09 Starting Search:
% 0.41/1.09
% 0.41/1.09 Resimplifying inuse:
% 0.41/1.09 Done
% 0.41/1.09
% 0.41/1.09 Failed to find proof!
% 0.41/1.09 maxweight = 22
% 0.41/1.09 maxnrclauses = 10000000
% 0.41/1.09 Generated: 325
% 0.41/1.09 Kept: 25
% 0.41/1.09
% 0.41/1.09
% 0.41/1.09 The strategy used was not complete!
% 0.41/1.09
% 0.41/1.09 Increased maxweight to 23
% 0.41/1.09
% 0.41/1.09 Starting Search:
% 0.41/1.09
% 0.41/1.09 Resimplifying inuse:
% 0.41/1.09 Done
% 0.41/1.09
% 0.41/1.09 Failed to find proof!
% 0.41/1.09 maxweight = 23
% 0.41/1.09 maxnrclauses = 10000000
% 0.41/1.09 Generated: 325
% 0.41/1.09 Kept: 25
% 0.41/1.09
% 0.41/1.09
% 0.41/1.09 The strategy used was not complete!
% 0.41/1.09
% 0.41/1.09 Increased maxweight to 24
% 0.41/1.09
% 0.41/1.09 Starting Search:
% 0.41/1.09
% 0.41/1.09 Resimplifying inuse:
% 0.41/1.09 Done
% 0.41/1.09
% 0.41/1.09 Failed to find proof!
% 0.41/1.09 maxweight = 24
% 0.41/1.09 maxnrclauses = 10000000
% 0.41/1.09 Generated: 325
% 0.41/1.09 Kept: 25
% 0.41/1.09
% 0.41/1.09
% 0.41/1.09 The strategy used was not complete!
% 0.41/1.09
% 0.41/1.09 Increased maxweight to 25
% 0.41/1.09
% 0.41/1.09 Starting Search:
% 0.41/1.09
% 0.41/1.09 Resimplifying inuse:
% 0.41/1.09 Done
% 0.41/1.09
% 0.41/1.09
% 0.41/1.09
% 0.41/1.09 found a saturation!
% 0.41/1.09 % SZS status Satisfiable
% 0.41/1.09 % SZS output start Saturation
% 0.41/1.09
% 0.41/1.09 clause( 24, [ =( 'and_star'( not( 'and_star'( xor( falsehood, Y ), xor(
% 0.41/1.09 truth, X ) ) ), xor( truth, X ) ), 'and_star'( not( 'and_star'( xor(
% 0.41/1.09 falsehood, X ), xor( truth, Y ) ) ), xor( truth, Y ) ) ) ] )
% 0.41/1.09 .
% 0.41/1.09 clause( 26, [ =( 'and_star'( not( 'and_star'( xor( falsehood, X ), xor(
% 0.41/1.09 falsehood, Y ) ) ), xor( falsehood, Y ) ), 'and_star'( not( 'and_star'(
% 0.41/1.09 xor( falsehood, X ), Y ) ), Y ) ) ] )
% 0.41/1.09 .
% 0.41/1.09 clause( 25, [ =( 'and_star'( not( 'and_star'( xor( truth, Y ), xor(
% 0.41/1.09 falsehood, X ) ) ), xor( falsehood, X ) ), 'and_star'( not( 'and_star'(
% 0.41/1.09 xor( truth, Y ), X ) ), X ) ) ] )
% 0.41/1.09 .
% 0.41/1.09 clause( 15, [ =( 'and_star'( not( 'and_star'( falsehood, X ) ), X ), not(
% 0.41/1.09 xor( truth, X ) ) ) ] )
% 0.41/1.09 .
% 0.41/1.09 clause( 14, [ =( 'and_star'( not( 'and_star'( xor( falsehood, X ), Y ) ), Y
% 0.41/1.09 ), 'and_star'( not( 'and_star'( xor( truth, Y ), xor( truth, X ) ) ),
% 0.41/1.09 xor( truth, X ) ) ) ] )
% 0.41/1.09 .
% 0.41/1.09 clause( 22, [ =( 'and_star'( not( 'and_star'( truth, X ) ), xor( falsehood
% 0.41/1.09 , X ) ), falsehood ) ] )
% 0.41/1.09 .
% 0.41/1.09 clause( 21, [ =( 'and_star'( truth, xor( falsehood, X ) ), 'and_star'(
% 0.41/1.09 truth, X ) ) ] )
% 0.41/1.09 .
% 0.41/1.09 clause( 18, [ =( 'and_star'( xor( truth, X ), xor( falsehood, X ) ),
% 0.41/1.09 falsehood ) ] )
% 0.41/1.09 .
% 0.41/1.09 clause( 19, [ =( xor( Y, xor( falsehood, X ) ), xor( Y, X ) ) ] )
% 0.41/1.09 .
% 0.41/1.09 clause( 10, [ =( 'and_star'( xor( falsehood, X ), xor( truth, X ) ),
% 0.41/1.09 falsehood ) ] )
% 0.41/1.09 .
% 0.41/1.09 clause( 17, [ =( xor( xor( falsehood, X ), X ), falsehood ) ] )
% 0.41/1.09 .
% 0.41/1.09 clause( 12, [ =( xor( not( xor( truth, X ) ), X ), falsehood ) ] )
% 0.41/1.09 .
% 0.41/1.09 clause( 16, [ =( 'and_star'( not( 'and_star'( truth, X ) ), X ), falsehood
% 0.41/1.09 ) ] )
% 0.41/1.09 .
% 0.41/1.09 clause( 7, [ =( 'and_star'( not( 'and_star'( xor( truth, X ), Y ) ), Y ),
% 0.41/1.09 'and_star'( not( 'and_star'( xor( truth, Y ), X ) ), X ) ) ] )
% 0.41/1.09 .
% 0.41/1.09 clause( 13, [ =( not( falsehood ), truth ) ] )
% 0.41/1.09 .
% 0.41/1.09 clause( 11, [ =( not( not( X ) ), X ) ] )
% 0.41/1.09 .
% 0.41/1.09 clause( 6, [ =( xor( X, xor( truth, Y ) ), xor( not( X ), Y ) ) ] )
% 0.41/1.09 .
% 0.41/1.09 clause( 8, [ =( not( truth ), falsehood ) ] )
% 0.41/1.09 .
% 0.41/1.09 clause( 5, [ =( 'and_star'( xor( truth, X ), X ), falsehood ) ] )
% 0.41/1.09 .
% 0.41/1.09 clause( 0, [ =( xor( X, truth ), not( X ) ) ] )
% 0.41/1.09 .
% 0.41/1.09 clause( 1, [ =( xor( X, falsehood ), X ) ] )
% 0.41/1.09 .
% 0.41/1.09 clause( 2, [ =( xor( X, X ), falsehood ) ] )
% 0.41/1.09 .
% 0.41/1.09 clause( 3, [ =( 'and_star'( X, truth ), X ) ] )
% 0.41/1.09 .
% 0.41/1.09 clause( 4, [ =( 'and_star'( X, falsehood ), falsehood ) ] )
% 0.41/1.09 .
% 0.41/1.09
% 0.41/1.09
% 0.41/1.09 % SZS output end Saturation
% 0.41/1.09 end of saturation!
% 0.41/1.09
% 0.41/1.09 Memory use:
% 0.41/1.09
% 0.41/1.09 space for terms: 621
% 0.41/1.09 space for clauses: 3031
% 0.41/1.09
% 0.41/1.09
% 0.41/1.09 clauses generated: 370
% 0.41/1.09 clauses kept: 27
% 0.41/1.09 clauses selected: 25
% 0.41/1.09 clauses deleted: 3
% 0.41/1.09 clauses inuse deleted: 1
% 0.41/1.09
% 0.41/1.09 subsentry: 41
% 0.41/1.09 literals s-matched: 41
% 0.41/1.09 literals matched: 41
% 0.41/1.09 full subsumption: 0
% 0.41/1.09
% 0.41/1.09 checksum: -25266516
% 0.41/1.09
% 0.41/1.09
% 0.41/1.09 Bliksem ended
%------------------------------------------------------------------------------