TSTP Solution File: SYN082-1 by Bliksem---1.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Bliksem---1.12
% Problem : SYN082-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : bliksem %s
% Computer : n011.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 21 02:47:34 EDT 2022
% Result : Unsatisfiable 0.47s 1.13s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN082-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : bliksem %s
% 0.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % DateTime : Tue Jul 12 06:15:43 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.47/1.13 *** allocated 10000 integers for termspace/termends
% 0.47/1.13 *** allocated 10000 integers for clauses
% 0.47/1.13 *** allocated 10000 integers for justifications
% 0.47/1.13 Bliksem 1.12
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 Automatic Strategy Selection
% 0.47/1.13
% 0.47/1.13 Clauses:
% 0.47/1.13 [
% 0.47/1.13 [ 'big_f'( a, f( a ) ), ~( 'big_f'( X, b ) ), 'big_f'( X, f( a ) ) ]
% 0.47/1.13 ,
% 0.47/1.13 [ 'big_f'( a, f( a ) ), 'big_f'( a, b ) ],
% 0.47/1.13 [ 'big_f'( g( X ), X ), ~( 'big_f'( a, X ) ), ~( 'big_f'( Y, b ) ),
% 0.47/1.13 'big_f'( Y, f( a ) ) ],
% 0.47/1.13 [ 'big_f'( g( X ), X ), ~( 'big_f'( a, X ) ), 'big_f'( a, b ) ],
% 0.47/1.13 [ 'big_f'( g( X ), X ), ~( 'big_f'( a, X ) ), ~( 'big_f'( a, f( a ) ) )
% 0.47/1.13 ],
% 0.47/1.13 [ ~( 'big_f'( g( X ), X ) ), ~( 'big_f'( a, X ) ), ~( 'big_f'( Y, b ) )
% 0.47/1.13 , 'big_f'( Y, f( a ) ) ],
% 0.47/1.13 [ ~( 'big_f'( g( X ), X ) ), ~( 'big_f'( a, X ) ), 'big_f'( a, b ) ]
% 0.47/1.13 ,
% 0.47/1.13 [ ~( 'big_f'( g( X ), X ) ), ~( 'big_f'( a, X ) ), ~( 'big_f'( a, f( a )
% 0.47/1.13 ) ) ]
% 0.47/1.13 ] .
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 percentage equality = 0.000000, percentage horn = 0.500000
% 0.47/1.13 This a non-horn, non-equality problem
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 Options Used:
% 0.47/1.13
% 0.47/1.13 useres = 1
% 0.47/1.13 useparamod = 0
% 0.47/1.13 useeqrefl = 0
% 0.47/1.13 useeqfact = 0
% 0.47/1.13 usefactor = 1
% 0.47/1.13 usesimpsplitting = 0
% 0.47/1.13 usesimpdemod = 0
% 0.47/1.13 usesimpres = 3
% 0.47/1.13
% 0.47/1.13 resimpinuse = 1000
% 0.47/1.13 resimpclauses = 20000
% 0.47/1.13 substype = standard
% 0.47/1.13 backwardsubs = 1
% 0.47/1.13 selectoldest = 5
% 0.47/1.13
% 0.47/1.13 litorderings [0] = split
% 0.47/1.13 litorderings [1] = liftord
% 0.47/1.13
% 0.47/1.13 termordering = none
% 0.47/1.13
% 0.47/1.13 litapriori = 1
% 0.47/1.13 termapriori = 0
% 0.47/1.13 litaposteriori = 0
% 0.47/1.13 termaposteriori = 0
% 0.47/1.13 demodaposteriori = 0
% 0.47/1.13 ordereqreflfact = 0
% 0.47/1.13
% 0.47/1.13 litselect = none
% 0.47/1.13
% 0.47/1.13 maxweight = 15
% 0.47/1.13 maxdepth = 30000
% 0.47/1.13 maxlength = 115
% 0.47/1.13 maxnrvars = 195
% 0.47/1.13 excuselevel = 1
% 0.47/1.13 increasemaxweight = 1
% 0.47/1.13
% 0.47/1.13 maxselected = 10000000
% 0.47/1.13 maxnrclauses = 10000000
% 0.47/1.13
% 0.47/1.13 showgenerated = 0
% 0.47/1.13 showkept = 0
% 0.47/1.13 showselected = 0
% 0.47/1.13 showdeleted = 0
% 0.47/1.13 showresimp = 1
% 0.47/1.13 showstatus = 2000
% 0.47/1.13
% 0.47/1.13 prologoutput = 1
% 0.47/1.13 nrgoals = 5000000
% 0.47/1.13 totalproof = 1
% 0.47/1.13
% 0.47/1.13 Symbols occurring in the translation:
% 0.47/1.13
% 0.47/1.13 {} [0, 0] (w:1, o:2, a:1, s:1, b:0),
% 0.47/1.13 . [1, 2] (w:1, o:20, a:1, s:1, b:0),
% 0.47/1.13 ! [4, 1] (w:0, o:13, a:1, s:1, b:0),
% 0.47/1.13 = [13, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.47/1.13 ==> [14, 2] (w:1, o:0, a:0, s:1, b:0),
% 0.47/1.13 a [39, 0] (w:1, o:9, a:1, s:1, b:0),
% 0.47/1.13 f [40, 1] (w:1, o:18, a:1, s:1, b:0),
% 0.47/1.13 'big_f' [41, 2] (w:1, o:45, a:1, s:1, b:0),
% 0.47/1.13 b [43, 0] (w:1, o:12, a:1, s:1, b:0),
% 0.47/1.13 g [45, 1] (w:1, o:19, a:1, s:1, b:0).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 Starting Search:
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 Bliksems!, er is een bewijs:
% 0.47/1.13 % SZS status Unsatisfiable
% 0.47/1.13 % SZS output start Refutation
% 0.47/1.13
% 0.47/1.13 clause( 0, [ ~( 'big_f'( X, b ) ), 'big_f'( X, f( a ) ), 'big_f'( a, f( a )
% 0.47/1.13 ) ] )
% 0.47/1.13 .
% 0.47/1.13 clause( 1, [ 'big_f'( a, b ), 'big_f'( a, f( a ) ) ] )
% 0.47/1.13 .
% 0.47/1.13 clause( 4, [ ~( 'big_f'( a, X ) ), ~( 'big_f'( a, f( a ) ) ), 'big_f'( g( X
% 0.47/1.13 ), X ) ] )
% 0.47/1.13 .
% 0.47/1.13 clause( 7, [ ~( 'big_f'( a, f( a ) ) ), ~( 'big_f'( a, X ) ) ] )
% 0.47/1.13 .
% 0.47/1.13 clause( 8, [ 'big_f'( a, f( a ) ) ] )
% 0.47/1.13 .
% 0.47/1.13 clause( 12, [] )
% 0.47/1.13 .
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 % SZS output end Refutation
% 0.47/1.13 found a proof!
% 0.47/1.13
% 0.47/1.13 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.47/1.13
% 0.47/1.13 initialclauses(
% 0.47/1.13 [ clause( 14, [ 'big_f'( a, f( a ) ), ~( 'big_f'( X, b ) ), 'big_f'( X, f(
% 0.47/1.13 a ) ) ] )
% 0.47/1.13 , clause( 15, [ 'big_f'( a, f( a ) ), 'big_f'( a, b ) ] )
% 0.47/1.13 , clause( 16, [ 'big_f'( g( X ), X ), ~( 'big_f'( a, X ) ), ~( 'big_f'( Y,
% 0.47/1.13 b ) ), 'big_f'( Y, f( a ) ) ] )
% 0.47/1.13 , clause( 17, [ 'big_f'( g( X ), X ), ~( 'big_f'( a, X ) ), 'big_f'( a, b )
% 0.47/1.13 ] )
% 0.47/1.13 , clause( 18, [ 'big_f'( g( X ), X ), ~( 'big_f'( a, X ) ), ~( 'big_f'( a,
% 0.47/1.13 f( a ) ) ) ] )
% 0.47/1.13 , clause( 19, [ ~( 'big_f'( g( X ), X ) ), ~( 'big_f'( a, X ) ), ~( 'big_f'(
% 0.47/1.13 Y, b ) ), 'big_f'( Y, f( a ) ) ] )
% 0.47/1.13 , clause( 20, [ ~( 'big_f'( g( X ), X ) ), ~( 'big_f'( a, X ) ), 'big_f'( a
% 0.47/1.13 , b ) ] )
% 0.47/1.13 , clause( 21, [ ~( 'big_f'( g( X ), X ) ), ~( 'big_f'( a, X ) ), ~( 'big_f'(
% 0.47/1.13 a, f( a ) ) ) ] )
% 0.47/1.13 ] ).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 subsumption(
% 0.47/1.13 clause( 0, [ ~( 'big_f'( X, b ) ), 'big_f'( X, f( a ) ), 'big_f'( a, f( a )
% 0.47/1.13 ) ] )
% 0.47/1.13 , clause( 14, [ 'big_f'( a, f( a ) ), ~( 'big_f'( X, b ) ), 'big_f'( X, f(
% 0.47/1.13 a ) ) ] )
% 0.47/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 2 ), ==>( 1,
% 0.47/1.13 0 ), ==>( 2, 1 )] ) ).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 subsumption(
% 0.47/1.13 clause( 1, [ 'big_f'( a, b ), 'big_f'( a, f( a ) ) ] )
% 0.47/1.13 , clause( 15, [ 'big_f'( a, f( a ) ), 'big_f'( a, b ) ] )
% 0.47/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 1 ), ==>( 1, 0 )] )
% 0.47/1.13 ).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 subsumption(
% 0.47/1.13 clause( 4, [ ~( 'big_f'( a, X ) ), ~( 'big_f'( a, f( a ) ) ), 'big_f'( g( X
% 0.47/1.13 ), X ) ] )
% 0.47/1.13 , clause( 18, [ 'big_f'( g( X ), X ), ~( 'big_f'( a, X ) ), ~( 'big_f'( a,
% 0.47/1.13 f( a ) ) ) ] )
% 0.47/1.13 , substitution( 0, [ :=( X, X )] ), permutation( 0, [ ==>( 0, 2 ), ==>( 1,
% 0.47/1.13 0 ), ==>( 2, 1 )] ) ).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 factor(
% 0.47/1.13 clause( 69, [ ~( 'big_f'( g( f( a ) ), f( a ) ) ), ~( 'big_f'( a, f( a ) )
% 0.47/1.13 ) ] )
% 0.47/1.13 , clause( 21, [ ~( 'big_f'( g( X ), X ) ), ~( 'big_f'( a, X ) ), ~( 'big_f'(
% 0.47/1.13 a, f( a ) ) ) ] )
% 0.47/1.13 , 1, 2, substitution( 0, [ :=( X, f( a ) )] )).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 resolution(
% 0.47/1.13 clause( 70, [ ~( 'big_f'( a, f( a ) ) ), ~( 'big_f'( a, f( a ) ) ), ~(
% 0.47/1.13 'big_f'( a, f( a ) ) ) ] )
% 0.47/1.13 , clause( 69, [ ~( 'big_f'( g( f( a ) ), f( a ) ) ), ~( 'big_f'( a, f( a )
% 0.47/1.13 ) ) ] )
% 0.47/1.13 , 0, clause( 4, [ ~( 'big_f'( a, X ) ), ~( 'big_f'( a, f( a ) ) ), 'big_f'(
% 0.47/1.13 g( X ), X ) ] )
% 0.47/1.13 , 2, substitution( 0, [] ), substitution( 1, [ :=( X, f( a ) )] )).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 factor(
% 0.47/1.13 clause( 71, [ ~( 'big_f'( a, f( a ) ) ), ~( 'big_f'( a, f( a ) ) ) ] )
% 0.47/1.13 , clause( 70, [ ~( 'big_f'( a, f( a ) ) ), ~( 'big_f'( a, f( a ) ) ), ~(
% 0.47/1.13 'big_f'( a, f( a ) ) ) ] )
% 0.47/1.13 , 0, 1, substitution( 0, [] )).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 subsumption(
% 0.47/1.13 clause( 7, [ ~( 'big_f'( a, f( a ) ) ), ~( 'big_f'( a, X ) ) ] )
% 0.47/1.13 , clause( 71, [ ~( 'big_f'( a, f( a ) ) ), ~( 'big_f'( a, f( a ) ) ) ] )
% 0.47/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 ), ==>( 1, 0 )] )
% 0.47/1.13 ).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 factor(
% 0.47/1.13 clause( 73, [ ~( 'big_f'( a, b ) ), 'big_f'( a, f( a ) ) ] )
% 0.47/1.13 , clause( 0, [ ~( 'big_f'( X, b ) ), 'big_f'( X, f( a ) ), 'big_f'( a, f( a
% 0.47/1.13 ) ) ] )
% 0.47/1.13 , 1, 2, substitution( 0, [ :=( X, a )] )).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 resolution(
% 0.47/1.13 clause( 74, [ 'big_f'( a, f( a ) ), 'big_f'( a, f( a ) ) ] )
% 0.47/1.13 , clause( 73, [ ~( 'big_f'( a, b ) ), 'big_f'( a, f( a ) ) ] )
% 0.47/1.13 , 0, clause( 1, [ 'big_f'( a, b ), 'big_f'( a, f( a ) ) ] )
% 0.47/1.13 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 factor(
% 0.47/1.13 clause( 75, [ 'big_f'( a, f( a ) ) ] )
% 0.47/1.13 , clause( 74, [ 'big_f'( a, f( a ) ), 'big_f'( a, f( a ) ) ] )
% 0.47/1.13 , 0, 1, substitution( 0, [] )).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 subsumption(
% 0.47/1.13 clause( 8, [ 'big_f'( a, f( a ) ) ] )
% 0.47/1.13 , clause( 75, [ 'big_f'( a, f( a ) ) ] )
% 0.47/1.13 , substitution( 0, [] ), permutation( 0, [ ==>( 0, 0 )] ) ).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 factor(
% 0.47/1.13 clause( 76, [ ~( 'big_f'( a, f( a ) ) ) ] )
% 0.47/1.13 , clause( 7, [ ~( 'big_f'( a, f( a ) ) ), ~( 'big_f'( a, X ) ) ] )
% 0.47/1.13 , 0, 1, substitution( 0, [ :=( X, f( a ) )] )).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 resolution(
% 0.47/1.13 clause( 77, [] )
% 0.47/1.13 , clause( 76, [ ~( 'big_f'( a, f( a ) ) ) ] )
% 0.47/1.13 , 0, clause( 8, [ 'big_f'( a, f( a ) ) ] )
% 0.47/1.13 , 0, substitution( 0, [] ), substitution( 1, [] )).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 subsumption(
% 0.47/1.13 clause( 12, [] )
% 0.47/1.13 , clause( 77, [] )
% 0.47/1.13 , substitution( 0, [] ), permutation( 0, [] ) ).
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 end.
% 0.47/1.13
% 0.47/1.13 % ABCDEFGHIJKLMNOPQRSTUVWXYZ
% 0.47/1.13
% 0.47/1.13 Memory use:
% 0.47/1.13
% 0.47/1.13 space for terms: 405
% 0.47/1.13 space for clauses: 676
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 clauses generated: 15
% 0.47/1.13 clauses kept: 13
% 0.47/1.13 clauses selected: 0
% 0.47/1.13 clauses deleted: 0
% 0.47/1.13 clauses inuse deleted: 0
% 0.47/1.13
% 0.47/1.13 subsentry: 32
% 0.47/1.13 literals s-matched: 12
% 0.47/1.13 literals matched: 12
% 0.47/1.13 full subsumption: 0
% 0.47/1.13
% 0.47/1.13 checksum: -302911
% 0.47/1.13
% 0.47/1.13
% 0.47/1.13 Bliksem ended
%------------------------------------------------------------------------------